You are on page 1of 2

DEC (EC-2011) TEST NO.

-1

1. If XY = 0, then the value of X⊕Y [X xor Y] is equal to


A). (X+Y), B). (X* + Y*), C). XY D). X*Y*

2. To implement Y =ABCD using only 2 input NAND gates, minimum number of gate
is: A) 3, B) 4, C) 5, D) 6

3. The output of a logic gate is ‘1’ when all it’s a inputs are at logic ‘0’. The gate is
either- A) a NANAD or EX-OR gate B) a NOR or an EX-NOR gate , C) an
OR or an EX-NOR gate D) an AND or an EX-OR gate

4. The minimum number of 2-input NAND gates required to implement the Boolean
function 𝑍 = 𝐴𝐵̅𝐶, [means AB’C] assuming that A, B and C are available is
(a) Two (b) Three (c) Five (d) Six

5. If the input to the digital circuit (in the figure) consisting of cascaded 20 XOR gates is
X, then what will be the expression of the output Y?

6. Design an XOR gate using minimum number of NAND gates and design a X-NOR
gate using minimum number of NOR gates.

7. Define Consensus Theorem and prove it.

8. What is the concept of Duality in Boolean algebra?


Sate and prove De-Morgan’s Theorem.

9. For the output F to be 1 is the logic circuit shown what should be the input
combination?

10. (a). Convert into Binary form: 197.56


(b). Convert into Decimal form: 10110111.0101

You might also like