PGDVLSI CDAC Noida class Quiz 1

Simplify the following Boolean expression a’bc + abc’+ abc + a’bc’

• 0

• 1

• a

• b

What is the minterm equivalent of a’+b’?

Consider the folloiwng circuit. The output can be expressed as

• A'B'E + EF + (CD)'F

• (E' + ABF')(C+D+F')

• (AB' + E)(C+D+F')

• (A+B)E' + DEF'

What is the boolean expression for the output f of the combinational logic circuit of NOR gates given

below?

• (Q+R)'

• (P+Q)'

• (P+R)'

• (P+Q+R)'

If A=1, B=1, what will be the values of Y and Z?

• Y=0, Z=0

• Y=0, Z=1

• Y = 1, Z =0

• Y = 1, Z= 1

With C = 0 the following circuit behaves as

• AND Gate

• OR Gate

• NOR Gate

• EXOR Gate

Identify the output (Y) of the following circuit

• Y = F(A,B,C) = Σ(1,2,3,5)

• Y = F(A,B,C) = Σ(1,2,4,5)

• Y = F(A,B,C) = Σ(1,,3,5,6)

• Y = F(A,B,C) = Σ(1,2,4,7)

Which of the following statements about the K-map is incorrect?

• In K Map don’t care terms are used only if they help in reducing the expression. Otherwise, they

  need not be considered.

• The five variable map may contain 2 squares, 4 squares, 8 squares or other combination

  involving four blocks

• The binary designations of the rows and columns of the K-map are in gray code

• A two variable K-map expression can have four possible combinations of the input variables

The number of min-terms after minimizing the following Boolean expression is ____________.

• 1

• 2

• 3

• 4

The reduced circuit of the following original circuit is

• 
• 
• 
•