Boolean Algebra


Q31.

Let # be a binary operator defined as X#Y=X'+Y' where X and Y are Boolean variables. Consider the following two statements. (S1) (P # Q) # R = P # (Q # R) (S2) Q # R = R # Q Which of the following is/are true for the Boolean variables P, Q and R?
GateOverflow

Q32.

Which of the following is not valid Boolean algebra rule ?
GateOverflow

Q33.

The total number of prime implicants of the function f(w,x,y,z)=\Sigma(0,2,4,5,6,10) is _______.
GateOverflow

Q34.

Consider the logic circuit given below:Q=__________?
GateOverflow

Q35.

The output of a tristate buffer when the enable input in 0 is
GateOverflow

Q36.

Consider the following minterm expression for F. F(P,Q,R,S) = \Sigma 0, 2, 5, 7, 8, 10, 13, 15 The minterms 2, 7, 8 and 13 are 'do not care terms. The minimal sum of-products form for F is
GateOverflow

Q37.

Consider the following Boolean Algebra for F: F(P,Q,R,S)=PQ+\bar{P}QR+\bar{P}Q\bar{R}S The minimal sum-of products form of F is
GateOverflow

Q38.

Which one of the following expressions does NOT represent exclusive NOR of x and y?
GateOverflow

Q39.

The output expression of the following gate network is
GateOverflow

Q40.

The most simplified form of the Boolean function x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15) (expressed in sum of minterms) is?
GateOverflow