Sie sind auf Seite 1von 4

SYLLABUS FOR AURCET

PAPER I

Syllabus of Paper I : Common to all Science Subjects:General information on


Science and its interface with society to test the candidates awareness of science, aptitude of scientific and quantitative reasoning. Questions would be so designed to judge the creativity, analytical ability and research aptitude of a candidate. The questions to test the knowledge at the basic level would be setup in each of the subject areas of NET, viz., Chemical Sciences, Earth, Atmospheric, Ocean & Planetary Sciences; Life Sciences; Mathematical Sciences, Physical Sciences and each 8 marks.

8 X 5 = 40 Marks. Common Elementary Computer Science:


(Applicable to all candidates offering any subject area; A few questions dealing with basic computer awareness and uses). 10 Marks (i) Programming Instructions (ii) Simple algorithms and Computational methods.

TEST NO. 12: MATHEMATICS: Analysis: Elementary set theory, finite, countable and uncountable sets, Real number system as a cinfimum.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.Reimann sums and Reimann 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. Metric spaces, compactness, connectedness. Normed Linear Spaces. Spaces of Continuous functions as examples. Algebra: Permutations, Combinations, Pigeon hole principle, inclusion exclusion principle, dearrangements.Groups, subgroups, normal subgroups, quotient groups, homomorphisms, cyclic groups, permutation groups, Cayleys 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. Topology: Finite sets, Countable and uncountable sets, infinite sets and the axiom of choice, well ordered sets, the maximum principle.Topological Spaces, Basis for a topology, the ordered topology, the product topology on X x Y, The subspace topology, closed sets and limit points. Continuous functions the product topology, Metric spaces, the metric topology.Connected spaces, connected subspaces of the real line, compact spaces, compact subspaces of the real line, limit point compactness, local compactness. The countability axioms, the separation axioms, normal spaces, the Urysohns lemma, the Urysohns metrization theorem, The Tietz extension theorem, the Tychnoffs theorem, the stonecech compactification. Local finiteness, The Nagata-Smirnov metrization theorem, complete metric spaces. Compactness in metric spaces, pointwise and compact convergence, Ascolis theorem. Baire space.. Complex Analysis: Algebra of complex numbers, the complex plane, polynomials, Power series, transcendental functions such as exponential, trigonometric and hyperbolic functions.Analytic functions,

Cauchy Rieann equations.Contour integral, Cauchys theorem, Cauchys integral formula, Liouvilles theorem, Maximum modulus principle, Schwarz lemma, Open mapping theorem.Taylor series, Laurent series, calculus of residues.Conformal mappings, Mobius transformations. Linear Algebra: Vector spaces, subspaces, linear dependence, basis, dimension, algebra of lineartransformations.Algebra of matrices, rank and determinant of matrices, linear equations.Eigenvalues and eigenvectors, Caley 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. Discrete Mathematics: Graphs, diagraphs, networks, multigraphs, Elementary results, structure based on connectivity, characterization, theorems on trees, tree distances, binary trees.Eulerian graphs, Hamiltonian graphs, spanning trees, Fundamental cycles, unrestricted graphs, minimal spanning trees, Kruskal algorithm, Prims algorithm.Relation, partial order relation, definition of lattices, Modular lattices,distributive lattices, Boolean algebras, Boolean rings. Basic properties: Boolean polynomials, ideals, minimal form of Boolean polynomials, Application of lattices, Switching circuits, Karnaugh diagrams. 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 homogeneous and non homogeneous linear ODEs, variation of parameters. Functional Analysis: Banach Spaces- Examples- continuous linear transformations. The Hahn Banach Theorem - The Natural imbedding of N into N**. The open mapping Theorem.The conjugugate of anoperator- Hilbert Spaces- examples and some simple propertiesOrthogonal compliments - Orthonormalsets-The Conjugage space H*-The adjoint of an operator-Self adjoint operators-Unitary operators andProjections. Partial Differential Equations (PDEs): Lagranges and Charpit methods for solving first order PDEs,

Cauchy problem for first order PDEs.Classification of second order PDEs, General solution of higherorder PDEs with constant coefficients, Method of separation of variables for Laplace, Heat,. And wave equations