Skip to content
PYQ Laboratory

CSIR NET Maths previous year question papers

Every PYQ, with the answer key, free — no account and no download. Pick your answer blind, then check it and uncover the trap. The worked solution and the per-option trap analysis come with Trap Analysis.

Total PYQs
[738 Total PYQs]
Solved today, this browser
[0 Solved Today]
Traps evaded today, this browser
[0 Traps Evaded]
Trap family

29 questions match · page 1 of 2

CSIR NET June 2025 · Part B (3 Marks)Probability, Statistics & Linear Programming#the-state-space-is-the-2025-residues-not-the-2024-step-values

Let Z1,Z2,…Z_{1}, Z_{2}, \dots be a sequence of independent and identically distributed random variables having discrete uniform distribution over {1, 2, …, 2024}. Let Yn=∑iY_{n} = \sum_{i}₌1nZi,n≥2_{1}^{n} Z_{i}, n \ge 2. Further, let XnX_{n} be the remainder when YnY_{n} is divided by 2025. Then, which of the following statements is true?

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2025 · Part B (3 Marks)Probability, Statistics & Linear Programming#an-unreachable-absorbing-state-splits-the-chain-into-two-closed-classe

Let {Xn:n≥0X_{n} : n \ge 0} be any homogeneous Markov Chain on the state space S = {1,2,3,4} having the transition probability matrix P=(pij)P = (p_{ij}) given by row 1 = (1/4, 0, 2/3, 1/12), row 2 = (0, 1, 0, 0), row 3 = (1/12, 0, 1/4, 2/3), row 4 = (2/3, 0, 1/12, 1/4). Which of the following statements about stationary distributions of any such Markov Chain is true?

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2025 · Part B (3 Marks)Probability, Statistics & Linear Programming#root-5-splits-the-binomial-support-between-2-and-3-not-at-a-rounder-nu

Let X1,X2,…X_{1}, X_{2}, \dots be a sequence of independent and identically distributed random variables having Binomial(3, 1/4) distribution. For j=1,2,…, define Yj=1Y_{j} = 1 if Xj≤5X_{j} \le \sqrt{5}, and 0 otherwise. If (1/n)∑j=1n(1/n)\sum_{j=1}^n Yj2Y_{j}^{2} converges almost surely to a constant c as n→∞n \to \infty, then the value of c equals

Single choice · Limit Theorems and Markov Chains

CSIR NET June 2025 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#a-2-cycle-and-a-3-cycle-in-the-same-class-force-the-period-to-1

Consider a Markov chain {Xn:n≥1X_{n} : n \ge 1} on state space {1, 2, 3, 4, 5} with the transition probability matrix whose rows are (0, 1/2, 1/2, 0, 0), (0, 0, 1, 0, 0), (0, 1/3, 0, 1/3, 1/3), (1, 0, 0, 0, 0) and (0, 0, 0, 0, 1). Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET June 2025 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#p-zero-is-1-minus-rho-the-idle-probability-not-rho-itself

Consider the M/M/1 queue in which customers arrive according to a Poisson process with rate 3 and successive service times are independent exponential random variables having mean 1/9. Let PnP_{n} be the long run probability that there are exactly n customers in the system. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET June 2025 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#the-variance-of-x-squared-is-the-fourth-moment-minus-1-not-the-fourth

Let X1,X2,…X_{1}, X_{2}, \dots be a sequence of independent and identically distributed random variables with E(X1)=0,E(X12)=1,E(X13)=0,E(X14)=3E(X_{1}) = 0, E(X_{1}^{2}) = 1, E(X_{1}^{3}) = 0, E(X_{1}^{4}) = 3. Let Sn=∑iS_{n} = \sum_{i}₌1nXi,Tn=∑i_{1}^{n} X_{i}, T_{n} = \sum_{i}₌1nXi2,Un=∑i_{1}^{n} X_{i}^{2}, U_{n} = \sum_{i}₌1nXi3_{1}^{n} X_{i}^{3} and Vn=∑iV_{n} = \sum_{i}₌1nXi4_{1}^{n} X_{i}^{4}. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2025 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#with-2-servers-the-death-rate-caps-at-2-mu-once-both-servers-are-busy

