Wednesday, January 12, 2011
0
16.
Fermat’s Last Theorem is a statement in number theory which states that it is impossible to separate any power higher than the second into two like powers, or, more precisely- If an integer n is greater than 2, then the equation a^n b^n = c^n has no solutions in non-zero integers a, b, and c. Now, if the difference of any two numbers is 9 and their product is 17, what is the sum of their squares?
a.43
b.45
c.98
d.115
ANS: d
17 .India with a burgeoning population and a plethora of vehicles (at last count there were more than 20 million of them) has witnessed big traffic jams at all major cities. Children often hone their counting skills by adding the wheels of vehicles in schoolyards or bus depots and guessing the number of vehicles.
Alok, one such child, finds only bicycles and 4 wheeled wagons in his schoolyard. He counts the totalnumber of wheels to be 46. What could be the possible number of bicycles?
a.25
b.5
c.4 d.8
ANS: b
18.
Given a collection of points P in the plane, a 1-set is a point in P that can be separated from the rest by a line; i.e. the point lies on one side of the line while the others lie on the other side. The number of 1-sets of P is denoted by n1(P). The maximum value of n1(P) over all configurations P of 19 points in the plane is
a.10
b.9
c.3
d.5
ans:a the maximum value is 19,as it is not given it is 10
19.Both A and B Alice and Bob play the following chip-off-the-table game. Given a pile of 58 chips, Alice first picks at least one chip but not all the chips. In subsequent turns, a player picks at least one chip but no more than the number picked on the previous turn by the opponent. The player to pick the last chip wins. Which of the following is true?
a.In order to win, Alice should pick 14 chips on her first turn.
b.In order to win, Alice should pick two chips on her first turn.
c.In order to win, Alice should pick one chip on her first turn.
ans:b
20.30 teams enter a hockey tournament. A team is out of the tournament if it loses 2 games. What is the maximum number of games to be played to decide one winner?
a.60
b.59
c.61
d.30
e.34
ANS: b
29 teams should have to fail two games, so 29*2=58, the winner loses one game.so 59(58+1)
6VD8D4THBV4P
TAGS:tcs open see same questions tcs open seesame questions tcs openseesamequestions tcs open seesame open seesame questions tcs aptitude questions with answers openseesame tcs tcs placement papers tcs interview questions tcs technical questions
TCS open seesame questions TCS openseesame latest questions open see same
16.
Fermat’s Last Theorem is a statement in number theory which states that it is impossible to separate any power higher than the second into two like powers, or, more precisely- If an integer n is greater than 2, then the equation a^n b^n = c^n has no solutions in non-zero integers a, b, and c. Now, if the difference of any two numbers is 9 and their product is 17, what is the sum of their squares?
a.43
b.45
c.98
d.115
ANS: d
17 .India with a burgeoning population and a plethora of vehicles (at last count there were more than 20 million of them) has witnessed big traffic jams at all major cities. Children often hone their counting skills by adding the wheels of vehicles in schoolyards or bus depots and guessing the number of vehicles.
Alok, one such child, finds only bicycles and 4 wheeled wagons in his schoolyard. He counts the totalnumber of wheels to be 46. What could be the possible number of bicycles?
a.25
b.5
c.4 d.8
ANS: b
18.
Given a collection of points P in the plane, a 1-set is a point in P that can be separated from the rest by a line; i.e. the point lies on one side of the line while the others lie on the other side. The number of 1-sets of P is denoted by n1(P). The maximum value of n1(P) over all configurations P of 19 points in the plane is
a.10
b.9
c.3
d.5
ans:a the maximum value is 19,as it is not given it is 10
19.Both A and B Alice and Bob play the following chip-off-the-table game. Given a pile of 58 chips, Alice first picks at least one chip but not all the chips. In subsequent turns, a player picks at least one chip but no more than the number picked on the previous turn by the opponent. The player to pick the last chip wins. Which of the following is true?
a.In order to win, Alice should pick 14 chips on her first turn.
b.In order to win, Alice should pick two chips on her first turn.
c.In order to win, Alice should pick one chip on her first turn.
ans:b
20.30 teams enter a hockey tournament. A team is out of the tournament if it loses 2 games. What is the maximum number of games to be played to decide one winner?
a.60
b.59
c.61
d.30
e.34
ANS: b
29 teams should have to fail two games, so 29*2=58, the winner loses one game.so 59(58+1)
6VD8D4THBV4P
TAGS:tcs open see same questions tcs open seesame questions tcs openseesamequestions tcs open seesame open seesame questions tcs aptitude questions with answers openseesame tcs tcs placement papers tcs interview questions tcs technical questions
This post was written by: noufel n backer
Subscribe to:
Post Comments (Atom)
0 Responses to “TCS open seesame questions TCS openseesame latest questions open see same”
Post a Comment