LABMNU

List of Practicals:
1 | Page

1. Write a program in C for insertion and deletion in a linear array.

2. Write a program in C showing the execution of Bubble sort in a linear
array.
3. Write a program in C performing linear search in a linear array.
4. Write a program in C showing the execution of Binary search in a linear
array.
5. Write a program in C to demonstrate matrix multiplication.
6. Write a program in C demonstrating the transpose of a sparse matrix.
7. Write a program in C showing the Search operation being performed on a
sorted linked list.
8. Write a program in C to insert an element onto a sorted list.
9. Write a program in C to realize a doubly linked list.
10. Write a program in C to implement a stack using an array.
11. Write a program in C for evaluating a postfix expression.
12. Write a program in C to transform an infix expression to a postfix
expression.
13. Write a program in C to show the implementation of Quick sort
algorithm.
14. Write a program in C to evaluate factorial of a number and another
program to display the Fibonacci series upto n terms.
15. Write a program in C to solve the Tower of Hanoi problem for N disks.
16. Write a program in C to implement a queue using an array.
17. Write a program in C to implement a queue data structure showing
deletion and insertion operation.
18. Write a program in C to implement priority queue using a one-way list.
19. Write a program in C which illustrates a linked list implementation of a
circular queue.
20. Write a program in C showing the implementation of inorder, preorder
and postorder traversals in a binary tree.
21. Write a program in C to demonstrate the concept of insertion in a Binary
Search Tree.
22. Write a program in C to demonstrate the concept of deletion in a Binary
Search Tree.
23. Write a program in C to demonstrate the insertion and deletion in a heap.
24. Write a program in C to demonstrate the heap sorting technique.
25. Write a program in C which shows the insertion and deletion operations
in an adjacency list.
26. Write a program in C which shows the implementation of BFS and DFS
traversal techniques in an adjacency list.
27. Write a program in C showing the implementation of Dijsktras
algorithm.

2 | Page

//Write a program in C for insertion and deletion in a linear

array.
OUTPUT:

//Write a program in C showing the execution of Bubble sort in a

linear array.
#include<stdio.h>
#include<conio.h>
void main()
{
int s,temp,i,j,a[20];
clrscr();
printf("Enter total numbers of elements: ");
scanf("%d",&s);
printf("Enter %d elements: ",s);
for(i=0;i<s;i++)
scanf("%d",&a[i]);
//Bubble sorting algorithm
for(i=s-2;i>=0;i--)
{
for(j=0;j<=i;j++)
{
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
printf("After sorting: ");
for(i=0;i<s;i++)
printf(" %d",a[i]);

3 | Page

getch();
}

OUTPUT:

//Write a program in C performing linear search in a linear array.

#include <stdio.h>
#include<conio.h>
void main()
{
int array[100], search, c, number;
clrscr();
printf("Enter the number of elements in array\n");
scanf("%d",&number);
printf("Enter %d numbers\n", number);
for (c=0;c<number;c++)
scanf("%d",&array[c]);
printf("Enter the number to search\n");
scanf("%d",&search);
for (c=0;c<number;c++)
{

4 | Page

if ( array[c] == search ) /* if required element found */

{
printf("%d is present at location %d.\n", search, c+1);
break;
}
}
if (c == number)
printf("%d is not present in array.\n", search);
getch();
}

OUTPUT:

//Write a program in C showing the execution of Binary search in

a linear array.
#include<stdio.h>
#include<conio.h>
void main()
{
int c,first,last,middle,n,search,array[100];
clrscr();
printf("Enter number of elements\n");
scanf("%d",&n);
printf("Enter %d integers\n",n);

5 | Page

for(c=0;c<n;c++)
scanf("%d",&array[c]);
printf("Enter value to find\n");
scanf("%d",&search);
first=0;
last=n-1;
middle=(first+last)/2;
while(first<=last)
{
if(array[middle]<search)
first=middle+1;
else if(array[middle]==search)
{
printf("%d found at location %d.\n",search,middle+1);
break;
}
else
last=middle-1;
middle=(first+last)/2;
}
if(first>last)
printf("Not found! %d is not present in the list.\n",search);
getch();

OUTPUT:

6 | Page

7 | Page