Draw the logic circuit to decode the following binary number (0001, 0101, 0111,
1000, 1010, 1100, 1110,1111) to its hexadecimal equivalents. Also state the
Hexadecimal equivalents of the given binary numbers.

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.