1.program to add 2 matrix.
#include<stdio.h>
int main()
{
int i,j,a[3][3],b[3][3],c[3][3];
printf("enter 1sr array:");
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter 2nd array");
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]);
}
}
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
printf("[%d]",c[i][j]);
}
printf("\n");
}
return 0;
}
OUTPUT :
enter 1st array:1
2
6
05
4
9
8
76
5
enter 2nd array:1
2
8
3
9
03
5
8
2
[2][4][14]
[8][13][12]
[13][84][7]
Program to multiple 2 matrix.
#include<stdio.h>
int main()
{
int i,j,a[3][3],b[3][3],c[3][3];
printf("enter array elements :");
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("enter 2nd array element :");
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("your multiplied array is here:\n");
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
printf("[%d]",c[i][j]);
}
printf("\n");
}
return 0;
}
OUTPUT :
enter array elements :2
7
9
3
7
5
2
9
0
enter 2nd array element :0
9
8
7
6
5
4
3
2
your multiplied array is here:
[0][63][72]
[21][42][25]
[8][27][0]
//////////////######////////////t
transpose of 2D array.
#include<stdio.h>
int main()
{
int i,j,a[3][3],b[3][3];
printf("enter array elements :");
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++)
{
b[j][i]=a[i][j];
}
}
printf("your transposed array is here:");
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
printf("[%d]",b[i][j]);
}
printf("\n");
}
return 0;
}
OUTPUT :
enter array elements :1
2
3
4
5
6
7
8
9
your transposed array is here:
[1][4][7]
[2][5][8]
[3][6][9]
////////////////£££££///////////////
Program to find the biggest value in matrix.
#include<stdio.h>
int main()
{
int i,j,a[3][3],big;
big=a[0][0];
for(i=0; i<3; i++)
{
for(j=0; j<3; j++)
{
printf("enter elements ");
scanf("%d",&a[i][j]);
}
}
for(i=1; i<3; i++)
{
for(j=1; j<3; j++) {
if(a[i][j]>big)
big=a[i][j];
}
}
printf("biggest number=%d",big);
return 0;
}
OUTPUT :
enter elements 10
enter elements 93
enter elements 65
enter elements 2
enter elements 8
enter elements 47
enter elements 99
enter elements 91
enter elements 88
biggest number=91
PROGRAM TO PRINT LOWER TRINGULAR MATRIX.
#include<stdio.h>
int main()
{
int i,j,n,a[100][100],sum=0 ;
printf("enter the size: ");
scanf("%d",&n);
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
printf("enter elements [%d][%d]: ",i,j);
scanf("%d",&a[i][j]);
}
}
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
if(j>=i)
{ printf("[%2d]",a[i][j]);
}
if(i>j)
printf("[ 0]");
}
printf("\n");
}
return 0 ;
}
OUTPUT :
enter the size: 3
enter elements [0][0]: 1
enter elements [0][1]: 2
enter elements [0][2]: 3
enter elements [1][0]: 4
enter elements [1][1]: 5
enter elements [1][2]: 6
enter elements [2][0]: 7
enter elements [2][1]: 8
enter elements [2][2]: 9
[ 1][ 2][ 3]
[ 0][ 5][ 6]
[ 0][ 0][ 9]
/////////////////////////////////////
Program to find the upper Triangular matrix.
#include<stdio.h>
int main()
{
int i,j,n,a[100][100],sum=0 ;
printf("enter the size: ");
scanf("%d",&n);
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
printf("enter elements [%d][%d]: ",i,j);
scanf("%d",&a[i][j]);
}
}
for(i=0; i<n; i++)
{
for(j=0; j<n; j++)
{
if(i>=j)
{ printf("[%d]",a[i][j]);
}
if(j>i)
printf("[0]");
}
printf("\n");
}
return 0 ;
}
Comments
Post a Comment