Professional Documents
Culture Documents
Algorithm
Step 1: [Start]
Begin
Step 2: [Input the order of matrix A and matrix B]
Read m, n, p, q
Step 3: [Check whether two matrices are multplicable]
If (n = p) then go to step 4
Else
Print (“MULTIPLICATION NOT ALLOWED…TRY AGAIN”)
Go to step 2
End if
Step 4: [Read matrix A]
For i = 0 thru m in steps of 1
For j = 0 thru n in steps of 1 Read A[ i ][ j ]
End for
End for
Step 5: [Read matrix B]
For i = 0 thru p in steps of 1
For j = 0 thru q in steps of 1 Read B[ i ][ j ]
End for
End for
Step 6: [Compute C[ I ][ j ]]
For i = 0 thru m in steps of 1
For j = 0 thru q in steps of 1
C[ I ][ j ] = 0
For k = 0 thru n in steps of 1
C[ I [ j ] = C[ I ][ j ] + A[ I ][ k ] * B[ k ][ j ]
End for
End for
End for Step 7: [Output]
Flowchart:
Program:
#include<stdio.h>
void main()
{
int a[5][5],b[5][5],c[5][5],m,n,p,q,i,j,k;
printf("Enter the size of first matrix \n");
scanf("%d%d",&m,&n);
printf("Enter the size of second matrix \n");
scanf("%d%d",&p,&q);
if(n==p)
{
printf("Enter the elements of first matrix \n");
for(i=0; i<m; i++)
{
for(j=0; j<n; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("Enter the elements of the second matrix \n");
for(i=0; i<p; i++)
{
for(j=0; j<q; j++)
{
scanf("%d",&b[i][j]);
}
}
printf("First matrix \n");
for(i=0; i<m; i++)
{
for(j=0; j<n; j++)
{
printf("%d\t",a[i][j]);
}
printf("\n");
}
printf("Second matrix \n");
for(i=0; i<p; i++)
{
for(j=0; j<q; j++)
{
printf("%d\t",b[i][j]);
}
printf("\n");
}