Question

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
• The candidate possesses the Secret Chi Power but does not belong to the Panda
• The Panda candidate is recommended by the Grand Master, but neither belongs to the Clan nor has been trained for more than 5 years

The inputs are:

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

(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 for X(C, T, P, R).

Answer 1

To determine eligibility, the Boolean output X(C, T, P, R) is expressed as X = CT + PC′ + RC′T′. This Sum-of-Products formula directly maps to the three legal conditions provided. By evaluating all sixteen binary combinations, the function yields an output of one for minterms 1, 2, 3, 6, 7, 12, 13, 14, and 15, confirming nine eligible scenarios.