(a) Reduce the Boolean function F(P,Q,R,S) = (P+Q+R+S) •(P+Q+R+Sꞌ) •
(P+Q+Rꞌ+S)•(P+Qꞌ+R+S) • (P+Qꞌ+R+Sꞌ) • (P+Qꞌ+Rꞌ+S) • (P+Qꞌ+Rꞌ+Sꞌ)
•(Pꞌ+Q+R+S)• (Pꞌ+Q+R+Sꞌ) by using 4-variable Karnaugh map, showing the
various groups (i.e. octal, quads and pairs).
(b) Draw the logic gate diagram for the reduced expression. Assume that the
variables and their complements are available as inputs.
--------------------------------------------------------------------------------------------------------------------------------

Convert the following infix notation to prefix form.
(A–B)/C*(D+E)

Given below are two statements marked Assertion and Reason. Read the two
statements carefully and choose the correct option.
Assertion: Recursion utilises more memory as compared to iteration.
Reason: Time complexity of recursion is higher due to the overhead of
maintaining the function call stack.

Name the entity described above and state its principle.
----------------------------------------------------------------------------------------------------------------------------------

According to the Principle of duality, the Boolean equation
(Aꞌ + B) • (1 + B) = Aꞌ + B will be equivalent to:

The compliment of the Boolean expression Aꞌ • (B • Cꞌ + Bꞌ • C)

Study the given propositions and the statements marked Assertion and Reason that
follow it. Choose the correct option on the basis of your analysis.
p = I am a triangle
q = I am a three-sided polygon
s1 = p → q
s2 = q → p
Assertion: s2 is converse of s1
Reason: Three-sided polygon must be a triangle.