PNC 2

1/15/24, 12:06 AM Vedantu Tools Dashboard
Q1: The number of ways of giving 20 distinct oranges to 3 children such that each child
gets at least one orange is _______.
Q1: The number of ways of giving 20 distinct oranges to 3 children such that each child
gets at least one orange is _______.
348.00
Solution:
20 distinct oranges distributed among 3 children so that each child gets at least one orange
Q2: The number of 4-letter words, with or without meaning, each consisting of 2 vowels
and 2 consonants, which can be formed from the letters of the word UNIVERSE without
repetition is ______.
Q2: The number of 4-letter words, with or without meaning, each consisting of 2 vowels
and 2 consonants, which can be formed from the letters of the word UNIVERSE without
repetition is ______.
432.00
Solution:
UNIVERSE
Vowels: E, I, U
Consonants: N, V, R, S
Q3: The largest natural number such that divide is ______.

Q3: The largest natural number such that divide is ______.

31.00
Solution:
Q4: Let and . Total number of onto functions

such that is equal to
Q4: Let and . Total number of onto functions

such that is equal to
180.00
Solution:
Total no. of onto function provided

= Total no. of onto function – No. of onto function
When
Q5: Some couples participated in a mixed doubles badminton tournament. If the number
of matches played, so that no couple played in a match, is 840, then the total numbers of
persons, who participated in the tournament, is _______.
Q5: Some couples participated in a mixed doubles badminton tournament. If the number
of matches played, so that no couple played in a match, is 840, then the total numbers of
persons, who participated in the tournament, is _______.
16.00
Solution:
Therefore total persons = 16

Q6: The number of permutations, of the digits without repetition, which

neither contain the string 153 nor the string 2467, is _____.
Q6: The number of permutations, of the digits without repetition, which

neither contain the string 153 nor the string 2467, is _____.
4898.00
Solution:
Digits → 1, 2, 3, 4, 5, 6, 7
Total permutations
Let number of numbers containing string 153
Let number of numbers containing string 2467
n
(neither string 153 nor string 2467)

= Total
Q7: The sum of all the four-digit numbers that can be formed using all the digits
is equal to ______.
Q7: The sum of all the four-digit numbers that can be formed using all the digits
is equal to ______.
26664.00
Solution:
Sum of digits of unit place

Required sum
Ans. 26664
Q8: In an examination, 5 students have been allotted their seats as per their roll
numbers. The number of ways, in which none of the students sits on the allotted eat, is
______.
Q8: In an examination, 5 students have been allotted their seats as per their roll
numbers. The number of ways, in which none of the students sits on the allotted eat, is
______.
44.00
Solution:
Derangement of 5 students
Q9: Let and Then the number of function

satisfying is equal to _______.
Q9: Let and Then the number of function

satisfying is equal to _______.
360.00
Solution:
Case I: mappings
Case II: mappings
Case III: mappings
Case Iv: mapping
& both have 6 mappings each
Number of functions
Q10: Let the digits a, b, c be in A. P. Nine-digit numbers are to be formed using each of
these three digits thrice such that three consecutive digits are in A.P. at least once.
How many such numbers can be formed?
Q10: Let the digits a, b, c be in A. P. Nine-digit numbers are to be formed using each of
these three digits thrice such that three consecutive digits are in A.P. at least once.
How many such numbers can be formed?
944.00
Solution:
or
––––––––
Q11: The number of seven digit positive integers formed using the digits 1, 2, 3 and 4
only and the sum of the digits equal to 12 is _______.
Q11: The number of seven digit positive integers formed using the digits 1, 2, 3 and 4
only and the sum of the digits equal to 12 is _______.
413.00
Solution:
No. of solutions
Q12: Total numbers of 3-digit numbers that are divisible by 6 and can be formed by using
the digits 1, 2, 3, 4, 5 with repetition, is ______.
Given: 89
Q12: Total numbers of 3-digit numbers that are divisible by 6 and can be formed by using
the digits 1, 2, 3, 4, 5 with repetition, is ______.
Given: 89
16.00
Solution:
For number to be divisible by ‘6’ unit digit should be even and sum of digit is divisible by 3.
Total 16 numbers.
Q13: A person forgets his 4-digit ATM pin code. But he remembers that in the code all the
digits are different, the greatest digit is 7 and the sum of the first two digits is equal to the
sum of the last two digits. Then the maximum number of trials necessary to obtain the
correct code is ___.
Q13: A person forgets his 4-digit ATM pin code. But he remembers that in the code all the
digits are different, the greatest digit is 7 and the sum of the first two digits is equal to the
sum of the last two digits. Then the maximum number of trials necessary to obtain the
correct code is ___.
72.00
Solution:
Sum of first two digits

