Assignment 2
Assignment 2
Essay Questions
(a) Simplify the following using K-map and implement the same using NAND
gates Y(A,B,C)=∑(0,2,4,5,6,7).
1
(b) Obtain the simplified expression in SOP form of:
F(a,b,c,d,e)=(1,2,4,7,12,14,15,24,27,29,30,31) using k-map.
(a) Reduce the following expression to the simplest possible POS and SOP
forms. F=∑m(6,8,13,18,19,25,27,29,31)+d(2,3,11,15,17,24,28).
2 (b) State and prove consensus theorem? Solve the given expression using
consensus theorem.
i. AB+AC+BC+BC+AB ii. (A+B)(A+C)(B+C)(A+D)(B+D).
3 Realize a 5-to-32 line decoder using one 2-to-4 and four 3-to-8 decoders.
7 (a) Implement the full adder with two half adders and an OR gate.
(b) Design the 4-bit ripple carry adder.
8 (a) With the help of logic diagram and a truth table, explain a 3-line to 8-line
decoder.
(b) Design and briefly explain the operation of a carry look ahead adder.
9 Design 32:1 multiplexer using two 16:1 Multiplexers and one 2:1 Multiplexer.
10 (a) Design a 4-bit adder-subtractor circuit and explain the operation in detail.
(b) Explain the functionality of a decoder with its logic diagram.
(a) Design a full subtractor circuit using 8X1 multiplexer.
11 (b) Design a 4 input digital circuit whose output is equal to 1 if any of the two
inputs are ‘1’. The output is ‘0’ otherwise. Using a truth table find the
Boolean function and implement with basic gates.
(a) Realize a 3 to 8 priority encoder using universal gates.
12 (b) Design a 2-bit binary multiplier with the help of an example and realize it
using basic gates.