Series 1 Basic Tools of Combinational Logic
Series 1 Basic Tools of Combinational Logic
Series 1 Basic Tools of Combinational Logic
Exercise 2.4 Write a Boolean equation in product-of-sums canonical form for the
truth tables in Figure 2.81.
Exercise 2.5 Minimize each of the Boolean equations from Exercise 2.1.
Exercise 2.6 Minimize each of the Boolean equations from Exercise 2.2.
Exercise 2.9 Repeat Exercise 2.7 using only NOT gates and AND and OR gates.
Exercise 2.10 Repeat Exercise 2.8 using only NOT gates and AND and OR gates.
Exercise 2.11 Repeat Exercise 2.7 using only NOT gates and NAND and NOR
gates.
Exercise 2.12 Repeat Exercise 2.8 using only NOT gates and NAND and NOR
gates.
Exercise 2.13 Simplify the following Boolean equations using Boolean theorems.
Check for correctness using a truth table or K-map.
(a) Y = AC + A BC
(b) Y = A B + ABC + ðA + C Þ
(c) Y = A B C D + AB C + ABCD + ABD + A BCD + BCD + A
Exercise 2.14 Simplify the following Boolean equations using Boolean theorems.
Check for correctness using a truth table or K-map.
(a) Y = ABC + ABC
(b) Y = ABC + AB
(b) Y = A + AB + A B + A + B
(c) Y = ABC + ABD + ABE + ACD + ACE + ðA + D + EÞ + B CD
+ B CE + B D E + C D E
(a) Y = ABC + BC + BC
(b) Y = ðA + B + CÞD + AD + B
(c) Y = ABCD + ABCD + ðB + DÞE