BASARA SARASWATHI BHAVAN_MDP N-120

Sec: SC-60 JI1 Complex numbers Date: 06–06-2020

--------------------------------------------------------------------------------------------
SINGLE ANSWER TYPE
1. The number of ways in which 5 identical balls can be kept in 10 identical boxes, if not
more than one can go into a box, is
10 
A) 10P5 B)   C) 5 D) 1
5
2. Total number of ways in which 256 identical balls can be placed in 16 numbered boxes
(1, 2, 3,.,16) such that rth box contains at least r balls is (1 ≤ r ≤ 16)
A) 120C15 B) 135C15 C) 256C15 D) 255C15
MULTIPLE ANSWER TYPE
3. If n is the number of positive integral solutions of x1x 2 x 3 x 4 = 210 . Then
A) n must be divisible by 3 distinct primes
B) n must be a perfect square
C) n must be a perfect 4th power
D) n must be a perfect 8th power
4. A is a set containing n elements. A subset P1 of A is chosen. The set A is reconstructed
by replacing the elements of P1 . Next a subset P2 of A is chosen and again the set is
reconstructed by replacing the elements of P2 . In this way m (  1) subsets P1,P2 ,...Pm so
that Pi  Pj =  for i  j , is
n
A) ( m + 1)n B) 2m − mCn C)  m Ck mk D) (2m − 1)n
k =0

5. Let A = 1, 2, 3 and B = 1, 2, 3, 4, 5, 6, 7 . Among all the functions from among all the
functions from A to B, the number of functions f such that
A) f ( i )  f ( i ) whenever i  j , is 35 B) f ( i )  f ( j) whenever i  j , is 84
C) f ( i )  f ( j) whenever i  j is 35 D) f ( i )  f ( i ) whenever i  j , is 30
6. Thirteen persons are sitting in a row. Number of ways in which four persons can be
selected so that no two of them are consecutive is equal to ____
a) number of ways in which all the letters of the word “M A R R I A G E” are
permutated if no two vowels are never together.
b) number of numbers lying between 100 and 1000 using only the digits 1,2,3,4,5,6,7
without repetition.
c) number of ways in which 4 alike chocolates can be distributed among 10 children
so that each child getting at most one chocolate.
d) number of triangles can be formed by joining 12 points in a plane, of which 5 are
collinear
7. Consider the following statements.
(i) In a 12 storeyed house, 10 people enter the lift cabin at ground floor. It is known that
they will leave lift in groups of particular 2, 3 and 5 people at different storey. The
 number of ways this can be done if the lift does not stop at first and second floors is
720.
(ii) Each of three ladies have brought their one child for admission to a school. The
principal wants to interview the six persons one by one, subject to the condition that no
mother is interviewed before her child. The number of ways in which interviews can be
arranged is 90.
(iii) The number of ways in which one can put three balls numbered 1, 2, 3 in three
boxes labelled a, b, c such that at most one box is empty is equal to 18.
(iv) A box contains 5 different red balls and 6 different white balls. The total number of
ways in which 4 ball can be selected, taking atleast 1 ball of each colour is 310.
(A) statements (i), (ii) are correct. (B) statements (ii) and (iv) are correct.
(C) statements (i) and (iii) are correct. (D) All statements are correct.
8. A fair coin is tossed n times. Let an denotes the no. of cases in which no two heads occur
consecutively, then
(A) a1 = 2 (B) a2 = 3
(C) a5 = 14 (D) a8 = 55
PASSAGE-1
Players P1,P2 ,P3 ,...,P16 take part in a tennis tournament lower suffix player is better than
any higher suffix player. These are to be divide into 4 groups each comprising of 4
players and the best from each group is selected for semifinals.

9. Number of ways in which 16 players can be divided into 4 equal groups, is

35 8 35 8 35 8 35 8
A)  ( 2r − 1)
27 r =1
B)  ( 2r − 1)
24 r =1
C)  ( 2r − 1)
52 r =1
D)  ( 2r − 1)
6 r =1

10. Number of ways in which they can be divided into 4 equal groups, if the players
P1,P2 ,P3 ,P4 are in different groups, is
(11) ! (11) ! (11) ! (11) !
A) B) C) D)
36 72 108 216
11. Number of ways in which these 16 players can be divided into four equal groups such
12!
that when the best player is selected from each group P6 is one of them, is ( k )  .
( 4!)
3

