Prashnikaप्रश्निका
Code
About
‹ Back to the paper

Question 4(i)

5 marks

Computer ScienceISC 2026 Computer Science Paper 1Long answerBoolean Algebra

Answer the following using a truth table.

According to the ancient laws of the Valley of Peace, a candidate can become the Dragon Warrior…

According to the ancient laws of the Valley of Peace, a candidate can become the Dragon Warrior only if they satisfy any one of the following conditions: • The candidate belongs to the Panda Clan and has been trained for more than 5 years under the Grand Master OR • The candidate possesses the Secret Chi Power but does not belong to the Panda Clan OR • The candidate is recommended by the Grand Master, but neither belongs to the Panda Clan nor has been trained for more than 5 years The inputs are:
INPUTS
CBelongs to the Panda Clan
TTrained for more than 5 years
PPossesses Secret Chi Power
RRecommended by the Grand Master
(In all the above cases, 1 indicates YES and 0 indicates NO) Output: X - Denotes eligibility to become the Dragon Warrior (1 = eligible and 0 = not eligible) Draw the truth table for the inputs and outputs given above. Write the SOP expression for X(C, T, P, R).
Open in the Boolean algebra solver

Answer

Answer

Condition 1: C • T Condition 2: C' • P Condition 3: C' • T' • R Eligibility function: X = C • T + C' • P + C' • T' • R Truth Table:
CTPRX
00000
00011
00101
00111
01000
01010
01101
01111
10000
10010
10100
10110
11001
11011
11101
11111
SOP Expression for X(C, T, P, R): In minterm notation: X(C, T, P, R) = Σ(1, 2, 3, 6, 7, 12, 13, 14, 15) Canonical SOP expression: X(C, T, P, R) = C'T'P'R + C'T'PR' + C'T'PR + C'TPR' + C'TPR + CTP'R' + CTP'R + CTPR' + CTPR