Karnaugh map program Assignment
Download as DOCX, PDF1 like422 views
The document describes a C++ program that implements a Karnaugh map to simplify boolean algebra expressions. The program takes in 16 binary inputs from the user, arranges them in a 4x4 Karnaugh map table, and checks for combinations of 1s in order to output a simplified boolean expression. If no combinations are found, it outputs 0.
![Submission Date: 18 -11-2016
//Bilal Aslam
//programfor implimentationof K-Map
#include <iostream>
usingnamespace std;
intmain() {
intm0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15;
intarr[16]={m0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15};
cout<<"Enter 1 or 0 in m0: "<< endl;
cin>>m0;
cout<<"Enter 1 or 0 in m1: "<< endl;
cin>>m1;
cout<<"Enter 1 or 0 in m2: "<< endl;
cin>>m2;
cout<<"Enter 1 or 0 in m3: "<< endl;
BY BILAL ASLAM
Karnaugh map
The Karnaugh map, also known as the K-map, is a method to
simplify boolean algebra expressions](https://image.slidesharecdn.com/dldassignment-170203184109/85/Karnaugh-map-program-Assignment-1-320.jpg)
Karnaugh map program Assignment
- 1. Submission Date: 18 -11-2016 //Bilal Aslam //programfor implimentationof K-Map #include <iostream> usingnamespace std; intmain() { intm0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15; intarr[16]={m0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15}; cout<<"Enter 1 or 0 in m0: "<< endl; cin>>m0; cout<<"Enter 1 or 0 in m1: "<< endl; cin>>m1; cout<<"Enter 1 or 0 in m2: "<< endl; cin>>m2; cout<<"Enter 1 or 0 in m3: "<< endl; BY BILAL ASLAM Karnaugh map The Karnaugh map, also known as the K-map, is a method to simplify boolean algebra expressions
- 2. cin>>m3; cout<<"Enter 1 or 0 in m4: "<< endl; cin>>m4; cout<<"Enter 1 or 0 in m5: "<< endl; cin>>m5; cout<<"Enter 1 or 0 in m6: "<< endl; cin>>m6; cout<<"Enter 1 or 0 in m7: "<< endl; cin>>m7; cout<<"Enter 1 or 0 in m8: "<< endl; cin>>m8; cout<<"Enter 1 or 0 in m9: "<< endl; cin>>m9; cout<<"Enter 1 or 0 in m10: "<< endl; cin>>m10; cout<<"Enter 1 or 0 in m11: "<< endl; cin>>m11; cout<<"Enter 1 or 0 in m12: "<< endl; cin>>m12; cout<<"Enter 1 or 0 in m13: "<< endl; cin>>m13; cout<<"Enter 1 or 0 in m14: "<< endl; cin>>m14; cout<<"Enter 1 or 0 in m15: "<< endl; cin>>m15;
- 3. cout<<endl; cout<<" C'D' "<<"C'D "<<"C D" <<" C D'" << endl; cout<<"A'B'"<<" "<< m0<<" "<< m1<<" "<< m3<<" "<<m2<<endl; cout<<"A'B"<<" "<< m4<<" "<< m5<<" "<< m7<<" "<< m6<<endl; cout<<"A B"<<" "<<m12<<" "<< m13<<" "<< m15<<" "<< m14<<endl; cout<<"A B'"<<" "<<m8<<" "<< m9<<" "<< m11<<" "<< m10<<endl; if((m0==1)&&(m1==1)&&(m2==1)&&(m3==1)&&(m4==1)&(m5==1)&&(m6==1)&&(m7==1)&&(m8==1)& &(m9==1)&&(m10==1)&&(m11==1)&&(m12==1)&&(m13==1)&&(m14==1)&&(m15==1)) cout<<endl<<"SimplifiedFunctionisF:"<<1 <<endl; else if((m0==0)&&(m1==0)&&(m2==1)&&(m3==0)&&(m4==0)&(m5==0)&&(m6==0)&&(m7==0)&&(m8==0)& &(m9==0)&&(m10==0)&&(m11==0)&&(m12==0)&&(m13==0)&&(m14==0)&&(m15==0)) cout<<"SimplifiedFunctionisF:"<<"A'B'C D'" <<endl; else if((m0==0)&&(m1==0)&&(m2==1)&&(m3==1)&&(m4==0)&(m5==0)&&(m6==0)&&(m7==0)&&(m8==0)& &(m9==0)&&(m10==0)&&(m11==0)&&(m12==0)&&(m13==0)&&(m14==0)&&(m15==0)) cout<<"SimplifiedFunctionisF:"<<"A'B'C" <<endl; else if((m0==0)&&(m1==1)&&(m2==1)&&(m3==1)&&(m4==0)&(m5==0)&&(m6==0)&&(m7==0)&&(m8==0)& &(m9==0)&&(m10==0)&&(m11==0)&&(m12==0)&&(m13==0)&&(m14==0)&&(m15==0)) cout<<"SimplifiedFunctionisF:"<<"A'B'D+A'B'C" <<endl; else cout<<"SimplifiedFunctionisF:"<<"0" <<endl;