CSIR-UGC NET - Mathematical Sciences (statistics option) · India · National Testing Agency for CSIR
Original practice questions written to the published syllabus · not past papersCSIR-UGC NET - Mathematical Sciences (statistics option) is a PhD, fellowship and lectureship exam run by National Testing Agency for CSIR, for candidates in India. Computer-based, 3 hours, Parts A (general aptitude), B and C (subject); statisticians answer from the statistics unit.
Official site: csirnet.nta.ac.in.
We have not been able to confirm these details against the exam body's own specification, so fees, dates and pass marks are left out on purpose. Check the current format, eligibility, fees and dates on the official site.
Random processes in time: Markov chains and their classification and limits, Poisson and birth-death processes, branching processes and Brownian motion, applied to population growth, epidemics, queues and weather sequences such as wet- and dry-day chains.
Our 38 CSIR-UGC NET questions in this subject: 0 easy, 16 medium, 22 hard, across 11 units.
Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.
These 10 were written to CSIR-UGC NET and are not shown on any other exam's page.
How is a process whose next value depends on its last two values made into a Markov chain?
B. Enlarge the state
Enlarging the state to the last two values gives a first-order Markov chain on pairs; this is how second-order rainfall chains are handled.
Which criterion characterises a recurrent state i?
A. Σₙ pᵢᵢ⁽ⁿ⁾ = ∞
The expected number of returns, Σₙ pᵢᵢ⁽ⁿ⁾, is infinite for recurrent and finite for transient states. pᵢᵢ = 1 defines an absorbing state, a special recurrent case.
According to Pólya's theorem, in which dimensions is the symmetric simple random walk recurrent?
D. One and two dimensions only
The return probability is 1 in dimensions 1 and 2 and below 1 in dimensions 3 and higher.
Which statement holds for every finite irreducible Markov chain?
C. All states are positive recurrent
A finite chain must have a recurrent state, and in an irreducible chain recurrence is shared, with finite mean return times. Aperiodicity is not guaranteed (the alternating chain).
For an absorbing chain with transient-to-transient block Q and transient-to-absorbing block R, which matrix gives the absorption probabilities?
A. (I − Q)⁻¹R
N = (I − Q)⁻¹ is the fundamental matrix of expected visits; NR gives absorption probabilities and N1 the expected times to absorption.
A periodic irreducible positive-recurrent chain has stationary distribution π. Which statement is correct?
C. Long-run time fractions equal π, though pᵢⱼ⁽ⁿ⁾ itself does not converge
Periodicity prevents convergence of n-step probabilities, but averages over time still converge to π (the ergodic theorem needs no aperiodicity).
A Yule process (each individual splits at rate λ) starts from one individual. What is E[X(t)]?
A. e^(λt)
X(t) is geometric with success probability e^(−λt), so its mean is e^(λt): exponential growth.
Each infected plant infects a Poisson number of others with mean 2. What is the probability that an outbreak from one infected plant dies out?
D. 0.203
q solves q = e^(2(q−1)); iterating gives q ≈ 0.203. e^(−2) = 0.135 is only the chance of no secondary infections.
What does the Pollaczek-Khinchine formula for the M/G/1 queue show?
D. Service variability lengthens queues
Lq = (λ²σ² + ρ²)/[2(1 − ρ)]: for a fixed mean, more variable service gives longer queues; deterministic service halves Lq compared with exponential.
What is the probability that standard Brownian motion reaches level 2 at some time before t = 4?
D. 0.317
Reflection principle: 2P(W(4) ≥ 2) = 2[1 − Φ(2/√4)] = 2[1 − Φ(1)] = 0.317. P(W(4) ≥ 2) alone = 0.159.
This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.
Read the manual chapters for these first and do every worked question you can find on them.
Aim for one sitting per unit, then mixed questions across them.
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Last updated · How Laisha writes and checks its pages · Report a mistake
US$10 a month · one price worldwide · cancel any time
| Free | Smarter | |
|---|---|---|
| Grow guides, pest pages, articles | Read all | Read all |
| Ask Laisha | 5 a day | Up to 1,000 a month |
| Exam practice | The sample on each page | Every question, timed papers |
| Crop calendar and pest alerts | — | For your own fields |
| Calculators and tools | — | All |
| Uploads and reports | — | 100 a month, real files |
An AI operating system for agriculture: free guides, manuals and tools written for every country.