Permutations & Combinations Questions and Answers

Answer: C

DETAIL has six distinct letters: vowels E, A, I and consonants D, T, L.

The odd positions are 1, 3 and 5 - three places for three vowels.

\[ \text{vowels} = 3! = 6 \]

\[ \text{consonants in the even positions} = 3! = 6 \]

\[ 6 \times 6 = 36 \]

The two counts match exactly, which is what makes the restriction satisfiable at all.

Answer: A

There are ten animals in all. "At least one cow" is easiest through the complement.

\[ \text{total} = {}^{10}C_{4} = 210 \]

\[ \text{no cow} = {}^{4}C_{4} = 1 \]

\[ 210 - 1 = 209 \]

With only four buffalos there is exactly one all-buffalo selection, which is what makes the complement so small.

Answer: C

\[ {}^{4}C_{3} \times {}^{6}C_{2} \times {}^{5}C_{3} \]

\[ = 4 \times 15 \times 10 = 600 \]

Each group is chosen from its own pool, so the three counts are independent and multiply.

Answer: A

The leader is to be a school girl or a school boy, and no one is both, so the two counts simply add.

\[ 12 + 10 = 22 \]

"Or" between mutually exclusive choices means addition; it would be multiplication only if a girl and a boy were both being chosen.

Answer: C

This type of question becomes very easy when we assume three colour are red(R) blue(B) and Green(G). 

Now according to the statement 1 i.e.., codes can be generated by waving single flag of different colours, then number of ways are three i.e.., R.B.G from statement III three flags in different sequence of colours, then number of ways are six i.e.., RBG, BGR, GBR, RGB, BRG, GRB. 

Hence total number of ways by changing flag = 3+ 6 +6 = 15

Answer: C

MATHEMATICS has eleven letters, with M, A and T each appearing twice. Its vowels are A, E, A, I and its consonants M, T, H, M, T, C, S.

Treating the four vowels as one block gives eight units, among which M and T each repeat:

\[ \frac{8!}{2!\,2!} = \frac{40320}{4} = 10{,}080 \]

Within the block the four vowels include two A's:

\[ \frac{4!}{2!} = 12 \]

\[ 10{,}080 \times 12 = 120{,}960 \]

Three separate repetitions have to be divided out - the M's and T's among the units, and the A's inside the block.

Answer: C

For each visualization let us name the females and Females(3) Males(5) 

A B C D E F G H 

Since A cannot go with B. 

She will make team with four males in four ways AD,AF,AG,AH.

Since there is no compulsion with females C and E. 

They can make team with 5 males in 5 different ways each. 

Therefore, Total number of ways = 4+5+5 =14

Answer: C

LOGARITHMS has ten letters, all different, and a word is an ordered arrangement.

\[ {}^{10}P_{4} = 10 \times 9 \times 8 \times 7 = 5040 \]

The corresponding combination \( {}^{10}C_{4} = 210 \) would count only which four letters are used, ignoring their order.