├── PROJECT REPORT.docx
├── PO3.cpp
├── PO1.cpp
└── PO2.cpp


/PROJECT REPORT.docx:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Mustafa-Hassan2001/Discrete-Structures-Programming-Project-/HEAD/PROJECT REPORT.docx


--------------------------------------------------------------------------------
/PO3.cpp:
--------------------------------------------------------------------------------
  1 | #include<iostream>
  2 | using namespace std;
  3 | //Function of conjunction
  4 | void conjunction(int arr1[],int arr2[]){
  5 | 	int i;
  6 | 	cout<<"[ ";
  7 | 	 for(i=0;i<4;i++){
  8 | 		if(arr1[i]==1 && arr2[i]==1){		//conjunction logic
  9 | 			cout<<"1 , ";
 10 | 		}else{
 11 | 			cout<<"0 , ";
 12 | 		}}
 13 | 	cout<<" ]"<<endl;
 14 | }
 15 | 
 16 | //Function for disjunction
 17 | void disjunction(int arr1[],int arr2[]){
 18 | 	int i;
 19 | 	cout<<"[ ";
 20 | 	for( i=0;i<4;i++){
 21 | 		if(arr1[i]==1 ||  arr2[i]==1){		//disjunction logic
 22 | 			cout<<"1 , ";
 23 | 		}else{
 24 | 			cout<<"0 , ";
 25 | 		}}
 26 | 	cout<<" ]"<<endl;
 27 | }
 28 | 
 29 | //Function For exclusive
 30 | void exclusive(int arr1[],int arr2[]){
 31 | 	cout<<"[ ";
 32 | 	for(int i=0;i<4;i++){
 33 | 		if(arr1[i]==arr2[i]){		//exclusive logic
 34 | 			cout<<"0 , ";
 35 | 		}else{
 36 | 			cout<<"1 , ";
 37 | 		}}
 38 | 	cout<<" ]"<<endl;
 39 | }
 40 | 
 41 | //Function for conditional
 42 | void conditional(int arr1[],int arr2[]){
 43 | 	cout<<"[ ";
 44 | 	for(int i=0;i<4;i++){
 45 | 		if(arr1[i]==1 && arr2[i]==0){		//conditional logic
 46 | 			cout<<"0 , ";
 47 | 		}else{
 48 | 			cout<<"1 , ";
 49 | 		}}
 50 | 	cout<<" ]"<<endl;
 51 | }
 52 | 
 53 | //Function for biconditional
 54 | void biconditional(int arr1[],int arr2[]){
 55 | 	cout<<"[ ";
 56 | 	for(int i=0;i<4;i++){ 
 57 | 		if(arr1[i]==arr2[i]){		//biconditional logic
 58 | 			cout<<"1 , ";
 59 | 		}else{
 60 | 			cout<<"0 , ";
 61 | 		}}
 62 | 	cout<<" ]"<<endl;
 63 | }
 64 | 
 65 | int main(){
 66 | int p[50],q[50],index;
 67 | int size,choice;
 68 | cout<<"Enter the size of array p:";
 69 | cin>>size;
 70 | cout<<"Enter the elements of array p:"<<endl;
 71 | for(index=0;index<size;index++){
 72 | 	cin>>p[index];
 73 | 	
 74 | }
 75 | cout<<"Enter the size of array q:";
 76 | cin>>size;
 77 | cout<<"Enter the elements of array q:"<<endl ;
 78 | for(index=0;index<size;index++){
 79 | 	cin>>p[index];	
 80 | }
 81 | do{
 82 | 	system("cls");
 83 | 	cout<<endl;
 84 | 	//main menu
 85 | cout<<"1.conjunction\n2.disjunction\n3.exclusive\n4.conditional\n5.biconditional"<<endl;
 86 | cout<<"Enter your choice: ";
 87 | cin>>choice;
 88 | 	system("cls");
 89 | 	if(choice==1){
 90 | 	cout<<endl<<"Conjunction   = ";
 91 | 	conjunction(p,q);
 92 | 	break;
 93 | 	}
 94 | 	if(choice==2){
 95 | 	cout<<endl<<"Disjunction   = ";
 96 | 	disjunction(p,q);
 97 | 	break;
 98 | 	}
 99 | 	if(choice==3){
100 | 	cout<<endl<<"Exclusive     = ";
101 | 	exclusive(p,q);
102 | 	break;
103 | }
104 | 	if(choice==4){
105 | 	cout<<endl<<"Conditional    = ";
106 | 	conditional(p,q);
107 | 	break;
108 | }
109 | 	if(choice==5){
110 | 	cout<<endl<<"Biconditional  = ";
111 | 	biconditional(p,q);
112 | 	break;
113 | }
114 | if(choice==6){
115 | 	cout<<"\nYou are exit from this program ";
116 | }
117 | }while(choice!=6);
118 | 
119 | }
120 |      
121 | 


