CSIR-UGC NET/JRF

Gate image

Index-

  1. About CSIR-UGC NET/JRF
  2. Eligibility for it
  3. Its Scope
  4. Exam. Scheme
  5. Syllabus
  6. MIMS Programme
  7. Study Material
  8. Admission Process
  9. Start of Batches
  10. Fee Structure
  11. Scholarship offered

1. CSIR

It stands for Council of Scientific & Industrial Research. It is a premier national R&D organisation and is among the world's largest publicly funded R&D organisations. CSIR conducts the Joint CSIR UGC NET exam twice a year (June & December), which is a national level entrance examination for Lectureship and Research Fellowship in the field of Science which includes Mathematical Sciences, Life Sciences, Physical Sciences, Chemical Sciences and Earth, Atmospheric, Ocean and Planetary Sciences.

2. Eligibility for CSIR NET

The interested candidates must have acquired their Masters' degree in Science stream. They should have scored 55 percent and above in the eligibility exam and should have done the course from a certified university. As per the CSIR NET Eligibility conditions, the candidates whose results are awaited can also apply subject to some given constraints. Usually, the NET qualified candidates opt for the two options – Either they seek for Assistant Professorship jobs or they choose to perform JRF (JRF is a fellowship which is offered by CSIR to the eligible and selected candidates. The fellowship is given to students to pursue their doctoral studies). Other details regarding eligibility and application process can be seen on www.csirhrdg.res.in

3. Scope of CSIR NET qualified candidate

Many of the candidates who score well in the CSIR NET JRF Exam go for the Ph.D. programs to add the doctoral or post-doctoral degree in their portfolios. Many of the candidates choose to get recruited on the Research Fellow positions in any of the reputed CSIR Research Laboratories. All NET qualified candidates are also eligible for Lectureship positions. Jobs in Public Sector Organizations are highly popular amongst the young candidates. These units offer the wide range of benefits and wonderful salary packages to the talented people. Many Public-Sector Undertakings have started taking interests in the recruitment of CSIR NET qualified candidates. While at the time of selection for the scientists or Research analysts, they consider CSIR Scorecards at priority and hire them based on their abilities. We are listing a few organizations that offer opportunities to CSIR NET qualified candidates-

  1. Indian Space Research Organization (ISRO)
  2. Indira Gandhi Centre for Atomic Research (IGCAR)
  3. Tata Institute of Fundamental Research (TIFR)
  4. Indian Institute of Science (IISc) Bangalore
  5. Defence Research Development Organization(DRDO) and many others.

4. Exam Scheme (Mathematical Sciences)

Time- 3 Hours Max. Marks- 200
CSIR-UGC (NET) Exam for Award of Junior Research Fellowship and Eligibility for Lectureship shall be a Single Paper Test having Multiple Choice Questions (MCQs). The question paper shall be divided in three parts.

Part 'A'- This part shall carry 20 questions pertaining to General Science, Quantitative Reasoning & Analysis and Research Aptitude. The candidates shall be required to answer any 15 questions. Each question shall be of two marks. The total marks allocated to this section shall be 30 out of 200. There will be negative marking @0.25 for each wrong answer.

Part 'B'- This part shall contain 40 Multiple Choice Questions (MCQs) generally covering the topics given in the syllabus. A candidate shall be required to answer any 25 questions. Each question shall be of three marks. The total marks allocated to this section shall be 75 out of 200. There will be negative marking @0.75 for each wrong answer.

Part 'C'- This part shall contain 60 questions that are designed to test a candidate's knowledge of scientific concepts and/or application of the scientific concepts. The questions shall be of analytical nature where a candidate is expected to apply the scientific knowledge to arrive at the solution to the given scientific problem. The questions in this part shall have multiple correct options. Credit in a question shall be given only on identification of ALL the correct options. No credit shall be allowed in a question if any incorrect option is marked as correct answer. No partial credit is allowed. A candidate shall be required to answer any 20 questions. Each question shall be of 4.75 marks. The total marks allocated to this section shall be 95 out of 200. There will be no negative marking in this part.

