Download matrices operations solver project in c++

                    Project Name: Matrices Operation Solver

                Language Name: C++ 

                Database Connectivity: Nil

               Application Type: Console application    

Introduction

Hi  friends, today I am going to post another mathematical project name as “matrices  operations solver”, this project is developed 
by my closed friend Muhammad junaid , one of my favorite  programmer ,this project is made on  c plusplus (c++)   console application  by the help of  advanced object  oriented concepts. This matrices operations solver
project have a lot of function by the help of these function we can easily solved all the matrix related problems  within twinkle of an eye ,I hope you will like this project  .This  “Matrices operations solver “have following functions.

• Multiply Two Matrixes.
• Add Two Matrixes.
• Subtract Two Matrixes.
• Transpose Of A Matrix.
• Add Scalar Number With A Matrix.
• Subtract Scalar Number With A Matrix.
• Multiply Scalar Number With A Matrix.
• Divide Scalar Number With A Matrix.
• Adjoin Of A Matrix.

 Source Code                   

#include<iostream> #include<iomanip> #include<string> #include<conio.h> using namespace std; void point_to_fraction(double num) { int denum=1000; int nonum=(num*1000); for(int j=10;j>1;j--) for (int i=20; i > 1; i--) { if ((denum % i == 0) && (nonum % i == 0)) { denum /= i; nonum /= i; } } cout<<nonum; if(denum!=1) cout<<"/"<<denum; } void fraction_to_point(char ch[],double *result) { int len=strlen(ch); int fraction_position; bool frac=false; for(int a=0;a<=len;a++) { frac=false; if(ch[a]=='/') { fraction_position=a; a=len; frac=true; } } if(frac==false) { *result=atoi(ch); } else if(fraction_position==len-1) { *result=atoi(ch); } else if(frac==true) { int ascii[10]={48,49,50,51,52,53,54,55,56,57},power=1,num; double up=atoi(ch); double down=0; for(int a=len;a>fraction_position;a--) { num=ch[a]; for(int b=0;b<10;b++) { if(num==ascii[b]) { num=b; b=10; } } down+=num*power; power=power*10; } *result=atoi(ch)/(down/10); } } class Matrix { double matrix[3][3]; int rows,columns; public: Matrix() { for(int row=0;row<3;row++) for(int col=0;col<3;col++) matrix[row][col]=0; } Matrix(int row,int col) { rows=row; columns=col; } void set_row_and_col(char name[]) { do{ system("cls"); cout<<name<<endl<<endl; cout<<"Enter Number of Matrix Rows :"; cin>>rows; cout<<"Enter Number of Matrix Columns :"; cin>>columns; }while(((rows>3)||(rows<0))||((columns<0)||(columns>3))); } void set(char name[]) { char ch[15]; double result; system("cls"); cout<<"\n\n"<<name<<"\n\n"; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { cout<<"Enter "<<row+1<<"x"<<col+1<<" value :"; cin>>ch; fraction_to_point(ch,&result); matrix[row][col]=result; } } void get(char name[]) { cout<<"\n"<<name<<"\n\n"; for(int row=0;row<rows;row++) { for(int col=0;col<columns;col++) { cout<<setw(15); point_to_fraction(matrix[row][col]); } cout<<endl<<endl<<endl<<endl; } } Matrix transpose() { Matrix tem; tem.rows=columns; tem.columns=rows; for(int i=0;i<rows;i++) for(int j=0;j<columns;j++) { tem.matrix[j][i]=matrix[i][j]; } return tem; } Matrix adjoint() { Matrix tem,result; tem.rows=rows; tem.columns=columns; result.rows=rows; result.columns=columns; tem.matrix[0][0]=(matrix[1][1]*matrix[2][2])-(matrix[1][2]*matrix[2][1]); tem.matrix[0][1]=(-1*((matrix[1][0]*matrix[2][2])-(matrix[1][2]*matrix[2][0]))); tem.matrix[0][2]=((matrix[1][0]*matrix[2][1])-(matrix[1][1]*matrix[2][0])); tem.matrix[1][0]=(-1*((matrix[0][1]*matrix[2][2])-(matrix[0][2]*matrix[2][1]))); tem.matrix[1][1]=((matrix[0][0]*matrix[2][2])-(matrix[0][2]*matrix[2][0])); tem.matrix[1][2]=(-1*((matrix[0][0]*matrix[2][1])-(matrix[0][1]*matrix[2][0]))); tem.matrix[2][0]=((matrix[0][1]*matrix[1][2])-(matrix[0][2]*matrix[1][1])); tem.matrix[2][1]=(-1*((matrix[0][0]*matrix[1][2])-(matrix[0][2]*matrix[1][0]))); tem.matrix[2][2]=((matrix[0][0]*matrix[1][1])-(matrix[0][1]*matrix[1][0])); result=tem.transpose(); return result; } Matrix operator +(double num) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]+num; } return tem; } Matrix operator -(double num) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]-num; } return tem; } Matrix operator *(double num) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]*num; } return tem; } Matrix operator /(double num) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]/num; } return tem; } Matrix operator +(Matrix m ) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]+m.matrix[row][col]; } return tem; } Matrix operator -(Matrix m ) { Matrix tem; tem.rows=rows; tem.columns=columns; for(int row=0;row<rows;row++) for(int col=0;col<columns;col++) { tem.matrix[row][col]=matrix[row][col]-m.matrix[row][col]; } return tem; } Matrix operator * (Matrix m) { Matrix tem; double sum=0; tem.rows=rows; tem.columns=m.columns; for (int i=0;i<rows;i++) for(int j=0;j<m.columns;j++) { for(int k=0;k<rows;k++) { sum+=matrix[i][k]*m.matrix[k][j]; } tem.matrix[i][j]=sum; sum=0; } return tem; } int get_rows() { return rows; } int get_columns() { return columns; } ~Matrix() {} }; void multiplication() { Matrix m1,m2,result; do{ m1.set_row_and_col("Set Matrix 1 Rows and Columns"); m2.set_row_and_col("Set Matrix 2 Rows and Columns"); if(m1.get_columns()==m2.get_rows()) { m1.set("Enter First Matrix Values"); m2.set("Enter Second Matrix Values"); result=m1*m2; system("cls"); m1.get("Fist Matrix :"); m2.get("Second Matrix :"); result.get("Both Matrix Multiplication Result :"); } else { cout<<"\nFirst Matrix Rows and Second Matrix Columns must be equal.\n"; getch(); } }while(m1.get_columns()==m2.get_rows()); } void Addition() { Matrix m1,m2,result; do{ m1.set_row_and_col("Set First Matrix Rows and Columns"); m2.set_row_and_col("Set Second Matrix Rows and Columns"); if((m1.get_rows()==m2.get_rows())&&(m1.get_columns()==m2.get_columns())) { m1.set("Enter First Matrix Values"); m2.set("Enter Second Matrix Values"); result=m1+m2; system("cls"); m1.get("Fist Matrix :"); m2.get("Second Matrix :"); result.get("Both Matrix Addition Result :"); } else { cout<<"\n Both Matrix rows and columns should be equal.\n"; getch(); } }while((m1.get_rows()!=m2.get_rows())||(m1.get_columns()!=m2.get_columns())); } void subtract() { Matrix m1,m2,result; do{ m1.set_row_and_col("Set First Matrix Rows and Columns"); m2.set_row_and_col("Set Second Matrix Rows and Columns"); if((m1.get_rows()==m2.get_rows())&&(m1.get_columns()==m2.get_columns())) { m1.set("Enter First Matrix Values"); m2.set("Enter Second Matrix Values"); result=m1-m2; system("cls"); m1.get("Fist Matrix :"); m2.get("Second Matrix :"); result.get("Both Matrix Subtraction Result :"); } else { cout<<"\n Both Matrix rows and columns should be equal.\n"; getch(); } }while((m1.get_rows()!=m2.get_rows())||(m1.get_columns()!=m2.get_columns())); } void transpose() { Matrix m1,m2; m1.set_row_and_col("Set Matrix Rows and columns"); m1.set("Enter Matrix :"); m2=m1.transpose(); m1.get("Matrix Before Transpose :"); m2.get("Matrix After Transpose :"); } void scalar_addition() { Matrix m1,result; char ch[15]; double num; system("cls"); cout<<"\n\nEnter Scalar Number :"; cin>>ch; fraction_to_point(ch,&num); system("cls"); m1.set_row_and_col("Set Matrix Rows and Columns."); m1.set("Matrix :"); result=m1+num; system("cls"); cout<<"Scalar Number :"<<ch; cout<<endl<<endl; m1.get("Matrix :"); cout<<endl<<endl; result.get("Addtion Of Scalar Number With A Matrix"); } void scalar_subtraction() { Matrix m1,result; char ch[15]; double num; system("cls"); cout<<"\n\nEnter Scalar Number :"; cin>>ch; fraction_to_point(ch,&num); system("cls"); m1.set_row_and_col("Set Matrix Rows and Columns."); m1.set("Matrix :"); result=m1-num; system("cls"); cout<<"Scalar Number :"<<ch; cout<<endl<<endl; m1.get("Matrix :"); cout<<endl<<endl; result.get("Subtraction Of Scalar Number With A Matrix"); } void scalar_multiplication() { Matrix m1,result; char ch[15]; double num; system("cls"); cout<<"\n\nEnter Scalar Number :"; cin>>ch; fraction_to_point(ch,&num); system("cls"); m1.set_row_and_col("Set Matrix Rows and Columns."); m1.set("Matrix :"); result=m1*num; system("cls"); cout<<"Scalar Number :"<<ch; cout<<endl<<endl; m1.get("Matrix :"); cout<<endl<<endl; result.get("Multiplication Of Scalar Number With A Matrix"); } void scalar_division() { Matrix m1,result; char ch[15]; double num; system("cls"); cout<<"\n\nEnter Scalar Number :"; cin>>ch; fraction_to_point(ch,&num); system("cls"); m1.set_row_and_col("Set Matrix Rows and Columns."); m1.set("Matrix :"); result=m1/num; system("cls"); cout<<"Scalar Number :"<<ch; cout<<endl<<endl; m1.get("Matrix :"); cout<<endl<<endl; result.get("Division Of Scalar Number With A Matrix"); } void adjoint() { system("cls"); Matrix m1(3,3),result; m1.set("Set Matrix Value :"); result=m1.adjoint(); system("cls"); m1.get("Matrix :"); result.get("Matrix Adjoint :"); } void main() { Matrix m1,m2,result; int choice; char cho[5]; do{ system("cls"); cout<<"1) Multiply Two Matrix. \n\n"; cout<<"2) Add Two Matrix.\n\n"; cout<<"3) Subtract Two Matrix.\n\n"; cout<<"4) Transpose Of A Matrix.\n\n"; cout<<"5) Add Scalar Number Wiht A Matrix.\n\n"; cout<<"6) Subtract Scalar Number Wiht A Matrix.\n\n"; cout<<"7) Multiply Scalar Number Wiht A Matrix.\n\n"; cout<<"8) Divide Scalar Number Wiht A Matrix.\n\n"; cout<<"9) Adjoint Of A Matrix.\n\n"; cout<<"10) Exit\n\n"; cout<<"Enter your choice :"; cin>>cho; choice=atoi(cho); if(choice==1) { multiplication(); getch(); } else if(choice==2) { Addition(); getch(); } else if(choice==3) { subtract(); getch(); } else if(choice==4) { transpose(); getch(); } else if(choice==5) { scalar_addition(); getch(); } else if(choice==6) { scalar_subtraction(); getch(); } else if(choice==7) { scalar_multiplication(); getch(); } else if(choice==8) { scalar_division(); getch(); } else if(choice==9) { adjoint(); getch(); } else if(choice==10) { exit(1); } else { cout<<"\nInvalid key."; getch(); } }while(choice!=10); }