Basic Concepts Of Permutations And Combinations

20 Questions  I  By Sweetsalman123
math xmlns=http://www.w3.org/1998/Math/MathMLmsubmn4/mnmsubmi mathvariant=boldP/mimn3/mn/msub/msub/math

  
Changes are done, please start the quiz.


Question Excerpt

Removing question excerpt is a premium feature

Upgrade and get a lot more done!
1.  The sum of all 4 digit number containing the digits 2, 4, 6, 8, without repetitions is
A.
B.
C.
D.
2.  The value of «math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«munderover»«mrow»«mo»§#8721;«/mo»«mi»r«/mi»«mo».«/mo»«/mrow»«mrow»«mi»r«/mi»«mo»=«/mo»«mn»1«/mn»«/mrow»«mn»10«/mn»«/munderover»«/math»«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«mi»r«/mi»«msub»«mi»p«/mi»«mi»r«/mi»«/msub»«/msub»«/math» Options: A.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mn»11«/mn»«mi»P«/mi»«/msub»«mn»11«/mn»«/msub»«/math» B.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mn»11«/mn»«mi»P«/mi»«/msub»«mn»11«/mn»«/msub»«/math»-1 C.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mn»11«/mn»«mi»P«/mi»«/msub»«mn»11«/mn»«/msub»«/math»+1 D.None of these
A.
B.
C.
D.
3.  «math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«mn»4«/mn»«msub»«mi mathvariant=¨bold¨»P«/mi»«mn»4«/mn»«/msub»«/msub»«/math» is equal to
A.
B.
C.
D.
4.  Every two persons shakes hands with each other in a party and the total number of hand shakes is 66. The number of guests in the party is
A.
B.
C.
D.
5.  In a group of boys the number of arrangement of 4 boys is 12 times the number of arrangements of 2 boys.The number boys in the group is
A.
B.
C.
D.
6.  «math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«mn»4«/mn»«msub»«mi mathvariant=¨bold¨»P«/mi»«mn»3«/mn»«/msub»«/msub»«/math» is evaluated as
A.
B.
C.
D.
7.  If n cr-1 = 56, «math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mi»n«/mi»«mi»c«/mi»«/msub»«mi»r«/mi»«/msub»«/math»= 28 and n cr+1 = 8, then r is equal to
A.
B.
C.
D.
8.  The number of 4 digit numbers formed with the digits 1, 1, 2, 2, 3, 4 is
A.
B.
C.
D.
9.  In nPr ,n is always 
A.
B.
C.
D.
10.  In nPr, the restriction is  Options: A.n > r B.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mi»n«/mi»«mo»§#10878;«/mo»«mi»r«/mi»«/math» C.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mi»n«/mi»«mo»§#10877;«/mo»«mi»r«/mi»«/math» D. None of these
A.
B.
C.
D.
11.  A person has 8 friends. The number of ways in which he may invite one or more of thai to a dinner is.
A.
B.
C.
D.
12.  The number of ways in which 8 different beads be strung on a necklace is
A.
B.
C.
D.
13.  If n1+n2 P2 = 132, n1-n2P2 = 30 then,  
A.
B.
C.
D.
14.  The number of ways the letters of the word "Triangle" to be arranged so that the word 'angle' will be always present is
A.
B.
C.
D.
15.  The number of ways in which 15 mangoes can be equally divided among 3 students is Options: A.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mn»15«/mn»«mo»!«/mo»«/mrow»«mrow»«mo»(«/mo»«mn»5«/mn»«msup»«mo»)«/mo»«mn»4«/mn»«/msup»«mo»!«/mo»«/mrow»«/mfrac»«/math» B.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mn»15«/mn»«mo»!«/mo»«/mrow»«mrow»«mo»(«/mo»«mn»5«/mn»«msup»«mo»)«/mo»«mn»3«/mn»«/msup»«mo»!«/mo»«/mrow»«/mfrac»«/math» C.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mn»15«/mn»«mo»!«/mo»«/mrow»«mrow»«mo»(«/mo»«mn»5«/mn»«msup»«mo»)«/mo»«mn»2«/mn»«/msup»«mo»!«/mo»«/mrow»«/mfrac»«/math» D.None of these
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.  «math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mo»(«/mo»«mi»n«/mi»«mo»-«/mo»«mn»1«/mn»«mo»)«/mo»«msub»«mi»P«/mi»«mi»r«/mi»«/msub»«mo»§nbsp;«/mo»«mo»+«/mo»«mi»r«/mi»«mo».«/mo»«/math»«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mo»(«/mo»«mi»n«/mi»«mo»-«/mo»«mn»1«/mn»«mo»)«/mo»«msub»«mi»P«/mi»«mrow»«mo»(«/mo»«mi»r«/mi»«mo»-«/mo»«mn»1«/mn»«mo»)«/mo»«/mrow»«/msub»«/math» is equal to Options: A.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mi»n«/mi»«mi»c«/mi»«/msub»«mi»r«/mi»«/msub»«/math» B.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mi»n«/mi»«mo»!«/mo»«/mrow»«mrow»«mo»(«/mo»«mi»r«/mi»«mo»!«/mo»«mo»(«/mo»«mi»n«/mi»«mo»-«/mo»«mi»r«/mi»«mo»)«/mo»«mo»!«/mo»«mo»)«/mo»«/mrow»«/mfrac»«/math» C.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«msub»«msub»«mi»n«/mi»«mi»p«/mi»«/msub»«mi»r«/mi»«/msub»«/math» D.None of these
A.
B.
C.
D.
18.  There are 10 trains plying between Calcutta and Delhi. The number of ways in which a person can go from Calcutta to Delhi and return by a different train is 
A.
B.
C.
D.
19.  The results of 8 matches (Win, Loss or Draw) are to be predicted. The number of differe forecasts containing exactly 6 correct results is
A.
B.
C.
D.
20.   nPr can also written as Options: A.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mi»n«/mi»«mo»!«/mo»«/mrow»«mrow»«mi»n«/mi»«mo»-«/mo»«mi»r«/mi»«mo»§nbsp;«/mo»«mo»!«/mo»«/mrow»«/mfrac»«/math» B.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mi»n«/mi»«mo»!«/mo»«/mrow»«mrow»«mi»r«/mi»«mo»!«/mo»«mo»(«/mo»«mi»n«/mi»«mo»-«/mo»«mi»r«/mi»«mo»)«/mo»«mo»!«/mo»«/mrow»«/mfrac»«/math» C.«math xmlns=¨http://www.w3.org/1998/Math/MathML¨»«mfrac»«mrow»«mi»r«/mi»«mo»!«/mo»«/mrow»«mrow»«mi»n«/mi»«mo»-«/mo»«mi»r«/mi»«mo»!«/mo»«/mrow»«/mfrac»«/math» D.None of these
A.
B.
C.
D.
Back to top


to post comments.

Removing ad is a premium feature

Upgrade and get a lot more done!
Take Another Quiz