Professional Documents
Culture Documents
Digital Electronics Questions
Digital Electronics Questions
5. Realize the following switching function using a multilevel gate network. Also, obtain
the logically equivalent multilevel NAND-NAND gate circuit
Y=A + (B+C') . (D'E+F)
6. Find the minimal Sum of Product for the Boolean Expression
Y=∑(1,2,3,7,8,9,10,11,14,15) using Quine MC cluskey method.
7. Using tabulation method to simplify the Boolean function
F(A,B,C,D)=∑(1,2,3,5,9,12,14,15) which has the don’t care conditions d(4,8,11)
8. Simplify ABC+A'BC+AB'C+ABC'+AB'C'+A'BC'+A'B'C'
9. Using K map method, obtain the minimal Sum of Product Expression
Y=∑m(0,2,4,5,6,7,8,10,11,12,14,15)
10. Using K map method, obtain the minimal Product of Sum Expression
Y=∏M(0,2,3,5,7,8,10,11,14,15)
Implement Boolean expression for EXOR gate using NAND and NOR gates.
11. Realize the following function using K-map and implement with NAND gates
Y = ∑m(0,1,2,5,6,7,8,9,10,14)
12. Simplify the expression F(A,B,C,D)=∑m(0,2,3,5,7,8,10,11,15)+ ∑d(1,4,9) using Quine
Mc-Cluskey method.
13. What is the advantage of using Tabulation method? Determine the prime implicants of
the following function using Tabulation method F(A,B,C,D)=∑(1,4,6,7,8,9,10,11,15)
UNIT II:
1. Design half adder and Full adder circuits with necessary diagram.
2. Implement the Boolean function using 8:1 Multiplexer.
F(W, X, Y, Z)= ∑m (0,2,6,10,11,12,13)+∑d(3,8,14)
3. Write short notes on 4 bit ripple carry adder with neat sketch.
4. Explain the operation and need of Priority Encoder.
5. Design a 4 bit Magnitude Comparator to compare two 4 bit numbers.
6. Design a 4 bit BCD adder using full adder and explain its structure and compute the
circuit to add 1001 and 0101. Write the sum and carry output of the given binary
number.
7. With neat circuit diagram, explain the working principle of octal to binary encoder
8. Analyse the combinational circuit shown in figure below to determine the truth table
and the Boolean expressions governing the outputs of the circuit.