---------------------------------------------------------------------------------------------------------------------------------------------------

1. Simplify the following Boolean function using 5-variable maps

i. 𝐹(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = ∑(0,1,4,5,16,17,21,25,29)
ii. 𝐹(𝐴, 𝐵, 𝐶, 𝐷, 𝐸) = ∑(1,2,3,5,7,11,13,17,19,23,29,31))

2. Implement the Boolean function by using a NAND logic gate

i. F (A, B, C, D, E) = A + (B’ + C) (D’ + BE’)

3. Implement the Boolean functions by using NOR logic gate. (2 and 3-input gates)
i. F(A, B, C, D, E, F) = (AE) + (BDE) + (BCEF)
ii. F(A, B, C, D, E, F) = (A B' + A'B) (C+D')

4. Simplify the following Boolean function F, together with the don't care conditions d, and then express the
simplified function in sum- of- minterms form
i. 𝐹(𝑥, 𝑦, 𝑧) = ∑ 𝑚(2,3,4,6,7) + ∑ 𝑑(0,1,5)
ii. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(0,6,8,13,14) + ∑ 𝑑(2,4,10)
iii. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(4,5,6,7,12,13,14) + ∑ 𝑑(1,9,11,15)
iv. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(1,3,8,10,15) + ∑ 𝑑(0,2,9)

---------------------------------------------------------------------------------------------------------------------------------------------------

Home work assignment problems

1. Design a circuit which has a 5-bit binary input (A, B, C, D, E), with A being the MSB (Most Significant Bit). It
must produce an output logic High for any prime number detected in the input data. (ans: Y=A'B'E + B'C'E +
A'B'C'D + AB'DE + A'CD'E + ABCE +A'C'DE).
2. Design a circuit of 5 input variables that generates output 1 if and only if the number of 1’s in the input is prime
(i.e., 2, 3 or 5). (ans: Y = BC’D’E + A’BC’D + AC’DE’ + AB’C’D + A’B’CE + A’CDE’ + A’BCD +
AB’CD’ + ABD’E’ + AB’DE’ + A’B’DE + ABCDE ).
3. Design a circuit with four inputs D, C, B, A that are natural 8421-binary encoded with D the most-significant bit.
The output F is true if the month represented by the input (0,0,0,0 = January, 1011 = December) is a vacation
month for me. I can have a vacation at Christmas, Easter, July, September and May. Since Easter can occur in
either March or April, we have to include both months. (ans: F = DB!A! + CA! + DBA! + DC!B!).
4. The Boolean function Y=AB + CD is to be realized using only 2 input NAND gates. What is the minimum
number of gates required? (ans: 3).
5. Simplify the following Boolean functions in products of sums:
F(w, x, y, z) = ∑(0, 2, 5, 6, 7, 8, 10) (ans: F = (w′+ x′) (x + z′)(x′+ y + z)

F(A, B, C, D) = ∏(1, 3, 5, 7, 13, 15) (ans: F = (B′+D′)(A+D′) )