Farheen Zahra

CS302
Assignment No. 2

Given min-terms
£(A,B,C,D,E) (0,1,2,4,6,7,9,10,15,16,20,21,22,23,28,29,30)
Step 1: Group minterms by the number of 1’s in their binary representations.
Group the minterms by number of 1’s
 Group O: (0)
 Group 1: (1)
 Group 2: (2,4)
 Group 3: (6,7,9,10)
 Group 4: (15,16,20,21,22,23,28,29,30)

Step 2: Find prime implicants within each group

 Group O: (0)

No further combinations possible as it contains only one minterm.

 For group 1: (1)

No further combinations possible as it contains only one minterm.

 For Group 2: (2,4)

The binary representations differ by 1bit, so combine them (2,4)=2ĀBC+2ABC

 For group 3:(6,7,9,10)

Perform comparisons:
 6 and 7 differ by 1 bit: (6,7)=> 6ĀBD+6ĀBE+7ĀBD+7ĀBE
 6 and 9 differ by 1 bit (6,9) => 6ĀBD+6ĀBE+9ĀBC+9ĀBE
 6 and 10 differ by 1 bit (6,10) => 6ĀBD+6ĀBE+10ĀBC+10ĀBE
 7 and 9 differ by 1 bit (7,9) => 7ĀBD+7ĀBE+9ĀBC+9ĀBE
 7 and 10 differ by 1 bit (7,10) => 7ĀBD+7ĀBE+10ĀBC+10ĀBE
 9 and 10 differ by 1 bit (9,10) => 9ĀBD+9ĀBE+10ĀBC+10ĀBE

 For group 4: (15,16,20,21,22,23,28,29,31)

Perform comparisons to find prime implicants.

Step 3: Check for essential prime implicants and cover all minterms.
The essential prime implicants are those that cover a minterm that no prime implicant
covers.

Step 4: Create the simplified expression using the prime implicants.

The simplified expression will be the sum of prime implicants obtained, covering all
minterms.

I will proceed with the steps to derive the prime implicants and the simplified
expression based on the provided minterms using Quine McCluskey method