MATRIX' CLASS OF SIZE m X n, OVERLOAD THE '+' OPERATOR TO ADD TWO MATRIX OBJECTS

-

hello friends....

TAKE THE FIRST STEP TO KNOWLEDGE FRIENDS BECAUSE KNOWLEDGE IS FREE.

/* CREATE A 'MATRIX' CLASS OF SIZE m X n, OVERLOAD THE '+' OPERATOR TO ADD TWO MATRIX OBJECTS. WRITE A FUNCTION IMPLEMENT IT. */ 

#include<iostream.h>
#include<conio.h>
class matrix
{
   int i,j,m[3][3];
   public:
    void getdata()
    {
      for(i=0; i<=2; i++)
      {
for(j=0; j<=2; j++)
{
  cin>>m[i][j];
}
      }
    }
    void display()
    {
      for(i=0; i<=2; i++)
      {
 for(j=0; j<=2; j++)
 {
    cout<<m[i][j]<<"\t";
 }
 cout<<"\n";
      }
    }

    friend matrix operator +(matrix,matrix);
};

matrix operator +(matrix m1, matrix m2)
{
   matrix m3;
   int i,j;
   for(i=0; i<=2; i++)
   {
     for(j=0; j<=2; j++)
     {
       m3.m[i][j] = m1.m[i][j] + m2.m[i][j];
     }
   }

   return m3;
}

void main()
{
  clrscr();
  matrix m1,m2,m3;
  cout<<"\nEnter the first matrix : \n";
  m1.getdata();
  cout<<"\nEnter the second matrix  :\n";
  m2.getdata();
  m3 = m1 + m2;
  cout<<"\nMatrix ans is : \n";
  m3.display();
  getch();
}

         OUTPUT 
================

Enter the first matrix : 
1
2
3
4
5
6
7
8
9

Enter the second matrix :
1
2
3
4
5
6
7
8
9

Matrix ans is : 
2       4      6
8      10      12
14      16      18 
* * * * * * * * * * * * * *
>> IF YOU LIKE THIS BLOG, PLEASE SHARE AND SUBSCRIBE. ALSO COMMENT  FOR THIS BLOG.

>> IF YOU HAVE ANY QUESTIONS PLEASE ASK IN COMMENT.



>> IF YOU WANT TO LEARN HTML WITH OUTPUT, SO VISIT THIS BLOG

      https://dnpwebdeveloper.blogspot.com/





>> IF YOU WANT TO LEARN C++ PROGRAM WITH OUTPUT, SO VISIT THIS BLOG



      https://cplusplusdnpdeveloper.blogspot.com/





>> IF YOU WANT TO LEARN C PROGRAM WITH OUTPUT, SO VISIT THIS BLOG



      https://dnpdeveloper.blogspot.com/

>> MY INSTAGRAM ID : dnp176

Comments

Post a Comment

Popular posts from this blog

RECEIVES TWO NUMBER AS AN ARGUMENT AND DISPLAY ALL PRIME NUMBER BETWEEN THESE TWO NUMBER

-
hello friends.... TAKE THE FIRST STEP TO KNOWLEDGE FRIENDS  BECAUSE KNOWLEDGE IS FREE. /* WRITE A FUNCTION THAT RECEIVES TWO NUMBER AS AN ARGUMENT AND  DISPLAY ALL PRIME NUMBER BETWEEN THESE TWO NUMBER */  #include<iostream.h> #include<conio.h> void prime(int,int); void main() {    clrscr();    int x,y;    cout<<"enter any two value : "<<endl;    cin>>x>>y;    cout<<"\n";    prime(x,y);    getch(); } void prime(int a,int b) {    int i,j,flag=1;    for(i=a+1; i<b; i++)    {        flag=1; for(j=2; j<i; j++) {      if(i%j==0)      { flag =0; break;      } } if(flag==1) {     cout<<i<<"\n"; }    } }   OUTPUT =========== ...
Read more

IMPLEMENT POWER FUNCTION USING FUNCTION OVERLOADING

-
hello friends.... TAKE THE FIRST STEP TO KNOWLEDGE FRIENDS  BECAUSE KNOWLEDGE IS FREE. /* WRITE A PROGRAM TO IMPLEMENT POWER FUNCTION USING FUNCTION OVERLOADING */  #include<iostream.h> #include<conio.h> int power (int,int); double power (double,int); void main() {    int x,p,ans1;    double y,ans2;    clrscr();    cout<<"enter int base value x = ";    cin>>x;    cout<<"enter double base value y = ";    cin>>y;    cout<<"enter power value of x & y = ";    cin>>p;    ans1=power(x,p);    cout<<"int base and power ans is : "<<ans1<<endl;    ans2=power(y,p);    cout<<"double base and power ans is : "<<ans2;    getch();   // return 0; } int power(int i, int j) {   int k,ans1=1; ...
Read more

SORT AN ARRAY OF INTEGER IN ASCENDING ORDER USING A FUNCTION BY REFERENCE

-
hello friends.... TAKE THE FIRST STEP TO KNOWLEDGE FRIENDS  BECAUSE KNOWLEDGE IS FREE. /* WRITE A C++ PROGRAM TO SORT AN ARRAY OF INTEGER IN ASCENDING ORDER  USING A FUNCTION CALLED EXCHANGE() WHICH ACCEPTS TWO INTEGER ARGUMENTS  BY REFERENCE */  #include<iostream.h> #include<conio.h> void exchange(int (&)[], int &); void main() {    int a[20],n,i;    clrscr();    cout<<"enter store elements :";    cin>>n;    cout<<"enter elements :"<<endl;    for(i=0; i<n; i++)    {      cin>>a[i];    }    exchange(a,n);    cout<<"\n";    for(i=0; i<n; i++)    {      cout<<"a["<<i<<"]="<<a[i]<<endl;    }    getch(); } void exchange(int (&x)[], int &y) ...
Read more