Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
WAP in C for multiplication of matrices with compatibility Check
#include
void main()
{
long int m1[10][10],m2[10][10],i,j,mult[10][10],r1,c1,r2,c2;
printf("enter order of matrix 1:\n\n");
scanf("%d %d",&r1,&c1);
printf("enter order of matrix 2:\n\n");
scanf("%d %d",&r2,&c2);
if(c1==r2)
printf("Enter element of matrix 1:\n\n");
for(i=0;i for(j=0;j { scanf("%d", &m1[i][j]); } printf("\nEnter elements of Martix 2:\n\n"); for (i=0;i for(j=0;j { scanf("%d",&m2[i][j]); } printf("\n Matrix 1:\n\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
for(j=0;j { scanf("%d", &m1[i][j]); } printf("\nEnter elements of Martix 2:\n\n"); for (i=0;i for(j=0;j { scanf("%d",&m2[i][j]); } printf("\n Matrix 1:\n\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
scanf("%d", &m1[i][j]);
}
printf("\nEnter elements of Martix 2:\n\n");
for (i=0;i for(j=0;j { scanf("%d",&m2[i][j]); } printf("\n Matrix 1:\n\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
for(j=0;j { scanf("%d",&m2[i][j]); } printf("\n Matrix 1:\n\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
scanf("%d",&m2[i][j]);
printf("\n Matrix 1:\n\n\n");
for(i=0;i { for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
for(j=0;j printf("\t%d",m1[i][j]); printf("\n"); } printf("\n matrix 2:\n\n"); for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
printf("\t%d",m1[i][j]);
printf("\n");
printf("\n matrix 2:\n\n");
for(i=0;i { for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
for(j=0;j printf("\t%d",m2[i][j]); printf("\n"); } printf("\n Multiplicfation Of Matrices\n\n"); // for matrix multiplication for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
printf("\t%d",m2[i][j]);
printf("\n Multiplicfation Of Matrices\n\n");
// for matrix multiplication
for(i=0;i { for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
for(j=0;j { mult[i][j]=0; for(long int k=0;k<=r1;k++) { mult[i][j]+=m1[i][k]*m2[k][j]; } printf("\t%d",mult[i][j]); } printf("\n"); } } else printf("\n Multiplication is not possible with the order of matrices\n\n"); } OUTPUT
mult[i][j]=0;
for(long int k=0;k<=r1;k++)
mult[i][j]+=m1[i][k]*m2[k][j];
printf("\t%d",mult[i][j]);
else
printf("\n Multiplication is not possible with the order of matrices\n\n");
OUTPUT
#write a program that counts the number of occurances of the string in the n-th padovan string p(n)
Define a procedure that takes three numbers as arguments and returns the sum of the squares of the two larger numbers.
THEORY OF COMPUTER PROGRAMMING
(a) Define a procedure (deep-member x e) that takes a list x and an element e and returns #t if the element e is in the list or in any lists that the list x contains. e.g., (dee
program for factorial
I need plugin for amibroker using c++ Project Description: Need to prepare plugin for amibroker using c++. Should be system bound after installing. System should show based o
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
Run the following C++ program with and without preprocessor variable POSTFIX defined. #include using namespace std; extern "C" int atoi( const char *str );
assume that the first integer read with cin specifies the number of values remaining to be entered. that program should read only one value each time cin is executed .a typical inp
solve for radius(R) of a circle of its area is to be inputted by a user. also display compute the circle diameter hint: area= pir21 pi=2.1416
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd