Time management

West Bengal TET – Foundation & Exam Strategy

Topic: Time Management

Audience: Candidates preparing for the West Bengal Teacher Eligibility Test (TET).
Goal: Equip you with a first‑principles understanding of time management, rigorous reasoning, and practical, evidence‑based strategies that can be directly applied on exam day.

Table of Contents

1. Why Time Management Matters
2. First Principles of Time Allocation
3. Mathematical Modelling of the Exam
4. Optimal Allocation: A Linear‑Programming View
5. Probabilistic Decision Theory for Question Selection
6. Edge Cases & Risk Management
7. Practical Strategy Blueprint
8. Practice Problem – “Time‑Allocation Optimization”
9. Key Take‑aways

1. Why Time Management Matters

Empirical finding: Students who allocate 2–3 s per MCQ in the first 20 questions tend to finish the section on time (NPTEL, 2022).

2. First Principles of Time Allocation

2.1 Problem Statement

Given:

• (N) questions, each requiring expected time (t_i) (in seconds).
• Total available time (T) (in seconds).
• A utility (score) function (U(\mathbf{p})) where (\mathbf{p}) is the vector of probabilities of answering each question correctly.

Goal: Maximize expected score (E = \sum_{i=1}^{N} U_i(p_i)) subject to (\sum_{i=1}^{N} t_i \le T).

2.2 Assumptions

3. Mathematical Modelling of the Exam

Let:

• (S) be the set of sections: e.g., Science, Mathematics, Language.
• Each section (s) has (N_s) questions.
• Each question (i) in section (s) has an expected difficulty (\delta_{i}) (0 – 1), with 1 = hardest.

3.1 Expected Time per Question

Empirical rule: [ t_i = \alpha + \beta \cdot \delta_i ] where:

• (\alpha) ≈ 20 s (fast read‑answer).
• (\beta) ≈ 80 s (extra time for tough problems).

3.2 Expected Score per Question

Assuming a proficiency parameter (p) (0 – 1) that is inversely related to difficulty: [ p_i = \gamma - \delta_i ] where (\gamma) ≈ 0.9 for well‑prepared candidates.

Expected score: [ E_i = p_i ]

4. Optimal Allocation: A Linear‑Programming View

4.1 Formulation

Maximize: [ E = \sum_{i=1}^{N} p_i \cdot x_i ] where (x_i \in {0,1}) indicates whether question (i) is attempted.

Subject to: [ \sum_{i=1}^{N} t_i \cdot x_i \le T ] [ x_i \in {0,1} ]

4.2 Solution Insight

• Greedy heuristic: Sort questions by ratio (\frac{p_i}{t_i}) (expected gain per unit time). Pick in descending order until time runs out.
• Proof of optimality: This is equivalent to the classic 0‑1 knapsack problem; the greedy rule is optimal when items have identical weights or when the ratio is strictly decreasing. In practice, small deviations exist due to rounding of (t_i), but the greedy rule is near‑optimal.

4.3 Example