CSIR-UGC National Eligibility Test (NET) for Junior Research Fellowship and Lecturer-ship COMMON SYLLABUS

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.

Classification of second order PDEs. unique factorization domain. system of first order ODEs. Euler. finite fields. Sturm-Liouville boundary value problem. congruences. Mobius transformations. Solution of systems of linear algebraic equations using Gauss elimination and Gauss-Seidel methods. Taylor series. Conformal mappings. Galois Theory. variation of parameters. Schwarz lemma. modified Euler and . separation axioms. Cauchy’s integral formula. normal subgroups. permutation groups. Polynomial rings and irreducibility criteria. singular solutions of first order ODEs. Partial Differential Equations (PDEs): Lagrange and Charpit methods for solving first order PDEs. ideals. Fields. quotient rings. dense sets. Groups. Euler’s Ø. field extensions. Liouville’s theorem. Method of iteration and Newton-Raphson method. Green’s function. Rate of convergence. calculus of residues. Numerical solutions of ODEs using Picard. prime and maximal ideals. homomorphisms. subspace and product topology. Hermite and spline interpolation. principal ideal domain. inclusion-exclusion principle. General solution of higher order PDEs with constant coefficients. Fundamental theorem of arithmetic.Contour integral. Rings. Cayley’s theorem. General theory of homogenous and non-homogeneous linear ODEs. quotient groups. pigeon-hole principle. cyclic groups. subgroups. UNIT – 3 Ordinary Differential Equations (ODEs): Existence and uniqueness of solutions of initial value problems for first order ordinary differential equations. divisibility in Z. combinations. Heat and Wave equations. derangements. Numerical Analysis : Numerical solutions of algebraic equations. Chinese Remainder Theorem. Maximum modulus principle. Numerical differentiation and integration. Finite differences.function. Cauchy’s theorem. Method of separation of variables for Laplace. Laurent series. class equations. Euclidean domain. Lagrange. Algebra: Permutations. Sylow theorems. Open mapping theorem. connectedness and compactness. Topology: basis. Cauchy problem for first order PDEs. primitive roots.

Simple nonparametric tests for one and two sample problems. Data reduction techniques: Principle component analysis. Classical Mechanics: Generalized coordinates. properties of estimators. Multivariate normal distribution. Necessary and sufficient conditions for extrema. best linear unbiased estimators. Linear Integral Equations: Linear integral equation of the first and second kind of Fredholm and Volterra type. UNIT – 4 Descriptive statistics. tests for linear hypotheses. confidence intervals. Hamilton’s canonical equations. stationary distribution. rank correlation and test for independence. Lagrange’s equations. Bayes theorem. Euler-Lagrange equation. Probability inequalities (Tchebyshef. exploratory data analysis Sample space. Markov chains with finite and countable state space. Cluster analysis. Euler’s dynamical equations for the motion of a rigid body about an axis. partial and multiple correlation coefficients and related tests. marginal and conditional distributions.d. Jensen). Variational methods for boundary value problems in ordinary and partial differential equations. Hamilton’s principle and principle of least action. Inference for parameters. Discriminant analysis. Large sample tests. Characteristic functions. expectation and moments. classification of states. Gauss-Markov models. Calculus of Variations: Variation of a functional. Logistic regression. Analysis of discrete data and chi-square test of goodness of fit.Runge-Kutta methods. standard errors and asymptotic distributions. Standard discrete and continuous univariate distributions. Poisson and birth-and-death processes. Elementary Bayesian inference. Methods of estimation. Distribution of quadratic forms. . Canonical correlation. estimability of parameters. confidence intervals. Random variables and distribution functions (univariate and multivariate). independent events. theory of small oscillations.i. Modes of convergence. Tests of hypotheses: most powerful and uniformly most powerful tests. discrete probability. Independent random variables. resolvent kernel. sampling distributions. Wishart distribution and their properties. Simple and multiple linear regression. Solutions with separable kernels. likelihood ratio tests. Two-dimensional motion of rigid bodies. case). limiting behaviour of n-step transition probabilities. Analysis of variance and covariance. distribution of order statistics and range. Fixed. random and mixed effects models. Central Limit theorems (i. Markov. Characteristic numbers and eigenfunctions. Elementary regression diagnostics. weak and strong laws of large numbers.

Ratio and regression methods. stratified sampling and systematic sampling.Simple random sampling. . series and parallel systems. All students are expected to answer questions from Unit I. M/M/C. M/M/C with limited waiting space. censoring and life testing. Elementary queuing and inventory models. Hazard function and failure rates. Probability proportional to size sampling. randomized block designs and Latin-square designs. duality. Linear programming problem. Steady-state solutions of Markovian queuing models: M/M/1. Completely randomized designs. simplex methods. Students with in statistics are expected to answer additional question from Unit IV. Students in mathematics are expected to answer additional question from Unit II and III. M/M/1 with limited waiting space. 2K factorial experiments: confounding and construction. BIBD. Connectedness and orthogonality of block designs. M/G/1.

Sign up to vote on this title
UsefulNot useful