Skip to main content
Back to PERMUTATION AND COMBINATION

Your Progress

0 / 742 Answered
0
Correct
0
Incorrect
0%
Accuracy
JEE • MATHEMATICS • PERMUTATION AND COMBINATION

Permutation and combination practice · Mixed difficulty

Try a question, then open “View answer” to check it. Sign in to submit answers and save progress.

Practice format and chapter quiz

These sets use single-correct-answer MCQs. They do not cover every JEE Main or JEE Advanced question format and are not full-length mock papers.

Take a chapter quiz →
Showing 721-742 of 742 questions
721 Easy
721 of 742
Application +4 | -1
If   12Pr=1320{\;^{12}}{P_r} = 1320, then rr is equal to
View answer and explanation
Correct option: C
3
Option C (3) is correct because solving the permutation equation   12Pr=1320{\;^{12}}{P_r} = 1320 leads to r=3r = 3.
722 Easy
722 of 742
Application +4 | -1
The number of ways in which the letters of the word BALLOON can be arranged so that two L's do not come together, is
View answer and explanation
Correct option: C
900
Option C (900) is correct because it subtracts the arrangements where the two L's are together from the total possible arrangements.
723 Easy
723 of 742
Application +4 | -1
At an election, a voter may vote for any number of candidates not greater than the number to be chosen. There are 10 candidates and 5 members to be selected. The number of ways of in which a voter can vote is:
View answer and explanation
Correct option: C
637
Option C (637) is correct because the voter can vote for 1 to 5 candidates, and the sum of the combinations 10C1{}^{10} C_1 to 10C5{}^{10} C_5 equals 637.
724 Easy
724 of 742
Application +4 | -1
The number of numbers that can be formed by using digits 1,2,3,4,3,2,1 so that odd digits always occupy odd places
View answer and explanation
Correct option: C
18
The correct answer is 18 because it is the number of numbers that can be formed using the digits 1,2,3,4,3,2,1 such that odd digits always occupy odd places.
725 Medium
725 of 742
Application +4 | -1
The number of permutations of 4 letters from the letters of word 'KOLKATA' is
View answer and explanation
Correct option: B
270
Option B is correct because the number of permutations of 4 letters from the word 'KOLKATA' is 270, considering the repeated letters.
726 Easy
726 of 742
Application +4 | -1
If   n+2C8  :  n−2P4=57  :16,{\;^{n + 2}}{C_8}\;:{\;^{n - 2}}{P_4} = 57\;:16, then the value of nn is
View answer and explanation
Correct option: B
19
Option B (19) is correct because it is the solution to the equation derived from the given ratio of combination and permutation after simplification and solving the quadratic equation.
727 Medium
727 of 742
Application +4 | -1
If all the words, with or without meaning, are written using the letters of the word QUEEN and are arranged as in English dictionary, then the position of the word QUEEN is:
View answer and explanation
Correct option: C
46th 46^{\text {th }}
Option C (46th) is correct because when arranging the letters of QUEEN in dictionary order, the word QUEEN appears after all words starting with E, N, QE, and QN.
728 Easy
728 of 742
Application +4 | -1
The number of integers greater than 6000 that can be formed using the digits 3,5,6,73,5,6,7 and 8 without repetition, is
View answer and explanation
Correct option: D
192
Option D (192) is correct because it sums the number of possible 4-digit numbers starting with 6, 7, or 8 and the number of possible 5-digit numbers using the given digits.
729 Easy
729 of 742
Application +4 | -1
Ashok, Usha, Rani, Sonu are to give speeches in a class. The teacher can arrange the order of their presentation in
View answer and explanation
Correct option: B
24 ways
Option B (24 ways) is correct because it represents the number of ways to arrange 4 distinct people in a sequence.
730 Easy
730 of 742
Application +4 | -1
The number of words that can be formed by using the letters of the word MATHEMATICS that start as well as end with T is:
View answer and explanation
Correct option: B
90720
Option B (90720) is correct because after fixing T at the beginning and end, we arrange the remaining 9 letters, accounting for repetitions of M and A, resulting in 9!/(2!2!) = 90720.
731 Medium
731 of 742
Application +4 | -1
The value of 20Cn25Cm\frac{{ }^{20} C_n}{{ }^{25} C_m} when both numerator and denominator have their greatest values, is
View answer and explanation
Correct option: C
1434025\frac{143}{4025}
Option C (1434025\frac{143}{4025}) is correct because it is the ratio of the greatest values of the binomial coefficients 20Cn{ }^{20} C_n and 25Cm{ }^{25} C_m, which occur at n=10n=10 and m=13m=13 respectively.
732 Easy
732 of 742
Application +4 | -1
The number of ways that 8 beads of different colours be strung as a necklace is
View answer and explanation
Correct option: C
7!2\frac{7 !}{2}
Option C (7!2\frac{7 !}{2}) is correct because the number of ways to arrange n distinct objects in a necklace is (n-1)!/2.
733 Medium
733 of 742
Analyzing +4 | -1
A class has 21 students. The class teacher has been asked to make nn groups of rr students each and go to zoo taking one group at a time. The size of group zoo i.e. the value of rr) for which the teacher goes to the maximum number of times is (no group can go to the zoo twice)
View answer and explanation
Correct option: B
10 or 11
Option A (0,π4)∪(3π4,π)\left(0, \frac{\pi}{4}\right) \cup\left(\frac{3 \pi}{4}, \pi\right) is correct because it is the interval where β−α\beta - \alpha lies, derived from the given trigonometric conditions.
734 Easy
734 of 742
Application +4 | -1
mm men and nn women are to be seated in a row so that no two women sit together. If m>nm > n, then the number of ways in which they can be seated, is
View answer and explanation
Correct option: A
m!(m+1)!(m−n+1)!\frac{{m!\left( {m + 1} \right)!}}{{\left( {m - n + 1} \right)!}}
Option A (m!(m+1)!(m−n+1)!\frac{{m!\left( {m + 1} \right)!}}{{\left( {m - n + 1} \right)!}}) is correct because it accounts for arranging the men and then placing the women in the gaps.
735 Medium
735 of 742
Application +4 | -1
The number of 3 digit numbers ' abca b c ' such that b<cb < c is
View answer and explanation
Correct option: B
405
Option B (405) is correct because there are 9 choices for the first digit and then the number of ways to choose the second and third digits such that b < c is the sum of integers from 1 to 9.
736 Medium
736 of 742
Application +4 | -1
Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five balls. In how many ways can we place the balls so that no box remains empty?
View answer and explanation
Correct option: C
150
Option C (150) is correct because it accounts for all possible distributions of the five balls into the three boxes such that no box is empty.
737 Easy
737 of 742
Application +4 | -1
The number of positive integers <1,00,000< 1,00,000 which contain exactly one 2, one 5 and one 7 in its decimal representation is
View answer and explanation
Correct option: A
2940
Option A (2940) is correct because it accounts for the permutations of the digits 2, 5, and 7 within a 5-digit number, along with the possible choices for the remaining digits.
738 Medium
738 of 742
Application +4 | -1
The number of arrangements that can be formed from the letters a,b,c,d,e,fa, b, c, d, e, f taken 3 at a time without repetition and each arrangement containing at least one vowel, is
View answer and explanation
Correct option: A
96
Option A (96) is correct because it correctly calculates the number of arrangements with at least one vowel by considering cases with one vowel and two consonants, and two vowels and one consonant.
739 Medium
739 of 742
Application +4 | -1
Let A={x1,x2,x3,  x4,  x5,  x6}A = \left\{ {{x_1},{x_{2,}}{x_3},\;{x_4},\;{x_5},\;{x_6}} \right\},
B={y1,  y2,  y3,y4,y5,y6}.B = \left\{ {{y_1},\;{y_2},\;{y_3},{y_4},{y_5},{y_6}} \right\}. . Then the number of one – one mapping from AA to BB such that f(xi)≠yvi=1,  2,  3,  4,  5,  6f\left( {{x_i}} \right) \ne {y_v}i = 1,\;2,\;3,\;4,\;5,\;6
View answer and explanation
Correct option: B
265
The correct answer is 265 because it is calculated by using the principle of inclusion-exclusion to find the number of one-to-one mappings where no element maps to itself.
740 Easy
740 of 742
Application +4 | -1
The letters of the word RANDOM are written in all possible orders and these words are written out as in a dictionary, then the rank of the word RANDOM is
View answer and explanation
Correct option: A
614
Option A (614) is correct because the rank of the word RANDOM is determined by counting the number of words that come before it in a dictionary, considering the alphabetical order of the letters.
741 Medium
741 of 742
Understanding +4 | -1
In a country, no two persons have identical set of teeth and there is no person without a tooth, also no person has more than 32 teeth. If shape and size of tooth is disregarded and only the position of tooth is considered, then maximum population of that country can be
View answer and explanation
Correct option: B
232−12^{32}-1
Option B (232−12^{32}-1) is correct because each tooth can be either present or absent, leading to 2322^{32} possibilities, but we exclude the case where no tooth is present.
742 Medium
742 of 742
Application +4 | -1
The number of ways in which the letters of 'ARRANGE' be arranged so that i. "No two R's come together is
View answer and explanation
Correct option: B
900
Option B (900) is correct because it calculates the arrangements where no two R's are together by arranging the other letters first and then placing the R's in the gaps.
Revision notes and key takeaways

Review PERMUTATION AND COMBINATION in your textbook or class notes, then use this set to check your understanding.

Showing 721-742 of 742 questions
0 /742
0✓ 0✗
0% Accuracy
Type at least 2 characters or jump directly:
🔓

Save your learning progress

Sign in with a free account to save your practice answers and quiz results, then return to them when you revise.