The simplification of the Boolean expression F(x,y) =(X’ .Y’)’ .(X+Y)’

• 0

• 1

• X

• X.Y

The minimum number of NAND gates required to realize AB+AB’C+AB’C’   is:

• 3

• 2

• 1

• 4

Consider the following statements about analog signal.

Analog signal :

            i.      Is in continuous wave form

  ii.      Easily to create

                            iii.      Contains a finite number of points

• a.       All are true

• (i) and (iii) are true

• (i) and (ii) are true

• Only (ii) is true.

The function by the network above is:

• 
• 
• 
• 

………. Truth table entries are necessary for a four input circuit.

• 4

• 8

• 12

• 16

In Boolean algebra, the OR operation is performed by which properties?

• Associative properties

•    Commutative properties

• Distributive properties

• All of the Mentioned

The corresponding min term when x=0, y=0 and z=1.  

• x.y.z’

• X’+Y’+Z

• X+Y+Z’

• x’.y’.z

The terms in SOP are called ___________.

• Max Terms

• Min Terms

• Mid Terms

• Sum Terms

What is the final expression when convert this to SSOP?

X=AB+AC’D

•     ABCD+ABCD’+ABC’D+ABC’D’+AC’D’B+AC’DB’

•     AB’CD+ABCD’+ABC’D+ABC’D’+AC’DB+AC’DB’

•       ABCD+ABCD’+ABC’D+ABC’D’+AC’DB+AC’D’B’

•       ABCD+ABCD’+ABC’D+ABC’D’+AC’DB+AC’DB’

• 0

• 1

• A

• A.B.C