Embedded Files
WAP to read 2 D array & print elements
#include<stdio.h>
int main()
{
int i,n,n2,j;
int arr[20][20];
printf("enter array row size: \n");
scanf("%d",&n);
printf("enter array collumn size size: \n");
scanf("%d",&n2);
printf("enter array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&arr[i][j]);
}
}
printf("array is: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
printf("%d\t",arr[i][j]);
}
printf("\n");
}
}
WAP to find sum of 2-D array
#include<stdio.h>
int main()
{
int i,n,n2,j,sum=0;
int arr[20][20];
printf("enter array row size: \n");
scanf("%d",&n);
printf("enter array collumn size size: \n");
scanf("%d",&n2);
printf("enter array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&arr[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
sum=sum+arr[i][j];
}
}
printf("%d",sum);
}
WAP to find sum of individual rows of 2D array
#include<stdio.h>
int main()
{
int i,n,n2,j,sum=0;
int arr[20][20];
printf("enter array row size: \n");
scanf("%d",&n);
printf("enter array collumn size size: \n");
scanf("%d",&n2);
printf("enter array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&arr[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
sum=sum+arr[i][j];
}
printf("%d\n",sum);
sum=0;
}
}
WAP to find sum of individual collumns of 2D array
//Sum of 2-D array
#include<stdio.h>
int main()
{
int i,n,n2,j,sum=0;
int arr[20][20];
printf("enter array row size: \n");
scanf("%d",&n);
printf("enter array collumn size size: \n");
scanf("%d",&n2);
printf("enter array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&arr[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
sum=sum+arr[j][i];
}
printf("%d\n",sum);
sum=0;
}
}
WAP to find sum of 2 2D arrays
#include<stdio.h>
int main()
{
int i,j,sum=0;
int a[3][3],b[3][3],c[3][3];
printf("enter first array: \n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter second array: \n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&b[i][j]);
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
c[i][j]=a[i][j]+b[i][j];
}
}
printf("Sum of arrays: \n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
printf("%d\n",c[i][j]);
}
}
}
WAP to find sum of diagonal elements of 2D arrays
#include<stdio.h>
int main()
{
int i,n,n2,j,sum=0;
int a[20][20];
printf("enter array row and collumn size: \n");
scanf("%d %d",&n,&n2);
printf("enter array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("array: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
printf("%d\t",a[i][j]);
}
printf("\n");
}
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
if(i==j)
sum=sum+a[i][j];
}
}
printf("sum of diagonal elements: %d\n",sum);
}
WAP to find transpose matrix of 2D array
#include<stdio.h>
int main()
{
int i,n,n2,j,sum=0;
int a[20][20];
printf("enter array row and collumn size: \n");
scanf("%d %d",&n,&n2);
printf("enter matrix: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("matrix: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
printf("%d\t",a[i][j]);
}
printf("\n");
}
printf("transpose matrix: \n");
for(i=0;i<n;i++)
{
for(j=0;j<n2;j++)
{
printf("%d\t",a[j][i]);
}
printf("\n");
}
}
WAP to find sum and subtraction of 2 2D arrays
#include<stdio.h>
int main()
{
int i,j,n,n2,x,x2,sum=0;
int a[20][20],b[20][20],c[20][20],d[20][20];
printf("enter array row and collumn size of first matrix: \n");
scanf("%d %d",&n,&n2);
printf("enter first matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter array row and collumn size of first matrix: \n");
scanf("%d %d",&x,&x2);
printf("enter second matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&b[i][j]);
}
}
printf("matrix: \n");
if(n==x &&n2==x2)
{
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
c[i][j]=a[i][j]+b[i][j];
}
}
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
d[i][j]=a[i][j]-b[i][j];
}
}
}
else
{
printf("invalid matrix size. Cannort perform operation\n");
}
printf("sum of matrices: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d\t",c[i][j]);
}
printf("\n");
}
printf("subtraction of matrices: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d\t",d[i][j]);
}
printf("\n");
}
}
WAP to find sum and subtraction of 2 2D arrays
#include<stdio.h>
int main()
{
int i,j,n,n2,x,x2,sum=0;
int a[20][20],b[20][20],c[20][20],d[20][20];
printf("enter array row and collumn size of first matrix: \n");
scanf("%d %d",&n,&n2);
printf("enter first matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter array row and collumn size of first matrix: \n");
scanf("%d %d",&x,&x2);
printf("enter second matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&b[i][j]);
}
}
printf("matrix: \n");
if(n==x &&n2==x2)
{
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
c[i][j]=a[i][j]+b[i][j];
}
}
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
d[i][j]=a[i][j]-b[i][j];
}
}
}
else
{
printf("invalid matrix size. Cannort perform operation\n");
}
printf("sum of matrices: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d\t",c[i][j]);
}
printf("\n");
}
printf("subtraction of matrices: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d\t",d[i][j]);
}
printf("\n");
}
}
WAP to find sum of even and odd elements present in 2D arrays
#include<stdio.h>
int main()
{
int i,j,n,n2,sum=0,sum2=0;
int a[20][20];
printf("enter array row and collumn size of matrix: \n");
scanf("%d %d",&n,&n2);
printf("enter matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("sum of even numbers:");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
if(a[i][j]%2==0)
{
sum=sum+a[i][j];
}
}
}
printf("%d\n",sum);
printf("sum of odd numbers:");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
if(a[i][j]%2!=0)
{
sum2=sum2+a[i][j];
}
}
}
printf("%d",sum2);
}
WAP to find sum of positive and negative elements present in 2D arrays
#include<stdio.h>
int main()
{
int i,j,n,n2,sum=0,sum2=0;
int a[20][20];
printf("enter array row and collumn size of matrix: \n");
scanf("%d %d",&n,&n2);
printf("enter matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("sum of positive numbers:");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
if(a[i][j]>=0)
{
sum=sum+a[i][j];
}
}
}
printf("%d\n",sum);
printf("sum of negative numbers:");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
if(a[i][j]<0)
{
sum2=sum2+a[i][j];
}
}
}
printf("%d",sum2);
}
WAP to find out maximum and second maximum elements present in 2D arrays
#include<stdio.h>
int main()
{
int i,j,n,n2,max,smax;
int a[20][20];
printf("enter array row and collumn size of matrix: \n");
scanf("%d %d",&n,&n2);
printf("enter matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("matrix: \n");
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
max = smax = a[0][0];
for(i=0; i<n; i++)
{
for(j=0; j<n2; j++)
{
if(max<a[i][j])
{
smax=max;
max=a[i][j];
}
else(smax<a[i][j] && max!=a[i][j])
smax=a[i][j];
}
}
printf("maximum element is:%d\n",max);
printf("minimum element is:%d\n",smax);
}
WAP to do matrix multiplication 2D arrays
#include<stdio.h>
int main()
{
int i, j, k, n, n2, x, x2;
int a[20][20], b[20][20], c[20][20];
printf("Enter row and column size of first matrix: \n");
scanf("%d %d", &n, &n2);
printf("Enter row and column size of second matrix: \n");
scanf("%d %d", &x, &x2);
if (n2 == x)
{
printf("Enter elements of first matrix: \n");
for (i = 0; i < n; i++)
{
for (j = 0; j < n2; j++)
{
scanf("%d", &a[i][j]);
}
}
printf("Enter elements of second matrix: \n");
for (i = 0; i < x; i++)
{
for (j = 0; j < x2; j++)
{
scanf("%d", &b[i][j]);
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < x2; j++)
{
c[i][j] = 0;
for (k = 0; k < n2; k++)
{
c[i][j] += a[i][k] * b[k][j];
}
}
}
printf("multiplication: \n");
for (i = 0; i < n; i++)
{
for (j = 0; j < x2; j++)
{
printf("%d ", c[i][j]);
}
printf("\n");
}
}
else
{
printf("Invalid size for matrix multiplication\n");
}
return 0;
}
WAP to swap two elements of matrix
#include<stdio.h>
int main()
{
int i, j;
int a[3][3], b[3][3];
printf("Enter elements of first matrix: \n");
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
scanf("%d", &a[i][j]);
}
}
printf("Enter elements of second matrix: \n");
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
scanf("%d", &b[i][j]);
}
}
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
a[i][j]=a[i][j]+b[i][j];
b[i][j]=a[i][j]-b[i][j];
a[i][j]=a[i][j]-b[i][j];
}
}
printf("swapped matrices: \n");
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
printf("\n");
for (i = 0; i < 3; i++)
{
for (j = 0; j < 3; j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
}
WAP to search whether a number is present in a matrix
#include<stdio.h>
int main()
{
int i, j, n, n2,c, x;
int a[3][3];
printf("enter row and column size of matrix: \n");
scanf("%d %d",&n,&n2);
printf("Enter elements matrix: \n");
for (i = 0; i < n; i++)
{
for (j = 0; j < n2; j++)
{
scanf("%d", &a[i][j]);
}
}
printf("enter the element you wish to search: \n");
scanf("%d",&x);
for (i = 0; i < n i++)
{
for (j = 0; j < n2; j++)
{
if(x==a[i][j])
c++;
}
}
if(c!=0)
{
printf("%d is present in the matrix!!!\n",x);
}
else
{
printf("SORRY! %d is not found\n",x);
}
}
WAP to print reverse of each number present in a matrix
#include<stdio.h>
int main()
{
int i, j, n, n2,k,num,c1;
int a[3][3];
printf("enter row and column size of matrix: \n");
scanf("%d %d",&n,&n2);
printf("Enter elements matrix: \n");
for (i = 0; i < n; i++)
{
for (j = 0; j < n2; j++)
{
scanf("%d", &a[i][j]);
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n2; j++)
{
num=a[i][j];
c1=0;
for(k=2;k<num;k++)
{
if(num%k==0)
{
c1++;
}
}
if(c1==0)
printf("%d ",num);
}
}
}
WAP to print prime numbers present in a matrix
#include<stdio.h>
int main()
{
int i,j,n,rem;
int a[3][3];
printf("enter matrix: \n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
n=a[i][j];
int sum=0;
while(n!=0)
{
rem=n%10;
sum=sum*10+rem;
n=n/10;
}
printf("reverse: %d\n",sum);
}
}
}
Page updated
Google Sites
Report abuse