A) 1000 | B) 100 |

C) 500 | D) 999 |

Explanation:

1 million distinct 3 digit initials are needed.

Let the number of required alphabets in the language be ‘n’.

Therefore, using ‘n’ alphabets we can form n * n * n = ${n}^{3}$ distinct 3 digit initials.

Note distinct initials is different from initials where the digits are different.

For instance, AAA and BBB are acceptable combinations in the case of distinct initials while they are not permitted when the digits of the initials need to be different.

This ${n}^{3}$ different initials = 1 million

i.e. ${n}^{3}={10}^{6}$ (1 million = ${10}^{6}$)

=> n = ${10}^{2}$ = 100

Hence, the language needs to have a minimum of 100 alphabets to achieve the objective.

A) 25 : 28 | B) 36 : 7 |

C) 8 :25 | D) 12 : 7 |

A) M | B) J |

C) B | D) O |

Explanation:

Thus after arranging the letters as per English alphabetical series; we get; Thus 4th letter from the left end will be K.

A) 2 | B) 3 |

C) 4 | D) 5 |

A) T | B) X |

C) N | D) R |

Explanation:

The first, the seventh, the ninth and the tenth letters of the word RECREATIONAL are R, T, O and N respectively. Meaningful word from these letters is only TORN. The third letter of the word is ‘R’.

A) 16! × 2 | B) 14! × 2 |

C) 18! × 2 | D) 14! |

A) 1/5225 | B) 1/5525 |

C) 5525 | D) 1/525 |

Explanation:

n(S) = 52C3 = 132600/6 = 22100

n(E) = 4C3 = 24/6 = 4