CAT 2019 Slot 2 DILR Q17

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Optimization
  • Medium
  • Multiple choice
  • CAT_2019_SLOT2_DILR_Q17

Data set · questions 17–20

Three doctors, Dr. Ben, Dr. Kane and Dr. Wayne visit a particular clinic Monday to Saturday to see patients. Dr. Ben sees each patient for 10 minutes and charges Rs. 100/-. Dr. Kane sees each patient for 15 minutes and charges Rs. 200/-, while Dr. Wayne sees each patient for 25 minutes and charges Rs. 300/-.

The clinic has three rooms numbered 1, 2 and 3 which are assigned to the three doctors as per the following table.

Room No.Monday & TuesdayWednesday & ThursdayFriday & Saturday
1BenWayneKane
2KaneBenWayne
3WayneKaneBen

The clinic is open from 9 a.m. to 11.30 a.m. every Monday to Saturday.

On arrival each patient is handed a numbered token indicating their position in the queue, starting with token number 1 every day. As soon as any doctor becomes free, the next patient in the queue enters that emptied room for consultation. If at any time, more than one room is free then the waiting patient enters the room with the smallest number. For example, if the next two patients in the queue have token numbers 7 and 8 and if rooms numbered 1 and 3 are free, then patient with token number 7 enters room number 1 and patient with token number 8 enters room number 3.

Question 17

What is the maximum number of patients that the clinic can cater to on any single day?

  1. A

    30

    Answer A in PrepSoc practice
  2. B

    12

    Answer B in PrepSoc practice
  3. C

    15

    Answer C in PrepSoc practice
  4. D

    31

    Answer D in PrepSoc practice

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

Show answer and solution

Answer: (D)

31

Solution

Concept: Queueing Bottlenecks, Additive Service Capacities & Multi-Server Scheduling

Master State Table

DoctorConsultation Duration (min)Consultation Fee (Rs.)Max Patients (150 min)Max Revenue (Rs.)Room (Mon & Tue)Room (Wed & Thu)Room (Fri & Sat)
Dr. Ben10100151,500Room 1Room 2Room 3
Dr. Kane15200102,000Room 2Room 3Room 1
Dr. Wayne2530061,800Room 3Room 1Room 2
Total / Clinic Capacity——315,300Rooms 1, 2, 3Rooms 1, 2, 3Rooms 1, 2, 3

Question Deduction

• Operating Duration & Uninterrupted Capacity:

• Operating hours from 9:00 a.m. to 11:30 a.m. provide a total window of 2.5 hours=150 minutes2.5\text{ hours} = 150\text{ minutes}.

• To maximize total patients catered to, every doctor must consult continuously with zero idle downtime between patients.

• The three doctors operate concurrently in separate rooms, forming three independent parallel service channels.

• Individual Doctor Throughput Calculations:

• Dr. Ben (10 min/patient10\text{ min/patient}): Completes 15010=15 patients\frac{150}{10} = 15\text{ patients}. Exactly fills 150 minutes150\text{ minutes} with no remaining downtime.

• Dr. Kane (15 min/patient15\text{ min/patient}): Completes 15015=10 patients\frac{150}{15} = 10\text{ patients}. Exactly fills 150 minutes150\text{ minutes}.

• Dr. Wayne (25 min/patient25\text{ min/patient}): Completes 15025=6 patients\frac{150}{25} = 6\text{ patients}. Finishes the 6th patient precisely at 11:30 a.m.

• Room Rotation Invariance & Clinic Aggregate:

• While doctors rotate rooms across days, consultation speeds are intrinsic to each doctor and unaffected by room numbers.

• Summing across the three parallel consulting channels yields:

• $\text{Maximum Daily Capacity} = 15 + 10 + 6 = 31\text{ patients}$.

• Option Evaluation:

• Option 1 (3030): Fails by assuming Dr. Wayne completes only 5 patients (125 min125\text{ min}) with 25 idle minutes.

• Option 2 (1212): Arbitrary distractor.

• Option 3 (1515): Captures Dr. Ben's individual capacity alone, ignoring Dr. Kane and Dr. Wayne.

• Option 4 (3131): Correctly aggregates all three doctors at maximum capacity.

• Option Matching:

• The maximum number of patients the clinic can cater to on any single day is 3131.

• Matches Option 4.

Topper Take

• Additive Rate Shortcut: Because 1010, 1515, and 25 minutes25\text{ minutes} all divide 150150 evenly, compute ∑150ti=15+10+6=31\sum \frac{150}{t_i} = 15 + 10 + 6 = 31 in under 15 seconds.

• Room Invariance: Never spend time mapping day-to-room allocations for an unconstrained capacity question—aggregate throughput is strictly invariant.

Other questions in this set

  1. Q18. The queue is never empty on one particular Saturday. Which of the three doctors would earn the maximum amount in…
  2. Q19. Mr. Singh visited the clinic on Monday, Wednesday, and Friday of a particular week, arriving at 8:50 a.m. on each of…
  3. Q20. On a slow Thursday, only two patients are waiting at 9 a.m. After that two patients keep arriving at exact 15 minute…

Optimization questions from other CAT papers

  1. CAT 2024 Slot 1 DILR Q18
    If both of them run staid campaigns attacking the other, then what percentage of students will vote in the…
  2. CAT 2024 Slot 1 DILR Q19
    What is the minimum percentage of students who will vote in the election?
  3. CAT 2024 Slot 1 DILR Q20
    If Amiya runs a campaign focusing on issues, then what is the maximum percentage of votes that she can get?
  4. CAT 2024 Slot 1 DILR Q21
    If Ramya runs a campaign attacking Amiya, then what is the minimum percentage of votes that she is…
  5. CAT 2024 Slot 1 DILR Q22
    What is the maximum possible voting margin with which one of the candidates can win?

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

Practise in PrepSoc