Professional Documents
Culture Documents
55practice Assignment 5
55practice Assignment 5
55practice Assignment 5
#include<stdio.h>
int main()
{
int m, n, p, q, c, d, k, sum = 0;
int first[10][10], second[10][10], multiply[10][10];
if ( n != p )
printf("Matrices with entered orders can't be multiplied with each other.\n");
else
{
printf("Enter the elements of second matrix\n");
multiply[c][d] = sum;
sum = 0;
PRACTICE ASSIGNMENT 5
}
}
printf("\n");
}
}
return 0;
}
#include<stdio.h>
#include<conio.h>
int main()
{
int a[2][3],b[2][3],c[2][3],i,j;
clrscr();
printf("\nENTER VALUES FOR MATRIX A:\n");
for(i=0;i<2;i++)
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
printf("\nENTER VALUES FOR MATRIX B:\n");
for(i=0;i<2;i++)
for(j=0;j<3;j++)
scanf("%d",&b[i][j]);
for(i=0;i<2;i++)
for(j=0;j<3;j++)
c[i][j]=a[i][j]+b[i][j];
printf("\nTHE VALUES OF MATRIX C ARE:\n");
for(i=0;i<2;i++)
{
for(j=0;j<3;j++)
printf("%5d",c[i][j]);
printf("\n");
}
getch();
}
PRACTICE ASSIGNMENT 5
3. Write a program in C to perform and display the Transpose of a matrix.
#include<stdio.h>
int main()
{
int a[10][10], transpose[10][10], r, c, i, j;
printf("Enter rows and columns: ");
scanf("%d %d", &r, &c);
#include<stdio.h>
int main()
{
int arr1[50][50],brr1[50][50],crr1[50][50],i,j,n;
#include<stdio.h>
int main()
{
int array1[10][10],i,j,m,n,sum = 0;
if(m==n)
{
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
PRACTICE ASSIGNMENT 5
if(i==j)
printf("\t%d", array1[i][j]);
else
printf("\t");
}
printf("\n\n");
}
}
else
{
printf("\nMatrix is not a Square Matrix.");
}
return 0;
}
#include<stdio.h>
int main()
{
int i, j, rows, columns, a[10][10], b[10][10], isEqual;
#include<stdio.h>
int main()
{
int arr1[10][10],i,j,n;
float determinant=0;
#include<stdio.h>
int main()
{
int arr1[10][10],i,j,n;
float determinant=0;
#include<stdio.h>
int main()
{
int n, array[1000], c, d, t, flag = 0;
return 0;
}
#include<stdio.h>
int main()
{
int a[100], n, i, j, position, swap;
printf("Enter number of elementsn");
scanf("%d", &n);
printf("Enter %d Numbersn", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for(i = 0; i < n - 1; i++)
{
position=i;
for(j = i + 1; j < n; j++)
{
if(a[position] > a[j])
position=j;
}
if(position != i)
{
swap=a[i];
a[i]=a[position];
a[position=swap;
}
}
printf("Sorted Array:n");
for(i = 0; i < n; i++)
printf("%dn", a[i]);
return 0;
}