Street Network

-
(CAT 2006)

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 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

2. 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

3. 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

4. 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,1
c. 1,5,3,3
d. 1,5,3,2
e.1,5,4,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


For answers click here

Comments

Post a Comment

Popular posts from this blog

Answers for CAT 2006

-
Formation of Team 1. a 2. c 3. d 4. e 5. e Class X Result 1. c 2. a 3. a 4. d 5. e   Two traders: Chetan and Michael 1. c 2. b 3. a 4. e 5. d   Street Network 1. e 2. b,c 3. a 4. d 5. c
Read more

Two traders: Chetan and Michael

-
(CAT 2006) Two traders, Chetan and Michael, were involved in the buying and selling of MCS shares over five trading days. At the beginning of the first day, the MCS share was priced at Rs 100, while at the end of the fifth day it was priced at Rs 110. At the end of each day, the MCS share price either went up by Rs 10, or else, it came down by Rs 10. Both Chetan and Michael took buying and selling decisions at the end of each trading day. The beginning price of MCS share on a given day was the same as the ending price of the previous day. Chetan and Michael started with the same number of shares and amount of cash, and had enough of both. Below are some additional facts about how Chetan and Michael traded over the five trading days. 1)  Each day if the price went up, Chetan sold 10 shares of MCS at the closing price. On the other hand, each day if the price went down, he bought 10 shares at the closing price. 2)  If on any day, the closing price was above Rs 110, then Michael
Read more

Neighborhood Disease cases

-
(CAT 2022) There are only four neighbourhoods in a city - Levmisto, Tyhrmisto, Pesmisto and Kitmisto. During the onset of a pandemic, the number of new cases of a disease in each of these neighbourhoods was recorded over a period of five days. On each day, the number of new cases recorded in any of the neighbourhoods was either 0, 1, 2 or 3. The following facts are also known: 1. There was at least one new case in every neighbourhood on Day 1. 2. On each of the five days, there were more new cases in Kitmisto than in Pesmisto. 3. The number of new cases in the city in a day kept increasing during the five-day period. The number of new cases on Day 3 was exactly one more than that on Day 2. 4. The maximum number of new cases in a day in Pesmisto was 2, and this happened only once during the five-day period. 5. Kitmisto is the only place to have 3 new cases on Day 2. 6. The total numbers of new cases in Levmisto, Tyhrmisto, Pesmisto and Kitmisto over the five-day period were 12, 12, 5 a
Read more