Consider an M/M/2 queuing system with the birth rate λ=4\lambda=4 per minute, the death rate μ=1\mu=1 per minute, and the total capacity of 3 customers (including the ones that are being served). Let p0p_{0} and p3p_{3} denote the long-run probabilities that the system will be empty (i.e. without customers) and will be blocked (i.e. full), respectively. Which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2025 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#reaching-a-closed-class-with-no-way-back-makes-every-state-outside-it

Suppose that the transition probability matrix of a homogeneous Markov chain with state space {1,2,3,4} is given by P, with row 1 = (1/4, 3/4, 0, 0), row 2 = (1, 0, 0, 0), row 3 = (1/8, 0, 7/8, 0), row 4 = (0, 0, 1/9, 8/9). Which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#the-median-survives-where-the-mean-does-not

Suppose that {XnX_{n}}(n∈N)(n\in\mathbb{N}) is a sequence of independent and identically distributed (i.i.d.) random variables with the common probability density function f(x)=1/(π(1+x2)),x∈Rf(x) = 1/(\pi(1 + x^{2})), x \in \mathbb{R}. Then which of the following statements is true?

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#thinned-poisson-streams-are-independent

Planes take off in a busy airport in accordance with the Poisson process with rate 60 planes per hour. 10% of these planes are cargo planes and 90% are passenger planes. Given that 10 cargo planes have taken off during one hour, what is the expected total number of planes that have taken off in that hour?

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#the-service-rate-scales-with-busy-servers

Consider an M/M/3 queuing system with arrival rate λ=2\lambda = 2 and service rate μ=3/2\mu = 3/2. Define, for i=1,2,…,Ii=1i = 1, 2, \dots, I_{i} = 1 if the first transition is from i to i + 1, and Ii=0I_{i} = 0 if the first transition from i is i − 1. Then, Var(I4)Var(I_{4}) equals

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#normalise-both-sums-before-the-limit

lim⁡(n→∞)∫01∫01⋯∫01(x12+⋯+xn2)/(x1+⋯+xn)\lim(n\to\infty) \int_{0}^{1}\int_{0}^{1}\cdots\int_{0}^{1} (x_{1}^{2} + \cdots + x_{n}^{2})/(x_{1} + \cdots + x_{n}) dx1…_{1} \dots dxn_{n} equals

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#the-stationary-share-not-the-transition-rate

In an examination question paper, all questions are 'True' or 'False' type. These are arranged in such a way that three-fourth of times a question with answer 'True' is followed by a question with answer 'True'. Also two-third of times a question with answer 'False' is followed by a question with answer 'False'. If the question paper has 100 questions, the approximate probability that the correct answer of the 100-th question is 'True', is

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#a-step-down-means-no-arrival-during-service

Consider an M/G/1 queuing system with arrival rate λ=1\lambda = 1 and independent and identically distributed successive service times having probability density function g(x) = xe⁻ˣ if x > 0, and 0 otherwise. Define, for i=1,2,…,Ii=1i = 1, 2, \dots, I_{i} = 1 if the first transition is from i to i − 1, and Ii=0I_{i} = 0 if the first transition from i is i + 1. Then, Var(I2)Var(I_{2}) equals

Single choice · Limit Theorems and Markov Chains

CSIR NET June 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#self-loop-needs-solving-not-summing

Let {XnX_{n} | n ≥ 0} be a homogeneous Markov chain with state space S = {0, 1, 2, 3, 4} and transition probability matrix

0 1 2 3 4
0 1/4 0 0 3/4 0
1 0 1 0 0 0
2 1/3 2/3 0 0 0
3 3/4 0 0 1/4 0
4 1/8 1/8 1/2 1/8 1/8

Let α\alpha denote the probability that starting with state 4 the chain will eventually get absorbed in closed class {0, 3}. Then the value of α\alpha is

Single choice · Limit Theorems and Markov Chains

CSIR NET June 2024 · Part B (3 Marks)Probability, Statistics & Linear Programming#finite-capacity-queue-must-renormalise

