PERCENTILE CLASSES

LR- 02
A significant amount of traffic flows from point S to point T in the one-way street network shown below. Points A, B, C, and D are
junctions in the network, and the arrows mark the direction of traffic flow. The fuel cost in rupees for travelling along a street is
indicated by the number adjacent to the arrow representing the street. Motorists travelling from point S to point T would obviously
take the route for which the total cost of travelling is the minimum. If two or more routes have the same least travel cost, then
motorists are indifferent between them. Hence, the traffic gets evenly distributed among all the least cost routes. The government
can control the flow of traffic only by levying appropriate toll at each junction. For example, if a motorist takes the route S-A-T (using
junction A alone), then the total cost of travel would be Rs. 14 (i.e. Rs. 9 + Rs. 5) plus the toll charged at junction A.

1. If the government wants to ensure that all motorists travelling from S to T pay the same amount (fuel costs and toll combined)
regardless of the route they choose and the street from B to C is under repairs (and hence unusable), then a feasible set of toll
charged (in rupees) at junctions A, B, C, and D respectively to achieve this goal is:
A. 2, 5, 3, 2 B. 0, 5, 3, 1 C. 1, 5, 3, 2 D. 2, 3, 5, 1 E. 1, 3, 5, 1

2. If the government wants to ensure that no traffic flows on the street from D to T, while equal amount of traffic flows through
junctions A and C, then a feasible set of toll charged (in rupees) at junctions A, B, C, and D respectively to achieve this goal is:
A. 1, 5, 3, 3 B. 1, 4, 4, 3 C. 1, 5, 4, 2 D. 0, 5, 2, 3 E. 0, 5, 2, 2

3. If the government wants to ensure that all routes from S to T get the same amount of traffic, then a feasible set of toll charged (in
rupees) at junctions A, B, C, and D respectively to achieve this goal is:
A. 0, 5, 2, 2 B. 0, 5, 4, 4 C. 1, 5, 3, 3 D. 1, 5, 3, 2 E. 1, 5, 4, 2

4. If the government wants to ensure that the traffic at S gets evenly distributed along streets from S to A, from S to B, and from S to
D, then a feasible set of toll charged (in rupees) at junctions A, B, C, and D respectively to achieve this goal is:
A. 0, 5, 4, 1 B. 0, 5, 2, 2 C. 1, 5, 3, 3 D. 1, 5, 3, 2 E, 0, 4, 3, 2

5. The government wants to devise a toll policy such that the total cost to the commuters per trip is minimized. The policy should also
ensure that not more than 70% per cent of the total traffic passes through junction B. The cost incurred by the commuter travelling
from point S to point T under this policy will be:
A. Rs. 7 B. Rs. 9 C. Rs. 10 D. Rs. 13 E. Rs. 14

