(y/n) All boolean circuits can be implemented using only AOI (AND, OR, INV) gates.

(y/n) All boolean circuits can be implemented using NAND gates only.

(y/n) Two boolean functions are equivalent if their truth tables are identical.

(y/n) A boolean function can be defined by either truth tables or by boolean equation.

The truth table for Boolean function F (X,Y,Z) = XY + X'Z has ___C___ rows and ___D___ columns for inputs and output.

___C___ =

___D___ =

2.

Match the boolean expressions

Group of answer choices

X + XY

[ Choose ] XY X' Y X + Y X'Y' Y' X

XY+XY

[ Choose ] XY X' Y X + Y X'Y' Y' X

X+XY

[ Choose ] XY X' Y X + Y X'Y' Y' X

X(X+Y)

[ Choose ] XY X' Y X + Y X'Y' Y' X

(X+Y)(X+Y')

[ Choose ] XY X' Y X + Y X'Y' Y' X

X(X'+Y)

[ Choose ] XY X' Y X + Y X'Y' Y' X