Subject Name: DIGITAL ELECTRONICS
Subject Code: TIU-ES-UEC-T21104
1. Design a full subtractor circuit using 8x1 multiplexer.
2. Describe the operation of half subtractor circuit.
3. Describe the operation of 3 bit binary to gray and gray to binary converter with truth table.
4. Design and explain a MOD-6 synchronous counter.
5. Design and explain a MOD-5 asynchronous counter.
6. Design and explain Jonson counter.
7. Explain the operation of T- flip flop with the help of truth table and excitation table.
8. Design a 3 bit parity generator and checker circuit.
9. Prove that NAND & NOR gate are universal gate.
10. Write down the comparison between synchronous and asynchronous counter.
11. Implement a 8x1 multiplexer with the help of 2x1 multiplexers.
12. Explain the operation of 4 x 10 decoder with the help of truth table.
13. Explain the operation of a clocked J-K Flip flop along with its excitation table.
14. Showing the steps, realization a J-K Flip flop using S-R Flip flop
15. Explain the operation of a 4 x 2 priority encoder with the help of truth table.
16. What do you mean by a shift register?
17. Explain the operation of serial in parallel out shift register with the help of suitable example.
18. Showing the steps, realization a S-R Flip flop using T Flip flop.
19. Showing the steps, realization a J-K flip flop using D-flip flop.
20. Simplify the Boolean expression and implement the simplified logic expression using universal
gates - Y= Π M (0,1,3,5,6,7,10,14,15).
21. Design a Full adder using universal gates.
22. Draw and explain the operation of master slave J-K Flip flop?
23. What are various types of random access memories?
24. What are the difference between decoder and encoder?
25. Design an Ex-NOR gate using NAND gates.
26. Write down the differences between demultiplexer and decoder?
27. Define priority encoder with example.
28. What are the difference between latch and flip flop?
29. Find the binary equivalent of BCD number 10010010.
30. Convert a binary number (1110101.1010)2 to Excess-3 number
31. Convert a hexadecimal number (381B.D6)16 into equivalent octal number.
32. Obtain the minimal sum of products expression for the following function and implement the
same using universal gates - F(A,B,C,D) = ∑m (1,3,4,6,8,9,11,15) +∑d (0,2,13,14)
33. A truth table in POS form is given by - F (A,B,C,D) = ΠM (0,2,6,11,13,14,15) + Πd (1,9,10)
34. Implement a full subtractor circuit using NAND gates.
35. Explain the operation of parallel in serial out shift register with the help of suitable example.
36. Explain the operation of Ring counter with the help of truth table
37. Design a synchronous counter with the following sequences : 5 → 3 → 2 → 6 → 5
38. Explain the operation of a S-R latch along with its truth table.
39. Write the basic differences between combinational logic circuit and sequential logic circuit.
40. Design an Ex-OR gate using NOR gates.
41. What is canonical/standard SOP?
42. Convert the Boolean expression - F(A,B,C) = AB + BC + AC' into canonical/standard SOP
form.
43. What are various types of ROMs?
44. What is the difference between level triggered and edge triggered flip- flop?
45. Explain the functioning of a positive edge triggered S-R flip-flop with truth table and excitation
table.
46. The content of a 4 bit serial in serial out shift register is initially 1110. Input serial data is 1010.
Register is shifted 4 times right with serial input. What is the content of the register after each
shift?
47. Design a 3 bit magnitude comparator.
48. Explain the operation of 3x8 decoder with the help of truth table.
49. Write down about RAM in computer memory.
50. What are the minterms and maxterms in the Boolean function given by F (A,B,C) = П(1,4,5,6).
51. What are the minterms and maxterms in the Boolean function given F(A,B,C) = (�′ + � + �).
(� + � + �′).(�′+ �′ + �).
52. What is gray code? Convert a binary number 11001 to the Gray code.
53. What is ripple counter?
54. Simplify the following Boolean expression with Boolean rules and laws.
a. F(A,B,C)=AB’C+A’BC+A’B’C
b. F(A,B,C,D)=A’B’C+(A+B+C’)’+A’B’C’D
c. F(A,B,C,D)=ABCD+AB(CD)’+(AB)’CD
d. F(A,B,C,D)=�′�′�+(���)′+�′�′�′�
e. F(A,B,C)= (A+B+C). (A+B′+C′).(A+B+C′).(A+B′+C)
55. Simplify the Boolean expression Y=∑m(0,1,2,3,4,5,6,7,11,13,14)
56. Simplify the Boolean expression Y=∑m(0,1,2,3,4,7,8,9,10,11,12,14)
57. Simplify the Boolean expression Y= ΠM(0,1,2,3,8,9,10,11,12,13)
58. Prove that AB+(��)′+A�′C(AB+C)=1 using boolean laws.
59. Prove that A (�̅ +C)(�̅B+C)(�̅ BC + �̅ ) = 0 using boolean laws.
60. A truth table in SOP form is given by F (A,B,C,D) =∑m (4,5,6,7,8,9). Simplify and design the
circuit using universal gates.
61. What do you mean by Mod-N counter?
62. With necessary diagrams, explain the operation of a 3-bit ring counter.
63. Design and explain MOD-8 synchronous counter
