csl203

The minimum number of 2-input NAND gates required to implement a 2-input XOR gate is

• 4

• 5

• 6

• 7

The Boolean expression in fig simplifies to

• X

• Y

• XY

• X+Y

Consider the 2-bit multiplexer (MUX) shown in the figure. For OUTPUT to be the XOR of C and D, the values for A₀, A₁, A₂ and A₃ are ___________.

• A₀ = 0, A₁ = 0, A₂ = 1, A₃ = 1

• A₀ = 1, A₁ = 0, A₂ = 1, A₃ = 0

• A₀ = 0, A₁ = 1, A₂ = 1, A₃ = 0

• A₀ = 1, A₁ = 1, A₂ = 0, A₃ = 0

Which of the following gives the correct number of multiplexers required to build a 32 x 1 multiplexer?

• Two 16 x 1 mux

• Three 8 x 1 mux

• Two 8 x 1 mux

• Three 16 x 1 mux

What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don’t care term.

• b'd'

• b'd'+b'c'

• b'd' + a'b'c'd'

• b'd' + b'c' + c'd'

Sum of two octal numbers “71” and “36” =

• 123

• 127

• 213

• 345

Which of the following is the Excess-3 code form of decimal (215)?

• (0101 0100 1000)
• (1101 1100 1010)
• (0101 0101 1001)
• (0111 0110 1100)

What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates?

• 2

• 3

• 4

• 5

The boolean expression AB + AB'+ A'C + AC is independent of the boolean variable

• A

• B

• C

• NONE OF THESE

There are _____________ Minterms for 3 variables (a, b, c)

• 4
• 2.0
• 8.0
• 1.0