Why This Topic Matters
Scheduling & Puzzle Sets
Assign events to slots in time — days, time-slots, rounds — under precedence ("A before B"), adjacency ("C right after D"), and capacity rules. A grid of slots plus disciplined elimination cracks them.
| Where scheduling showed up | 2021 | 2022 | 2023 | 2024 | 2025 | Avg/slot |
|---|---|---|---|---|---|---|
| Pure scheduling sets | 3.3 | – | – | – | 1.7 | 1.0 |
| Scheduling inside LR sets | 2.0 | – | – | 1.7 | – | 0.7 |
| Scheduling inside DI sets | – | – | 1.7 | – | – | 0.3 |
| Routes-with-timetable sets | – | 1.7 | – | – | – | 0.3 |
Scheduling never skips a year — it just changes section labels. 2021 ran pure scheduling sets, 2022 hid it in a routes set, 2023 served it as DI-scheduling, 2024 as an LR set, 2025 as pure scheduling again (5 questions). That's on average about 2–3 questions per slot of the same core skill: timeline + precedence + capacity. This is among the highest-yield DILR skills to master.
Method
- Lay out the timeline as labelled slots.
- Place fixed events ("E is on Monday") immediately.
- Convert precedence to bounds: "A two days before B" both orders them and limits their possible slots.
- Adjacency = a block: "C immediately after D" travels as one unit.
- Eliminate until each slot is forced.
A worked example
Five lectures — Physics, Chemistry, Biology, Maths, CS — are scheduled Mon–Fri, one per day. (1) Maths is on Wednesday. (2) Biology is on Friday. (3) CS is immediately after Physics. (4) Physics is before Chemistry.
- Fixed: Wed = Maths, Fri = Biology. Free days: Mon, Tue, Thu.
- The Physics→CS block needs two consecutive free days. Among Mon, Tue, Thu, only Mon–Tue are consecutive (Wed sits between Tue and Thu). So Physics = Mon, CS = Tue.
- Chemistry takes the last free day, Thu — and indeed Physics (Mon) is before Chemistry (Thu). ✓
The whole timetable was forced — no guessing.
The real CAT version adds one twist: capacity. A typical recent scheduling set (e.g. the 16-classes/7-teachers/4-days pattern) fixes how many events each day holds ("5 classes on Monday and Sunday, 3 on Wednesday and Friday") and how many each person may take ("each teacher 1–3 classes, never two on the same day"). Those capacity numbers are your strongest clues — total them first ( ✓) and squeeze group counts against them before placing anything.
Common traps
Precedence ≠ adjacency. "Before" allows gaps; "immediately before" does not. And when a fixed event sits mid-week, count consecutive free slots around it carefully — Tue and Thu are not consecutive when Wed is taken. Most scheduling-set errors are one of these two misreads.
- Missing a capacity rule ("at most two per slot") that quietly kills a branch.
Checklist
- Draw the timeline; drop in fixed events
- Total the capacities and check them against the event count
- Turn "before/after" into bounds, adjacency into blocks
- Find the only consecutive gap for adjacency pairs
- Verify every precedence clue in the final grid
Sample Questions
8 practice questions
Sign in for full access
Create a free account to access all 8 practice questions on this topic.
CAT PYQ Spotlight
Actual CAT questions on this topic
Sign in for full access
Create a free account to access all 8 CAT PYQs on this topic.
Continue Your Prep