**CAT DILR: Selection & Scheduling – The Ultimate 99+ Percentile Guide**

CAT DILR: Selection & Scheduling – The Ultimate 99+ Percentile Guide

What This Is

Selection & Scheduling problems test your ability to choose subsets of items (selection) under constraints and arrange them in time slots (scheduling). These questions appear in ~3-4 sets per CAT DILR section (12-16 marks) and are high-scoring if approached systematically.

Why master this?
- High ROI: Once you crack the pattern, these sets are faster to solve than LR puzzles (e.g., arrangements).
- Predictable traps: CAT repeats constraint misinterpretation, overcounting, and time-window errors.
- Real CAT example:

"A company must select 3 managers from 5 candidates (A, B, C, D, E) for 3 distinct projects (P1, P2, P3). A cannot work on P1, and B cannot work on P2. If C is selected, D must also be selected. How many valid selections are possible?" (This tests selection + conditional constraints + scheduling.)

Key Concepts & Techniques

1. Constraint Classification
2. Hard constraints: Must be satisfied (e.g., "A cannot be in slot 1").
3. Soft constraints: Preferential (e.g., "If possible, assign B to slot 2").

4. When to use: First step in every problem. List all constraints before solving.

5. Case Splitting

6. Break the problem into mutually exclusive scenarios (e.g., "Case 1: C is selected → D must be selected. Case 2: C is not selected").

7. When to use: When a constraint triggers a chain reaction (e.g., "If X is chosen, Y must be excluded").

8. Slot-Filling (Scheduling)

9. Treat time slots as fixed positions (e.g., "Morning, Afternoon, Evening").

10. When to use: When the problem involves ordering (e.g., "Schedule 4 tasks in 4 time slots with no overlaps").

11. Inclusion-Exclusion Principle

12. Total ways = (Ways without constraints) – (Ways violating constraints).

13. When to use: For counting problems with overlapping restrictions (e.g., "How many 3-person teams exclude both A and B?").

14. Backtracking (Trial & Error)

15. Start with the most restrictive constraint and fill slots backward.

16. When to use: When constraints are interdependent (e.g., "A and B cannot be together, but C must be with D").

17. Answer Choice Validation

18. Plug in options to eliminate wrong answers (e.g., "Option A violates constraint X → discard").

19. When to use: For MCQs where brute-force solving is tedious.

20. Symmetry & Grouping

21. If two items are indistinguishable (e.g., "Two identical machines"), treat them as one.
22. When to use: When the problem has duplicate items (e.g., "Schedule 5 tasks on 2 identical servers").

Step-by-Step Strategy

Step 1: Read & Classify

• Action: Identify if the problem is selection-only, scheduling-only, or both.
• Selection: "Choose 3 out of 5 people."
• Scheduling: "Assign 4 tasks to 4 time slots."
• Both: "Select 3 managers and assign them to 3 distinct projects."

Step 2: List All Constraints

• Action: Write down every constraint in shorthand (e.g., "A ≠ P1", "B ≠ P2", "C → D").
• Pro tip: Underline conditional constraints (e.g., "If X, then Y").

Step 3: Choose a Starting Point

• Action: Pick the most restrictive constraint (e.g., "A cannot be in slot 1" is more restrictive than "B prefers slot 2").
• For selection: Start with inclusion/exclusion (e.g., "Must include A").
• For scheduling: Start with fixed slots (e.g., "Task X must be in slot 3").

Step 4: Case Split (If Needed)

• Action: If constraints are interdependent, split into cases (e.g., "Case 1: C is selected → D must be selected. Case 2: C is not selected").
• Pro tip: Label cases clearly to avoid confusion.

Step 5: Fill Slots/Select Items

• Action: Use backtracking or slot-filling to assign items.
• For selection: Use combinations (e.g., "Total ways to choose 3 from 5 = 5C3").
• For scheduling: Use permutations (e.g., "4! = 24 ways to assign 4 tasks to 4 slots").

Step 6: Validate & Count

• Action: Check if all constraints are satisfied. Count valid configurations.
• For MCQs: Cross-check with answer choices.

