CAT 2022 Slot 2 DILR Q10

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Routes & Networks
  • Medium
  • Multiple choice
  • CAT_2022_SLOT2_DILR_Q10

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 10

If Ahmednagar is not the first location to be visited in a route and the total route distance is 2929 km, then which of the following is a possible number of widgets delivered on that day?

  1. A

    220

    Answer A in PrepSoc practice
  2. B

    210

    Answer B in PrepSoc practice
  3. C

    200

    Answer C in PrepSoc practice
  4. D

    250

    Answer D in PrepSoc practice

Answer this questionOr tap an option. Opens in practice mode, free, no sign-in.

Show answer and solution

Answer: (B)

210

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 Route of Total Distance 29 km:

• Ahmednagar (AA) is NOT the first location visited.

• BB (max 60) and DD (max 50) can never exceed CC (min 70), so CC must be the first location visited!

• Starting leg: W→C=12W \to C = 12 km.

• Remaining distance to visit the other 3 locations =29−12=17= 29 - 12 = 17 km.

• Paths from CC to visit B,A,DB, A, D:

• Direct road $C \to B = 4$ km.

• Direct road $B \to A = 6$ km.

• Path from $A \to D$ (via $W$) $= 5 + 2 = 7$ km.

• Sum $= 4 + 6 + 7 = 17$ km!

• Thus, the unique valid route order is:

$$W \to C \to B \to A \to D$$

• Determining Compatible Demands:

• For the sequence to be C→B→A→DC \to B \to A \to D, demands must satisfy:

$$\text{Demand}(C) \ge \text{Demand}(B) > \text{Demand}(A) > \text{Demand}(D)$$

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

• To maintain B>A>DB > A > D, we must have:

$$B = 60, \quad A = 50, \quad D = 30$$

• Since C≥B=60C \ge B = 60, CC can be either 70 or 100.

• Evaluating Total Widgets Delivered:

• If C=70C = 70: Total=70+60+50+30=210\text{Total} = 70 + 60 + 50 + 30 = 210 units.

• If C=100C = 100: Total=100+60+50+30=240\text{Total} = 100 + 60 + 50 + 30 = 240 units.

• Among the options {220,210,200,250}\{220, 210, 200, 250\}, 210 is a valid possibility.

• Option Matching:

• Matches Option 2 (210).

Topper Take

• Distance Decomposition: Remaining 17 km from C is uniquely C→B(4)+B→A(6)+A→D(7)C \to B (4) + B \to A (6) + A \to D (7). This forces B=60,A=50,D=30B=60, A=50, D=30. Total with C=70C=70 is 70+60+50+30=21070+60+50+30=210.

Other questions in this set

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

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