[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

TCS Aptitude Test Papers

370.25K

Total Qs: 652+

NA
SHSTTON
41
Solv. Corr.
37
Solv. In. Corr.
78
Attempted
0 M:0 S
Avg. Time

11 / 652

3, 15, X, 51, 53,159,161. Find X

A9

B45

C18

D17

Explanation:

15 = 3*5
x = 15 + 2
51 = 17*3
53 = 51+2
159 = 53*3

ShortCut By :: DADI BHARATH SHANKAR

logic
3 (3x5) , (15+2), ( 3x17), ( 51+2), ( 3x53), ( 159+2), (3x161) , ( 483+2)

Tags: TCS

NA
SHSTTON
25
Solv. Corr.
44
Solv. In. Corr.
69
Attempted
0 M:0 S
Avg. Time

12 / 652

Choose the correct option.

A hollow space on earth surface is to be filled. Total cost of filling is Rs20000. The cost of filling per mt3 is Rs 225 .how many times a size of 3 mt3 soil is required to fill the hollow space?

A30

B20

C40

D10

Explanation:

20000/225=88.88
88.88/3=29.62 .So 30 times of 3 mt3 is required to fill the space completely.

Tags: TCS

NA
SHSTTON
25
Solv. Corr.
20
Solv. In. Corr.
45
Attempted
0 M:0 S
Avg. Time

13 / 652

There are different things like p,q,r,s,t,u,v. We can take p and q together. If r and s are taken together then t must has to be taken. u and v can be taken together.v can be taken with p or s. every thing can be taken together except

Ap

Bt

Cv

Ds

| | Topic: Uncategorized| |

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
74
Solv. Corr.
112
Solv. In. Corr.
186
Attempted
0 M:33 S
Avg. Time

14 / 652

Choose the correct option.

There are 11 boys in a family. Youngest child is a boy. Probability is 1 that of all are boys out of?

A2

B2!

C2048

D1024

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
12
Solv. Corr.
18
Solv. In. Corr.
30
Attempted
0 M:0 S
Avg. Time

15 / 652

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 5 points in the plane in general position(.i.e no three points in P lie on a line) is

A3

B5

C2

D1

| | Topic: Uncategorized| |

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
41
Solv. Corr.
124
Solv. In. Corr.
165
Attempted
0 M:56 S
Avg. Time

16 / 652

Choose the correct option.

The citizens of planet nigiet are 8 fingered and have thus developed their decimal system in base 8. A certain street in nigiet contains 1000 (in base 8) buildings numbered 1 to 1000. How many 3s are used in numbering these buildings?

A54

B64

C265

D192

Explanation:

Here is no explanation for this answer

Tags: TCS Wipro NLTH

NA
SHSTTON
3
Solv. Corr.
54
Solv. In. Corr.
57
Attempted
0 M:0 S
Avg. Time

17 / 652

Choose the correct option.

Given 3 lines in the plane such that the points of intersection form a triangle with sides of length 20, 20 and 30, the number of points equidistant from all the 3 lines is

A1

B3

C4

D0

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
36
Solv. Corr.
29
Solv. In. Corr.
65
Attempted
2 M:5 S
Avg. Time

18 / 652

Choose the correct option.

Hare in the other. The hare starts after the tortoise has covered 1/5 of its distance and that too leisurely3. A hare and a tortoise have a race along a circle of 100 yards diameter. The tortoise goes in one direction and the. The hare and tortoise meet when the hare has covered only 1/8 of the distance. By what factor should the hare increase its speed so as to tie the race?

A37.8

B8

C40

D5

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
23
Solv. Corr.
24
Solv. In. Corr.
47
Attempted
0 M:0 S
Avg. Time

19 / 652

Choose the correct option.

Here 10 programers, type 10 lines with in 10 minutes then 60 lines can type within 60 minutes. How many programmers are needed?

A16

B6

C10

D60

Explanation:

Here is no explanation for this answer

Tags: TCS

NA
SHSTTON
12
Solv. Corr.
49
Solv. In. Corr.
61
Attempted
0 M:0 S
Avg. Time

20 / 652

Alice and Bob play the following coins-on-a-stack game. 20 coins are stacked one above the other. One of them is a special (gold) coin and the rest are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack.
Alice starts and the players take turns. A turn consists of moving the coin on the top to a position i below the top coin (0 = i = 20). We will call this an i-move (thus a 0-move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2-move, on subsequent turns neither player can make a 2-move. If the gold coin happens to be on top when it's a player's turn then the player wins the game. Initially, the gold coinis the third coin from the top. Then

AIn order to win, Alice's first move should be a 1-move.

BIn order to win, Alice's first move should be a 0-move.

CIn order to win, Alice's first move can be a 0-move or a 1-move.

DAlice has no winning strategy.

| | Topic: Uncategorized| |