|
|
Permutation - Quant/Math - CAT 2009
Question 4 the day:
March , 2003
The question for the day is from the topic of Permutation
- How many words can be formed by re-arranging the letters of the word ASCENT such that A and T occupy the first and last position respectively?
| (1) |
5! |
| | |
(2) |
4! |
| (3) |
6! - 2! |
| | |
(4) |
6! / 2! |
Correct Answer - (2)
Solution:
As A and T should occupy the first and last position, the first and last position can be filled in only one way.
The remaining 4 positions can be filled in 4! Ways by the remaining words (S,C,E,N,T). hence by rearranging the letters of the word ASCENT we can form 1x4! = 4! words.
|
|
|
|
