Ids QB Ete
Ids QB Ete
Ids QB Ete
Question – (8): What are Universal Gates? Interpret your answer through some examples. CO1
(BTL 2)
Question – (9):
(a) Differentiate Signed Binary number and Unsigned Binary number? CO1
(BTL 2)
(b) Represent +127 and -127 using 8-bit 1’s compliment form CO1 (BTL 2)
Question – (10): Solve the following using Binary Arithmetic operations: CO2 (BTL 3)
(a) Addition: (b) Subtraction:
0 1 1 1 1 1 0
+ 1 0 1 - 1 0 0 1
------------------------------- ---------------------------------
------------------------------- ---------------------------------
Question – (11): Write the symbol, truth table, Boolean expression for following logic gates: CO1
(BTL 2)
(i) NAND Gate (ii) XOR Gate
Question – (12): State De-Morgan’s law of Boolean algebra and Justify them using truth
table. CO1 (BTL 2)
Question – (13): Simplify the following Boolean expressions using Boolean Laws: CO2 (BTL 3)
(i) (X + Y).(X’ + Y)
(ii) (A + B).(A + C)
Question – (14): Prove the following: CO2 (BTL 3)
(i) A + A’B +AB =A + B
(ii) AB + ABC + AB’ = A
Question – (15): Prove the following identities using Boolean laws: CO2 (BTL 3)
(i) A+A.B=A
(ii) (A + B) . (A + C) = A + B . C
Question – (16): Simplify the following Boolean expressions and design circuit using logic gates:
CO2 (BTL 3)
(i) Y = [(A . B)’ + (A . C)’]’
(ii) Y = [(A + B)’ . (A + C)’]’
Question – (17): Sketch the equivalent circuit of OR, NOR & NOT logics using NAND gate. CO2
(BTL 3)
Question – (18): Sketch the equivalent circuit of NAND, AND & NOT logics using NOR gate. CO2
(BTL 3)
Question – (19): Subtract (5)10 from (9)10, Using 2’s complement method. (BTL 2) CO1
Question – (20): Subtract (9)10 from (4)10, Using 2’s complement method. (BTL 2) CO1
Question – (21): Convert the binary number 1010 1111 1011 0010 into the equivalent hex number.
(BTL 2) CO1
Question – (22): Perform (1010)2 - (101)2 Using 2’s complement method. (BTL 3) CO2
Question – (23): Obtain the 1’s & 2’s complement of the following numbers: (1010)2 &
(10110010)2. (BTL 3) CO2
Question – (24): With neat sketch, realize the expression Y = AB + CD by NAND gates only. (BTL
3) CO2
Question – (25): Y = ABC + BC’D + A’BC
(i) Simplify this equation and realize using basic gates. (BTL 3) CO2
(ii) Realize the simplified equation using only NOR gates. (BTL 2) CO2
Question – (26): Write the smallest TWO digit number in the following number systems (BTL
2) CO1
a. Binary
b. Octal
c. Hexadecimal
Question – (27): Identify the operation performed by the following gates (BTL 2) CO1
(a) (b)
Question – (28): Realize AND logic, using NOR gates only. (BTL 3). CO2
Question – (29): Calculate (a) 1-bit (b) 2-bit (c) 3-bit Gray codes and tabulate along with their
equivalent decimal numbers. (BTL 3) (CO2).
Question – (30): Represent the decimal number 27 in binary using (i) Binary code (ii) BCD
code (iii) Excess-3 Code (iv) Gray Code. (BTL 3) (CO2)
Question – (31): Represent the decimal number 396 and 4096 in binary using (i) Binary code
(ii) BCD code (iii) Excess-3 Code (iv) Gray Code. (BTL 3) CO2
Question – (32): Convert AB+AC’+BC into standard SOP form. (BTL 3) CO2
Question – (33): Convert (A+B).(A+C).(B+C’) into standard POS form. (BTL 3) CO2
Question – (34): Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) =
∑4(0,1,2,3,5,7,8,9,11,14). (BTL 3) CO2
Question – (35): Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) =
¶M (4,6,10,12,13,15). (BTL 3) CO2
Question – (36): Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) =
ABC < D + A< BCD + A< B < C < + A< B < D< + AC < + AB < C + B′. (BTL 3) CO2
Question – (37): Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) =
(𝐴 + 𝐵 + 𝐶 < + 𝐷< ). (𝐴< + 𝐶 + 𝐷< ). (𝐴< + 𝐵 + 𝐶 < + 𝐷< ). (𝐵< + 𝐶). (𝐵< + 𝐶 < ). (𝐴 + 𝐵< )(𝐵< +
𝐷< ). (BTL 3) CO2
Question – (40): (a) Make a K-map for the function f= AB+AC’+C+AD+AB’C+ABC. (b)
Express ‘f’ in standard SOP form. (BTL 3) CO2
Question – (41): Design a full adder using two half adders. (BTL 4) CO3
Question – (42): Design a BCD to Excess-3 code converter using minimum number of NAND
gates and justify In what way is a BCD adder different from a binary adder? (BTL 4) CO3
Question – (43): Given the logic equation f= ABC+ BC’D+ A’BC. (a) Make a truth table. (b)
Simplify using K-map. (c) Realize the function using NAND gates only. (BTL 3) CO2
Question – (44): Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) =
¶M (1,4,6,9,10,11,14,15) and realize it using NOR gates only. (BTL 3) CO2
Question – (45): Design a 4:1 multiplexer using NAND gates only. (BTL 4) CO3
Question – (46): Draw and explain the circuit diagram of BCD adder. (BTL 2) CO1
Question – (47): Explain a full subtractor circuit and find out its outputs. Show how it can be
realized using two half subtractors. (BTL 2) CO3
Question – (48): What are encoders and why are they used? Draw and explain a decimal to
BCD encoder. (BTL 2) CO1
Question – (49): Implement 8:1 multiplexer with the help of its truth table and Boolean
expression. (BTL 4) CO3
Question – (50): Implement 3:8 Decoder with the help of its truth table and Boolean expression.
(BTL 4) CO3
Question – (51): Implement 8:3 Encoder with the help of its truth table and Boolean expression.
(BTL 4) CO3
Question – (52): Design a combinational circuit that converts a 4-bit Gray Code number to 4-
bit straight binary number. (BTL 4) CO3
Question – (53): What is the difference between encoder and decoder? Outline their limitations.
(BTL 2) CO1
Question – (54): Differentiate between combinational circuit and sequential circuit. (BTL 2)
CO1
Question – (55): Discuss the operation of SR latch using NAND & NOR gate with help of
circuit diagram & truth table.
Question – (56): Explain the working of SR flip-flop with help of circuit diagram & truth table.
Question – (57): Explain the working of JK flip-flop with help of circuit diagram & truth table.
Question – (60): List down the different types of flip flop. (BTL 2) CO1
Question – (61): What do you mean by edge triggered flipflop? (BTL 2) CO1
Question – (62): What do you mean by level triggered flipflop? (BTL 2) CO1
Question – (63): Give a logic implementation of positive edge triggered edge detector circuit?
(BTL 3) CO2