--------------------------------------------------------------------------------
/PO1.cpp:
--------------------------------------------------------------------------------
  1 | #include<iostream>
  2 | using namespace std;
  3 | //Function for symmatric
  4 | void symmatric(){
  5 | 	int A[10][10], i, j, m, n, x = 0, y = 0;
  6 |     cout << "Enter the number of rows and columns : ";
  7 |     cin >> m >> n;
  8 |     cout << "Enter the matrix elements : ";
  9 |     for (i = 0; i < m; i++)
 10 |         for (j = 0; j < n; j++)
 11 |             cin >> A[i][j];
 12 |     for (i = 0; i < m; i++){
 13 |         for( j = 0; j < n; j++){		//symmatric logic
 14 |             if (A[i][j] != A[j][i])
 15 |                 x = 1;
 16 |             else if (A[i][j] == -A[j][i])
 17 |                     y = 1;
 18 |         }}
 19 |     if (x == 0)
 20 |         cout << "The matrix is symmetric.\n ";
 21 |     else if (x == 1)
 22 |         cout << "The matrix is Anti-symmetric.\n ";
 23 |     for (i = 0; i < m; i++){
 24 |             for (j = 0; j < n; j++)	
 25 |                 cout << A[i][j] << " ";
 26 |             cout << "\n ";
 27 |         }}
 28 | 
 29 | // Function for reflexive
 30 | void reflexi(){
 31 | 		int A[10][10], i, j, m, n, x = 0, y = 0;
 32 |     cout << "Enter the number of rows and columns : ";
 33 |     cin >> m >> n;
 34 |     cout << "Enter the matrix elements : ";
 35 |     for (i = 0; i < m; i++)
 36 |         for (j = 0; j < n; j++)
 37 |             cin >> A[i][j];
 38 |     for (i = 0; i < m; i++){
 39 |         for( j = 0; j < n; j++){		//reflexive logic
 40 |         	if(i==j & A[i][j] != 1){
 41 |         		x=1;
 42 | 			}}
 43 | }
 44 | if(x==0)
 45 | 	cout<<"\nMatrix is reflexive.\n";
 46 | if(x==1)
 47 | 	cout<<"\nMatrix is irreflexive.\n";	
 48 | 	    for (i = 0; i < m; i++)
 49 |         {
 50 |             for (j = 0; j < n; j++)	
 51 |                 cout << A[i][j] << " ";
 52 |             cout << "\n ";
 53 |         }
 54 | }
 55 | 
 56 | //Function for Transitive
 57 | void Transitive(){
 58 | 		int A[10][10], i, j, m, n, x = 0, y = 0;
 59 | 		  bool check=true;
 60 |     cout << "Enter the number of rows and columns : ";
 61 |     cin >> m >> n;
 62 |     cout << "Enter the matrix elements : ";
 63 |     for (i = 0; i < m; i++)
 64 |         for (j = 0; j < n; j++)
 65 |             cin >> A[i][j];
 66 |            
 67 | 		for(int i=0;i<m;i++){
 68 | 			for(int j=0;j<m;j++){
 69 | 				for(int k=0;k<m;k++){			//Transitive logic
 70 |                  if ((i!=j && j!=k) && (A[i][j] == 1 && A[j][k] == 1 && A[k][i] != 1)){
 71 |                    y=1;
 72 | 				}}}
 73 | 	}
 74 | 		if(check==0){
 75 | 			cout<<endl<<"The matrix is transitive.\n";
 76 | 		}	
 77 | 		else{
 78 | 			cout<<endl<<"The matrix is not transitive.\n";
 79 | 		}
 80 | 		for (i = 0; i < m; i++){
 81 |             for (j = 0; j < n; j++)	
 82 |                 cout << A[i][j] << " ";
 83 |             cout << "\n ";
 84 |         }
 85 |         }
 86 | 
 87 | int main (){
 88 | 
 89 | 	int ch;
 90 | 	//main menu
 91 | 	do{
 92 | 		
 93 | 			cout<<endl;
 94 | 	cout<<"1->Symmatric\n2->reflexive\n3->Transitive\n4->Exit\n";
 95 | 	cout<<"Enter your choice : ";
 96 | 	cin>>ch;
 97 | 	system("cls");
 98 | 	if(ch==1)
 99 |     symmatric();
100 |     if(ch==2)
101 | 	reflexi();
102 | 	if(ch==3)
103 |     Transitive();
104 |     if(ch==4){
105 |     	cout<<"\nYour are exit form this program";
106 | 	}
107 | }while(ch!=4);
108 | 
109 |     return 0;
110 | }
111 | 
112 | 