Fully Worked Example (CAT-Style)

Problem: A company must select 3 managers from 5 candidates (A, B, C, D, E) for 3 distinct projects (P1, P2, P3). Constraints: 1. A cannot work on P1.
2. B cannot work on P2.
3. If C is selected, D must also be selected.
4. E must be assigned to either P1 or P2.

How many valid selections are possible?

Solution Using the Strategy

Step 1: Read & Classify

• Selection + Scheduling: Choose 3 managers and assign them to projects.

Step 2: List Constraints

1. A ≠ P1
2. B ≠ P2
3. C → D (If C is selected, D must be selected)
4. E ∈ {P1, P2}

Step 3: Choose Starting Point

• Most restrictive constraint: E must be in P1 or P2 (constraint 4).
• Case Split:
• Case 1: E is assigned to P1.
• Case 2: E is assigned to P2.

Step 4: Case 1 (E in P1)

• Slots:
• P1: E (fixed)
• P2: ?
• P3: ?
• Remaining managers: A, B, C, D (must select 2 more).
• Constraints:
• A ≠ P1 (already satisfied, since P1 is E).
• B ≠ P2.
• If C is selected, D must be selected.

Subcases: 1. Subcase 1.1: C is selected → D must be selected.
- Selection: E, C, D.
- Assignments:
- P1: E (fixed).
- P2: Cannot be B (constraint 2) → Can be C or D.
- P3: Remaining manager.
- Valid assignments:
- P2 = C, P3 = D → Valid (B not in P2).
- P2 = D, P3 = C → Valid.
- Total: 2 ways.
2. Subcase 1.2: C is not selected.
- Selection: E + any 2 from A, B, D.
- Possible pairs: (A,B), (A,D), (B,D).
- Assignments:
- P1: E (fixed).
- P2: Cannot be B (constraint 2).
- P3: Remaining manager.
- Check each pair:
- (A,B):
- P2 = A, P3 = B → Valid (B not in P2).
- P2 = B → Invalid (constraint 2).
- Total: 1 way.
- (A,D):
- P2 = A, P3 = D → Valid.
- P2 = D, P3 = A → Valid.
- Total: 2 ways.
- (B,D):
- P2 = D, P3 = B → Valid (B not in P2).
- P2 = B → Invalid.
- Total: 1 way.
- Total for Subcase 1.2: 1 + 2 + 1 = 4 ways.

Total for Case 1: 2 (Subcase 1.1) + 4 (Subcase 1.2) = 6 ways.

Step 5: Case 2 (E in P2)

• Slots:
• P2: E (fixed).
• P1: ?
• P3: ?
• Remaining managers: A, B, C, D (must select 2 more).
• Constraints:
• A ≠ P1.
• B ≠ P2 (already satisfied, since P2 is E).
• If C is selected, D must be selected.

Subcases: 1. Subcase 2.1: C is selected → D must be selected.
- Selection: E, C, D.
- Assignments:
- P2: E (fixed).
- P1: Cannot be A → Can be C or D.
- P3: Remaining manager.
- Valid assignments:
- P1 = C, P3 = D → Valid.
- P1 = D, P3 = C → Valid.
- Total: 2 ways.
2. Subcase 2.2: C is not selected.
- Selection: E + any 2 from A, B, D.
- Possible pairs: (A,B), (A,D), (B,D).
- Assignments:
- P2: E (fixed).
- P1: Cannot be A (constraint 1).
- P3: Remaining manager.
- Check each pair:
- (A,B):
- P1 = B, P3 = A → Valid (A not in P1).
- P1 = A → Invalid.
- Total: 1 way.
- (A,D):
- P1 = D, P3 = A → Valid.
- P1 = A → Invalid.
- Total: 1 way.
- (B,D):
- P1 = B, P3 = D → Valid.
- P1 = D, P3 = B → Valid.
- Total: 2 ways.
- Total for Subcase 2.2: 1 + 1 + 2 = 4 ways.

Total for Case 2: 2 (Subcase 2.1) + 4 (Subcase 2.2) = 6 ways.

