CAT 2025 Slot 1 · DILR · Question 5

CAT 2025 Slot 1 previous year question on Quant Based Puzzles and Optimisation, with the answer and a step-by-step solution.

Quant Based Puzzles and OptimisationLOGICAL REASONING - High LevelType in the answer (TITA)Medium

Set 1: Train Occupancy, Stations A to E — this question belongs to a set. Read the full set with all 5 questions →

A train travels from Station A to Station E, passing through stations B, C, and D, in that order. The train has a seating capacity of 200. A ticket may be booked from any station to any other station ahead on the route, but not to any earlier station.

A ticket from one station to another reserves one seat on every intermediate segment of the route. For example, a ticket from B to E reserves a seat in the intermediate segments B – C, C – D, and D – E.

The occupancy factor for a segment is the total number of seats reserved in the segment as a percentage of the seating capacity. The total number of seats reserved for any segment cannot exceed 200.

The following information is known.

Segment C – D had an occupancy factor of 95%. Only segment B – C had a higher occupancy factor.

Exactly 40 tickets were booked from B to C and 30 tickets were booked from B to E.

Among the seats reserved on segment D – E, exactly four-sevenths were from stations before C.

The number of tickets booked from A to C was equal to that booked from A to E, and it was higher than that from B to E.

No tickets were booked from A to B, from B to D and from D to E.

The number of tickets booked for any segment was a multiple of 10.

How many tickets were booked to travel in exactly one segment?
Answer & solution

Answer: 60

A ticket spans exactly one segment when it runs between consecutive stations.

The four such types are A–B, B–C, C–D and D–E.

Clue 5 sets both A–B and D–E to zero.

Clue 2 gives B–C as 40.

The C–D count was found to be 20 while solving the 190-seat equation for segment C – D.

So the single-segment tickets number 0+40+20+0=60.

Shortcut. Of the four consecutive-station journeys, clue 5 kills two outright and clue 2 hands over a third. Only the C–D figure needs to be worked out, so this question is almost free once the grid is built.

More Quant Based Puzzles and Optimisation questions

All Quant Based Puzzles and Optimisation PYQs →

Take this paper as a timed test
Real exam timing, instant score, rank and topic-wise analysis.

Practice timed →