The CSIR NET Mathematical Sciences examination for the June 2026 session is scheduled to be held on 17 July 2026 in Shift 2 (3:00 PM to 6:00 PM) in Computer-Based Test (CBT) mode. With the examination approaching, solving and analysing previous year papers is one of the most effective ways to understand the latest question pattern, subject-wise weightage, and frequently tested concepts.
This CSIR NET Mathematical Sciences PYQ Analysis is based on six question papers conducted between June 2023 and June 2025, covering nearly 510 questions. The analysis highlights important subjects, recurring theorem-based questions, Part C trends, repeated topics, and preparation priorities to help candidates prepare more effectively for the June 2026 examination.
The examination is divided into three sections. Each section evaluates different skills required for Mathematical Sciences.
| Part | Approximate Questions | Purpose |
| Part A | 20 | General Aptitude, Logical Reasoning, Arithmetic, Series, Geometry, Probability |
| Part B | Around 30 | Core Mathematical Sciences concepts with single correct answers |
| Part C | Around 35 | Advanced conceptual questions with multiple correct answers |
The CSIR NET Mathematical Sciences PYQ Analysis shows that Part C remains the most important section because it contains advanced conceptual and multiple-select questions. These questions require candidates to evaluate every option carefully. A single mistake can lead to losing the entire mark for that question.
The paper follows a similar structure across all six analysed examinations.
| Section | Question Range | Focus Area |
| General Aptitude | Q1–Q20 | Reasoning, Arithmetic, Data Interpretation, Geometry, Series |
| Core Mathematics | Q21–Q50 | Analysis, Algebra, Complex Analysis, Linear Algebra, ODE, PDE |
| Advanced Mathematics | Q51–Q85 | Multi-select conceptual questions across all major subjects |
The CSIR NET Mathematical Sciences Question Paper Analysis indicates that Part C has become the deciding factor for high scores. Most top-ranking candidates perform well in this section because of strong conceptual clarity.
The following table summarises the average number of questions observed across six papers.
| Subject | Approximate Questions per Paper | Weightage Trend |
| Real Analysis | 10–14 | Very High |
| Linear Algebra | 8–12 | Very High |
| Abstract Algebra | 8–12 | Very High |
| Complex Analysis | 8–10 | Very High |
| Ordinary Differential Equations | 6–9 | High |
| Partial Differential Equations | 5–7 | High |
| Topology | 4–6 | Medium-High |
| Calculus of Variations | 4–6 | Medium-High |
| Integral Equations | 3–5 | Medium |
| Numerical Analysis | 3–5 | Medium |
| General Aptitude | 20 | Fixed |
This CSIR NET Mathematical Sciences Weightage Analysis clearly shows that Real Analysis, Linear Algebra, Abstract Algebra, and Complex Analysis together contribute a significant portion of the paper. Candidates should prioritise these subjects during preparation.
Several concepts appeared repeatedly across almost every paper. These topics deserve special attention during revision.
Real Analysis consistently had the highest number of questions. Frequently tested concepts include:
Sequences and Series
Uniform Convergence
Continuity
Differentiability
Riemann Integration
Monotone Functions
Uniform Continuity
Limit Superior and Limit Inferior
Most questions required the application of standard theorems instead of lengthy calculations.
Linear Algebra remained one of the most reliable scoring sections. Repeated topics include:
Rank of Matrices
Eigenvalues and Eigenvectors
Diagonalisation
Minimal Polynomial
Inner Product Spaces
Quadratic Forms
Positive Definiteness
Symmetric Matrices
Rank inequalities and diagonalisability appeared in almost every paper.
Complex Analysis continued to receive substantial weightage. Most repeated concepts include:
Liouville's Theorem
Residue Theorem
Laurent Series
Contour Integration
Singularities
Argument Principle
Entire Functions
Schwarz Lemma
Liouville's Theorem appeared in different forms throughout all six papers.
Questions from Abstract Algebra mainly focused on theorem-based applications. Important areas include:
Groups
Rings
Ideals
Homomorphisms
Sylow Theorems
Finite Fields
Galois Theory
Class Equation
Sylow Theorems and finite field properties were among the most repeated concepts.
Differential Equations maintained a consistent representation. Commonly tested topics include:
Wronskian
Existence and Uniqueness
Picard-Lindelöf Theorem
Cauchy Problems
Lagrange's Method
PDE Classification
Wave Equation
Heat Equation
Wronskian-based questions appeared in nearly every analysed paper.
The CSIR NET Mathematical Sciences Previous Year Paper Analysis highlights several concepts that repeatedly appear in different forms.
| Topic | Common Question Pattern |
| Liouville's Theorem | Bounded entire functions, bounded real or imaginary parts |
| Rank Inequalities | Rank(A+B), Rank(AB), Sylvester Rank Inequality |
| Diagonalisation | Minimal Polynomial, Eigenvalue Multiplicity |
| Sylow Theorems | Number of Sylow Subgroups |
| Finite Fields | Cyclic Multiplicative Groups, Subfields |
| Wronskian | Linear Independence of Solutions |
| Picard-Lindelöf | Existence and Uniqueness of IVP |
| Euler-Lagrange Equation | Calculus of Variations |
| PDE Classification | Hyperbolic, Parabolic, Elliptic Equations |
| Compactness | Metric Spaces and Connectedness |
These concepts are repeatedly used to frame conceptual and multi-select questions.
Several incorrect assumptions repeatedly appear in the options of previous-year questions.
| Common Mistake | Correct Understanding |
| Rank(A+B) always equals Rank(A)+Rank(B) | This is not always true. |
| Every bounded function satisfies Liouville's Theorem | The function must be entire and bounded on the whole complex plane. |
| Every compact subset is closed in every topological space | This holds only in Hausdorff spaces. |
| Every finite field has a cyclic additive group | Only fields of prime order have cyclic additive groups. |
| Newton-Raphson always has quadratic convergence | Multiple roots reduce the order of convergence. |
| Every connected open set is not path-connected | Open connected subsets of ℝⁿ are path-connected. |
| Every nilpotent matrix is diagonalizable | A non-zero nilpotent matrix is never diagonalizable. |
Avoiding these common misconceptions can improve performance in conceptual questions.
The CSIR NET Mathematical Sciences PYQ Analysis shows that the examination pattern has remained consistent over recent years, with greater emphasis on conceptual understanding than lengthy calculations. Real Analysis, Linear Algebra, Abstract Algebra, and Complex Analysis continue to account for a significant share of the questions, while Part C remains the highest-scoring as well as the most challenging section.
Candidates preparing for the June 2026 examination should prioritise repeated concepts, strengthen theorem-based applications, practise multi-select questions regularly, and solve previous year papers in exam-like conditions. A balanced combination of concept revision and systematic PYQ practice can help improve both accuracy and confidence.