The value of k, is
A) 36 B) 24 C) 18 D) 20
PASSAGE-2
There are three pots and four coins. All these coins are to be distributed into these pots
where any pot can contains any number of coins.
12. In how many ways all these coins can be distributed if all coins are identical but all pots
are different?
A) 15 B) 16 C) 17 D) 81
13. In how many ways all these coins can be distributed if all coins are different but all pots
are identical?
A) 14 B) 21 C) 27 D) 16
14. In how many ways all these coins can be distributed such that no pot is empty if all
coins are different but all pots are identical?
A) 16 B) 6 C) 42 D) 21
15. In how many ways all these coins can be distributed if all coins are identical and two
pots are also identical?
A) 1 B) 10 C) 9 D) 11
PASSAGE-3
Let f ( n ) denotes the number of different ways the positive integer n can be expressed as
the sum of 1’s and 2’s. For example f ( 4 ) = 5
i.e., 4 = 1 +1 +1 +1 +1 = 1 +1 + 2 = 1 + 2 +1 = 2 +1 +1 = 2 + 2

16. The value of f ( 6 ) is

A) 10 B) 13 C) 16 D) 19
17. The value of f ( f (6)) is
A) 356 B) 377 C) 389 D) 427
18. The number of solutions of the equation f ( n ) = n , where n  N is
A) 1 B) 2 C) 3 D) 4
PASSAGE-4
10-digit numbers are formed by using all the digits 0,1,2,3,4,5,6,7,8 and 9 such that they
are divisible by 11111.
19. The digit in the ten’s place, in the smallest of such numbers, is
A) 9 B) 8 C) 6 D) 7
20. The digit in the unit’s place, in the greatest of such numbers, is
A) 2 B) 3 C) 4 D) 1
21. The total number of such numbers is
A) 3456 B) 5634 C) 6543 D) 4365
PASSAGE-5
A is a set containing n elements. A subset S1 of A is chosen. The set A is reconstructed by
replacing the elements of S1. Again, a subset S2 of A is chosen and again the set is reconstructed
by replacing the elements of S2. The number of ways of choosing S1 or S2 where

22. S1 and S2 have one element common is

(A) 3n–1 (B) n . 3n–1
(C) 2n–1 (D) n
23. S1  S2 = A is
(A) 3n (B) n . 3n
(C) 4n (D) 4n–1
24. S1 is a subset of S2 is
(A) 4n–1 (B) 3n + 1
 (C) 4n (D) 3n
PASSAGE-6
If a set A has n elements then the number of subsets of A containing exactly r elements is
n
C r . The number of all subsets of A is 2n. Now answer the following questions. A set
A has 7 elements. A subset P of A is selected. After noting the elements they are placed
back in A. Again subset Q is selected. Then the number of ways of selecting P and Q
such that
25. P, Q have no common element is
A) 2835 B) 128 C) 3432 D) 2187
26. P and Q have exactly 3 elements is common is
A) 2835 B) 128 C) 3432 D) 2187
27. P and Q have equal number of elements is (P and Q may be null sets)
A) 2835 B) 128 C) 3432 D) 2187
PASSAGE-7
Two numbers x and y are drawn without replacement from the set of the first 15 natural
numbers. The number of ways of drawing them such that
28. x 3 + y 3 is divisible by 3

A) 21 B) 33 C) 35 D) 69
29. x 2 − y 2 is divisible by 5

A) 21 B) 33 C) 35 D) 69
30. x 4 − y 4 is divisible by 5

A) 57 B) 64 C) 69 D) 72
PASSAGE-8
A square of n units by n units is divided into n2 squares each of area 1 sq. unit, by
horizontal and vertical lines.
31. Total no. of shortest ways to reach from the corner to opposite corner along horizontal
and vertical of square, equal to
2n! 2 ( n + 1)!
(A) (B)
n!n! n!n!

( 2n + 2 )! ( 2n + 2 )!
(C) (D)
( n + 1)!( n + 1)! ( n + 1)!( n − 1)!