Consider a petrol pump which has a single petrol dispensing unit. Customers arrive there in accordance with a Poisson process having rate λ=1\lambda = 1 minutes. An arriving customer enters the petrol pump only if there are two or less customers in the petrol pump, otherwise he/she leaves the petrol pump without taking the petrol (at any point of time a maximum of three customers are present in the petrol pump). Successive service times of the petrol dispensing unit are independent exponential random variables having mean 1/2 minutes. Let X denote the average number of customers in the petrol pump in the long run. Then E(X) is equal to

Single choice · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#independence-permits-distributional-but-not-probability-convergence

Let X1,X2…X_{1}, X_{2} \dots be a sequence of independent random variables with XiX_{i} following N(0, 1 + 1/i) distribution for all i∈Ni \in \mathbb{N}. Let X be N(0, 1)-random variable independent of {Xn:n≥1X_{n} : n \ge 1}. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#the-product-vanishes-but-its-nth-root-does-not

Let U1,U2,…U_{1}, U_{2}, \dots be a sequence of independent and identically distributed (i.i.d.) U(0, 1) random variables. Let Gn=(∏(i=1..n)Ui)(1/n)G_{n} = (\prod(i=1..n) U_{i})^(1/n) be the geometric mean of U1,U2,…,UnU_{1}, U_{2}, \dots, U_{n} for n∈Nn \in \mathbb{N}. Let X1X_{1} and X2X_{2} be degenerate random variables such that P(X1=0)=1P(X_{1} = 0) = 1 and P(X2=1/e)=1P(X_{2} = 1/e) = 1. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#no-mean-and-still-a-weak-law

Let X1,X2,…,XnX_{1}, X_{2}, \dots, X_{n} be independent and identically distributed (i.i.d.) random variables such that for x=3,4,…,P(X1=±x)=1/(2x = 3, 4, \dots, P(X_{1} = \pm{}x) = 1/(2cx2ln⁡(x))^{2}\ln(x)), where c=∑(x=3..∞)1/(x2ln⁡(x))c = \sum(x=3..\infty) 1/(x^{2}\ln(x)). Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#a-communicating-class-that-leaks-is-transient

Consider the Markov chain with state space {0, 1, 2, 3, 4} and the transition probability matrix P = [[0.4, 0.3, 0.3, 0, 0], [0, 0.5, 0, 0.5, 0], [0.5, 0, 0.5, 0, 0], [0, 0.5, 0, 0.5, 0], [0, 0.3, 0, 0.3, 0.4]]. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#only-a-constant-limit-reverses-the-arrow

Suppose that a sequence of random variables {XnX_{n}}n≥1_{n}\ge_{1} and the random variable X are defined on the same probability space. Then which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#the-count-grows-only-its-proportion-converges

Let {(X_k, Y_k)}(k≥1) be a sequence of independent and identically distributed (i.i.d.) random vectors with common joint probability density function f(x, y) = e^(−y) if 0<x<y<∞0 < x < y < \infty, and 0 otherwise. For n = 1, 2, 3, …, let NnN_{n} be a random variable denoting the number of elements in the set {k : k = 1, 2, …, n; Y_k ≥ 2}. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#no-state-of-a-finite-irreducible-chain-is-transient

Consider the Markov chain with state space {0, 1, 2} and the transition probability matrix P = [[0, 1/2, 1/2], [3/4, 0, 1/4], [3/4, 1/4, 0]]. Let P⁽n^{n}⁾ = ((P⁽n^{n}⁾ij))_{ij})) denote the n-step transition probability matrix. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET June 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#no-finite-chain-has-a-null-recurrent-state

Transition probability matrix of a homogeneous Markov chain with states 0, 1, 2, 3 is P = [[1/4, 3/4, 0, 0], [1, 0, 0, 0], [2/3, 0, 1/3, 0], [0, 0, 2/5, 3/5]], where rows and columns are indexed 0, 1, 2, 3. Which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

CSIR NET June 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#divide-by-the-right-power-of-n

Let {XnX_{n}}n≥1_{n}\ge_{1} be a sequence of independent and identically distributed random variables with E(X1)=0E(X_{1}) = 0 and Var(X1)=1Var(X_{1}) = 1. Which of the following statements are true?

Multi-select · full marks only for the exact set · Limit Theorems and Markov Chains

Session · 0 answered · — accuracy