1
Q:

# If the letters of the word VERMA are arranged in all possible ways and these words are written out as in a dictionary, then the rank of the word VERMA is :

 A) 108 B) 117 C) 810 D) 180

Explanation:

The number of words beign with A is 4!

The number of words beign with E is 4!

The number of words beign with M is 4!

The number of words beign with R is 4!

Number of words beign with VA is 3!

Words beign with VE are VEAMR

VEARM

VEMAR

VEMRA

VERAM

VERMA

$\inline&space;\therefore$  The Rank of the word VERMA = 4 x 4! + 3! + 6

= 96 + 6 + 6 =108

Q:

A group consists of 4 men, 6 women and 5 children. In how many ways can 2 men , 3 women and 1 child selected from the given group ?

 A) 600 B) 610 C) 609 D) 599

Explanation:

Two men, three women and one child can be selected in ⁴C₂ x ⁶C₃ x ⁵C₁ ways

= $\inline \fn_jvn \small \left ( \frac{4x3}{2x1} \right )x \left ( \frac{6x5x4}{3x2x1} \right )x 5$

= 600 ways.

1 4
Q:

The number of sequences in which 4 players can sing a song, so that the youngest player may not be the last is ?

 A) 2580 B) 3687 C) 4320 D) 5460

Explanation:

Let 'Y' be the youngest player.

The last song can be sung by any of the remaining 3 players. The first 3 players can sing the song in (3!) ways.

The required number of ways = 3(3!) = 4320.

3 72
Q:

A letter lock consists of three rings each marked with six different letters. The number of distinct unsuccessful attempts to open the lock is at the most  ?

 A) 215 B) 268 C) 254 D) 216

Explanation:

Since each ring consists of six different letters, the total number of attempts possible with the three rings is = 6 x 6 x 6 = 216. Of these attempts, one of them is a successful attempt.

Maximum number of unsuccessful attempts = 216 - 1 = 215.

1 33
Q:

The number of ways in which six boys and six girls can be seated in a row for a photograph so that no two girls sit together is  ?

 A) 2(6!) B) 6! x 7 C) 6! x ⁷P₆ D) None

Explanation:

We can initially arrange the six boys in 6! ways.
Having done this, now three are seven places and six girls to be arranged. This can be done in ⁷P₆ ways.

Hence required number of ways = 6! x ⁷P₆

1 55
Q:

The number of permutations of the letters of the word 'MESMERISE' is  ?

 A) 9!/(2!)^{2}x3! B) 9! x 2! x 3! C) 0 D) None

Number of arrangements = $\inline&space;\fn_jvn&space;\small&space;\frac{9!}{(2!)^{2}x3!}$