32. No. of ways in which four points out of total points formed by intersection of
horizontal and vertical lines, can be selected to form a square is
 n 2 ( n + 1) n ( n + 1)
2 2

(A) (B)
2 2

n 2 ( n + 1) n ( n + 1)
(C) (D)
2 2

33. No. of squares having its sides horizontal are

(A)  n3 (B)  n

(C)  n2 (D)  n4
PASSAGE-9
If x1 + x2 + x3 ….. + xr = n
Then number of solutions of equation n + r – 1Cn when xi are (i = 1, 2, 3 …. r) non-negative
integers and n – 1Cr – 1 when xi are (i = 1, 2, 3 …. r) positive integers

34. If a, b, c be three natural numbers in A.P. then number of solution of a + b + c = 21 is

(A) 15 (B) 14
(C) 13 (D) 16
35. Number of ways of distributing 22, identical toys among 4 children when each child
must get odd number of toys is equal to
(A)8c3 (B) 12c9
(C) 21c3 (D) 25c22
PASSAGE-10
D1,D2,-----,D1000 are 1000 doors and P1, P2,-------P1000 are 1000 persons. Initially all the
doors are closed. P1 opens all the doors. Then, P2 closes D2,D4, D6---- D998, D1000. Then
P3 changes the status of
D3,D6, D9, D12,-----etc.(doors having numbers which are multiples of 3). Changing the
status of a door means closing it if it is open and opening it if it is closed. Then P4
changes the status of D4,D8, D12, D16,-----etc (doors having numbers which are
multiples of 4). And so on until lastly P1000 changes the status of D1000.
36. Finally, how many doors are open?
a) 30 b) 31 c) 32 d) 33
37. What is the greatest number of consecutive doors that are closed finally?
a) 56 b) 58 c) 60 d) 62
38. The door having the greatest number that is finally open is
a) D960 b) D961 c) D962 d) D963
PASSAGE-11
The sides of a triangle a, b, c be positive integers and given a  b  c . If c is given,
then
39. The number of triangle that can be formed when c is odd are _____
( c + 1)
2
3c − 1 1 1
a) b) c) c (c + 2) d) ( 3c − 2 )
4 2 4 2
40. The number of triangle that can be formed when c is even are ______
( c + 1)
2
3c − 1 1 1
a) b) c) c (c + 2) d) ( 3c − 2 )
4 2 4 2
41. The no.of isosceles or equletent triangle that can be formed when c is odd is ____
( c + 1)
2
3c − 1 1 1
a) b) c) c (c + 2) d) ( 3c − 2 )
4 2 4 2
PASSAGE-12
There are ‘n’ intermediate stations on a railway line from one terminus to another. In
how many ways can the train stop at 3 of these intermediate stations, if
42. All the three stations are consecutive
a) (n + 2) b) (n + 1) c) (n – 1) d) (n – 2)
43. Atleast two of the stations are consecutive
a) (n + 2) (n - 1) b) (n – 2) (n – 1) c) (n – 2)2 d) None
44. No two of these stations are consecutive
( n − 2 )( n − 3)
a) nc b) ( n − 2 )c c) d) none
3 3 6

PASSAGE-13

A = {a 1 , a2 ,.....an } , A  A = ( a i , a j ) ; a i , a j A,1  i, j  n 
A * A = {ai , a j }: ai , a j A,1  i, j  n
45. Number of functions defined form A A → A
b) n ( n −1) c) n( n +1)
2 2 2

a) n n d) n2n
46. Number of functions defined from A * A → A
( n +1)2 n2 n ( n +1) n ( n −1)

a) n 2
b) n 2
c) n d) n 2
2

PASSAGE-14
For a finite set A, let A denote the number of elements in the Set A. Also Let F denote
the set of all functions f : 1, 2,...., n → 1, 2,..., k , ( n  3, k  2) satisfying f ( i )  f (i + 1) for
every i , 1  j  n − 1
47. F =
a) k n ( k −1) b) k ( k − 1) c) k n−1 ( k −1) d) k ( k − 1)
n n −1

48. If c ( n, k ) denote the number of functions in F satisfying f ( n)  f (1) , then for

n  4, C ( n, k )
a) k ( k −1) − c ( n −1, k ) b) k ( k −1) − c ( n −1, k −1)
n −1 n

