A new pattern will be implemented from June 2011 for NETJRF exam.The detailed exam scheme and syllabus for physical science paper given below.
EXAM SCHEME
MAXIMUM MARKS: 200
TIME: 3 HOURS
From June, 2011 CSIRUGC (NET) Exam will 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.
Part 'B'
This part shall contain 20 Multiple Choice Questions (MCQs) generally covering the topics given in the Part 'A'(CORE) of syllabus. All questions are compulsory. Each question shall be of 3.5 Marks. The total marks allocated to this section shall be 70 out of 200.
Part 'C'
This part shall contain 25 questions from Part 'B'(Advanced) 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. There will be 10 compulsory questions. Out of remaining 15 questions, a candidate shall be required to answer any 10. Each question shall be of 5 Marks. The total marks allocated to this section shall be 100 out of 200.
There will be negative marking @25% for each wrong answer.To enable the candidates to go through the questions, the question paper booklet shall be distributed 15 minutes before the scheduled time of the exam. The Answer sheet shall be distributed at the scheduled time of the exam.
On completion of the exam i.e. at the scheduled closing time of the exam, the candidates shall be allowed to carry the Question Paper Booklet. No candidate is allowed to carry the Question Paper Booklet in case he/she chooses to leave the test before the scheduled closing time.
Model Question Paper shall be released at the time of Notification for June 2011 exam
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, CayleyHamilton 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, CauchyRiemann 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, pigeonhole principle, inclusionexclusion 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 nonhomogeneous linear ODEs, variation of parameters, SturmLiouville 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 NewtonRaphson method, Rate of convergence, Solution of systems of linear algebraic equations using Gauss elimination and GaussSeidel methods, Finite differences, Lagrange, Hermite and spline interpolation, Numerical differentiation and integration, Numerical solutions of ODEs using Picard, Euler, modified Euler and RungeKutta methods.
Calculus of Variations: Variation of a functional, EulerLagrange 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 eigenfunctions, resolvent kernel.
Classical Mechanics: Generalized coordinates, Lagrange's equations, Hamilton's canonical equations, Hamilton's principle and principle of least action, Twodimensional 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 nstep transition probabilities, stationary distribution, Poisson and birthanddeath 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 chisquare 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. GaussMarkov 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 Latinsquare 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. Steadystate 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 with M.sc. in mathematics are expected to answer additional question from Unit II and III. Students with M.sc. in statistics are expected to answer additional question from Unit IV.
Reference: http://csirhrdg.res.in/mcs_ma_sylbs.pdf
