LAISHA
Open Laisha

ICAR AICE-JRF/SRF Stochastic Processes: practice questions

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) · India · National Testing Agency for ICAR

Original practice questions written to the published syllabus · not past papers
10worked here, free
40written to this exam in this subject
11syllabus units

About ICAR AICE-JRF/SRF

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) is a PhD, fellowship and lectureship exam run by National Testing Agency for ICAR, for candidates in India. Computer-based test, 2 hours, 120 MCQs, +4 / -1 (Part A general, Part B core group, Part C subject). 2026 exam held with AIEEA-PG in July 2026.

Source: icar.org.in.

Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.

Stochastic Processes in ICAR AICE-JRF/SRF

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 40 ICAR AICE-JRF/SRF questions in this subject: 0 easy, 18 medium, 22 hard, across 11 units.

10 practice questions, worked

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 ICAR AICE-JRF/SRF and are not shown on any other exam's page.

Question 1 · medium

Which statement about independent increments and the Markov property is correct?

  1. The two properties are equivalent
  2. The Markov property implies independent increments
  3. Neither implies the other in any case
  4. Independent increments imply the Markov property, but not conversely
Answer and working

D. Independent increments imply the Markov property, but not conversely

If increments are independent, the future increment ignores the past, so the process is Markov. A wet/dry rainfall chain is Markov but its 'increments' are not independent.

Question 2 · hard

Which process has independent and stationary increments but is not weakly stationary?

  1. A stationary Gaussian AR(1) process
  2. Standard Brownian motion
  3. An irreducible Markov chain started in its stationary distribution
  4. White noise
Answer and working

B. Standard Brownian motion

Var W(t) = t grows with t, so W is not stationary, although its increments are independent and stationary. The other three are stationary processes.

Question 3 · hard

What does detailed balance πᵢpᵢⱼ = πⱼpⱼᵢ imply?

  1. Stationarity and reversibility
  2. All transition probabilities are equal
  3. The chain is periodic
  4. The chain has no stationary distribution
Answer and working

A. Stationarity and reversibility

Summing detailed balance over i gives πP = π; the chain looks the same run backwards in time. Birth-death chains always satisfy it.

Question 4 · medium

Insect emergence follows a non-homogeneous Poisson process with rate λ(t) = 2t per day for 0 ≤ t ≤ 3. What is the expected number of emergences in the first 3 days?

  1. 18
  2. 9
  3. 3
  4. 6
Answer and working

B. 9

Mean = ∫₀³ 2t dt = t² evaluated at 3 = 9. Using λ(3) × 3 = 18 overstates it; 6 is λ(3).

Question 5 · hard

For a birth-death process with birth rates λₙ and death rates μₙ, how are the stationary probabilities found?

  1. πₙ = λₙ/(λₙ + μₙ)
  2. πₙ = 1/(n + 1)
  3. πₙ = π₀ Π from k = 1 to n of λₖ₋₁/μₖ, normalised
  4. πₙ = μₙ/Σμₖ
Answer and working

C. πₙ = π₀ Π from k = 1 to n of λₖ₋₁/μₖ, normalised

Detailed balance πₙ₋₁λₙ₋₁ = πₙμₙ gives the product form, which must be summable for a stationary distribution to exist.

Question 6 · hard

How is the PGF of generation size Zₙ related to the offspring PGF G?

  1. It is Gⁿ(s), the n-th power
  2. It is nG(s)
  3. It is G(sⁿ)
  4. The n-fold composition of G
Answer and working

D. The n-fold composition of G

Each generation is a random sum of the previous one's offspring, so PGFs compose. The n-th power would describe the sum of n independent families.

Question 7 · medium

In epidemic terms, what does the mean offspring number m of a branching-process approximation correspond to?

  1. The case-fatality rate
  2. The incubation period
  3. The prevalence
  4. R₀
Answer and working

D. R₀

Early in an outbreak each case generates on average R₀ new cases; R₀ ≤ 1 means minor outbreaks only.

Question 8 · medium

What is Cov(W(2), W(5)) for standard Brownian motion?

  1. 2
  2. 10
  3. 3
  4. 5
Answer and working

A. 2

Cov(W(s), W(t)) = min(s, t) = 2, since W(5) = W(2) + an independent increment.

Question 9 · hard

Which limit theorem shows that a suitably scaled simple random walk converges to Brownian motion?

  1. The elementary renewal theorem
  2. The ergodic theorem for Markov chains
  3. Donsker's invariance principle
  4. The Glivenko-Cantelli theorem
Answer and working

C. Donsker's invariance principle

Donsker's theorem is a functional central limit theorem: the whole rescaled path converges in distribution to W.

Question 10 · hard

When can preventive (age-based) replacement of a component reduce long-run cost compared with replacement only on failure?

  1. When lifetimes are exponential
  2. When failures cost less than planned replacement
  3. Never, by the renewal theorem
  4. When lifetimes have an increasing hazard rate
Answer and working

D. When lifetimes have an increasing hazard rate

Only wear-out (increasing hazard) makes an old working component worse than a new one. With exponential lives the memoryless property makes preventive replacement pointless.

A study plan for Stochastic Processes in ICAR AICE-JRF/SRF

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.

  1. First, the heavy units (50% of the 40 questions): Brownian motion and its basic properties (5, 13%); Classification of states and periodicity (5, 13%); Definition and classification of stochastic processes (5, 13%); Renewal processes (introduction) (5, 13%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Branching processes and extinction probability (4, 10%); Limiting and stationary distributions (4, 10%); Markov-chain models of rainfall and crop sequences (4, 10%); Pure birth, pure death and birth-death processes (3, 8%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Markov chains: transition matrices and Chapman-Kolmogorov equations (2, 5%); Poisson process and its properties (2, 5%); Queueing models M/M/1 and M/M/c (1, 3%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Queueing models M/M/1 and M/M/c (1 hard of 1), Branching processes and extinction probability (3 hard of 4), Limiting and stationary distributions (3 hard of 4).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — ICAR AICE-JRF/SRF Stochastic Processes

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.