PROG-1

//Program to traverse an array

#include<stdio.h>
int main()
{
int a[5],i;
printf("Enter Array Elements: ");
for(i=0;i<5;i++)
scanf("%d",&a[i]);
printf("Array Elements are: ");
for(i=0;i<5;i++)
printf("%d\t",a[i]);
return 0;
}

OUTPUT -
PROG-2

//Program to find minimum of array

#include<stdio.h>
int main()
{
int a[5],i,min;
printf("Enter Array Elements: ");
for(i=0;i<5;i++)
{scanf("%d",&a[i]);}
min=a[0];
for(i=1;i<5;i++)
{
if(min>a[i])
{ min=a[i];}
}
printf("Minimum=%d",min);
return 0;
}

OUTPUT -
PROG -3

#include<stdio.h>
int main()
{
int a[25],n,i,j,temp;
printf("Enter the size of array: ");
scanf("%d",&n);
printf("Enter Array Elements: ");
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
printf("Array in Ascending order: ");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
return 0;
}

OUTPUT -
PROG-4

//Program to insert an element in array at given position

#include<stdio.h>
int main()
{
int a[25],pos,i,size,value;
printf("Enter no. of elements in array: ");
scanf("%d",&size);
printf("Enter elements: ");
for(i=0;i<size;i++)
scanf("%d",&a[i]);
printf("Enter the position where you want to insert the element: ");
scanf("%d",&pos);
printf("Enter the value into that poition: ");
scanf("%d",&value);
for(i=size-1;i>=pos-1;i--)
a[i+1]=a[i];
a[pos-1]= value;
printf("Final array after inserting:\n");
for(i=0;i<=size;i++)
printf("%d\t",a[i]);
return 0;
}

OUTPUT -
PROG-5

//Program to delete an element in an array

#include <stdio.h>
int main()
{
int a[25],position,i,n;
printf("Enter number of elements in array: ");
scanf("%d",&n);
printf("Enter elements of array: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("Enter the location where you wish to delete element: ");
scanf("%d",&position);
if(position>=n+1 )
printf("Deletion not possible.\n");
else
{
for (i= position-1;i<n-1;i++)
a[i]=a[i+1];
printf("Array after deletion:\n");
for(i=0;i<n-1;i++)
printf("%d\t",a[i]);
}
return 0;
}

OUTPUT –
PROG-6

//Program to reverse an array

#include<stdio.h>
int main()
{
int a[25],i,j,n,temp;
printf("Enter the no. of elements in array: ");
scanf("%d",&n);
printf("Enter Array Elements: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
i=0;
j=n-1;
while(i<=n/2)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
i++;
j--;
}
printf("Reversed Array:\n ");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
return 0;
}

OUTPUT -
PROG-1

//Program to traverse a matrix

#include<stdio.h>
int main()
{
int a[20][20],r,c,i,j;
printf("Enter no. of rows: ");
scanf("%d",&r);
printf("Enter no. of columns: ");
scanf("%d",&c);
printf("enter array elements: ");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
}
printf("Array:\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%d\t",a[i][j]);
}
printf("\n");
}
return 0;
}

OUTPUT -
PROG-2

//Program to add to matrices

#include<stdio.h>
int main()
{
int a[10][10],r,c,i,j,b[10][10];
printf("Enter no. of rows : ");
scanf("%d",&r);
printf("Enter no. of columns: ");
scanf("%d",&c);
printf("Enter array elements of 1st matrix: ");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);}
printf("Enter array elements of 2nd matrix: ");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
scanf("%d",&b[i][j]);}
printf("Matrix 1:\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{ printf("%d\t",a[i][j]);}
printf("\n");
}
printf("Matrix 2:\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{ printf("%d\t",b[i][j]);}
printf("\n");
}
printf("Addition matrix:\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{ printf("%d\t",a[i][j]+b[i][j]);}
printf("\n");
}
return 0;
}
OUTPUT -
PROG -3

//Program to multiply two given matrices

#include<stdio.h>
int main()
{
int a[10][10],b[10][10],mul[10][10],r,c,i,j,k;
printf("enter the number of row: ");
scanf("%d",&r);
printf("enter the number of column: ");
scanf("%d",&c);
printf("enter the first matrix element=\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter the second matrix element=\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&b[i][j]);
}
}
printf("multiply of the matrix=\n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
mul[i][j]=0;
for(k=0;k<c;k++)
{
mul[i][j]+=a[i][k]*b[k][j];
}
}
}
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%d\t",mul[i][j]);
}
printf("\n");
}
return 0;
}
OUTPUT -
PROG-4

//Program to transpose a given matrix

#include<stdio.h>
int main()
{
int a[10][10],r,c,i,j;
printf("Enter no. of rows : ");
scanf("%d",&r);
printf("Enter no. of columns: ");
scanf("%d",&c);
printf("Enter array elements: ");
for(i=0;i<r;i++)
{ for(j=0;j<c;j++)
scanf("%d",&a[i][j]);}
printf("Array:\n");
for(i=0;i<r;i++)
{for(j=0;j<c;j++)
{printf("%d\t",a[i][j]);
}
printf("\n");
}
printf("transpose Array:\n");
for(i=0;i<c;i++)
{for(j=0;j<r;j++)
{printf("%d\t",a[j][i]);
}
printf("\n");
}
return 0;
}

OUTPUT –
PROG-1

//Program to implement Linear Search

#include<stdio.h>
int main()
{
int a[25],n,i,item,flag=0,loc;
printf("Enter the number of elements in array: ");
scanf("%d",&n);
printf("Enter array elements: ");
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
printf("Enter the element to be searched: ");
scanf("%d",&item);
for(i=0;i<n;i++)
{ if(a[i]==item)
{
flag=1;
loc=i+1;
break;
}
}
if(flag==1)
printf("Element found at position %d",loc);
else
printf("Element not found");
return 0;
}

OUTPUT -
PROG-2

//Program to implement Binary Search

#include<stdio.h>
int main()
{
int a[25],i,n,beg,end,mid,item,flag=0;
printf("Enter the number of elelments in array: ");
scanf("%d",&n);
printf("Enter the elements of array in ascending order: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("Enter the element to be searched: ");
scanf("%d",&item);
beg=0;
end=n-1;
mid=(beg+end)/2;
if(a[mid]==item)
printf("Element found at position %d",mid+1);
else
{ while((beg<=end) && (a[mid]!=item))
{ mid=(beg+end)/2;
if(a[mid]==item)
{
printf("Element found at position %d",mid+1);
flag=1;
}
else if(item>a[mid])
{
beg=mid+1;
}
else if(item<a[mid])
{
end=mid-1;
}
}
if(flag==0)
printf("Element not found");
}
return 0;
}

OUTPUT -