Dr.M.G.

REducational and Research Institute

BRE18005- DIGITAL ELECTRONICS

Set 1
Part-A
Answer any 10 Questions 10X 2 = 20 Marks

1. Define a Literal (L1, CO1)

2. Remember two absorption properties of Boolean algebra.(L2, CO1)
3. Express F=BC’+AC in SOP form.(L3, CO1)
4. Justify that NAND gate is a universal gate.(L3, CO2)
5. Discuss in short the Combinational Logic Circuit.(L2, CO2)
6. Draw the logic circuit of Half –adder mentioning clearly its inputs and outputs.(L3, CO2)
7. Discuss in brief the sequential Logic Circuit.(L2, CO3)
8. Give the excitation table for JK flip flop.(L3, CO3)
9. Define a Synchronous Counter.(L1, CO3)
10. Compare synchronous sequential circuit and asynchronous sequential circuit.(L3, CO4)
11. State Mealy’s model of Finite State Machine.(L1, CO4)
12. Elucidate State reduction techniques.(L1, CO4)
13. Mention the different types of TTL logic. (L1, CO5)
14. Differentiate source from sink current.(L2, CO5)
15. Describe Speed power product.(L2, CO5)

PART – B

Answer any Five questions 5 X 16 = 80 Marks

16. Implement the following Boolean Function using Karnaugh map technique:
F(w,x,y,z)=∑(0,1,2,4,5,6,8,9,12,13,14)(L5, CO1)
17. Design a 4 bit parallel adder employing full adder element and explain its operation with
the help of an example.(L5, CO2)
18. Realize SR flip flop using suitable logic gates and explain its operation with the help of a
truth table.(L5, CO3)
19. Design a sequential circuit for the state diagram shown in Fig 1.(L5, CO4)

9 3

7
0
2

Fig 1.
20. Explain with a suitable schematic how CMOS inverter is designed.(L3, CO5)
21. Simplify the following Boolean function by using Quine Mcklusky method:
F(A,B,C,D)=∑(0,2,3,6,7,8,10,12,13)(L4, CO1)
22. Realize F(A,B,C,D)=∑(0,1,3,4,8,9,15) using a suitable multiplexer circuit.(L4, CO2)
23. Design a counter that has the following sequence 0, 1, 3, 7, 6, 4, 0….(L5, CO4)
 Dr.M.G.REducational and Research Institute

BRE18005- DIGITAL ELECTRONICS

Set 2
Part-A
Answer any 10 Questions 10X 2 = 20 Marks

1. Tell the associative law of Boolean algebra.(L1, CO1)

2. State the principle of duality.(L1, CO1)
3. List the two basic types of Boolean expressions.(L2, CO1)
4. Justify that NOR gate is a Universal gate.(L3, CO2)
5. Identify the code used to label the row headings and column headings of K-Map.(L4,
CO2)
6. Draw the logic circuit of Half –subtractor mentioning clearly its inputs and outputs.(L4,
CO2)
7. Sketch the logic circuit of SR flip flop.(L3, CO3)
8. Define an asynchronous counter.(L1, CO3)
9. Express the principle of Shift registers.(L2, CO3)
10. Define Moore’s model of Finite State Machine.(L1, CO4)
11. Paraphrase a state with regard to designing sequential circuits.(L2, CO4)
12. Mention the basic building blocks of an Algorithmic State Machine Chart.(L2, CO4)
13. State the advantages of totem pole output.(L2, CO5)
14. Mention the important characteristics of digital IC’s.(L1, CO5)
15. Remember the principle of tristate capability(L1, CO5)

PART – B

Answer any Five questions 5 X 16 = 80 Marks

16. Implement the following Boolean functions using Karnaugh map technique:
 F(A,B,C,D)=∑(1,3,7,11,15)+∑d(0,2,4)(L4, CO1)
17. Implement 1:16 demultiplexer using 1:4 demultiplexers.(L4, CO2)
18. Realize D flip flop using suitable logic gates and explain its operation with the help of a
truth table.(L3, CO3)
19. Design divide by 6 counter using T-flip-flops.(L4, CO4)
20. Describe the various characteristics of Logic families with suitable examples.(L2, CO5)
21. Minimize the expression using Quine Mckluskey method:(L3, CO1)
Y=A’BC’D’+A’BC’D+ABC’D’+ABC’D+AB’C’D+A’B’CD’.
22. Realize a Gray to BCD Converter.(L4, CO2)
23. Design and explain the working of Johnson Counter.(L5, CO4)
 Dr.M.G.REducational and Research Institute

