Time Management for the Chhattisgarh TET
Foundation & Exam Strategy – Advanced University‑Level Notes
Audience: Candidates preparing for the Chhattisgarh Teacher Eligibility Test (TET)
Depth: MIT‑style treatment – first principles, rigorous reasoning, edge‑case analysis, and a challenging optimization problem.
Table of Contents
| # | Section | Sub‑topics |
|---|---|---|
| 1 | Why Time Management Matters | 1.1. Time as a scarce resource 1.2. Cognitive ergonomics |
| 2 | First Principles of Time Allocation | 2.1. Resource‑allocation model 2.2. Law of diminishing returns |
| 3 | Theoretical Foundations | 3.1. Scheduling theory basics 3.2. Weighted completion time minimization |
| 4 | Applying Theory to TET | 4.1. Exam structure & constraints 4.2. Linear‑programming formulation |
| 5 | Practical Exam‑Day Strategy | 5.1. Pre‑exam preparation 5.2. In‑exam tactics |
| 6 | Edge Cases & Robustness | 6.1. Test‑day disruptions 6.2. Low‑confidence topics |
| 7 | Sample Time‑Management Plan | 7.1. Daily study timetable 7.2. Mini‑exam simulation |
| 8 | Challenging Problem | 8.1. Problem statement 8.2. Solution outline |
| 9 | Summary & Take‑Away Points | 9.1. Key formulas 9.2. Quick‑check list |
| 10 | Further Reading | 10.1. Books 10.2. Articles |
Tip: Keep a running log of your study times and test performance. The data will refine your model.
1. Why Time Management Matters
1.1 Time as a Scarce Resource
- Finite budget: 3 hours per paper, 180 minutes total.
- Opportunity cost: Any minute spent on one question is a minute not spent on another.
- Decision theory: Optimal allocation maximizes expected score, not just raw completion.
1.2 Cognitive Ergonomics
- Attention span: Average sustained focus ≈ 20–30 min before a micro‑break.
- Working‑memory limits: Complex questions drain memory, causing slower subsequent processing.
- Stress‑time trade‑off: Rapid pacing can induce errors; over‑pacing leads to exhaustion.
2. First Principles of Time Allocation
2.1 Resource‑Allocation Model
Let
- (T) = total available time (minutes).
- (n) = number of questions.
- (t_i) = time allocated to question (i).
- (p_i) = points for question (i).
- (s_i(t_i)) = probability of answering correctly given (t_i) minutes.
Objective: maximize expected score
[
\max_{{t_i}};\sum_{i=1}^n p_i,s_i(t_i)
]
subject to
[
\sum_{i=1}^{n} t_i \le T,\quad t_i \ge 0.
]
This is a continuous optimization problem with a concave objective (assuming (s_i) is concave).
2.2 Law of Diminishing Returns
- Marginal benefit of extra minutes on a question decreases after a threshold.
- Marginal cost: risk of running out of time for later questions.
- Practical rule: Allocate only enough time to reach the inflection point where ( \frac{ds_i}{dt_i} ) falls below a critical value (often ≈ 0.02 per minute).
3. Theoretical Foundations
3.1 Scheduling Theory Basics
- Job‑shop scheduling: Each question is a job; the “machine” is your mind.
- Objective functions:
- Makespan (total completion time) → minimize total time to finish all questions.
- Weighted completion time → minimize sum of time × weight (points).
- Classic algorithms:
- Shortest Processing Time (SPT) minimizes makespan.
- Weighted Shortest Processing Time (WSPT) minimizes weighted completion.
3.2 Weighted Completion Time Minimization
For deterministic times (t_i) and weights (w_i = p_i), the optimal sequence is sorted by decreasing ( \frac{w_i}{t_i} ) (Smith’s Rule).
In our context, (t_i) is unknown (you choose it), so we refine the rule:
- Estimate baseline time (t_i^0) (e.g., 3 min for MCQs).
- Compute benefit per minute (b_i = w_i \cdot \frac{ds_i}{dt_i}\big|_{t_i^0}).
- Prioritize questions with higher (b_i).
This heuristic translates the continuous optimization into a discrete “question‑order” strategy.