In the table below is the listing of players, seeded from highest (#1) to lowest (#32), who are due to play in an Association of
Tennis Players (ATP) tournament for women. This tournament has four knockout rounds before the final, i.e., first round, second
round, quarterfinals, and semi-finals. In the first round, the highest seeded player plays the lowest seeded player (seed # 32)
which is designated match No. 1 of first round; the 2nd seeded player plays the 31st seeded player which is designated match No.
2 of the first round, and so on. Thus, for instance, match No. 16 of first round is to be played between 16th seeded player and the
17th seeded player. In the second round, the winner of match No. 1 of-first round plays the winner of match No. 16 of first round
and is designated match No. I of second round. Similarly, the winner of match No, 2 of first round plays the winner of match No.

1|Page

NO SUBSTITUTE TO HARDWORK
9893123047
15 of first round, and is designated match No. 2 of second round. Thus, for instance, match No. 8 of the second round is to be
played between the winner of match No. 8 of first round and the winner of match No. 9 of first
round. The same pattern is followed for later rounds as well.

Seed (#) Name of Player Seed (#) Name of Player Seed (#) Name of Player
1 Mario Sharapova 12 Mary Pierce 23 Silvia Farina Elia
2 Lindsay Davenport 13 Anastasia Myskina 24 Tatiana Golovin
3 Amelie Mauresmo 14 Alicia Molik 25 Shinobu Asagoe
4 Kim Clijsters 15 Nathalie Dechy 26 Francesca Schiavone
5 Svetlana Kuznetsova 16 Elina Bovina 27 Nicole Vaidisova
6 Elena Dementieva 17 Jelena Jankovic 28 Gisela Dulko
7 Justine Henin 18 Ana Ivanovic 29 Flavia Pennetta
8 Serena Williams 19 Vera Zvonareva 30 Anna Chakvetadze
9 Nadia Petrova 20 Elena Likhovtseva 31 Ai Sugiyama
10 Venus Williams 21 Daniela Hantuchova 32 Anna-Lena Groenefeld
11 Patty Schnyder 22 Dinara Safina    

6. If there are no upsets (a lower seeded player beating a higher seeded player) in the first round, and only match Nos. 6, 7, and 8 of
the second round result in
upsets, then who would meet Lindsay Davenport in quarter finals, in case Davenport reaches quarter finals?
A. (1)Justine Henin
B. (2) Nadia Petrova
C. (3) Patty Schnyder
D. (4) Venus Williams

7. If Elena Dementieva and Serena Williams lose in the second round, while Justine Henin and Nadia Petrova make it to the
semifinals, then who would play Maria
Sharapova in the quarterfinals, in the event Sharapova reaches quarterfinals?
A. Dinara Safina
B. (2)Justine Henin
C. Nadia Petrova
D. Patty Schnyder

8. If, in the first round, all even numbered matches (and none of the odd numbered ones) result in upsets, and there are no upsets in
the second round, then who
could be the lowest seeded player facing Maria Sharapova in semi-finals?
A. Anastasia Myskina
B. Flavia Pennetta
C. Nadia Petrova
D. Svetlana Kuznetsova

9. If the top eight seeds make it to the quarterfinals, then who, amongst the players listed below, would definitely not play against
Maria Sharapova in the final, in
case Sharapova reaches the final?
A. Amelie Mauresmo
B. Elena Dementieva
C. Kim Clijsters
D. Lindsay Davenport

2|Page

NO SUBSTITUTE TO HARDWORK
9893123047
In a sports event, six teams (A, B, C, D, E and F) are competing against each other. Matches are scheduled in two stages. Each team
plays three matches in Stage-I and two matches in Stage-II. No team plays against the same team more than once in the event. No
ties are permitted in any of the matches. The observations after the completion of Stage-I and Stage-II are as given below.
Stage-I:
> One team won all the three matches. > Two teams lost all the matches. > D lost to A but won against C and F.
> E lost to B but won against C and F. > B lost at least one match. > F did not play against the top team of
Stage-I.
Stage-II:
>The leader of Stage-I lost the next two matches.
>Of the two teams at the bottom after Stage-I, one team won both matches, while the other lost both matches.
>One more team lost both matches in Stage-II.

10. The team(s) with the most wins in the event is (are): 12. The only team(s) that won both the matches in Stage-II is
A. A (are):
B. A & C A. B
C. F B. E & F
D. E C. A, E & F
E. B & E D. B, E & F
E. B & F
11. The two teams that defeated the leader of Stage-I are:
A. F & D 13. The teams that won exactly two matches in the event are:
B. E & F A. A, D & F
C. B & D B. D & E
D. E & D C. E & F
E. F & D D. D, E & F
E. D & F

Kuki, Kukoo, Kukad, Kokki and Kook are five hens. Initially they had 1, 2, 3, 4, 5 eggs, not necessarily in that order. They laid 1, 2, 3,
4, 5 eggs and finally had 4, 5, 6, 7, 8 eggs in the end. None of the hens started with same number of eggs. None of them laid the
same number of eggs and none finally had the same number of eggs. Each of the hens started with at least one egg and also laid
atleast one egg. Further information regarding them is given.
- Kokki had 2 eggs at the start and 7 eggs at the end. - Kukoo laid 3 eggs and did not end in 8 eggs.
- Kook did not lay 1 egg or 2 eggs. - Kuki ended with the number of eggs Kukad started

24. How many eggs did the hen started with 3 eggs lay?
A. 1 B. 2 C. 3 D. 4

25. How many eggs did the hen that ended with 6 eggs lay?
A. 1 B. 2 C. 3 D. 4

26. What was the name of the hen that laid 1 egg?
A. Kuki B. Kukko C. Kukad D. Cannot be determined

27. The hen that ended with maximum number of eggs started with…….number of eggs.
A. 1 B. 3 C. 4 D. 5

3|Page

NO SUBSTITUTE TO HARDWORK
9893123047
ANSWERS
3 D 10 E 15 D
4 A 11 B 16 C
5 C 12 D 17 B
6 D 13 E

7 C

1 B, C 8 A

2 E 9 C 14 C

Answer 24: Option B Answer 25: Option A Answer 26: Option C Answer 27: Option C

4|Page

NO SUBSTITUTE TO HARDWORK
9893123047