Previous year question papers of entrance exam of M.Sc Maths

Will you please share with me the previous year question papers of entrance exam of M.Sc Maths?

[Kiran Chandar]

As you want to get the previous year question papers of entrance exam of M.Sc Maths so here it is for you:

Some content of the file has been given here:

SAMPLE QUESTIONS
Note: For each question there are four suggested answers of which only one is cor-
rect.
1. Let ffn(x)g be a sequence of polynomials de_ned inductively as
f1(x) = (x _ 2)2
fn+1(x) = (fn(x) _ 2)2; n _ 1:
Let an and bn respectively denote the constant term and the coe_cient of x
in fn(x). Then
(A) an = 4, bn = _4n (B) an = 4, bn = _4n2
(C) an = 4(n_1)!, bn = _4n (D) an = 4(n_1)!, bn = _4n2.
2. If a; b are positive real variables whose sum is a constant _, then the minimum
value of p(1 + 1=a)(1 + 1=b) is
(A) _ _ 1=_ (B) _ + 2=_ (C) _ + 1=_ (D) none of the above.
3. Let x be a positive real number. Then
(A) x2 + _2 + x2_ > x_ + (_ + x)x_
(B) x_ + _x > x2_ + _2x
(C) _x + (_ + x)x_ > x2 + _2 + x2_
(D) none of the above.
4. Suppose in a competition 11 matches are to be played, each having one of 3
distinct outcomes as possibilities. The number of ways one can predict the
outcomes of all 11 matches such that exactly 6 of the predictions turn out to
be correct is
(A) _11
6 __ 25 (B) _11
6 _ (C) 36 (D) none of the above.
5. A set contains 2n+1 elements. The number of subsets of the set which contain
at most n elements is
(A) 2n (B) 2n+1 (C) 2n_1 (D) 22n.
6. A club with x members is organized into four committees such that
(a) each member is in exactly two committees,
(b) any two committees have exactly one member in common.
Then x has
(A) exactly two values both between 4 and 8
(B) exactly one value and this lies between 4 and 8
(C) exactly two values both between 8 and 16
(D) exactly one value and this lies between 8 and 16.
7. Let X be the set f1; 2; 3; 4; 5; 6; 7; 8; 9; 10g. De_ne the set R by
R = f(x; y) 2 X_X : x and y have the same remainder when divided by 3g:
Then the number of elements in R is
(A) 40 (B) 36 (C) 34 (D) 33.
8. Let A be a set of n elements. The number of ways, we can choose an ordered
pair (B;C), where B;C are disjoint subsets of A, equals
(A) n2 (B) n3 (C) 2n (D) 3n.








For more detailed information I am uploading PDF files which are free to download: