1. | is evaluated as |
A. |
B. |
C. |
D. |
2. | is equal to |
A. |
B. |
C. |
D. |
3. | 7! is equal to |
A. |
B. |
C. |
D. |
4. | 0! is a symbol equal to |
A. |
B. |
C. |
D. |
5. | In ^{n}P_{r ,}n is always |
A. |
B. |
C. |
D. |
6. | In ^{n}P_{r}, the restriction is Options: A.n > r B. C. D. None of these |
A. |
B. |
C. |
D. |
7. | In ^{n}P_{r} =n (n-1) (n-2) ........................ (n-r-1), the number of factor is |
A. |
B. |
C. |
D. |
8. | ^{n}P_{r} can also written as Options: A. B. C. D.None of these |
A. |
B. |
C. |
D. |
9. | If ^{n}P_{4} = 12 x ^{n}P_{2}, then is equal to |
A. |
B. |
C. |
D. |
10. | If . ^{n}P_{3}: ^{n}P_{2} =3:1, then n is equal to |
A. |
B. |
C. |
D. |
11. | ^{m+n}P_{2} = 56, ^{m-}^{n}P_{2} = 30 then |
A. |
B. |
C. |
D. |
12. | If ^{5}P_{r}= 60, then the value of r is |
A. |
B. |
C. |
D. |
13. | If ^{n1+n}^{2} P_{2} = 132, ^{n1-}^{n2}P_{2} = 30 then, |
A. |
B. |
C. |
D. |
14. | The number of ways the letters of the word COMPUTER can be rearranged is |
A. |
B. |
C. |
D. |
15. | The number of arrangements of the letters in the word FAILURE, so that vowels are always! coming together is |
A. |
B. |
C. |
D. |
16. | 10 examination papers are arranged in such a way that the best and worst papers never come together. The number of arrangements is |
A. |
B. |
C. |
D. |
17. | N articles are arranged in such a way that 2 particular articles never come together. The number of such arrangements is |
A. |
B. |
C. |
D. |
18. | If 12 school teams are participating in a quiz contest, then the number of ways the first, second and third positions may be won is |
A. |
B. |
C. |
D. |
19. | The sum of all 4 digit number containing the digits 2, 4, 6, 8, without repetitions is |
A. |
B. |
C. |
D. |
20. | The number of 4 digit numbers greater than 5000 can be formed out of the digits 3, 4, 5, 6 and 7 (no. digit is repeated). The number of such is |
A. |
B. |
C. |
D. |