LAISHA
Open Laisha

GATE Stochastic Processes: practice questions

GATE - Statistics (ST) · India · IITs and IISc on rotation (2026: IIT Guwahati)

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

What this subject covers

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.

In the exams: GATE ST 'Stochastic Processes' (heavy); UPSC ISS Statistics I (present); ISI admission (present); CSIR-NET Unit 4 (present); light in AICE-JRF Ag Stat

What GATE asks from it

GATE Statistics (ST)

n-step transition probabilities, classification of states, stationary distributions, absorption probabilities, Poisson-process computations (inter-arrival, thinning, conditional uniformity) and birth-death processes, as NAT and MSQ items.

Where the 86 questions fall

How our questions for GATE spread across the units of Stochastic Processes. Difficulty: 24 easy, 47 medium, 15 hard.

Classification of states and periodicity10
Markov chains: transition matrices and Chapman-Kolmogorov equations9
Limiting and stationary distributions9
Poisson process and its properties9
Pure birth, pure death and birth-death processes8
Branching processes and extinction probability8
Queueing models M/M/1 and M/M/c8
Brownian motion and its basic properties8
Definition and classification of stochastic processes7
Markov-chain models of rainfall and crop sequences5
Renewal processes (introduction)5

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.

1 · Definition and classification of stochastic processes · easy

What is a sample path of a stochastic process?

  1. The mean function of the process
  2. The state space of the process
  3. One realisation over time
  4. The distribution of X(t) at a single t
Answer and working

C. One realisation over time

Fixing the random outcome ω gives a function of t, the trajectory actually observed, e.g. one season's daily rainfall sequence.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

2 · Markov chains: transition matrices and Chapman-Kolmogorov equations · hard

For a two-state chain with p₀₁ = 0.3 and p₁₀ = 0.4, at what geometric rate do the rows of Pⁿ approach their limit?

  1. 0.3ⁿ
  2. 0.4ⁿ
  3. 0.12ⁿ
  4. 0.7ⁿ
Answer and working

A. 0.3ⁿ

The second eigenvalue of P is 1 − a − b = 0.3, and Pⁿ = limit + (1 − a − b)ⁿ × (fixed matrix). 0.7 = a + b and 0.4 = p₁₀ are not eigenvalues of P.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

3 · Classification of states and periodicity · hard

A random walk on 0, ..., 6 steps up with probability 0.6 and down with 0.4, starting at 3 and absorbed at 0 and 6. What is the probability of reaching 6 first?

  1. 0.6000
  2. 0.5000
  3. 0.7714
  4. 0.2286
Answer and working

C. 0.7714

[1 − (q/p)ⁱ]/[1 − (q/p)ᴺ] with q/p = 2/3: [1 − (2/3)³]/[1 − (2/3)⁶] = 0.7714. 0.5 would hold only for p = 1/2.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

4 · Limiting and stationary distributions · hard

A periodic irreducible positive-recurrent chain has stationary distribution π. Which statement is correct?

  1. No stationary distribution exists for periodic chains
  2. π depends on the starting state
  3. Long-run time fractions equal π, though pᵢⱼ⁽ⁿ⁾ itself does not converge
  4. pᵢⱼ⁽ⁿ⁾ converges to πⱼ as in the aperiodic case
Answer and working

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).

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

5 · Pure birth, pure death and birth-death processes · medium

A biocontrol agent has per-individual birth rate 0.3 and death rate 0.2 per day (linear birth-death). What is the probability of eventual extinction if 5 individuals are released?

  1. 1.000
  2. 0.667
  3. 0.868
  4. 0.132
Answer and working

D. 0.132

For λ > μ, extinction from i individuals has probability (μ/λ)ⁱ = (2/3)⁵ = 0.132. 0.667 is the risk from a single individual.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

6 · Pure birth, pure death and birth-death processes · medium

In a birth-death process in state n, how long does the process stay before the next transition?

  1. Exponential with rate λₙ + μₙ
  2. Gamma with shape n
  3. Fixed at 1/(λₙ + μₙ)
  4. Exponential with rate λₙ
Answer and working

A. Exponential with rate λₙ + μₙ

Competing exponential clocks for birth and death give an exponential holding time with the summed rate; the move is a birth with probability λₙ/(λₙ + μₙ).

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

7 · Branching processes and extinction probability · medium

A single introduction has extinction probability 0.5. What is the extinction probability with 10 independent founders?

  1. 0.0010
  2. 0.5000
  3. 0.1000
  4. 0.0500
Answer and working

A. 0.0010

Independent lines must all die out: qᵏ = 0.5¹⁰ = 0.0010.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

8 · Queueing models M/M/1 and M/M/c · medium

In Kendall's notation, what does M/M/2 denote?

  1. Deterministic arrivals, exponential service, two servers
  2. Poisson arrivals, exponential service, two servers
  3. Two Poisson arrival streams, one server
  4. Markov arrivals with two queues
Answer and working

B. Poisson arrivals, exponential service, two servers

A/B/c: arrival process, service distribution, number of servers; M stands for Markovian (Poisson/exponential).

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

9 · Markov-chain models of rainfall and crop sequences · easy

In a wet/dry chain with P(wet | wet) = 0.6, what is the mean length of a wet spell?

  1. 0.6 day
  2. 2.5 days
  3. 1.67 days
  4. 1.5 days
Answer and working

B. 2.5 days

Wet-spell length is geometric with mean 1/(1 − p₁₁) = 1/0.4 = 2.5 days. 1/0.6 uses the persistence probability itself.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

10 · Renewal processes (introduction) · medium

How does a renewal process differ from a Poisson process?

  1. Its events must occur at integer times
  2. Its counts are always Poisson
  3. Inter-event times need not be exponential
  4. It has no independent inter-event times
Answer and working

C. Inter-event times need not be exponential

A renewal process keeps iid inter-event times but drops the exponential assumption; the Poisson process is the exponential special case.

Further reading: Karlin and Taylor, A First Course in Stochastic Processes; Ross, Introduction to Probability Models; Medhi, Stochastic Processes

Ten here, 86 in the app. The Laisha app has every practice question we have written to GATE in this subject, marked as you go, with timed papers, a jump-to-unanswered list and a certificate when you pass at 70 per cent.

Free for ten days, then one subscription of US$10 a month. We would rather say so here than have you find it later.

Practise the full set in Laisha →

Read the subject

Stochastic ProcessesThe full study manual, free GATEFormat, sections and how it has changed

More GATE practice

Statistical Inference I: EstimationProbability TheoryMultivariate AnalysisCategorical Data Analysis & Generalized Linear ModelsBayesian InferenceNonparametric & Rank-Based MethodsBioassay, Survival & Epidemiological StatisticsProbability Distributions & Sampling DistributionsStatistical Inference II: Testing of Hypotheses & Sequential AnalysisReal Analysis for StatisticsOptimization Techniques for StatisticiansLinear Algebra & Matrix Theory for StatisticsStatistical Quality Control & ReliabilityLinear Models & Regression Analysis

Stochastic Processes for other exams

IIT JAM · IndiaChina national postgraduate entrance exam · ChinaICAR AICE-JRF/SRF · IndiaCSIR-UGC NET · IndiaASRB Agricultural Research Service · IndiaASRB NET · IndiaCUET-PG · IndiaIndian Statistical Institute admission tests · India

Ask Laisha about this

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