Assignment -2
1. Simplify the following Boolean expressions to a minimum number of literals:
i) 𝑋. 𝑌 + 𝑋. (𝑊. 𝑍 + 𝑊. 𝑍̅), ii) 𝑋. 𝑌̅ + 𝑌̅. 𝑍̅ + 𝑋̅. 𝑍̅
2. Using De-Morgan’s Theorem, find the complemented expression of the given Boolean
expressions:
i) 𝐹 = 𝐴𝐵(𝐶̅ 𝐷 + 𝐶𝐷 ̅ ) + 𝐴̅𝐵̅(𝐶̅ + 𝐷)(𝐶 + 𝐷 ̅ ),
ii) 𝐹 = (𝑋 + 𝑌̅ + 𝑍)(𝑋̅ + 𝑍̅)(𝑋 + 𝑌)
3. Simplify the Boolean function 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(3, 4, 13, 15) + 𝑑(1, 2, 5, 6, 8, 10, 12, 14)
and implement using NAND and NOR gates for POS and SOP expressions.
4. Design a combinational circuit with three inputs and one output, whose output is equal to
logic 1 when the decimal value of the input is less than 3?
5. What is half adder and full adder and draw its block diagram?
6. Design and explain a 4-bit binary parallel Adder.
7. Write the differences between multiplexer and demultiplexer?
8. What is DeMultiplexer? Explain 1:4 Demux with its truth table and gate level realisation.
9. Define flip-flop? What are the different types of flip-flops?
10. Realize a SR flip flop using NAND gates and explain its operation.
11. Draw the logic diagram of a JK flip flop and explain its operation with relevant truth tables.
12. Describe function of full Subtractor circuit with its truth table, K-map simplification, and logic
diagram
13. Design a full adder by using two half adders.
14. Explain about SISO and SIPO shift registers.
15. Draw the logic diagram of a 4-bit ring counter using D flip flop.