IAE Academy

GATE 2020 CS Q.42: solution and answer

GATE 2020 · CSQ.42 · 2 marks · NAT

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ______.

See the question in the paper

Answer and solution

ANSWER

The number of such permutations is 12.

Official answer: 12Source: Official answer key, GATE 2020 CS (IIT Delhi)

  1. In LILAC the characters sit at positions as . So is originally at positions and , at , at and at . The two 's are identical, so the condition on them is that neither may sit in position or .

  2. Hence the two 's must occupy two of the positions . There are choices. The remaining three positions are filled by in some order, and each of these three letters keeps its own restriction.

  3. Case at : the free positions are . Positions and (the original places of and ) are occupied, so and are unrestricted. Only must avoid position . Count: .

  4. Case at : the free positions are . Position is occupied, so is unrestricted. Position is occupied, so is unrestricted. Only must avoid position . Count: .

  5. Case at : the free positions are . and are unrestricted. Only must avoid position . Count: .

  6. The three cases are disjoint, because they place the 's differently. Total .

KEY IDEA

Identical letters share a single forbidden set. Both 's must avoid positions and , so they must occupy two of the remaining three positions. Then count the arrangements of the other letters case by case, using complement counting for the one restricted letter in each case.

WATCH OUT FOR

Treating the two 's as distinct and then dividing by (or applying the derangement count for distinct objects) gives the wrong number. Another slip is forgetting that and lose their restriction when their original positions are taken by 's.

From the GATE 2020 CS paper. Every question of this paper · Download the full paper · All 6 Counting questions, with notes

More Counting questions