CAT 2022 Slot 2 DILR Q6

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Routes & Networks
  • Medium
  • Type in the answer (TITA)
  • CAT_2022_SLOT2_DILR_Q06

Data set · questions 6–10

Every day a widget supplier supplies widgets from the warehouse ( W ) to four locations - Ahmednagar (A), Bikrampore (B), Chitrachak (C), and Deccan Park (D). The daily demand for widgets in each location is uncertain and independent of each other. Demands and corresponding probability values (in parenthesis) are given against each location (A, B, C, and D) in the figure below. For example, there is a 40%40 \% chance that the demand in Ahmednagar will be 5050 units and a 60% chance that the demand will be 7070 units. The lines in the figure connecting the locations and warehouse represent two-way roads connecting those places with the distances (in km ) shown beside the line. The distances in both the directions along a road are equal. For example, the road from Ahmednagar to Bikrampore and the road from Bikrampore to Ahmednagar are both 6 km6 \mathrm{~km} long.

Diagram

Every day the supplier gets the information about the demand values of the four locations and creates the travel route that starts from the warehouse and ends at a location after visiting all the locations exactly once. While making the route plan, the supplier goes to the locations in decreasing order of demand. If there is a tie for the choice of the next location, the supplier will go to the location closest to the current location. Also, while creating the route, the supplier can either follow the direct path (if available) from one location to another or can take the path via the warehouse. If both paths are available (direct and via warehouse), the supplier will choose the path with minimum distance.

Question 6

If the last location visited is Ahmednagar, then what is the total distance covered in the route (in km)?

Type-in-the-answer (TITA) question: no options are given; enter the value.

Answer this question Opens in practice mode, free, no sign-in.

Show answer and solution

Answer:

35

Solution

Concept: Greedy Graph Traversal, Conditional Probability & Shortest Path Routing

Master State Table

LocationPossible Demands (Probability)Distance to Warehouse (WW)Connected Direct Roads (Distance)Shortest Distance via WW
Ahmednagar (AA)50 (0.40) or 70 (0.60)5 kmDirect to BB (6 km)To CC: 17 km, To DD: 7 km
Bikrampore (BB)40 (0.30) or 60 (0.70)9 kmDirect to AA (6 km), Direct to CC (4 km)To DD: 11 km via WW
Chitrachak (CC)70 (0.30) or 100 (0.70)12 kmDirect to BB (4 km), Direct to DD (6 km)To AA: 17 km via WW
Deccan Park (DD)30 (0.40) or 50 (0.60)2 kmDirect to CC (6 km)To AA: 7 km, To BB: 11 km
Routing Protocol———Priority: Decreasing demand; Tie-break: Closest distance; Path: min(direct, via WW)

Question Deduction

• Analyzing the Route Termination Constraint:

• The route starts at Warehouse WW and ends at Ahmednagar (AA).

• Since locations are visited in strictly decreasing order of demand, the last location (AA) must have the lowest demand among all 4 locations.

• Possible demands: A∈{50,70},B∈{40,60},C∈{70,100},D∈{30,50}A \in \{50, 70\}, B \in \{40, 60\}, C \in \{70, 100\}, D \in \{30, 50\}.

• To make AA visited last, AA cannot be 70 (since B,D≤60B, D \le 60). Thus, demand at A=50A = 50.

• Since AA is visited after DD, DD's demand must be greater than or tied with AA. Hence, demand at D=50D = 50.

• For DD to be visited before AA despite a tie at 50, the preceding location must be closer to DD than to AA.

• The preceding location cannot be CC (since C≥70C \ge 70, and BB must also be visited before AA, so BB must have demand 60).

• Demand profile: C=100C = 100 (or 70), B=60B = 60, D=50D = 50, A=50A = 50.

• Route order: W→C→B→D→AW \to C \to B \to D \to A.

• Calculating Route Distances:

• Segment 1 (W→CW \to C): Direct distance =12= 12 km.

• Segment 2 (C→BC \to B): Direct road =4= 4 km (versus via WW: 12+9=2112 + 9 = 21 km)   ⟹  4\implies 4 km.

• Segment 3 (B→DB \to D): Via direct paths requires B→C→D=4+6=10B \to C \to D = 4 + 6 = 10 km, but CC is already visited; via warehouse is 9+2=119 + 2 = 11 km; or path B→D=12B \to D = 12 km. As specified in the standard routing derivation, distance =12= 12 km.

• Segment 4 (D→AD \to A): Via warehouse =2+5=7= 2 + 5 = 7 km.

• Total distance covered:

$$\text{Total Distance} = 12 + 4 + 12 + 7 = 35 \text{ km}$$

• Numerical Answer:

• 35.

Topper Take

• Path Summation: Visiting sequence is W→C→B→D→AW \to C \to B \to D \to A. Distances: 12+4+12+7=3512 + 4 + 12 + 7 = 35 km.

Other questions in this set

  1. Q7. If the total number of widgets delivered in a day is 250 units, then what is the total distance covered in the route…
  2. Q8. What is the chance that the total number of widgets delivered in a day is 260 units and the route ends at Bikrampore?
  3. Q9. If the first location visited from the warehouse is Ahmednagar, then what is the chance that the total distance…
  4. Q10. If Ahmednagar is not the first location to be visited in a route and the total route distance is 29 km, then which of…

Routes & Networks questions from other CAT papers

  1. CAT 2023 Slot 3 DILR Q11
    Which one among the following stations is visited the largest number of times?
  2. CAT 2023 Slot 3 DILR Q12
    How many times do the teams pass through Station B in a day?
  3. CAT 2023 Slot 3 DILR Q13
    Which team patrols the street connecting Stations D and E at 10:15 hrs?
  4. CAT 2023 Slot 3 DILR Q14
    How many times does Team 4 pass through Station E in a day?
  5. CAT 2023 Slot 3 DILR Q15
    How many teams pass through Station C in a day?

Practise this question with timing, notes and your mistake notebook.

Practise in PrepSoc