5. Syllabus

UNIT-1

Analysis:

Elementary set theory, finite, countable and uncountable sets, Real number system as a complete ordered field, Archimedean property, supremum, infimum. Sequences and series, convergence, limsup, liminf. Bolzano Weierstrass theorem, Heine Borel theorem. Continuity, uniform continuity, differentiability, mean value theorem. Sequences and series of functions, uniform convergence. Riemann sums and Riemann integral, Improper Integrals. Monotonic functions, types of discontinuity, functions of bounded variation, Lebesgue measure, Lebesgue integral. Functions of several variables, directional derivative, partial derivative, derivative as a linear transformation, inverse and implicit function theorems. Metric spaces, compactness, connectedness. Normed linear Spaces. Spaces of continuous functions as examples.

Linear Algebra:

Vector spaces, subspaces, linear dependence, basis, dimension, algebra of linear transformations. Algebra of matrices, rank and determinant of matrices, linear equations. Eigenvalues and eigenvectors, Cayley-Hamilton theorem. Matrix representation of linear transformations. Change of basis, canonical forms, diagonal forms, Triangular forms, Jordan forms. Inner product spaces, orthonormal basis. Quadratic forms, reduction and classification of quadratic forms

UNIT – 2

Complex Analysis:

Algebra of complex numbers, the complex plane, polynomials, power series, transcendental functions such as exponential, trigonometric and hyperbolic functions. Analytic functions, Cauchy-Riemann equations. Contour integral, Cauchy’s theorem, Cauchy’s integral formula, Liouville’s theorem, Maximum modulus principle, Schwarz lemma, Open mapping theorem. Taylor series, Laurent series, calculus of residues. Conformal mappings, Mobius transformations.

Algebra:

Permutations, combinations, pigeon-hole principle, inclusion-exclusion principle, derangements. Fundamental theorem of arithmetic, divisibility in Z, congruences, Chinese Remainder Theorem, Euler’s Ø- function, primitive roots. Groups, subgroups, normal subgroups, quotient groups, homomorphisms, cyclic groups, permutation groups, Cayley’s theorem, class equations, Sylow theorems. Rings, ideals, prime and maximal ideals, quotient rings, unique factorization domain, principal ideal domain, Euclidean domain. Polynomial rings and irreducibility criteria. Fields, finite fields, field extensions, Galois Theory. Topology: basis, dense sets, subspace and product topology, separation axioms, connectedness and compactness.

UNIT-3

Ordinary Differential Equations (ODEs):

Existence and uniqueness of solutions of initial value problems for first order ordinary differential equations, singular solutions of first order ODEs, system of first order ODEs. General theory of homogenous and non-homogeneous linear ODEs, variation of parameters. Sturm-Liouville’s boundary value problem, Green’s function.

Partial Differential Equations (PDEs):

Lagrange and Charpit methods for solving first order PDEs, Cauchy problem for first order PDEs. Classification of second order PDEs, General solution of higher order PDEs with constant coefficients, Method of separation of variables for Laplace, Heat and Wave equations.

Numerical Analysis:

Numerical solutions of algebraic equations, Method of iteration and Newton-Raphson method, Rate of convergence, Solution of systems of linear algebraic equations using Gauss elimination and Gauss-Seidel methods, Finite differences, Lagrange, Hermit and spline interpolation, Numerical Differentiation and integration, Numerical solutions of ODEs using Picard, Euler, modified Euler and Runge-Kutta methods.

Calculus of Variations:

Variation of a functional, Euler-Lagrange equation, Necessary and sufficient conditions for Extrema. Variational methods for boundary value problems in ordinary and partial differential equations.

Linear Integral Equations:

Linear integral equation of the first and second kind of Fredholm and Volterra type, Solutions with separable kernels. Characteristic numbers and Eigen functions, Resolvent kernel.

Classical Mechanics:

