program perkalian matriks berordo nxn

7
Modul 3 Algoritma & Pemrograman Perkalian 2 Buah Matriks Dg Inputan Keyboard Flowchart Source Code //Program Perkalian 2 Buah Matriks Berordo NxN atau MxN// #include <iostream.h> #include <conio.h> #include <stdio.h> #define ValueMax 25 typedef float matriks[ValueMax][ValueMax]; void main() { int colA,colB,rowA,rowB,i,j; matriks A,B,C; int answer; do { clrscr(); cout<<"\aIni Adalah Program Perkalian Matriks Ordo NxN\n\n\n"; cout<<"MATRIKS A : "<<endl<<endl; cout<<"Masukkan Jumlah Baris Matriks A : "; cin>>rowA; cout<<"Masukkan Jumlah Kolom Matriks A : "; cin>>colA; cout<<endl<<endl; cout<<"MATRIKS B : "<<endl<<endl; cout<<"Masukkan Jumlah Baris Matriks B : "; cin>>rowB; cout<<"Masukkan Jumlah Kolom Matriks B : "; cin>>colB; Lukman. M/06.2007.1.04153

Upload: lukman

Post on 14-Sep-2014

225 views

Category:

Documents


14 download

TRANSCRIPT

Page 1: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

Perkalian 2 Buah Matriks Dg Inputan Keyboard

Flowchart

Source Code//Program Perkalian 2 Buah Matriks Berordo NxN atau MxN// #include <iostream.h> #include <conio.h> #include <stdio.h>

#define ValueMax 25

typedef float matriks[ValueMax][ValueMax];

void main() {

int colA,colB,rowA,rowB,i,j; matriks A,B,C; int answer;

do { clrscr(); cout<<"\aIni Adalah Program Perkalian Matriks Ordo NxN\n\n\n"; cout<<"MATRIKS A : "<<endl<<endl; cout<<"Masukkan Jumlah Baris Matriks A : "; cin>>rowA; cout<<"Masukkan Jumlah Kolom Matriks A : "; cin>>colA; cout<<endl<<endl; cout<<"MATRIKS B : "<<endl<<endl; cout<<"Masukkan Jumlah Baris Matriks B : "; cin>>rowB; cout<<"Masukkan Jumlah Kolom Matriks B : "; cin>>colB; } while (colA!=rowB);

clrscr(); cout<<"Masukkan Nilai Matriks A : "<<endl; for(i=1;i<=rowA;i++) { for(j=1;j<=colA;j++) { cout<<"A["<<i<<","<<j<<"] = ";

Lukman. M/06.2007.1.04153

Page 2: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

cin>>A[i][j]; } }

cout<<endl<<endl; cout<<"Masukkan Nilai Matriks B : "<<endl; for(i=1;i<=rowB;i++) { for(j=1;j<=colB;j++) { cout<<"B["<<i<<","<<j<<"] = "; cin>>B[i][j]; } }

clrscr(); cout<<endl; //Proses Perkalian Matriks if(colA == 1) { for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { C[i][j] = (A[i][1] * B[1][j]); } } }

if(colA == 2) { for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { C[i][j] = (A[i][1] * B[1][j] + A[i][2] * B[2][j]); } } }

if(colA == 3) { for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { C[i][j] = (A[i][1] * B[1][j] + A[i][2] * B[2][j] + A[i][3] * B[3][j]); } } }

if(colA == 4) {

Lukman. M/06.2007.1.04153

Page 3: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { C[i][j] = (A[i][1]*B[1][j] + A[i][2]*B[2][j] + A[i][3]*B[3][j] + A[i][4]*B[4][j]); } } }

if(colA == 5) { for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { C[i][j] = (A[i][1]*B[1][j] + A[i][2]*B[2][j] + A[i][3]*B[3][j] + A[i][4]*B[4][j] + A[i][5]*B[5][j]); } } }

clrscr(); //Output Matriks A gotoxy(1,5); cout<<"A = "; for(i=1;i<=rowA;i++) { for(j=1;j<=colA;j++) { gotoxy(2+4*j,2+2*i); cout<<A[i][j]; } }

//Output Matriks B gotoxy(1,17); cout<<"B = "; for(i=1;i<=rowB;i++) { for(j=1;j<=colB;j++) { gotoxy(2+4*j,14+2*i); cout<<B[i][j]; } }

//Output Matriks C gotoxy(1,30); cout<<"C = "; for(i=1;i<=rowA;i++) { for(j=1;j<=colA;j++)

Lukman. M/06.2007.1.04153

Page 4: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

{ gotoxy(3+4*j,27+2*i); cout<<A[i][j]; } }

gotoxy(25,30); cout<<" X "; for(i=1;i<=rowB;i++) { for(j=1;j<=colB;j++) { gotoxy(26+4*j,27+2*i); cout<<B[i][j]; } }

gotoxy(43,30); cout<<" = "; for(i=1;i<=rowA;i++) { for(j=1;j<=colB;j++) { gotoxy(45+4*j,27+2*i); cout<<C[i][j]; } }

getch();}

Lukman. M/06.2007.1.04153

Page 5: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

Lukman. M/06.2007.1.04153

Page 6: Program Perkalian Matriks Berordo NxN

Modul 3 Algoritma & Pemrograman

Lukman. M/06.2007.1.04153