LAISHA
Open Laisha

CUET-PG Probability Theory: practice questions

CUET-PG - Statistics · India · National Testing Agency

Original practice questions written to the published syllabus · not past papers
10worked here, free
85written 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.

Probability Theory in CUET-PG

Classical and conditional probability, addition and multiplication rules, Bayes' theorem, expectation and variance, Chebyshev's inequality and the normal approximation.

Probability from its axioms to the limit theorems: random variables, expectation, generating functions, inequalities and modes of convergence, ending with the laws of large numbers and the central limit theorem that justify most of applied statistics.

Our 85 CUET-PG questions in this subject: 35 easy, 42 medium, 8 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 · medium

X has a continuous, strictly increasing CDF F. What is the distribution of Y = F(X)?

  1. The same distribution as X, shifted to start at zero
  2. Exponential (mean 1), whatever the distribution of X
  3. Uniform on (0, 1), whatever the distribution of X
  4. Standard normal, by the central limit theorem
Answer and working

C. Uniform on (0, 1), whatever the distribution of X

P(Y ≤ y) = P(X ≤ F⁻¹(y)) = F(F⁻¹(y)) = y for 0 < y < 1, so Y is uniform: the probability integral transform. −ln Y, not Y, would be exponential; the CLT plays no part.

Question 2 · medium

X is a non-negative continuous random variable with CDF F. Which formula gives E(X)?

  1. ∫ from 0 to ∞ of x F(x) dx
  2. ∫ from 0 to ∞ of [1 − F(x)] dx
  3. ∫ from 0 to ∞ of F(x) dx
  4. 1 − ∫ from 0 to ∞ of F(x) dx
Answer and working

B. ∫ from 0 to ∞ of [1 − F(x)] dx

Writing X = ∫₀^X dx = ∫₀^∞ 1{X > x} dx and taking expectations gives E(X) = ∫₀^∞ P(X > x) dx = ∫ (1 − F). For exponential rate λ this gives ∫ e^(−λx) dx = 1/λ. ∫ F dx diverges for any proper distribution.

Question 3 · medium

(X, Y) has joint density f(x, y) = x + y on 0 < x < 1, 0 < y < 1. What is the marginal density of X?

  1. 2x for 0 < x < 1
  2. x + 1/2 for 0 < x < 1
  3. x + y for 0 < x < 1
  4. x for 0 < x < 1
Answer and working

B. x + 1/2 for 0 < x < 1

f_X(x) = ∫₀¹ (x + y) dy = x + 1/2. It integrates to 1/2 + 1/2 = 1 as it must. A marginal cannot contain y; dropping the y-integral gives x, which integrates to only 1/2.

Question 4 · medium

X and Y are independent and uniform on (0, 1). What is P(X + Y ≤ 0.5)?

  1. 0.375
  2. 0.125
  3. 0.500
  4. 0.250
Answer and working

B. 0.125

The sum has the triangular density f(s) = s on (0, 1), so P(S ≤ 0.5) = ∫₀^0.5 s ds = 0.5²/2 = 0.125: the area of a right triangle with legs 0.5 in the unit square. 0.250 forgets the 1/2 of the triangle; 0.500 treats the sum as uniform on (0, 1).

Question 5 · medium

An irrigation pump stops when either of two independent components fails. Their failure times are exponential with rates 0.02 and 0.03 per hour. What is the mean time until the pump first stops?

  1. 41.7 hours
  2. 50.0 hours
  3. 20.0 hours
  4. 83.3 hours
Answer and working

C. 20.0 hours

P(min > t) = e^(−0.02t)e^(−0.03t) = e^(−0.05t), so the minimum is exponential with rate 0.05 and mean 20.0 h. Adding the means (83.3 h) describes components in standby, not in series; averaging them (41.7 h) has no basis.

Question 6 · medium

Yield Y is a concave function g of rainfall R. An agronomist computes g at mean rainfall and calls it 'expected yield'. Compared with the true E(Y), this figure is:

  1. Exactly equal, because expectation is a linear operator
  2. Never smaller, because E g(R) ≤ g(E R) for concave g
  3. Never larger, because E g(R) ≥ g(E R) for concave g
  4. Larger or smaller with equal chance, depending on the sample
