GATE MA 2027: syllabus and marking scheme
GATE Mathematics (paper code MA)
The official GATE 2027 syllabus, paper MA (IIT Madras) lists 11 syllabus lines in 11 sections, shown below in the exact official wording. The exam lasts 3 hours. Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
Pattern and marking
| Section | Questions | Type | Marking |
|---|---|---|---|
| General Aptitude (1 mark) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| General Aptitude (2 marks) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (1 mark) | 25 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (2 marks) | 30 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
More verified facts
- Duration: 3 hours (180 minutes).
- Total marks: 100.
- Language of the paper: English.
- Calculator: on-screen virtual scientific calculator; physical calculators are prohibited in the hall.
- Numerical answers: on-screen virtual numeric keypad for NAT answers (the computer keyboard is disabled); the answer is a signed real number, an integer or with up to three decimals, and the question states the decimal places required; no options are shown.
- Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
- Multiple select: no negative marking and no partial marks.
- Numerical answer type: no negative marking.
Pattern source: GATE 2027 Information Brochure, revised version dated 17 October 2026 (IIT Madras) (official document). Last checked 2026-11-21. Every pattern fact above cites a section of that document in our data. The split of the subject questions into 25 one-mark and 30 two-mark questions is worked out from the stated totals (55 questions carrying 85 marks), not quoted.
Official syllabus lines (2027)
Copied from GATE 2027 syllabus, paper MA (IIT Madras), read on 2026-11-21. Each line is shown unchanged.
Section 1: Calculus
- Functions of two or more variables, continuity, directional derivatives, partial derivatives, total derivative, Taylor’s theorem, maxima and minima, saddle point, method of Lagrange’s multipliers; Double and Triple integrals, Jacobians and Change of variables, Applications to area, volume and surface area; Vector Calculus: gradient, divergence and curl, Line integrals and Surface integrals, Green’s theorem, Stokes’ theorem, and Gauss divergence theorem.
Section 2: Linear Algebra
- Finite dimensional vector spaces over real or complex fields; Linear transformations and their matrix representations, rank and nullity; systems of linear equations, characteristic polynomial, eigenvalues and eigen- vectors, diagonalization, minimal polynomial, Cayley-Hamilton Theorem, Finite dimensional inner product spaces, Gram-Schmidt orthonormalization process, symmetric, skew-symmetric, Hermitian, skew-Hermitian, normal, orthogonal and unitary matrices; diagonalization by a unitary matrix, Jordan canonical form; bilinear and quadratic forms.
Section 3: Real Analysis
- Metric spaces, Baire category theorem, connectedness, compactness, completeness; Continuity and Uniform continuity of functions; Sequences and series of functions, uniform convergence, Ascoli-Arzela theorem; Weierstrass approximation theorem; contraction mapping principle, Power series; Differentiation of functions of several variables, Inverse and Implicit function theorems; Lebesgue measure on the real line, measurable functions; Lebesgue integral, Fatou’s lemma, monotone convergence theorem, dominated convergence theorem, Lp spaces.
Section 4: Complex Analysis
- Functions of a complex variable: continuity, differentiability, analytic functions, harmonic functions; Complex integration: Cauchy’s integral theorem and formula; Liouville’s theorem, maximum modulus principle, Morera’s theorem; zeros and singularities; Power series, radius of convergence, Taylor’s series and Laurent’s series; Residue theorem and applications for evaluating real integrals; Rouche’s theorem, Argument principle, Schwarz lemma; Conformal mappings, Mobius transformations.
Section 5: Ordinary Differential Equations
- First order ordinary differential equations, existence and uniqueness theorems for initial value problems, linear ordinary differential equations of higher order with constant coefficients; Second order linear ordinary differential equations with variable coefficients; Cauchy-Euler equation; Definition and basic properties of Laplace transforms, Applications of Lapalce transform for solving ordinary differential equations, series solutions (power series, Frobenius method); Legendre and Bessel functions and their orthogonal properties; Systems of linear first order ordinary differential equations, Sturm's oscillation and separation theorems, Sturm-Liouville eigenvalue problems, Planar autonomous systems of ordinary differential equations: Stability of stationary points for linear systems with constant coefficients, Linearized stability, Lyapunov functions.
Section 6: Algebra
- Groups, subgroups, normal subgroups, quotient groups, homomorphisms, automorphisms; cyclic groups, permutation groups, Group action, Finite Abelian groups, Sylow’s theorems and their applications; Rings, ideals, prime and maximal ideals, quotient rings, unique factorization domains, Principle ideal domains, Euclidean domains, polynomial rings, Eisenstein’s irreducibility criterion; Fields, finite fields, field extensions, algebraic extensions, algebraically closed fields.
Section 7: Functional Analysis
- Normed linear spaces, Bounded linear operators and compact linear operators, Banach spaces, Separability, Dual spaces, Hahn-Banach theorem, open mapping and closed graph theorems, principle of uniform boundedness; Inner-product spaces, Hilbert spaces, orthonormal bases, projection theorem, Riesz representation theorem, spectral theorem for compact self-adjoint operators.
Section 8: Numerical Analysis
- Systems of linear equations: Direct methods (Gaussian elimination, LU decomposition, Cholesky factorization), Iterative methods (Gauss-Seidel and Jacobi) and their convergence for diagonally dominant coefficient matrices; Numerical solutions of nonlinear equations: bisection method, secant method, Newton-Raphson method, fixed point iteration; Interpolation: Lagrange and Newton forms of interpolating polynomial, Error in polynomial interpolation of a function; Numerical differentiation and error, Numerical integration: Trapezoidal and Simpson rules, Newton-Cotes integration formulas, composite rules, mathematical errors involved in numerical integration formulae; Numerical solution of initial value problems for ordinary differential equations: Methods of Euler, Runge-Kutta method of order 2.
Section 9: Partial Differential Equations
- Method of characteristics for first order linear and quasilinear partial differential equations; Second order partial differential equations in two independent variables: classification and canonical forms, method of separation of variables for Laplace equation in Cartesian and polar coordinates, Maximum Principle; heat and wave equations in one space variable; Wave equation: Cauchy problem and d'Alembert formula, domains of dependence and influence, non-homogeneous wave equation; Heat equation: Cauchy problem; Laplace and Fourier transform methods.
Section 10: Topology
- Basic concepts of topology, bases, subbases, subspace topology, order topology, product topology, quotient topology, metric topology, connectedness, path connectedness, compactness, sequentially compact, limit point compact, Tychonoff theorem, countability and separation axioms, Urysohn’s Lemma, Tietze extension theorem.
Section 11: Linear Programming
- Linear programming models, convex sets, extreme points; Basic feasible solution, graphical method, simplex method, two phase methods, revised simplex method ; Infeasible and unbounded linear programming models, alternate optima; Duality theory, weak duality and strong duality; Balanced and unbalanced transportation problems, Initial basic feasible solution of balanced transportation problems (least cost method, north-west corner rule, Vogel’s approximation method); Optimal solution, modified distribution method; Solving assignment problems, Hungarian method.
What is next
Question pages, topic notes and practice sets for this exam are being prepared on the same syllabus graph as JEE Main. Until a question has passed our checks it is not shown as verified.