GATE 2017 CS (CS1) – Question 9
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?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (D) 14
Explanation
There are 4!=24 unrestricted assignments of four distinct shirts to four distinct people. Let A be the forbidden event that Arun gets red, and S the event that Shweta gets white.
Fixing either forbidden assignment leaves 3!=6 ways for the other shirts. Fixing both leaves 2!=2 ways, and these were subtracted twice. Inclusion–exclusion gives
$$24-6-6+2=14.$$
Thus **D**. Adding back the double-forbidden assignments once avoids over-subtraction.
More Quantitative Aptitude: Probability, Statistics and Combinatorics questions
- GATE 2017 EC Q9
- GATE 2025 ME Q5
- GATE 2025 ME Q10
- GATE 2025 AR — Architecture Q5
- GATE 2025 AR — Architecture Q10
- GATE 2025 AR — Planning Q5
All Quantitative Aptitude: Probability, Statistics and Combinatorics questions →