CAT 2022 Slot 2 DILR Q7

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

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 7

If the total number of widgets delivered in a day is 250250 units, 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:

38

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

• Deconstructing Total Delivery of 250 Units:

• Maximum possible demand sum =70(A)+60(B)+100(C)+50(D)=280= 70 (A) + 60 (B) + 100 (C) + 50 (D) = 280 units.

• Given total =250= 250 units, exactly 280−250=30280 - 250 = 30 units must be reduced.

• Reductions from maximum available demands:

• $A$: $70 - 50 = 20$.

• $B$: $60 - 40 = 20$.

• $C$: $100 - 70 = 30$.

• $D$: $50 - 30 = 20$.

• The only way to reduce exactly 30 units is for CC to drop from 100 to 70 units, while A,B,DA, B, D remain at their maximums!

• Realized demands:

$$A = 70, \quad B = 60, \quad C = 70, \quad D = 50$$

• Determining Route Traversal Order:

• Starting from WW, the highest demand is 70, shared by AA and CC (tie).

• Distance from WW to A=5A = 5 km; distance from WW to C=12C = 12 km.

• Tie-break rule: visit closest first   ⟹  \implies visit AA first!

• After AA, the highest remaining demand is C(70)  ⟹  C (70) \implies visit CC.

• After CC, next highest is B(60)  ⟹  B (60) \implies visit BB.

• After BB, next highest is D(50)  ⟹  D (50) \implies visit DD.

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

• Calculating Cumulative Distance:

• W→AW \to A: 5 km.

• A→CA \to C: Via warehouse is 5+12=175 + 12 = 17 km.

• C→BC \to B: Direct road is 4 km.

• B→DB \to D: Distance is 12 km.

• Total distance covered:

$$\text{Total Distance} = 5 + 17 + 4 + 12 = 38 \text{ km}$$

• Numerical Answer:

• 38.

Topper Take

• Unique Drop: 280−250=30  ⟹  C280 - 250 = 30 \implies C is 70 while others are max (A=70,B=60,D=50A=70, B=60, D=50). Distance: W→A(5)+A→C(17)+C→B(4)+B→D(12)=38W \to A (5) + A \to C (17) + C \to B (4) + B \to D (12) = 38 km.

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