Quine–McCluskey Method — Full Solutions
Prepared for: Your Assignment
===== Problem 1 (from your file) =====
Variables: A, B, C, D
Minterms: [0, 1, 2, 5, 6, 7, 8, 9, 10, 14]
Step 1: Binary representations grouped by number of ones
Group 0 ones:
0 = 0000
Group 1 ones:
1 = 0001
2 = 0010
8 = 1000
Group 2 ones:
5 = 0101
6 = 0110
9 = 1001
10 = 1010
Group 3 ones:
7 = 0111
14 = 1110
Step 2: Combining to find prime implicants (showing final prime implicants)
Pattern: 0-01 covers minterms [1, 5]
Pattern: 01-1 covers minterms [5, 7]
Pattern: 011- covers minterms [6, 7]
Pattern: -00- covers minterms [0, 1, 8, 9]
Pattern: -0-0 covers minterms [0, 2, 8, 10]
Pattern: --10 covers minterms [2, 6, 10, 14]
Prime implicant chart (minterm -> implicants covering it):
0 -> ['-00-', '-0-0']
1 -> ['0-01', '-00-']
2 -> ['-0-0', '--10']
5 -> ['0-01', '01-1']
6 -> ['011-', '--10']
7 -> ['01-1', '011-']
8 -> ['-00-', '-0-0']
9 -> ['-00-']
10 -> ['-0-0', '--10']
14 -> ['--10']
Essential prime implicants:
-00- covers [0, 1, 8, 9]
--10 covers [2, 6, 10, 14]
Selected prime implicants (after covering remaining minterms):
01-1 covers [5, 7]
-00- covers [0, 1, 8, 9]
--10 covers [2, 6, 10, 14]
Final minimized SOP (sum of products) terms:
A'BD + B'C' + CD'
Karnaugh Map for Problem 1 (A B rows, C D columns)
Rows AB -> 00, 01, 11, 10
Cols CD -> 00, 01, 11, 10
K-map grid (rows AB, cols CD):
00 : 1 1 0 1
01 : 0 1 1 1
11 : 0 0 0 1
10 : 1 1 0 1
K-map grouping observed (for explanation):
Group of four covering minterms {0,1,8,9} -> pattern -00- -> B' C'
Group of four covering {2,6,10,14} -> pattern --10 -> C D'
Group of two covering {1,5} -> 0 1 ? 1 -> 0 1 ? 1 -> A' B D
(These K-map groups match the QM solution above.)
===== Problem 2 (extra example) =====
Variables: A, B, C, D
Minterms: [1, 3, 7, 11, 15]
Step 1: Binary representations grouped by number of ones
Group 1 ones:
1 = 0001
Group 2 ones:
3 = 0011
Group 3 ones:
7 = 0111
11 = 1011
Group 4 ones:
15 = 1111
Step 2: Combining to find prime implicants (showing final prime implicants)
Pattern: 00-1 covers minterms [1, 3]
Pattern: --11 covers minterms [3, 7, 11, 15]
Prime implicant chart (minterm -> implicants covering it):
1 -> ['00-1']
3 -> ['00-1', '--11']
7 -> ['--11']
11 -> ['--11']
15 -> ['--11']
Essential prime implicants:
00-1 covers [1, 3]
--11 covers [3, 7, 11, 15]
Selected prime implicants (after covering remaining minterms):
00-1 covers [1, 3]
--11 covers [3, 7, 11, 15]
Final minimized SOP (sum of products) terms:
A'B'D + CD
===== Problem 3 (extra example) =====
Variables: A, B, C, D
Minterms: [0, 2, 4, 5, 6, 10, 12, 13]
Step 1: Binary representations grouped by number of ones
Group 0 ones:
0 = 0000
Group 1 ones:
2 = 0010
4 = 0100
Group 2 ones:
5 = 0101
6 = 0110
10 = 1010
12 = 1100
Group 3 ones:
13 = 1101
Step 2: Combining to find prime implicants (showing final prime implicants)
Pattern: -010 covers minterms [2, 10]
Pattern: 0--0 covers minterms [0, 2, 4, 6]
Pattern: -10- covers minterms [4, 5, 12, 13]
Prime implicant chart (minterm -> implicants covering it):
0 -> ['0--0']
2 -> ['-010', '0--0']
4 -> ['0--0', '-10-']
5 -> ['-10-']
6 -> ['0--0']
10 -> ['-010']
12 -> ['-10-']
13 -> ['-10-']
Essential prime implicants:
-010 covers [2, 10]
-10- covers [4, 5, 12, 13]
0--0 covers [0, 2, 4, 6]
Selected prime implicants (after covering remaining minterms):
-010 covers [2, 10]
-10- covers [4, 5, 12, 13]
0--0 covers [0, 2, 4, 6]
Final minimized SOP (sum of products) terms:
B'CD' + BC' + A'D'
