Question
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 _______.
Official answer and solution
- Official answer
- 12
- From
- Official GATE 2020 answer key
Solution
Count valid derangements by placing the two indistinguishable L's first, then arranging the remaining letters.
Word: LILAC (letters: ).
Original positions:
- Position 1: L
- Position 2: I
- Position 3: L
- Position 4: A
- Position 5: C
Placement condition: No letter may appear in its original position.
- The two L's cannot be at positions 1 or 3.
- Therefore, the two L's must be placed in positions chosen from .
- Number of ways to choose positions for the two L's is .
Analyze the three cases for remaining letters :
- L's at positions 2 and 4:
- Remaining positions: .
- Forbidden positions for remaining letters: C cannot be at 5 (its original position). I and A have no forbidden positions in .
- Total permutations of 3 letters = . Permutations with C at position 5 = .
- Valid arrangements = .
- L's at positions 2 and 5:
- Remaining positions: .
- Forbidden position: A cannot be at position 4.
- Valid arrangements = .
- L's at positions 4 and 5:
- Remaining positions: .
- Forbidden position: I cannot be at position 2.
- Valid arrangements = .
Total number of valid permutations:
12
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2020 Computer Science and Information Technology (CS)
- Question
- 52 of 65, printed as CS Q.42
- Section
- Computer Science and Information Technology
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.