Examples of Two Dimensional Array in Data Structure Lab 3

• Example No:1

Translate the matrix multiplication algorithm into a program which finds the product C of an nxm matrix A and pxn matrix B. Test the program using

                                 A=  4       -3        5

                                       6        1       -2

                                       23     -7       -3

                                 B= 5       -1         6        2

                                      0        3        -2         1 

Algorithm

Let A be an nxm matrix, and let B be a pxn matrix array. This algorithm stores the product of A and B in a mxp matrix array C

Repeat Steps 2 to 4 for I=1to M

Repeat Steps 3 to 4 for J=1to N

Set C[I,J]=0 Initialize C[I,J]

Repeat for K=1 to P    

C[I,J]=C[I,J]+A[I,K]*B[K,J]

[END of inner loop]

[END of Step 2 loop]

[END of Step 1 loop]

Source Code:

 

#include<iostream> using namespace std; class Matrix { public: void multiply(int A[2][3],int B[3][4],int C[2][4]) { for(int i=0;i<2;i++) { for(int j=0;j<4;j++) { for(int k=0;k<3;k++) { C[i][j]=C[i][j]+A[i][k]*B[k][j]; } } } cout<<C[0][0]<<" "<<C[0][1]<<" "<<C[0][2]<<" "<<C[0][3]<<"\n"; cout<<C[1][0]<<" "<<C[1][1]<<" "<<C[1][2]<<" "<<C[1][3]<<"\n"; } }; void main() { Matrix m;; int A[2][3]={{4,-3,5},{6,1,-2}}; int B[3][4]={{2,3,-7,-3},{5,-1,6,2},{0,3,-2,1}}; int C[2][4]={{0,0,0,0},{0,0,0,0}}; m.multiply(A,B,C); }

• Example No:02

Suppose A and B are n-elements vector array in memory and X an Y
are scalars. Write a program to find.
a) XA + YB
b) A . B
Test the program using A= (16, -6,7), B=(4,2,-3), X= 2, Y= -5
Source Code:

#include<iostream> usingnamespacestd; class vector { private: int value; intproduct_value; public: void add(int a[],int b[],intx,int y) {cout<<"{"; for(int i=0;i<3;i++) {value=x*a[i]+y*b[i]; cout<<value<<","; } cout<<"}\n"; } void multi(int a[],int b[],intx,int y) {cout<<"{"; for(int i=0;i<3;i++) { product_value=(a[i]*b[i])*(x+y); cout<<product_value<<","; } cout<<"}\n"; } }; void main() { vectorvec; int ary1[3] = {16,-6,7}; int ary2[3] = {4,2,-3}; int x=2; int y=-5; charch; do { cout<<"1) For Scalar Muliplication\n"; cout<<"2) For Dot Product\n"; cout<<"3) End Program\n"; cout<<"Enter your option: "; cin>>ch; switch(ch) { case'1': { vec.add(ary1,ary2,x,y); break; } case'2': { vec.multi(ary1,ary2,x,y); break; } } } while(ch != '3'); }

•  Example No:03

Translate the linear search algorithm into a program which either find
the location LOC where ITEM appears in ARRAY or return LOC=0.?
Source Code:

#include<iostream> using namespace std; class Linear { public: void search(int a[],int num) { for(int i=0;i<10;i++) { if(a[i]==num) {cout<<"number found at index "<<i<<"\n"; } else { cout<<"number not found.\n"; } } } }; void main() { Linear l; int a[10]={11,22,33,36,45,52,57,60,64,78}; int num; cout<<"enter number you want to find?"; cin>>num; l.search(a,num); }
      

•    Example No:04

Translate binary search and insertion algorithm into a program which finds either the location LOC where ITEM appears in ARRAY or the location  LOC  where ITEM should be inserted into ARRAY. (For object 3, 4, and 5 take an array of 10 elements given below)? 

Source Code: 

#include<iostream> usingnamespacestd; class binary { private: int n, search[10],low , high,mid ,temp, key; public: void main() { bool found = false; cout<<"Enter the number of element: "; cin>>n; for(int i = 0; i < n; i++){ cout<<"search["<<i<<"]: "; cin>>search[i]; } for(int i = 0; i < n; i++){ for(int j = 0; j < n-i-1; j++){ if(search[j] > search[j+1]){ temp = search[j]; search[j] = search[j+1]; search[j+1] = temp; } } } cout<<"the sorted array is: "; for(int i = 0; i < n; i++){ cout<<search[i]<<" "; } cout<<"\nEnter the number to search: "; cin>>key; low = 0; high = n-1; while(low<=high){ mid = (low + high)/2; if(key == search[mid]){ cout<<"The key is found at index "<<mid<<endl; found = true; break; }elseif(key < search[mid]){ high = mid - 1; }else{ low = mid + 1; } } if(!found){ cout<<"Key not found!"; } } }; void main() { binary b; b.main(); } 

•  Example No:05

Write a program which uses Binary Search to search the elements 52,and 33 and print it.
Source Code:

#include<iostream> using namespace std; class Search { public: int mid,up,low; void search(int arr[]) { mid=arr[5]; if( 45 >arr[5]) { for ( int i=5;i<10;i++) { if ( arr[i]== 45) { cout<<"45 is at index"<<"\n"; } } } if( 45 <arr[5]) { for (int i=0;i<5;i++) { if ( arr[i]== 45) { cout<<"45 is at index "<<i<<" \n"; } } } } void search1(int arr[]) { mid=arr[5]; if( 33 >arr[5]) { for ( int i=5;i<10;i++) { if ( arr[i]==33) { cout<<"33 is at index "<<"\n"; } } } if( 33 <arr[5]) { for ( int i=0;i<5;i++) { if ( arr[i] == 33) { cout<<"33 is at index "<<i<<" \n"; } } } } }; void main() { int arr[10]={11,22,33,36,45,52,57,60,64,78}; Search s; s.search(arr); s.search1(arr); }  

•  Example No:06

Write a program which uses Binary Search to search the elements 45,and 78 and delete it.
NUMBERS=[11,22,33,36,45,52,57,60,64,78] 
 Source Code:

#include<iostream> using namespace std; class search { public: int mid,up,low; void search(int arr[]) { mid=arr[5]; if( 45 >arr[5]) { for ( inti=5;i<10;i++) { if ( arr[i]== 45) { arr[i]=0; } } } if( 45 <arr[5]) { for ( inti=0;i<5;i++) { if ( arr[i]== 45) { arr[i]=0; } } } } void search1(intarr[]) { mid=arr[5]; if( 78 >arr[5]) { for ( inti=5;i<10;i++) { if ( arr[i]==78) { arr[i]=0; } } } if( 78 <arr[5]) { for ( inti=0;i<5;i++) { if ( arr[i] == 78) { arr[i]=0; } } } } }; void main() { int arr[10]={11,22,33,36,45,52,57,60,64,78}; search ob; ob.search45(arr); ob.search78(arr); for(inti=0;i<10;i++) { cout<<"Array "<<i<<" : "<<arr[i]<<endl; } }