CAT Quantitative Aptitude Questions | CAT Permutation and Combination Questions

The question is from Permutation and Combination. This question is about Letters Rearrangment. We need to find out the number of ways the letters can be rearranged from a particular word with a condition given. This section hosts a number of questions which are on par with CAT questions in difficulty on CAT Permutation and Combination, and CAT Probability.

Question 30: In how many ways can we rearrange the letters of the word MANANA such that no two A’s are adjacent to each other?

1. 3 ! * ⁵C₃
2. 4 ! * ⁴C₃
3. 3 * ⁴C₃
4. 3 ! * ⁴C₃

Explanatory Answer

Method of solving this CAT Question from Permutation and Combination: Simple Rearrangment Question!!

MANANA has 6 letters, of which 3 are A's
Now, let us place the letters that are not As on a straight line. We have MNN. These can be arranged in \\frac{3!}{2!}\\) = 3 ways.
Now let us create slots between these letters to place the As in.
In order to ensure that no two As are adjacent to each other, let us create exactly one slot between any two letters.
M __N __ N
Additionally, let us add one slot at the beginning and end as well as the As can go there also.
__ M __N __ N __
Now, out of these 4 slots, some 3 can be A. That can be selected in ⁴C₃ ways.
So, total number of words = 3 ! * ⁴C₃ ways

The question is "In how many ways can we rearrange the letters of the word MANANA such that no two A’s are adjacent to each other?"

Hence the answer is "3 * ⁴C₃ "

Choice C is the correct answer.