Indian Institute of Technology Roorkee
Tutorial 2
ECE
Digital Electronics:
Prof. Sudeb Dasgupta
Problem.1 Find the minterm and maxterm for the given Boolean functions T1 and T2.
Problem.2 The minterm expansion of 𝐹(𝐴, 𝐵, 𝐶) = 𝐴𝐵 + 𝐵𝐶 + 𝐴𝐶
Problem.3 Find the minterm and maxterm for the given Boolean functions
(a) F=AB
(b) F=A⊙B
(c) F1= S, F2=C in fig. 1
Fig. 1
(d) F3=Sum, F4= C_out in Fig. 2
Fig. 2
Problem.4 For the Boolean function 𝐹 = 𝑥𝑦𝑧 + 𝑥 𝑦𝑧 + 𝑤𝑥𝑦 + 𝑤𝑥𝑦 + 𝑤𝑥𝑦
(a) Obtain the truth table of F. (b) Draw the logic diagram, using the original Boolean expression.
(c) Use Boolean algebra to simplify the function to a minimum number of literals. (d) Obtain the
truth table of the function from the simplified expression and show that it is the same as the one
in part (a). (e) Draw the logic diagram from the simplified expression and compare the total
number of gates with the diagram of part (b).
Problem. 5 Express the following function as a sum of minterms and as a product of maxterms:
𝐹( 𝐴, 𝐵, 𝐶, 𝐷) = 𝐵𝐷 + 𝐴𝐷 + 𝐵𝐷
Problem. 6 Convert each of the following to the other canonical form:
(𝑎) 𝐹(𝑥, 𝑦, 𝑧) = (1, 3, 5)
(𝑏) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∏(3, 5, 8, 11)
Problem. 7 Simplify the following Boolean expressions to a minimum number of literals:
(𝑎) 𝑥𝑦 + 𝑥𝑦
(𝑎) 𝑥𝑦 + 𝑥𝑦
(𝑏) (𝑥 + 𝑦)(𝑥 + 𝑦)
(𝑐) 𝑥𝑦𝑧 + 𝑥 𝑦 + 𝑥𝑦𝑧
(𝑑) (𝑎 + 𝑏 + 𝑐)(𝑎 𝑏 + 𝑐)
(𝑒) 𝑎𝑏𝑐 + 𝑎𝑏𝑐 + 𝑎𝑏𝑐 + 𝑎𝑏𝑐
Problem. 8 Simplify the following Boolean expressions to a minimum number of literals:
(𝑎) 𝐴𝐵𝐶 + 𝐴𝐵 + 𝐴𝐵𝐶
(𝑏) 𝑥𝑦𝑧 + 𝑥𝑧
(𝑐) (𝑥 + 𝑦) (𝑥 + 𝑦)
(d) 𝑥𝑦 + 𝑥(𝑤𝑧 + 𝑤𝑧)
(𝑒)(𝐵𝐶 + 𝐴𝐷) (𝐴𝐵 + 𝐶𝐷)
Problem. 9 Simplify the following Boolean functions, using three-variable maps:
(𝑎) 𝐹(𝑥, 𝑦, 𝑧) = (0, 2, 6, 7)
(𝑏) 𝐹(𝑥, 𝑦, 𝑧) = (0, 2, 3, 4, 6)
(𝑐) 𝐹(𝑥, 𝑦, 𝑧) = (0, 1, 2, 3, 7)
(𝑑) 𝐹(𝑥, 𝑦, 𝑧) = (3, 5, 6, 7)
Problem. 10 Simplify the following Boolean functions, using three-variable maps:
(𝑎) 𝐹 (𝑥, 𝑦, 𝑧) = (0, 1, 5, 7)
(𝑏) 𝐹 (𝑥, 𝑦, 𝑧) = (1, 2, 3, 6, 7)
(𝑐) 𝐹 (𝑥, 𝑦, 𝑧2 = (0, 1, 6, 7)
Problem. 11 Simplify the following Boolean functions, using three-variable maps:
(𝑎) 𝐹 (𝑥, 𝑦, 𝑧2 = (0,1, 3, 4, 5)
(𝑏) 𝐹(𝑥, 𝑦, 𝑧2 = (1, 3, 5,7)
(𝑐) 𝐹( 𝑥, 𝑦, 𝑧2 = (1,4, 5, 6, 7)
Problem. 12 Simplify the following Boolean functions:
(𝑎) 𝑤𝑧 + 𝑥𝑧 + 𝑥 𝑦 + 𝑤𝑥 𝑧
(𝑏) 𝐴𝐷 + 𝐵 𝐶𝐷 + 𝐵𝐶𝐷 + 𝐵𝐶𝐷
(𝑐) 𝐴𝐵𝐶 + 𝐵 𝐶 𝐷 + 𝐵𝐶𝐷 + 𝐴𝐶𝐷 + 𝐴 𝐵𝐶 + 𝐴𝐵𝐶𝐷
(𝑑) 𝑤𝑥𝑦 + 𝑥𝑧 + 𝑤𝑥𝑧 + 𝑤𝑥
Problem. 13 Simplify the following functions, and implement them with two-level NAND gate
circuits:
(𝑎) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) =
(𝑏) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) =
Problem. 14 Simplify the following functions, and implement them with two-level NAND gate
circuits:
(𝑎) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) =
(b)
Problem. 15 Draw a NAND logic diagram that implements the complement of the following
function:
F(A, B, C, D) = (0, 1, 2, 3, 4, 8, 9, 12)
Problem. 16 Implement the following Boolean function F, using the two-level forms of logic (a)
NAND AND, (b) AND-NOR, (c) OR-NAND, and (d) NOR-OR:
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = (0, 4, 8, 9, 10, 11, 12, 14)
Problem. 17 Implement the following Boolean expression with exclusive-OR and AND gates:
𝐹 = 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷 + 𝐴𝐵 𝐶𝐷 + 𝐴𝐵𝐶𝐷