karnaugh map program assignment

BY BILAL ASLAM

Karnaugh mapThe Karnaugh map, also known as the K-map, is a method to simplify boolean algebra expressions

//Bilal Aslam

//program for implimentation of K-Map

#include <iostream>

using namespace std;

int main() {

int m0,m1,m2,m3,m4,m5,m6,m7,m8,m9,m10,m11,m12,m13,m14,m15;

int arr[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;


cin>>m1;


cin>>m2;


Submission Date: 18 -11-2016

cin>>m3;


cin>>m4;


cin>>m5;


cin>>m6;


cin>>m7;


cin>>m8;


cin>>m9;


cin>>m10;


cin>>m11;


cin>>m12;


cin>>m13;


cin>>m14;


cin>>m15;

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<<"Simplified Function is F: "<<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<<"Simplified Function is F: "<<"A'B'C D'" <<endl;


cout<<"Simplified Function is F: "<<"A'B'C" <<endl;


cout<<"Simplified Function is F: "<<"A'B'D+A'B'C" <<endl;

else

cout<<"Simplified Function is F: "<<"0" <<endl;

return 0; }

Output:

karnaugh map program assignment

Engineering