Syllabus For Maths Optional in Upsc-1
Syllabus For Maths Optional in Upsc-1
Syllabus For Maths Optional in Upsc-1
PART-I
(1) Linear Algebra
MATHEMATICS PAPER I Vector spaces over R and C, linear dependence and independence, subspaces, bases,
dimensions, Linear transformations, rank and nullity, matrix of a linear transformation. Algebra of Matrices; Row and
column reduction, Echelon form, congruence’s and similarity; Rank of a matrix; Inverse of a matrix; Solution of system
of linear equations; Eigenvalues and eigenvectors, characteristic polynomial, Cayley-Hamilton theorem, Symmetric,
skew-symmetric, Hermitian, skew Hermitian, orthogonal and unitary matrices and their eigenvalues.
(2) Calculus
Real numbers, functions of a real variable, limits, continuity, differentiability, mean-value theorem, Taylor’s theorem
with remainders, indeterminate forms, maxima and minima, asymptotes; Curve tracing; Functions of two or three
variables; Limits, continuity, partial derivatives, maxima and minima, Lagrange’s method of multipliers, Jacobian.
Riemann’s definition of definite integrals; Indefinite integrals; Infinite and improper integral; Double and triple integrals
(evaluation techniques only); Areas, surface and volumes.
1|Page
(5) Dynamics and Statics
Rectilinear motion, simple harmonic motion, motion in a plane, projectiles; Constrained motion; Work and energy,
conservation of energy; Kepler’s laws, orbits under central forces. Equilibrium of a system of particles; Work and
potential energy, friction, Common catenary; Principle of virtual work; Stability of equilibrium, equilibrium of forces
in three dimensions.
PAPER II
(1) Algebra:
Groups, subgroups, cyclic groups, cosets, Lagrange’s Theorem, normal subgroups, quotient groups, homomorphism of
groups, basic isomorphism theorems, permutation groups, Cayley’s theorem. Rings, subrings and ideals,
homomorphisms of rings; Integral domains, principal ideal domains, Euclidean domains and unique factorization
domains; Fields, quotient fields.
2|Page
(6) Numerical Analysis and Computer Programming:
Numerical methods: Solution of algebraic and transcendental equations of one variable by bisection, Regula-Falsi and
Newton-Raphson methods, solution of system of linear equations by Gaussian Elimination and Gauss-Jorden (direct),
Gauss-Seidel (iterative) methods. Newton’s (forward and backward) and interpolation, Lagrange’s interpolation.
Numerical integration: Trapezoidal rule, Simpson’s rule, Gaussian quadrature formula. Numerical solution of ordinary
differential equations: Eular and Runga Kutta methods. Computer Programming: Binary system; Arithmetic and logical
operations on numbers; Octal and Hexadecimal Systems; Conversion to and from decimal Systems; Algebra of binary
numbers. Elements of computer systems and concept of memory; Basic logic gates and truth tables, Boolean algebra,
normal forms. Representation of unsigned integers, signed integers and reals, double precision reals and long integers.
Algorithms and flow charts for solving numerical analysis problems.
3|Page