Generalized coordinates, Lagrange’s equations, Hamilton’s canonical equations, Hamilton’s principle and principle of least action, Two-dimensional motion of rigid bodies, Euler’s dynamical equations for the motion of a rigid body about an axis, theory of small oscillations.

UNIT-4

Descriptive statistics, exploratory data analysis, Sample space, discrete probability, independent events, Bayes theorem. Random variables and distribution functions (univariate and multivariate); expectation and moments. Independent random variables, marginal and conditional distributions. Characteristic functions. Probability inequalities

(Tchebyshef, Markov, Jensen). Modes of convergence, weak and strong laws of large numbers, Central Limit theorems (i.i.d. case). Markov chains with finite and countable state space, classification of states, limiting behaviour of n-step transition probabilities, stationary distribution, Poisson and birth-and-death processes.

Standard discrete and continuous univariate distributions. Sampling distributions, standard errors and asymptotic distributions, distribution of order statistics and range. Methods of estimation, properties of estimators, confidence intervals. Tests of hypotheses: most powerful and uniformly most powerful tests, likelihood ratio tests. Analysis of discrete data and chi-square test of goodness of fit. Large sample tests. Simple nonparametric tests for one and two sample problems, rank correlation and test for independence. Elementary Bayesian inference.

Gauss-Markov models, Estimability of parameters, best linear unbiased estimators, confidence intervals, tests for linear hypotheses. Analysis of variance and covariance. Fixed, random and mixed effects models. Simple and multiple linear regression. Elementary regression diagnostics. Logistic regression.

Multivariate normal distribution, Wishart distribution and their properties. Distribution of quadratic forms. Inference for parameters, partial and multiple correlation coefficients and related tests. Data reduction techniques: Principle component analysis, Discriminant analysis, Cluster analysis, Canonical correlation. Simple random sampling, stratified sampling and systematic sampling. Probability proportional to size sampling. Ratio and regression methods. Completely randomized designs, randomized block designs and Latin-square designs. Connectedness and Orthogonality of block designs, BIBD. 2K factorial experiments: confounding and construction. Hazard function and failure rates, censoring and life testing, series and parallel systems.

Linear programming problem, simplex methods, duality. Elementary queuing and inventory models. Steady-state solutions of Markovian queuing models: M/M/1, M/M/1 with limited waiting space, M/M/C, M/M/C with limited waiting space, M/G/1.

All students are expected to answer questions from Unit I. Students in Mathematics are expected to answer additional question from Unit II and III. Students in Statistics are expected to answer additional questions from Unit IV.

6. MIMS Programme

  1. Entire informations regarding CSIR-NET/JRF and its scope.
  2. Detailed study of complete syllabus by regular classes.
  3. All the lectures according to Lecture-Plan in systematic order.
  4. Doubt classes after every chapter and in every week.
  5. Discussion of objective questions chapter wise.
  6. Discussion of Question Bank and List of model questions.
  7. Model tests before the CSIR exams.
  8. Post examination analysis.
  9. Easy and convenient environment of learning and practices.

7. Study Material-

www.mims.org.in->Home->Study Material

8. Admission Process (in steps)

  1. Registration- Always open
  2. Scholarship Confirmation- Test/Verification(If any)
  3. Fee Submission
  4. Admission Confirmation
  5. Lecture permission

10. Start of Batches-

  1. 2nd week of March every year.
  2. As per the notification given by MIMS

11. Fee Structure-

www.mims.org.in->Home->Admissions->Fee Structure
Or, contact to the office.
It can change according to time and need.

12. Scholarship offered to the students of following category-

  1. Alumni of MIMS
  2. Rank holder of Scholarship test held by MIMS
  3. University Toppers (Certificate required)
  4. College Toppers (Certificate required)
  5. Teachers of recognized institutes/schools/colleges (Identity proof required)
  6. Researchers (Proof required)
  7. National/State/District Champions in Athletics/Sports/Games (Certificate required).
  8. NCC ‘C’ certificate holder (Certificate required).
  9. Any other students who really deserve it.