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]
UnitAll (738)Analysis & Linear AlgebraComplex Analysis, Algebra & TopologyODE, PDE & Applied MathematicsProbability, Statistics & Linear Programming
PartPart B (Single Choice: +3 / −0.75)Part C (Multi-Select: +4.75 / 0)Part A (Aptitude: +2 / −0.5)Year
Trap family

5 questions match · page 1 of 1

CSIR NET June 2025 · Part B (3 Marks)Probability, Statistics & Linear Programming#the-optimum-is-where-the-first-two-constraints-meet-not-the-first-and

Solve the following linear programming problem: maximize z = x + y subject to 5x + 3y ≤ 30, 2x + 6y ≤ 25, 2x − y ≤ 8, x ≥ 0, y ≥ 0. Then the optimal value of the objective function is

Single choice · Linear Programming

CSIR NET December 2025 · Part B (3 Marks)Probability, Statistics & Linear Programming#check-every-vertex-the-optimum-need-not-sit-where-the-loosest-looking

Consider the following linear programming problem: Maximize 3x1+4x23x_{1} + 4x_{2} subject to 3x1+2x2≤12,3x1+5x2≤15,2x1−x2≥0,x2≤23x_{1} + 2x_{2} \le 12, 3x_{1} + 5x_{2} \le 15, 2x_{1} - x_{2} \ge 0, x_{2} \le 2, and x1,x2≥0x_{1}, x_{2} \ge 0. Which of the following values is the optimum value of the objective function in the feasible region?

Single choice · Linear Programming

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#chain-the-constraints-to-bound-the-objective

Consider maximizing the objective function P=x1+2x2+3x3P = x_{1} + 2x_{2} + 3x_{3} subject to x1+x2≤5,x2+x3≤2,x1+x2+x3≤6,x1≥0,x2≥0,x3≥0x_{1} + x_{2} \le 5, x_{2} + x_{3} \le 2, x_{1} + x_{2} + x_{3} \le 6, x_{1} \ge 0, x_{2} \ge 0, x_{3} \ge 0. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Linear Programming

CSIR NET December 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#a-non-negative-sum-bounded-above-by-zero

Consider maximizing the objective function P=x1+x2P = x_{1} + x_{2} subject to x1+x2+2x3≤5,2x1−3x3≥1,x2+x3≤0,x1≥0,x2≥0,x3≥0x_{1} + x_{2} + 2x_{3} \le 5, 2x_{1} - 3x_{3} \ge 1, x_{2} + x_{3} \le 0, x_{1} \ge 0, x_{2} \ge 0, x_{3} \ge 0. Then, which of the following statements are true?

Multi-select · full marks only for the exact set · Linear Programming

CSIR NET June 2024 · Part C (4.75 Marks)Probability, Statistics & Linear Programming#an-unbounded-variable-hidden-among-bounded-ones

Consider the linear programming problem: max{x1+x2+x3x_{1} + x_{2} + x_{3}} subject to constraints x1+x2−x3≤1,x1+x3≤2,0≤x1≤1/2,x2≥0x_{1} + x_{2} - x_{3} \le 1, x_{1} + x_{3} \le 2, 0 \le x_{1} \le 1/2, x_{2} \ge 0, and 0≤x3≤10 \le x_{3} \le 1. Which of the following statements are true?

Multi-select · full marks only for the exact set · Linear Programming

Session · 0 answered · — accuracy

Reset Filters Next Random Trap PYQ

Explore further

Topic-wise weightage →counted from these papers, with each paper's coverage shownWhat changed between two papers →by share of each paper, not raw countsWhat each paper cut off at →official CSIR figures, category-wise, with the sourcePart A general aptitude →30 of the 200 marks, and no mathematics