In a city, there are four local trains, Train 1, Train 2, Train 3 and Train 4, that travel between four

stations, A, B, C, and
D, which are, in that order, in a circle such that each train travels from A to B, B to C, C to D, and D to A. Each train
always travels with a constant speed and stops at each station for 5 minutes. Further, each train starts its journey
from a different station – Train 1 starts at Station A, Train 2 starts at Station B, Train 3 starts at Station C, and Train 4
starts at Station D. Any train which travels through all the stations once and again reaches its starting station is said to
have completed one round trip. The chart below gives the time taken (in minutes) by each train to travel from one
station to another. The time represented in the graph does not include the duration for which the trains stop at each
station.

Q1. At Station A, a person gets on to Train 1 that started from its initial station at 10:00 am, and on that day, each of the
other three trains started from their respective starting stations 126 minutes after Train 1 started. What is the
approximate earliest time the person can reach Station D provided he can switch trains at any station, if the trains are
present in the same station?

a) 1:46 pm

b) 2:16 pm

c) 1:59 pm

d) 12 noon

Q2. If all the trains start at the same time at their respective stations on a certain day, what is the maximum number of
trains simultaneously present at any station at any point of time before Train 3 completes its first two round trips?

a) 3

b) 2

c) 1

d) 4
Q3. If all the trains start at the same time at their respective stations on a certain day, what is the maximum number of
trains simultaneously present at Station C at any point of time before Train 2 completes its first two round trips?

a) 4

b) 1

c) 2

d) 3

Q4. On a particular day, a person, who wanted to board a train at Station B to travel to Station C, saw a train leave the
station just as he entered Station B but managed to board the very next train to arrive at the station. If all the trains
started at 10:00 AM at their respective stations on that day, what is the minimum time that the person could have
waited in Station B (before boarding a train to Station C), given he boarded a train before 8:00 PM on that day?

a) 15 minutes

b) 12 minutes

c) 6 minutes

d) 36.5 minutes

A war was declared between the kingdoms of two types of ants – type A and type B. In the war, all the 50 ants of A
are in a queue facing all the 60 ants of B which are again in queue. These two queues move towards each other. Every
ant of type A kills every fourth ant of type B that it encounters and every ant of type B kills every seventh ant of type
A that it encounters. Any ant that is killed will be out of the queue. In the war, it is possible that an ant of one of the
two types can kill as well as can be killed by the same ant. The war will be over, once the queues pass each other.

Q5. What is the maximum number of ants that any ant of type B killed in the war?

Q6. How many ants of type A are killed?

Q7. How many ants of type B are alive after the war?

a) 20

b) 10

c) 3

d) 16

Q8. In total, how many ants are killed in the war?

Company XYZ Pvt. Ltd. has six employees P, Q, R, S, T and U who joined in either May or June of 2009 and have
salaries (in Rs.’000 per month) of 20, 12, 25, 15, 18 and 10 (not necessarily in the same order). There are three
departments – Finance, Sales and HR – in the company and two persons in each of the departments.

The following information is also known :

i. P, who does not receive the highest salary, gets a salary which is not less than that of S.

ii. No person who joined in May has a salary greater than that of those who joined in June.

iii. P and T belong to the same department and joined in the same month.

iv. Q and S did not join in the same month.

v. R and U joined in the same month and T joined one month after U.

vi. The sum of the salaries of Q and P is same as the sum of the salaries of R and S.

vii. The sum of the salaries of Q and U is the second least among all possible combinations of the salaries of any two
persons.

viii. The person who gets the least salary in the HR department gets a salary, which is greater than that of the person
who gets the highest salary in the Finance department.

ix. The person who gets the highest salary in the HR department gets a salary which is less than that of the person
who gets the least salary in the Sales department.

Q9. Which of the following persons did not join in June?

a) P

b) T

c) S

d) Q

Q10. The combined salaries of which of the following persons is the least?

a) Q, R

b) S, Q

c) S, R

d) S, U

Q11. Which department does R work in?

a) Sales

b) Finance

c) HR
d) Either Sales or HR

Q12. The number of employees who joined in May and do not work in the sales department is

There are six persons, A, B, C, D, E and F, who together completed tasks 1 to 6, with each person doing some part of
each task. The following graph shows the distribution of the efforts put in by each of the six persons in these six tasks.

Q13. Suppose the given graph was for the work intended to be done, but the persons interchanged their work as
follows: First B and C, then C and D, and then D and E. After this the work is done. Now if task 3 is considered and the six
persons are ranked according to the distribution of work done in the descending order, what is the rank of E?

a) 2

b) 3

c) 4

d) 5

Q14. If for task 4, all persons other than A decide to evenly share their work, what would be the change in the
percentage distribution of work done by E?

a) Reduction of 5.2 percentage points

b) Reduction of 6.4 percentage points

c) Reduction of 7.9 percentage points

d) Reduction of 9.2 percentage points

Q15. Suppose persons B, C and D drop out and the remaining persons redistribute the work of these persons equally
among themselves. Then, across all tasks, who has the maximum share in any task?

a) Person E, task 1

b) Person F, task 5

c) Person E, task 6

d) Person E, task 2

Q16. If F dropped out of all the six tasks and his share of work is equally distributed between C and D, the number of
tasks in which E’s share of work is more than that of C’s share of work is