c) k n−1 ( k −1) − c ( n − 1, k ) d) k n ( k −1) − c ( n −1, k )

n

49. For n  k , c ( n, k ) , where c ( n, k ) has the same meaning as in question no.37, equals.
a) k n + ( −1) ( k − 1) b) ( k − 1) + ( −1) ( k − 1)
n n n −1

c) ( k − 1) + ( −1) ( k − 1) d) k n + ( −1) ( k − 1)
n n n −1

PASSAGE-15
Let  = ( a1, a2 , a3 ,..........., an ) be a given arrangement of n distinct objects
a1 , a2 , a3 ,..........., an . A derangement of  is an arrangement of these n objects in which
 none of the objects occupies its original position. Let Dn be the number of
derangements of the permutation  .
50. 16. Dn is equal to
a) ( n −1) Dn−1 + Dn−2 b) Dn−1 + ( n −1) Dn−2
c) n ( Dn−1 + Dn−2 ) d) ( n −1)( Dn−1 + Dn−2 )
51. The relation between Dn and Dn-1 is given by
a) Dn − nDn−1 = ( −1) b) Dn − ( n − 1) Dn−1 = ( −1)
n n −1

c) Dn − nDn−1 = ( −1) d) Dn − Dn−1 = ( −1)

n −1 n −1

52. There are 5 different colour balls and 5 boxes of colours same as those of the balls.
The number of ways in which one can place the balls into the boxes, one each in a
box, so that no ball goes to a box of its own colour is
a) 40 b) 44 c) 45 d) 60
INTEGER TYPE
53. If f : a1,a 2 ,a 3 ,a 4 ,a 5  → a1,a 2 ,a 3 ,a 4 ,a 5 ,f is onto and f ( x )  x for each
k
x  a1,a 2 ,a 3 ,a 4 ,a 5  , is equal to k, then is
11
54. The number of onto functions f from the set {1, 2, 3, 4, 5} to the set , , ,  such that
f −1 (  ) = 2 is a number, sum of whose digits is
MATRIX MATCHING TYPE

55.
Column – I Column –
II
A) Number of ways in which 5 different books are P) 2520
distributed among 3 students
B) Number of ways in which 5 different books are Q) 21
divided in 3 sets
C) Number of ways in which 5 distinct books can be R) 25
arranged in 3 almirahs
D) Number of ways in which 5 identical books are S) 243
distributed among 3 persons

56.
Column – I Column – II
A) If n be the number of ways in which 12 different P) 4
books can be distributed equally among 3 persons
( 4!) n
4

then is divisible by
12!
B) If n be the number of ways in which 12 Q) 6
different things can be distributed in three
( 4!) ( 3!) n
3 2

groups. Then is divisible by

12!
C) If n be the number of ways in which 12 R) 12
different things can be distributed in 5 sets
 ( 3!) ( 2!)
3 4
5!
of 2,2,2,3,3 things. Then n is divisible
12!
by
D) The number of ways in which 12 balls can be S) 24
divided between two friends, one receiving 8 and
11! . k
the other 4, is , then k is divisible by
8!4!
T) 30

SUBJECTIVE TYPE
57. Find the number of isosceles triangles whose sides does not exceed 2c unit.
58. Determine the maximum among all number obtained by deleting 100 digits from the
number
12345678910111213 . . . . . 99100,
Whose digits are the integers 1 through 100 in order from left to right.
KEY
1 D 2 B 3 BCD 4 AC 5 ABC 6 BCD 7 AB 8 ABD
9 A 10 C 11 D 12 A 13 A 14 B 15 C 16 B
17 B 18 B 19 C 20 C 21 A 22 A 23 A 24 B
25 D 26 A 27 C 28 C 29 B 30 C 31 A 32 C
33 C 34 C 35 B 36 B 37 C 38 B 39 A 40 C
41 B 42 D 43 C 44 B 45 A 46 CD 47 D 48 A
49 C 50 D 51 A 52 B 53 4 54 9

55. A–s;B–r;C–p;D–q

56. A – PQRS ; B – Q ; C – PQRST ; D – PQRS

57. 3c 2 58. 9999978596061……..99100