Permutation and Combination MCQ Quiz - Objective Question with Answer for Permutation and Combination - Download Free PDF
Last updated on Jun 18, 2025
Latest Permutation and Combination MCQ Objective Questions
Permutation and Combination Question 1:
Fifteen distinct points are randomly placed on the circumference of a circle. At most how many triangles can be formed using these points?
Answer (Detailed Solution Below)
Permutation and Combination Question 1 Detailed Solution
Given:
Number of distinct points = 15
Formula used:
Maximum number of triangles = C(n, 3)
Where, C(n, r) =
Calculation:
Maximum number of triangles = C(15, 3)
⇒ C(15, 3) =
⇒ C(15, 3) =
⇒ C(15, 3) = 455
∴ The correct answer is option (2).
Permutation and Combination Question 2:
A 6-digit security code is made using digits from 0 to 9. The first and the last digits are known. If the remaining four digits are known to be primes, at the most how many trials are required to determine the code?
Answer (Detailed Solution Below)
Permutation and Combination Question 2 Detailed Solution
Given:
A 6-digit security code is made using digits from 0 to 9. The first and the last digits are known. The remaining four digits are prime numbers.
Prime numbers between 0 and 9: 2, 3, 5, 7
Formula used:
Number of trials = Total possible combinations of the four prime digits
Calculation:
The total number of choices for each of the four remaining digits = 4 (since there are 4 prime numbers: 2, 3, 5, 7)
Total combinations = 4 × 4 × 4 × 4
⇒ Total combinations = 44
⇒ Total combinations = 256
∴ The correct answer is option (3).
Permutation and Combination Question 3:
How many 4-digit numbers can be generated from the digits 1, 2, 3, 4, 5 and 6 such that 123 always appear as a string? No digit appears more than once.
Answer (Detailed Solution Below)
Permutation and Combination Question 3 Detailed Solution
Given:
Digits available: 1, 2, 3, 4, 5, 6
Requirement: Form 4-digit numbers
Calculations:
Let the 4-digit number be represented by four positions:
Since the string 123 must appear and no digit can be repeated, the digits 1, 2, and 3 are used up when the string "123" is placed.
The remaining available digits are {4, 5, 6}.
There are two possible ways for the string 123 to appear in a 4-digit number:
Case 1: 123 occupies the first three positions.
The number format is 1 2 3 _
The first three digits are fixed as 1, 2, and 3.
The fourth position (the blank) must be filled by one of the remaining digits from {4, 5, 6}.
Number of choices for the fourth digit = 3 (either 4, 5, or 6).
The possible numbers are: 1234, 1235, 1236.
Number of numbers in Case 1 = 3.
Case 2: 123 occupies the last three positions.
The number format is _ 1 2 3
The last three digits are fixed as 1, 2, and 3.
The first position (the blank) must be filled by one of the remaining digits from {4, 5, 6}.
Number of choices for the first digit = 3 (either 4, 5, or 6).
The possible numbers are: 4123, 5123, 6123.
Number of numbers in Case 2 = 3.
Total number of 4-digit numbers = (Numbers from Case 1) + (Numbers from Case 2)
⇒ Total number = 3 + 3 = 6
∴ The correct answer is option 3.
Permutation and Combination Question 4:
How many 4-digit numbers can be generated from the digits 1, 2, 3, 4, 5, 6 and 7 such that no digit appears more than once, and '123' always appear as a string?
Answer (Detailed Solution Below)
Permutation and Combination Question 4 Detailed Solution
Given:
Digits: 1, 2, 3, 4, 5, 6, 7
Total digits in each number: 4
'123' must always appear as a string.
Formula used:
Number of arrangements = (Number of positions for the fixed string) × (Number of ways to arrange the remaining digits)
Calculation:
'123' is treated as a single unit (fixed string). Remaining digits: 4, 5, 6, 7 (4 digits).
Possible positions for the fixed string '123' in a 4-digit number:
Positions: [ _ _ _ _ ]
'123' can occupy positions: 1-3 or 2-4 (2 positions).
For each position of '123', the remaining digit can occupy the 4th position.
Number of arrangements of the remaining digits = 4! / (4-1)! = 4.
⇒ Total numbers = 2 × 4 = 8
∴ The correct answer is option 1.
Permutation and Combination Question 5:
In how many different ways can the letters of the word 'WORKSPACE' be arranged in such a way that the vowels always come together?
Answer (Detailed Solution Below)
Permutation and Combination Question 5 Detailed Solution
Given:
Word: WORKSPACE
Total letters = 9
Vowels = O, A, E (3 vowels)
Consonants = W, R, K, S, P, C (6 consonants)
Condition: Vowels must always be together
Calculations:
If vowels are together, treat them as one unit
So total units = 6 consonants + 1 vowel group = 7 units
Ways to arrange these 7 units = 7!
Ways to arrange 3 vowels within the group = 3!
7! = 5040
3! = 6
Total ways = 5040 × 6 = 30240
∴ Total arrangements = 30240
Top Permutation and Combination MCQ Objective Questions
How many possible two-digit numbers can be formed by using the digits 3, 5 and 7 (repetition of digits is allowed)?
Answer (Detailed Solution Below)
Permutation and Combination Question 6 Detailed Solution
Download Solution PDF⇒ Number of possible two-digit numbers which can be formed by using the digits 3, 5 and 7 = 3 × 3.
∴ 9 possible two-digit numbers can be formed.
The 9 possible two-digit numbers are:
33, 35, 37, 53, 55, 57, 73, 75, 77
In how many different ways can the letters of the word 'GEOGRAPHY' be arranged such that the vowels must always come together?
Answer (Detailed Solution Below)
Permutation and Combination Question 7 Detailed Solution
Download Solution PDFGiven:
The given number is 'GEOGRAPHY'
Calculation:
The word 'GEOGRAPHY' has 9 letters. It has the vowels E, O, A in it, and these 3 vowels must always come together. Hence these 3 vowels can be grouped and considered as a single letter. That is, GGRPHY(EOA).
Let 7 letters in this word but in these 7 letters, 'G' occurs 2 times, but the rest of the letters are different.
Now,
The number of ways to arrange these letters = 7!/2!
⇒ 7 × 6 × 5 × 4 × 3 = 2520
In the 3 vowels(EOA), all vowels are different
The number of ways to arrange these vowels = 3!
⇒ 3 × 2 × 1 = 6
Now,
The required number of ways = 2520 × 6
⇒ 15120
∴ The required number of ways is 15120.
In a meeting of 45 people, there are 40 people who know one another and the remaining know no one. People who know each other only hug, whereas those who do not know each other only shake hands. How many handshakes occur in this meeting?
Answer (Detailed Solution Below)
Permutation and Combination Question 8 Detailed Solution
Download Solution PDFExplanation:
Total people in meeting is 45 and out of then 40 people know each other.
So 5 people don't know anyone.
Let those 5 peoples be A, B, C, D, E
So A will handshake 44 people.
B will handshake 43 people
C will handshake 42 people
D will handshake 41 people
and E will handshake 40 people
Hence total handshake = 44 + 43 + 42 + 41 + 40 = 210
Option (3) is correct
From a group of 7 men and 6 women, five persons are to be selected to form a committee so that atleast 3 men are there on the committee. In how many ways can it be done ?
Answer (Detailed Solution Below)
Permutation and Combination Question 9 Detailed Solution
Download Solution PDFGiven:
(7 men + 6 women) 5 persons are to be chosen for a committee.
Formula used:
nCr = n!/(n - r)! r!
Calculation:
Ways in which at least 3 men are selected;
⇒ 3 men + 2 women
⇒ 4 men + 1 woman
⇒ 5 men + 0 woman
Number of ways = 7C3 × 6C2 + 7C4 × 6C1 + 7C5 × 6C0
⇒ 7!/(3! × 4!) × 6!/(2! × 4!) + 7!/(4! × 3!) × 6!/(1! × 5!) + 7!/(5! × 2!) × 6!/(6!× 0!)
⇒ 35 × 15 + 35 × 6 + 21
⇒ 735 + 21 = 756
∴ The required no of ways = 756.
Important PointsThe value of 0! is 1.
Find the number of ways in which 448 mobile phones can be shared equally among students.
Answer (Detailed Solution Below)
Permutation and Combination Question 10 Detailed Solution
Download Solution PDF448 = 2 × 2 × 2 × 2 × 2 × 2 × 7
⇒ 448 = 26 × 71
∴ The required number of mobile phones be shared equally in the students = (6 + 1) × (1 + 1) = 7 × 2 = 14
In how many different ways can the letters of the word 'FIGHT' be arranged?
Answer (Detailed Solution Below)
Permutation and Combination Question 11 Detailed Solution
Download Solution PDFGiven
Total alphabets in word 'FIGHT' = 5
Concept Used
Total number ways of arrangement = n!
Calculation
The number of different ways of arrangement of n different words (without repetition) = 5!
⇒ 5 × 4 × 3 × 2 × 1 = 120
∴ The required answer is 120
How many 3 digit odd numbers can be formed from the digits 5, 6, 7, 8, 9, if the digits can be repeated
Answer (Detailed Solution Below)
Permutation and Combination Question 12 Detailed Solution
Download Solution PDFGiven:
5, 6, 7, 8, 9 are the digits to form 3 digit number
Calculation:
Let us take the 3digit number as H T U (Hundreds, tens, unit digit) respectively
To make 3 digit number as odd
5, 7, 9 are only possibly be used in the unit digit place
In hundreds and tens place all 5 digits are possible
Number of ways for unit digit = 3
Number of ways for tens digit = 5
Number of ways for hundreds digit = 5
Number of 3 digits odd number = 3 × 5 × 5 = 75
∴ 75 Three-digit odd numbers can be formed from the digits 5, 6, 7, 8, 9 if the digits can be repeated
In how many ways can we sort the letters of the word MANAGEMENT so that the comparative position of vowels and consonants remains the same as in MANAGEMENT.
Answer (Detailed Solution Below)
Permutation and Combination Question 13 Detailed Solution
Download Solution PDFGiven:
Word = MANAGEMENT
Calculation:
Vowel occupy 4 places then !4
∵ A and E are repeated then !4/(!2 × !2)
Consonant occupy 6 places then !6
⇒ M and N are repeated then !6/(!2 × !2)
∴
= 6 × 180 = 1080
In how many ways can the word CHRISTMAS be arranged so that the letters C and M are never adjacent?
Answer (Detailed Solution Below)
Permutation and Combination Question 14 Detailed Solution
Download Solution PDFGiven:
Different words from CHRISTMAS have to be formed.
Formula:
Words in which letters C and M are never adjacent = All cases – words having C and M together.
Calculation:
⇒ Total number of words = 9!/2! (Division of 2! As S is repeated)
Let us assume C and M to be one unit. Then, letters can be arranged in 8! Ways. C and M can be arranged in 2! Ways. Letter S is repeated, so total number of ways will be divided by 2!
⇒ Number of words with C and M adjacent= 8!/2! × 2! = 8!
Words in which letters C and M are never adjacent = 9!/2! – 8! = 8! × (9/2 - 1) = 8! × (7/2)
How many four-digit numbers can be formed with digits 2, 5, 6, 7 and 8? (Repeating digits are not allowed)
Answer (Detailed Solution Below)
Permutation and Combination Question 15 Detailed Solution
Download Solution PDFGiven:
5 number are given 2, 5, 6, 7 and 8
Four-digit number without repetition
Formula used:
Permutation for no repetition =
Where n = total possible numbers
r = required number
Calculation:
Here the total possible number n = 5
And Required number r = 4
Applying the formula
⇒ 5!
⇒ 5 × 4 × 3 × 2 × 1 = 120
∴ There will 120 possible four-digit number.