Sum of last two digits
Case-I:
ways
Case-II:
ways
ways
Case-III:
ways
ways
Case-IV:
ways
ways
Case-V:
ways
ways
Ans.
Q14: All the letters of the word PUBLIC are written in all possible orders and these words
are written as in a dictionary with serial numbers. Then the serial number of the word
PUBLIC is
(A) 582
(B) 580
(C) 576
(D) 578
Q14: All the letters of the word PUBLIC are written in all possible orders and these words
are written as in a dictionary with serial numbers. Then the serial number of the word
PUBLIC is
(A) 582
(B) 580
(C) 576
(D) 578
Solution:
B……………
C……………
I……………
L……………
PB……………
PC……………
PL……………
PI……………
………
………
………
………
Serial number
Q15: Let the number of elements in sets and be five and two respectively. Then the
number of subsets of each having at least 3 and at most 6 elements is:
(A) 772
(B) 792
(C) 782
(D) 752
Q15: Let the number of elements in sets and be five and two respectively. Then the
number of subsets of each having at least 3 and at most 6 elements is:
(A) 772
(B) 792
(C) 782
(D) 752
Solution:
Q16: The number of ways, in which 5 girls and 7 boys can be seated at a round table so
that no two girls sit together, is
(A)
(B)
(C)
(D)
Q16: The number of ways, in which 5 girls and 7 boys can be seated at a round table so
that no two girls sit together, is
(A)
(B)
(C)
(D)
Solution:
7 boys can be seated in 6! Ways

Now girls will be placed in gaps
Total ways
Q17: The number of arrangements of the letters of the word “INDEPENDENCE” in which
all the vowels always occur together is
(A) 33600
(B) 14800
(C) 18000
(D) 16800
Q17: The number of arrangements of the letters of the word “INDEPENDENCE” in which
all the vowels always occur together is
(A) 33600
(B) 14800
(C) 18000
(D) 16800
Solution:
Vowels: I, 4E
Consonants: 3N, 2D, P, C
Total ways of arranging taking vowels together
Q18: If the number of words, with or without meaning, which can be made using all the
letters of the word MATHEMATICS in which C and S do not come together, is , then
is equal to
(A) 5670
(B) 2835
(C) 945
(D) 1890
Q18: If the number of words, with or without meaning, which can be made using all the
letters of the word MATHEMATICS in which C and S do not come together, is , then
is equal to
(A) 5670
(B) 2835
(C) 945
(D) 1890
Solution:
Arrange remaining 9 letters and put C and S in any 2 gaps out of 10 gaps.
i.e., (Given)
Q19: Let and . Then the number of elements in the

relation divides and divides
is
(A) 18
(B) 36
(C) 12
(D) 24
Q19: Let and . Then the number of elements in the

relation divides and divides
is
(A) 18
(B) 36
(C) 12
(D) 24
Solution:
divides
Each element has 2 choices
divides
Each element has 2 choices
Total
Q20: Eight persons are to be transported from city A to city B in three cars of different
makes. If each car can accommodate at most three persons, then the number of ways, in
which they can be transported, is
(A) 3360
(B) 1680
(C) 560
(D) 1120
Q20: Eight persons are to be transported from city A to city B in three cars of different
makes. If each car can accommodate at most three persons, then the number of ways, in
which they can be transported, is
(A) 3360
(B) 1680
(C) 560
(D) 1120
Solution:
The number of ways

