DEC Assignment 2
Question 1:
Minimize the following Boolean function using algebraic manipulation 𝐹 = 𝐴𝐵𝐶’𝐷’ + 𝐴𝐵𝐶’𝐷 +
𝐴𝐵’𝐶’𝐷 + 𝐴𝐵𝐶𝐷 + 𝐴𝐵’𝐶𝐷 + 𝐴𝐵𝐶𝐷’ + 𝐴𝐵’𝐶𝐷’
Question 2:
Find the minimum number of 2-input NAND gates required to implement the Boolean
function 𝑍 = 𝐴𝐵𝐶’. Assume that A, B and C are available.
Question 3:
Simplify the following SOP expression:
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑𝑚(1,2,3,4,12,14)
Question 4:
Represent the following expression using two-input NAND gate.
𝑌 = 𝐴𝐵 + 𝐵𝐶 + 𝐶’𝐷𝐸 + 𝐷𝐸𝐹
Question 5:
Question 6:
Question 7:
Question 8:
Which logical operation is followed in the below circuit? Justify your answer.
A
Y
B
Question 9:
Question 10:
Please draw the minimum CMOS transistor network that implements the functionality of Boolean
equation F= ((A+B) C + D)'. You can assume both the original and complemented versions of each
literal are available as gate inputs.