Previous Year Paper
CAT-2003-Previous Years Paper
A string of three English letters is formed as per the following rules:
I. The first letter is any vowel.
II. The second letter is m, n or p.
III. If the second letter is m, then the third letter is any vowel which is different from the first letter.
IV. If the second letter is n, then the third letter is e
V. If the second letter is p, then the third letter is the same as the first letter.
How many strings of letters can possibly be formed using the above rules such that the third letter of the string is e?
A 8 B 9 C 10 D 11
As the third letter is e that can be selected in only one way
Case I: 4 m e = 4 ways
Case II: 5 n e = 5 ways
Case III: e p e = 1 ways
= 10 ways