LAISHA
Open Laisha

CUET-PG Stochastic Processes: practice questions

CUET-PG - Statistics · India · National Testing Agency

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

About CUET-PG

CUET-PG - Statistics is a postgraduate admission exam run by National Testing Agency, for candidates in India. Computer-based MCQ test used by central and participating universities for MSc Statistics admission.

Official site: exams.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.

Stochastic Processes in CUET-PG

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 33 CUET-PG questions in this subject: 18 easy, 13 medium, 2 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 CUET-PG and are not shown on any other exam's page.

Question 1 · easy

When is a process weakly (covariance) stationary?

  1. Its finite-dimensional distributions are shift-invariant
  2. Constant mean; covariance depends only on lag
  3. Its variance grows linearly in t
  4. Its increments are independent
Answer and working

B. Constant mean; covariance depends only on lag

Weak stationarity concerns only first and second moments; shift-invariance of all finite-dimensional distributions is strict stationarity. Brownian motion has independent increments but variance growing with t, so it is not stationary.

Question 2 · easy

A weather chain has P(dry → wet) = 0.3 and P(wet → wet) = 0.6. If today is dry, what is the probability that the day after tomorrow is wet?

  1. 0.30
  2. 0.18
  3. 0.39
  4. 0.09
Answer and working

C. 0.39

P²(D, W) = 0.7 × 0.3 + 0.3 × 0.6 = 0.39, summing over tomorrow being dry or wet. 0.18 counts only the path dry-wet-wet.

Question 3 · easy

Which property must every row of a Markov transition matrix have?

  1. Its diagonal entry is the largest
  2. Non-negative, summing to 1
  3. Its entries sum to 0
  4. Its entries are equal
Answer and working

B. Non-negative, summing to 1

Each row is the conditional distribution of the next state given the current one.

Question 4 · easy

When is state i of a Markov chain recurrent?

  1. Return to i is certain
  2. When i is accessible from every state
  3. When the chain can leave i
  4. When pᵢᵢ > 0
Answer and working

A. Return to i is certain

Recurrence means fᵢᵢ = 1, equivalently Σₙ pᵢᵢ⁽ⁿ⁾ = ∞. pᵢᵢ > 0 concerns aperiodicity, not recurrence.

Question 5 · easy

Farmers arrive at a soil-testing lab as a Poisson process with rate 3 per hour. What is the probability of no arrivals in 30 minutes?

  1. 0.777
  2. 0.500
  3. 0.050
  4. 0.223
Answer and working

D. 0.223

N(0.5) ~ Poisson(1.5): P(0) = e^(−1.5) = 0.223. e^(−3) uses a full hour.

Question 6 · easy

Arrivals are Poisson with rate 3 per hour. What is the probability of exactly 2 arrivals in an hour?

  1. 0.271
  2. 0.224
  3. 0.801
  4. 0.448
Answer and working

B. 0.224

e^(−3)3²/2! = 0.224. Forgetting the 2! gives 0.448; 0.801 is P(at least 2).

Question 7 · easy

When is extinction of a Galton-Watson process certain (excluding the case where every individual has exactly one offspring)?

  1. When m = 2
  2. When m > 1
  3. Never
  4. When m ≤ 1
Answer and working

D. When m ≤ 1

Subcritical and critical processes die out with probability 1; supercritical ones survive with positive probability.

Question 8 · 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).

Question 9 · easy

For standard Brownian motion, what is the distribution of W(t) − W(s) for s < t?

  1. N(0, t + s)
  2. N(0, t − s)
  3. Exponential with mean t − s
  4. N(t − s, 1)
Answer and working

B. N(0, t − s)

Increments are normal with mean 0 and variance equal to the elapsed time, and independent over disjoint intervals.

Question 10 · medium

Why are rainfall Markov chains usually fitted separately for each month or season?

  1. Seasonal non-homogeneity
  2. Seasonal chains need no transition counts
  3. Monthly records are always independent
  4. Annual chains cannot be estimated
Answer and working

A. Seasonal non-homogeneity

A single matrix would average monsoon and dry-season behaviour; seasonal or smoothly varying (logistic) models respect the non-homogeneity.

A study plan for Stochastic Processes in CUET-PG

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 (42% of the 33 questions): Markov chains: transition matrices and Chapman-Kolmogorov equations (4, 12%); Poisson process and its properties (4, 12%); Branching processes and extinction probability (3, 9%); Brownian motion and its basic properties (3, 9%).

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

  2. Then the middle band: Classification of states and periodicity (3, 9%); Definition and classification of stochastic processes (3, 9%); Limiting and stationary distributions (3, 9%); Pure birth, pure death and birth-death processes (3, 9%).

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

  3. Then the lighter units: Renewal processes (introduction) (3, 9%); Markov-chain models of rainfall and crop sequences (2, 6%); Queueing models M/M/1 and M/M/c (2, 6%).

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

  4. Leave time for the hard ones: Definition and classification of stochastic processes (1 hard of 3), Limiting and stationary distributions (1 hard of 3).

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

  5. Bank the easy marks: Markov chains: transition matrices and Chapman-Kolmogorov equations (3 easy of 4); Poisson process and its properties (3 easy of 4).

    Do these early in revision so they are fast on the day.

  6. 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 — CUET-PG 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.