Step 6: Final Count

• Total valid selections: Case 1 (6) + Case 2 (6) = 12 ways.

Common Mistakes

1. Mistake: Ignoring conditional constraints (e.g., "If C is selected, D must be selected").
2. Why it happens: Students focus on hard constraints and miss if-then rules.

3. Correct approach: Always case-split on conditional constraints.

4. Mistake: Overcounting identical scenarios.

5. Why it happens: Treating order as distinct when it’s not (e.g., "A in P1, B in P2" vs. "B in P1, A in P2" may be the same if projects are identical).

6. Correct approach: Clarify if projects are distinct (permutations) or identical (combinations).

7. Mistake: Misapplying inclusion-exclusion.

8. Why it happens: Forgetting to subtract invalid cases (e.g., "Total ways to choose 3 from 5 = 10" but ignoring constraints).

9. Correct approach: First calculate total ways, then subtract invalid cases.

10. Mistake: Not validating assignments.

11. Why it happens: Assuming all assignments are valid without checking constraints.
12. Correct approach: Always cross-check with constraints (e.g., "Does this assignment violate A ≠ P1?").

CAT Traps & Time Management

Traps

1. Hidden Constraints: CAT often buries constraints in the problem statement (e.g., "E must be assigned to either P1 or P2" is easy to miss).

2. How to spot: Read the last 2 lines carefully—CAT loves hiding constraints there.

3. Overlapping Cases: Students double-count scenarios where cases overlap (e.g., "C is selected" and "D is selected" may overlap).

4. How to avoid: Label cases clearly and ensure they are mutually exclusive.

5. Time-Window Errors: In scheduling, students misinterpret "no overlaps" (e.g., "Task A ends at 3 PM, Task B starts at 3 PM" → is this allowed?).

6. How to avoid: Clarify if "no overlap" means strict inequality (A ends < B starts) or non-strict (A ends ≤ B starts).

Time Management

• Easy set: 6-8 minutes.
• Medium set: 8-10 minutes.
• Hard set: 10-12 minutes (skip if stuck).
• Pro tip: If a set has >3 constraints, case-split early to avoid confusion.

Quick Practice

Question: A team of 4 must be selected from 6 players (A, B, C, D, E, F) with the following constraints: 1. If A is selected, B must be selected.
2. C and D cannot be selected together.
3. E and F must be selected together or not at all.
How many valid teams are possible?

Answer: 9
Solution Path: - Case 1: E and F are selected → 2 spots left.
- Subcase 1.1: A is selected → B must be selected → C/D cannot be selected → Only 1 way (A,B,E,F).
- Subcase 1.2: A is not selected → Choose 2 from B,C,D (but C and D cannot be together) → 3 ways (B,C / B,D / C,D invalid → B,C and B,D only).
- Case 2: E and F are not selected → 4 spots left.
- Subcase 2.1: A is selected → B must be selected → Choose 2 from C,D (cannot be together) → 1 way (A,B,C or A,B,D → 2 ways).
- Subcase 2.2: A is not selected → Choose 4 from B,C,D → 3 ways (B,C,D,E/F excluded).
- Total: 1 (1.1) + 2 (1.2) + 2 (2.1) + 3 (2.2) = 9 ways.

Last-Minute Cram Sheet

1. Selection = Combinations, Scheduling = Permutations.
2. Case-split on conditional constraints (e.g., "If X, then Y").
3. Start with the most restrictive constraint (e.g., "A cannot be in slot 1").
4. E and F must be together? → Treat as a single unit.
5. A cannot be with B? → Total ways = (Total without constraints) – (A and B together).
6. Time-window trap: "No overlap" = strict inequality (A ends < B starts).
7. MCQ hack: Plug in answer choices to eliminate wrong options.
8. Overcounting alert: If projects are identical, use combinations (not permutations).
9. Hidden constraint: Check the last 2 lines of the problem.
10. Time limit: 8-10 minutes max. Skip if stuck after 12 minutes.

Final Tip: Practice 10-15 sets of this type from past CAT papers. The patterns repeat—master the strategy, not just the problems. ?