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:
(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).
| INPUTS | |
| C | Belongs to the Panda Clan |
| T | Trained for more than 5 years |
| P | Possesses Secret Chi Power |
| R | Recommended by the Grand Master |
Answer
Answer
AIWritten by AI (antigravity) - it can contain mistakes.
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:
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
| C | T | P | R | X |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
From ISC 2026 Computer Science Paper 1, question 4(i).