--------------------------------------------------------------------------------
/PO2.cpp:
--------------------------------------------------------------------------------
  1 | #include<iostream>
  2 | using namespace std;
  3 | 
  4 | //Function for Union
  5 | void Union(int arr1[], int arr2[], int len1, int len2) {
  6 |     int f, i, j, k = 0;
  7 |     int arr3[100];
  8 |     for (i = 0; i < len1; i++) {
  9 |         arr3[k] = arr1[i];
 10 |         k++;
 11 |     }
 12 |     for (i = 0; i < len2; i++) {			//Union logic in this for loop
 13 |         f = 0;
 14 |         for (j = 0; j < len1; j++) {
 15 |             if (arr2[i] == arr1[j]) {
 16 |                 f = 1;
 17 |             }}
 18 |         if (f == 0) {
 19 |             arr3[k] = arr2[i];
 20 |             k++;
 21 |         }  }
 22 |     cout << "Union of two array is:";
 23 |     for (i = 0; i < k; i++) {
 24 |         cout << arr3[i] << " ";
 25 |     }
 26 | }
 27 |  
 28 | //Function for Intersection
 29 | void Intersection(int arr1[], int arr2[], int len1, int len2) {
 30 |     int arr3[100];
 31 |     int i, j, k = 0;
 32 |     for (i = 0; i < len1; i++) {		//Intersection logic
 33 |         for (j = 0; j < len2; j++) {
 34 |             if (arr1[i] == arr2[j]) {
 35 |                 arr3[k] = arr1[i];
 36 |                 k++;
 37 |             }
 38 |         }
 39 |     }
 40 |     cout << "\nIntersection of two array is:";
 41 |     for (i = 0; i < k; i++) {
 42 |         cout << arr3[i] << " ";
 43 |     }
 44 | }
 45 | 
 46 | //Funnctiom fro A-B
 47 | void diference(int a[10],int b[10], int n1, int n2){
 48 | 	int c[10],d[10],m=0,k=0,l,i,j;
 49 |     for( i=0;i<n1;i++){
 50 |         for(j=0;j<n2;j++){			//A-B logic
 51 |             if(b[j]==a[i])
 52 |              break;
 53 |         }
 54 |         if(j==n2){			
 55 |             for(l=0;l<k;l++){
 56 |                 if(c[l]==a[i])
 57 |                  break;
 58 |             }
 59 |             if(l==k){
 60 |                 c[k]=a[i];
 61 |                 k++;
 62 |             }
 63 |         }}
 64 |     cout<<"\nDifference of A-B is:-\n";
 65 |      for(i=0;i<k;i++)
 66 |      {
 67 |          cout<<c[i]<<" ";
 68 |      }
 69 |     
 70 | }
 71 | 
 72 | //Funtion for A+B
 73 | void last(int arr1[], int arr2[], int len1, int len2){
 74 |         int arr3[200];
 75 |         int p = 0;
 76 |         int q = 0;
 77 |         int k = 0;
 78 |         while ( p < len1 && q < len2) {				// A+B LOGIC
 79 |             if (arr1[p] < arr2[q]) {
 80 | 
 81 |                 arr3[k++] = arr1[p++];
 82 |             } else {
 83 |                 arr3[k++] = arr2[q++]; 
 84 |             }
 85 |                 
 86 |         }
 87 |         while ( p < len1) {
 88 |             arr3[k++] = arr1[p++];   
 89 |         }
 90 |         while ( q < len2) {
 91 |             arr3[k++] = arr2[q++];   
 92 |         }
 93 |         cout<<"\nA+B : "<<endl;
 94 |         for ( int c = 0; c < k; c++) {
 95 |             cout << arr3[c] << " ";   
 96 |         }               
 97 | }
 98 | 
 99 | void get(){
100 | 	    int arr1[100];
101 |     int arr2[100];
102 |     int arr3[100];
103 |     int i, j, len1, len2;
104 | 	int ch;
105 |     cout << "Enter size of 1st array:";
106 |     cin>>len1;
107 | 
108 |     cout << "Enter 1st array elements:";
109 |     for (i = 0; i < len1; i++) {
110 |         cin >> arr1[i];
111 |     }
112 |     cout << "Enter size of 2nd array:";
113 |     cin>>len2;
114 | 
115 |     cout << "Enter 2nd array elements:";
116 |     for (i = 0; i < len2; i++) {
117 |         cin >> arr2[i];
118 |     }
119 |     system("cls");
120 |     do{
121 |     	//main menu
122 |     cout<<"\n\n1->Union\n2->Intersection\n3->A-B\n4->A+B\n5->Exit"<<endl;
123 | 	cout<<"Enetr your choice : ";
124 | 	cin>>ch;
125 | 	if(ch==1){
126 | //	system("cls");	
127 |     Union(arr1, arr2, len1, len2);}
128 |     if(ch==2){
129 | //    system("cls");	
130 |     Intersection(arr1, arr2, len1, len2);
131 | 	}
132 | 	if(ch==3){
133 | //	system("cls");
134 | 	diference(arr1, arr2, len1, len2);
135 | 	}
136 | 	if(ch==4){
137 | //	system("cls");
138 | 	last(arr1, arr2, len1, len2);
139 | 	}
140 | 	if(ch==5){
141 | 		cout<<"\n\nYou are exit to this program..";
142 | 		exit(0);
143 | 	}
144 | }while(ch!=5);
145 | 
146 | }
147 | 
148 | int main() {
149 | get();
150 |     return 0;
151 | }
152 | 
153 | 


--------------------------------------------------------------------------------