Q21: The number of triplets , where are distinct non negative integers
satisfying , is
(A) 136
(B) 114
(C) 92
(D) 80
Q21: The number of triplets , where are distinct non negative integers
satisfying , is
(A) 136
(B) 114
(C) 92
(D) 80
Solution:
Total no. of solution

Let
7 solutions
There are 21 solutions in which exactly
Two of are equal
There is one solution in which
Required answer
Q22: Let and . Let R be a relation defined on

such that . Then the number
of elements in the set R is
(A) 180
(B) 26
(C) 52
(D) 160
Q22: Let and . Let R be a relation defined on

such that . Then the number
of elements in the set R is
(A) 180
(B) 26
(C) 52
(D) 160
Solution:
Let choices of
choices of
choices of
choices of
choices of
For 16 ways
Similarly, choices of
choices of
choices of
choices of
Required elements in R = 160
Q23: If the letters of the word MATHS are permuted and all possible words so formed are
arranged as in a dictionary with serial numbers, then the serial number of the word
THAMS is
(A) 101
(B) 104
(C) 102
(D) 103
Q23: If the letters of the word MATHS are permuted and all possible words so formed are
arranged as in a dictionary with serial numbers, then the serial number of the word
THAMS is
(A) 101
(B) 104
(C) 102
(D) 103
Solution:
Q24: The number of five digit numbers, greater than 40000 and divisible by 5 , which can
be formed using the digits and 9 without repetition, is equal to
(A) 120
(B) 96
(C) 72
(D) 132
Q24: The number of five digit numbers, greater than 40000 and divisible by 5 , which can
be formed using the digits and 9 without repetition, is equal to
(A) 120
(B) 96
(C) 72
(D) 132
Solution:
So Required numbers
Q25: All words, with or without meaning, are made using all the letters of the word
MONDAY. These words are written as in a dictionary with serial numbers. The
serial number of the word MONDAY is
(A) 327
(B) 328
(C) 324
(D) 326
Q25: All words, with or without meaning, are made using all the letters of the word
MONDAY. These words are written as in a dictionary with serial numbers. The
serial number of the word MONDAY is
(A) 327
(B) 328
(C) 324
(D) 326
Solution:
First arrange in alphabetical order

i.e., ADMNOY
Q26: The total number of three-digit numbers, divisible by 3, which can be formed using
the digits 1, 3, 5 8, if repetition of digits is allowed, is
(A) 22
(B) 21
(C) 20
(D) 18
Q26: The total number of three-digit numbers, divisible by 3, which can be formed using
the digits 1, 3, 5 8, if repetition of digits is allowed, is
(A) 22
(B) 21
(C) 20
(D) 18
Solution:
Total number

PNC 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PNC 2

Uploaded by

Copyright:

Available Formats

1/15/24, 12:06 AM Vedantu Tools Dashboard

Q3: The largest natural number such that divide is ______.

Q3: The largest natural number such that divide is ______.

Q4: Let and . Total number of onto functions

Q4: Let and . Total number of onto functions

Total no. of onto function provided

Therefore total persons = 16

Q6: The number of permutations, of the digits without repetition, which

Q6: The number of permutations, of the digits without repetition, which

(neither string 153 nor string 2467)

Sum of digits of unit place

Q9: Let and Then the number of function

Q9: Let and Then the number of function

Sum of first two digits

7 boys can be seated in 6! Ways

Q19: Let and . Then the number of elements in the

Q19: Let and . Then the number of elements in the

The number of ways

Total no. of solution

Q22: Let and . Let R be a relation defined on

Q22: Let and . Let R be a relation defined on

First arrange in alphabetical order

You might also like