Logic functions and Minimization

Consider the Boolean function z(a,b,c).

Which one of the following minterm lists represents the circuit given above ?

Let p and q be two propositions. Consider the following two formulae in propositional logic.

S1:  (¬p∧(p∨q))→q
S2:  q→(¬p∧(p∨q)) 

Which one of the following choices is correct?

Consider the following Boolean expression.

F=(X+Y+Z)(X'+Y)(Y'+Z) 

Which of the following Boolean expressions is/are equivalent to F' (complement of F)?

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

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

Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate?

The simplified SOP (Sum Of Product) form of the boolean expression (P + Q' + R') . (P + Q' + R) . (P + Q + R') is

The minterm expansion of f(P, Q, R) = PQ + QR' + PR' is

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?

In the Karnaugh map shown below, X denotes a don't care term. What is the minimal form of the function represented by the Karnaugh map?

A)   


B) 

C) 

D)