Beruflich Dokumente
Kultur Dokumente
2015-16
23. Design full adder using two half adders.
24. Differentiate between encoders and decoders.
25. Design a 4-bit by 4-bit binary multiplier.
26. Using a decoder and external gates, design the combinational circuit defined by the following three Boolean
function:
i. F1 = (y’+x)z
ii. F2 = y’z’+yz’
iii. F3 = (x’+y)z
27. Construct 4 to 16 line decoder using five 2 to 4 line decoders with enable.
28. Implement a 2-bit magnitude comparator.
29. Define an encoder. Also describe a 3x8 Priority encoder.
30. Explain Carry Look-Ahead Generator. Also draw the logic diagram of a BCD Adder.
31. What is a multiplexer? Implement the given function with:
i. 8:1 Mux
ii. 4:1 Mux
iii. 2:1 Mux
F (A, B, C, D) = ∑ m (0, 1, 2, 3, 7, 8, 9, 11, 14, 15)
32. Design Half Adder using Multiplexer.
33. Design a 4-bit magnitude comparator using one bit comparator modules.
34. Using a decoder and external gates, design the combinational circuit defined by the following three Boolean
function:
i. F1 = x’yz’+ xz
ii. F2 = xy’z’+ x’y
iii. F3 = x’y’z’+ xy
2014-15
35. Draw suitable diagram of full adder.
36. Draw and explain the logic of 4 bit magnitude comparator.
37. Design 16:1 multiplexers using 4:1 multiplexers.
38. Explain Priority Encoder.
2013-14
59. Design a combinational circuit that converts 3-bit Gray code to 3-bit binary number. Implement the
circuit with (i) Exclusive OR gates (ii) NAND gates only.
60. Design a logic circuit diagram of a 2 to 4 line decoder with an enable input using NOR gates only
61. Design a combinational circuit that compare two 2-bit numbers A & B to check if they are equal.
Implement the design using NAND gates only or NOR gates only.
62. Design the following Boolean function using 8:1 Multiplexer
F (A, B, C, D) = ∑ m (0, 3, 5, 6, 8, 9, 14, 15)
64. Design a combinational circuit with 4 input variables which will produce logic 1 output when the
number of 1’s in the input is even.
65. Design full adder using NAND gates only.
66. Design binary to BCD converter.
67. Design the following Boolean function using 8:1 Multiplexer
F (A, B, C, D) = ∑ m (0, 1, 2, 5, 7, 8, 9, 14, 15)
2012-13
68. Design a 2-bit binary magnitude comparator.
69. Design a combinational circuit that converts 3-bit Gray code to 3-bit binary number. Implement the
circuit with (i) Exclusive OR gates (ii) NAND gates only.
70. Implement the given Boolean function using A, B and C variables to the selection lines:
F (A, B, C, D) = ∑ m (0, 1, 3, 4, 8, 9, 15)
71. Realize the expression of F using 8:1 multiplexer
F(x, y, z) = ∑ m (1, 2, 4, 5, 7)
72. Design a BCD to Excess-3 code converter.
73. Construct 4 input priority encoder using combinational gates.
74. Design a 4-bit magnitude comparator using combinational gates.
2011-12
78. Construct a BCD to Excess-3 code converter using 4-bit adder. What must be done to change the
circuit to an Excess-3 to BCD code converter?
79. What is magnitude comparator? Design a 3-bit magnitude comparator using logic gates.
80. Design a full subtractor circuit with a decoder and 2 OR gates.
81. Implement the given Boolean function with 4:1 multiplexer using A and B variables to the selection
lines:
F (A, B, C) = A’B’C + A’BC’ + A(BC)’ + ABC