EdiShorts

UPSC Prelims 2020 CSAT Q67 · Numeracy

Year2020
PaperCSAT
QuestionQ67
SubjectNumeracy

How many different 5-letter words (with or without meaning) can be constructed using all the letters of the word 'DELHI' so that each word has to start with D and end with I?

  1. a24
  2. b18
  3. c12
  4. d6
Show answer & explanationHide answer
Correct answer(d) 6

Fixing the first position with D and the last position with I leaves 3 middle positions to be filled by the remaining 3 unique letters (E, L, H), which can be arranged in 3! = 6 ways.

Statement-by-statement analysis

✗ Option (a)
  • Calculates 4! = 24.
  • This represents the number of arrangements if only 1 letter was fixed instead of both D and I.
✗ Option (b)
  • Calculates 18, which is an incorrect value.
  • Results from erroneous arithmetic combinations such as 3 multiplied by 6.
✗ Option (c)
  • Calculates 12.
  • Results from incorrectly multiplying 3! by 2 or misapplying permutation rules.
✓ Option (d)
  • Fixes D at position 1 and I at position 5, leaving positions 2, 3, and 4 free.
  • The remaining 3 distinct letters (E, L, H) can be arranged in 3! = 3 × 2 × 1 = 6 ways.

Concept to know

  • The number of permutations of n distinct items taken all at a time is given by n! = n × (n - 1) × ... × 1.
  • When specific positions are fixed by designated items, those positions offer only 1 choice each and do not contribute variable arrangements.
  • The fundamental multiplication principle states that if one step has m choices and another has n choices, the sequence of steps has m × n total choices.
  • For a word of length N with K fixed positions and all distinct letters, the number of valid arrangements is (N - K)!.
  • Here, word length N = 5 and fixed positions K = 2 (D at start and I at end), giving (5 - 2)! = 3! = 6 valid words.

Related facts for revision

  • Permutations with repeated letters where total arrangements are divided by the factorials of repeated letter frequencies.
  • Permutations under adjacency constraints, such as keeping all vowels together by treating them as a single combined block.
  • Circular permutations where the number of distinct ways to arrange n objects around a circle is (n - 1)!.
  • Combination problems requiring selection of r items out of n followed by their arrangement (nCr × r!).
How UPSC tests this

Understanding permutations with positional constraints.

Trap: Overlooking that two positions are fixed simultaneously, leading candidates to calculate 4! = 24 instead of 3! = 6.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.