#1
3rd January 2018, 12:14 PM
| |||
| |||
TIFR Mock Test Papers
Can you provide me previous year question paper of Computer & Systems Sciences for preparation of Graduate School Admissions (GS) of Tata Institute of Fundamental Research?
|
#2
3rd January 2018, 12:30 PM
| |||
| |||
Re: TIFR Mock Test Papers
Previous year question paper of Computer & Systems Sciences for preparation of Graduate School Admissions (GS) of Tata Institute of Fundamental Research is as follows: Part A: Common Part A suitcase weighs one kilogram plus half of its weight. How much does the suitcase weigh? (a) 1.333... kilograms (b) 1.5 kilograms (c) 1.666... kilograms (d) 2 kilograms (e) cannot be determined from the given data On planet TIFR, the acceleration of an object due to gravity is half that on planet earth. An object on planet earth dropped from a height h takes time t to reach the ground. On planet TIFR, how much time would an object dropped from height h take to reach the ground? (a) t/√2 (b) √2t (c) 2t (d) h/t (e) h/2t In a tutorial on geometrical constructions, the teacher asks a student to construct a right-angled triangle ABC where the hypotenuse BC is 8 inches and the length of the perpendicular dropped from A onto the hypotenuse is h inches, and offers various choices for the value of h. For which value of h can such a triangle NOT exist? (a) 3.90 inches (b) 2√2 inches (c) 2√3 inches (d) 4.1 inches (e) none of the above Consider the following game with two players, Aditi and Bharat. There are n tokens in a bag. The players know n, and take turns removing tokens from the bag. In each turn, a player can either remove one token or two tokens. The player that removes the last token from the bag loses. Assume that Aditi always goes first. Further, we say that a player has a winning strategy if she or he can win the game, no matter what the other player does. Which of the following statements is TRUE? (a) For n = 3, Bharat has a winning strategy. For n = 4, Aditi has a winning strategy (b) For n = 7, Bharat has a winning strategy. For n = 8, Aditi has a winning strategy (c) For both n = 3 and n = 4, Aditi has a winning strategy (d) For both n = 7 and n = 8, Bharat has a winning strategy (e) Bharat never has a winning strategy Question Paper Computer & Systems Sciences Tata Institute of Fundamental Research |