Answer and working

B. Never smaller, because E g(R) ≤ g(E R) for concave g

Jensen for concave g: E g(R) ≤ g(E R). So yield at average rainfall over-states (or at best equals) average yield; rainfall variability itself lowers average yield. Linearity of expectation applies to linear functions only.

Question 7 · medium

Xₙ converges in distribution to a constant c. What can be concluded?

  1. Xₙ converges to c in mean square as well
  2. Xₙ converges to c in probability as well
  3. Xₙ converges to c almost surely as well
  4. Nothing more, since the limit is only in law
Answer and working

B. Xₙ converges to c in probability as well

For a degenerate limit, P(|Xₙ − c| > ε) ≤ 1 − Fₙ(c + ε) + Fₙ(c − ε) → 0, because c ± ε are continuity points. Almost-sure and mean-square convergence need more (moments may not even exist).

Question 8 · easy

The sample mean X̄ₙ converges in probability to μ > 0. By the continuous mapping theorem, log X̄ₙ converges in probability to:

  1. 0
  2. log μ
  3. E(log X)
  4. μ
Answer and working

B. log μ

g(x) = log x is continuous at μ > 0, so g(X̄ₙ) → g(μ) = log μ. E(log X) is a different quantity, smaller than log μ by Jensen's inequality.

Question 9 · easy

What is the essential difference between the weak and the strong law of large numbers?

  1. The weak law holds for small samples; the strong law holds only for samples over thirty
  2. The weak law needs a finite variance; the strong law needs only identically distributed variables
  3. The weak law gives convergence in probability; the strong law gives almost-sure convergence
  4. The weak law concerns sums; the strong law concerns the normal limit of sums
Answer and working

C. The weak law gives convergence in probability; the strong law gives almost-sure convergence

The laws differ in the mode of convergence of X̄ₙ to μ. Khintchine's WLLN needs no variance, the SLLN needs E|X| < ∞, and neither is about a particular sample size or about normality, which is the CLT.

Question 10 · easy

U₁, ..., U₁₂ are iid uniform on (0, 1). Why is S = ΣUᵢ − 6 used as a rough standard normal generator?

  1. S has mean 0 and variance 12 × 1/12 = 1, and the CLT makes it near-normal
  2. S is exactly normal because a sum of uniforms is always normally distributed
  3. S has mean 6 and variance 1, and the normal shape follows from symmetry alone
  4. S has mean 0 and variance 12, and dividing is unnecessary for large sums
Answer and working

A. S has mean 0 and variance 12 × 1/12 = 1, and the CLT makes it near-normal

Each Uᵢ has mean 1/2 and variance 1/12, so ΣUᵢ has mean 6 and variance 1; subtracting 6 standardises it, and the CLT makes 12 terms close to normal (though the tails are cut off at ±6). A sum of uniforms is never exactly normal.

A study plan for Probability Theory 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 (44% of the 85 questions): Expectation, moments and moment-generating, probability-generating and characteristic functions (10, 12%); Sample spaces, sigma-fields and the axioms of probability (10, 12%); Inequalities: Markov, Chebyshev, Jensen and Cauchy-Schwarz (9, 11%); Conditional probability, independence and Bayes' theorem (8, 9%).

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

  2. Then the middle band: Functions of random variables and transformations (Jacobian method) (8, 9%); Joint, marginal and conditional distributions; conditional expectation (8, 9%); Random variables, distribution functions, mass and density functions (8, 9%); Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method (7, 8%).

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

  3. Then the lighter units: Modes of convergence and their relations; Slutsky's lemma; Borel-Cantelli lemma (7, 8%); Weak and strong laws of large numbers (6, 7%); Elements of measure theory: measurable functions and Lebesgue integral (4, 5%).

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

  4. Leave time for the hard ones: Modes of convergence and their relations; Slutsky's lemma; Borel-Cantelli lemma (2 hard of 7), Elements of measure theory: measurable functions and Lebesgue integral (1 hard of 4), Sample spaces, sigma-fields and the axioms of probability (2 hard of 10).

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

  5. Bank the easy marks: Conditional probability, independence and Bayes' theorem (5 easy of 8); Random variables, distribution functions, mass and density functions (5 easy of 8).

    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 Probability Theory

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.