Question
Arun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shweta dislikes the colour white. Gulab and Neel like all the colours. In how many different ways can they choose the shirts so that no one has a shirt with a colour he or she dislikes?
Official answer and solution
- Official answer
- D
- From
- Official GATE 2017 answer key
Solution
Use the Principle of Inclusion-Exclusion over bijective assignments of 4 shirts to 4 people.
There are 4 people: Arun (A), Gulab (G), Neel (N), and Shweta (S).
There are 4 shirts: Red (R), Pink (P), Blue (B), and White (W).
The total number of bijective assignments of the 4 distinct shirts to the 4 distinct people without any restriction is:
Identify the disallowed conditions:
- Condition : Arun gets the Red shirt.
- Condition : Shweta gets the White shirt.
We seek the number of assignments satisfying neither condition: .
By the Principle of Inclusion-Exclusion:
-
Number of assignments where Arun gets Red ():
Arun's shirt is fixed as Red. The remaining 3 shirts are distributed among Gulab, Neel, and Shweta in ways. -
Number of assignments where Shweta gets White ():
Shweta's shirt is fixed as White. The remaining 3 shirts are distributed among Arun, Gulab, and Neel in ways. -
Number of assignments where both occur ():
Arun gets Red and Shweta gets White. The remaining 2 shirts (Pink, Blue) are distributed between Gulab and Neel in ways.
Substituting these values:
Therefore, there are 14 different ways to choose the shirts.
D
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2017 Computer Science and Information Technology (CS) Session 1
- Question
- 64 of 65, printed as GA Q.64
- Section
- General Aptitude
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.