Ten units of study notes written for the UGC NET Bureau’s “NET Syllabus, Subject: Statistics, Code 107”, with that syllabus reproduced below in the document’s own words. Each line points at the section of the unit notes that teaches it and, where one exists, the full course on this site that takes it further.
What this page does not say. The syllabus lists topics and nothing else, so this page says nothing about marks, duration, the number of questions or eligibility. Read those in the current notification for the session you are sitting.
Five symbols in the PDF are equation objects that do not survive as text — L′ in L′Hospital, 2² and 2³, R², T² and the word Latex. They were read off the printed page and are shown as printed.
deep a full course unit on this site teaches it, with the derivation worked out — the link after the UGC NET section. brief the UGC NET unit notes cover it at exam level: the definition, the result and two worked examples, without the full derivation. not here nothing on this site teaches it. Every course link was checked against that page’s own text when this map was built.
11 lines · 11 deep · 0 brief · 0 not here · Read the Unit I notes →
16 lines · 10 deep · 6 brief · 0 not here · Read the Unit II notes →
16 lines · 13 deep · 3 brief · 0 not here · Read the Unit III notes →
17 lines · 14 deep · 3 brief · 0 not here · Read the Unit IV notes →
12 lines · 11 deep · 1 brief · 0 not here · Read the Unit V notes →
17 lines · 11 deep · 6 brief · 0 not here · Read the Unit VI notes →
10 lines · 7 deep · 3 brief · 0 not here · Read the Unit VII notes →
8 lines · 8 deep · 0 brief · 0 not here · Read the Unit VIII notes →
8 lines · 0 deep · 8 brief · 0 not here · Read the Unit IX notes →
| Syllabus line, as prescribed | Where it is taught here | Depth |
|---|---|---|
| Markov chains with finite and countable state space, classification of states | UGC NET Unit IX — Markov Chains: Definitions | brief |
| Chapman- Kolmogorov equations | UGC NET Unit IX — Chapman–Kolmogorov Equations | brief |
| limiting behaviour of n-step transition probabilities, stationary distribution | UGC NET Unit IX — Limiting Behaviour of n-Step Probabilities | brief |
| Gambler’s ruin problem | UGC NET Unit IX — Gambler's Ruin Problem | brief |
| simple random walk | UGC NET Unit IX — Simple Random Walk | brief |
| Poisson process, inter-arrival and waiting time distributions | UGC NET Unit IX — Poisson Process | brief |
| Birth and death processes | UGC NET Unit IX — Birth and Death Processes | brief |
| M/M/1 queues | UGC NET Unit IX — M/M/1 Queue | brief |
15 lines · 13 deep · 2 brief · 0 not here · Read the Unit X notes →
No gaps in this syllabus. Every line above points at a page on this site.
32 lines are taught only in the UGC NET unit notes, at exam level, with no full course behind them yet. They are marked brief above; Unit IX, Stochastic Processes, is the largest block of them, because no course here teaches Markov chains or queues.
The courses the syllabus map above, and the Paper I map, send you to, in learning order — 25 of them — for each line that a full course takes further than the UGC NET unit notes. Each is listed because a map links into it.