Revision technique

Revision Technique for the Mizoram Teacher Eligibility Test (TET)

Audience: Aspirants preparing for the Mizoram TET (Foundation & Exam Strategy).
Goal: Equip you with a scientifically‑grounded, highly efficient revision framework that can be customised for any subject area and exam schedule.

Style: MIT‑level rigor – first‑principle derivation, formal reasoning, edge‑case analysis, and a challenging optimisation problem at the end.

1. Why Revision Matters (Cognitive Foundations)

Bottom line: A revision plan is a dynamic rehearsal that harnesses retrieval practice, spaced repetition, and metacognitive monitoring.

2. First‑Principle Derivation of the Revision Algorithm

2.1 Problem Statement

Given:

• A set of n topics (T = {t_1, t_2, \dots, t_n}).
• For each topic (t_i), an estimated initial mastery level (m_i \in [0,1]) (0 = unknown; 1 = perfect).
• An exam time horizon (H) days until the TET.
• A daily revision capacity (C) hours.
• A desired final mastery (M_{\text{req}} = 0.9) (for all topics).

Goal: Devise a schedule (S) that maximises the probability that each topic reaches (M_{\text{req}}) by day (H).

2.2 Modelling Retention Dynamics

Let (R_i(t)) denote the retention of topic (t_i) at day (t). Empirically, forgetting follows a power‑law:

[ R_i(t) = m_i \cdot t^{-\alpha} ]

where (\alpha) is a forgetting exponent (~0.5–0.7 for verbal material).

Retrieval practice amplifies (m_i) by a factor (\beta > 1) (typically 1.2–1.5) and resets the forgetting curve.

Thus, after a revision session at day (t_r):

[ m_i(t_r^+) = \beta \cdot R_i(t_r) ]

2.3 Optimisation Framework

We model the process as a discrete‑time dynamical system with control variables: the schedule of revision sessions.

Define binary control variable (x_{i,t} \in {0,1}) indicating whether topic (t_i) is revised on day (t).

Constraints:

1. Capacity constraint: (\sum_{i} x_{i,t} \leq C) for each day (t).
2. Spacing constraint: If (x_{i,t} = 1) and (x_{i,t-1} = 1), then (x_{i,t} = 0) (no consecutive day revising the same topic to avoid over‑learning).
3. Coverage constraint: For every (i), (\sum_{t} x_{i,t} \geq 1) (each topic must be revisited at least once).

Objective: Maximise (\sum_{i} \mathbb{I}\left( R_i(H) \geq M_{\text{req}} \right)), where (\mathbb{I}) is the indicator function.

This is a binary integer programming problem with a highly non‑linear objective (due to the forgetting curve). Solving exactly is NP‑hard, but heuristic schedules – e.g., Ebbinghaus‑Spaced Repetition – provide near‑optimal solutions.

3. Core Principles of an Effective Revision Plan