BRE18005- DIGITAL ELECTRONICS

Set 3
Part-A
Answer any 10 Questions 10X 2 = 20 Marks

1. List the two canonical forms for Boolean algebra.(L2, CO1)

2. Tell the number of inputs required for the Boolean ExpressionF=AB’D+ACD’+EF(L4,
CO1)
3. State the Associative law of Boolean algebra.(L2, CO1)
4. Draw the logic diagram for X=AB+B’C.(L4, CO2)
5. Perform excess 3 addition of (3) d+ (4) d.(L4, CO2)
6. Tell the principle of binary decoder.(L2, CO2)
7. Define a parallel in parallel out shift register. (L2, CO3)
8. Give the meaning of edge –triggering in flip flops.(L2, CO3)
9. Tell the importance of sequential switching circuits.(L1, CO3)
10. Write in brief about dynamic hazards.(L1, CO4)
11. Name the different techniques used in state assignment.(L1, CO4)
12. Define a primitive flow table.(L2, CO4)
13. Recollect the noise margin.(L1, CO5)
14. State fan-out.(L1, CO5)
15. For a certain IC family, propagation delay is 10ns with an average dissipation of
6mW.Calculate its speed power product.(L3, CO5)

PART – B

Answer any Five questions 5 X 16 = 80 Marks

16. Obtain the minimum SOP using K-map method :(L5, CO1)
F=m0+m1+m4+m8+m10+m11+m12+m13.

17. Design a 2 –bit comparator using gates.(L4, CO2)

18. Design a MOD-5 Synchronous counter using JK Flips & implement it.(L5, CO3)
19. Realize JK flip flop using suitable logic gates and explain its operation with the help of a
truth table.(L3, CO3)
20. Describe in detail, the different characteristics of CMOS logic family.(L2, CO5)
21. Determine prime implicants for the Boolean expression by using QuineMcklusky
method:(L5, CO1)
F(A,B,C,D)= ∑(1,3,6,7,8,9,10,12,14,15)+∑d(11,13).
22. Realize a BCD to Excess -3 Converter.(L4, CO2)
23. Design and explain the working of Ring Counter.(L5, CO4)
 Dr.M.G.REducational and Research Institute

BRE18005- DIGITAL ELECTRONICS

Set 4
Part-A
Answer any 10 Questions 10X 2 = 20 Marks

1. Tell the number of inputs required for the Boolean ExpressionF=AB’D+ACD’+EF. (L3,
CO1)
2. Simplify the following Boolean expression to minimum number of literals
(X+Y)(X+Y’).(L3, CO1)
3. Prove x+x’y equals x+y.(L3, CO1)
4. State the maximum number of outputs for a decoder with a 6 bit data word.(L3, CO2)
5. Implement a method to overcome the limitation on the speed of an adder.(L4, CO2)
6. Differentiate a demultiplexer from a decoder.(L3, CO2)
7. Give the characteristic equation of a JK flip flop.(L2, CO3)
8. List any two applications of programmable counter.(L2, CO3)
9. Mention the operations of T flip flop.(L1, CO3)
10. Define static hazard.(L1, CO4)
11. List the different techniques used in state assignment.(L2, CO4)
12. Classify the types of asynchronous circuits.(L2, CO4)
13. Defend the occurrence of propagation delay in logic circuits.(L3, CO5)
14. Name the types of ROM.(L1, CO5)
15. Define a PLD.(L1, CO5)

PART – B

Answer any Five questions 5 X 16 = 80 Marks

16. Implement the following Boolean functions using Karnaugh map technique:
F(A,B,C,D)=∑(0,2,4,8,9,10,11,12,13).(L4, CO1)

17. Implement the following Boolean function using 8:1 multiplexer

F(A,B,C,D)=∑(1,3,4,5,6,11,15).(L5, CO2)
18. Realize T flip flop using suitable logic gates and explain its operation with the help of a
truth table.(L3, CO3)
19. Draw and explain the operation of a 4 bit Serial in Serial out (SISO) shift register with a
timing diagram.(L2, CO4)
20. Explain the two different types of Random Access Memories.(L2, CO5)
21. Simplify the following function using Quine Mcclusky method:
F(A,B,C,D,E,F,G)=∑(20,28,52,60)(L3, CO1)
22. Realize a full adder circuit that employs 3X8 decoder, clearly mentioning its inputs and
outputs.(L4, CO2)
23. Design and explain the working of a 3 bit synchronous binary up counter.(L5, CO4)