How to Prepare for GATE MA 2027: Syllabus, Strategy and a 14-Week Plan

MA is the Mathematics paper. It tracks the core of a B.Sc. (Honours) and M.Sc. curriculum in pure and applied mathematics, from Lebesgue integration and Sylow theorems to Runge-Kutta methods and the simplex tableau.

Do not confuse it with the Engineering Mathematics questions inside engineering papers. MA is a university-level mathematics paper, and it rewards a precise grip on definitions, hypotheses and examples far more than long computation. An MSQ might list four statements about a sequence of functions and ask which are true.

A valid score is used for M.Tech, MS and PhD admissions at the IITs, IISc, NITs and other institutes, and for research programmes in mathematics and allied areas.

Taken from the official GATE 2027 site at gate2027.iitm.ac.in. Dates are liable to change; verify them there.

Organising institute	IIT Madras
Exam dates	6, 7, 13, 14, 20 and 21 February 2027 (the date of the MA paper is set in the official schedule)
Result	19 March 2027
Mode	Computer-based test, English only
Duration	3 hours
Questions	65 (10 General Aptitude + 55 subject)
Marks	100: General Aptitude 15, Mathematics 85
Question types	MCQ, MSQ (multiple select) and NAT (numerical answer)
Negative marking	MCQ only: 1/3 for a 1-mark question, 2/3 for a 2-mark question
Calculator	On-screen virtual calculator in recent GATE exams; 2027 rules in the information brochure
Score validity	Three years from the date the result is announced
Two-paper options with MA	CS, DA, PH, ST

On eligibility, you may appear if you are in the third or a higher year of an undergraduate degree, or have completed a government-approved degree in engineering, technology, architecture, science, commerce, arts or humanities. The official table lists B.Sc. students in the third year or already graduated, and M.Sc. students from the first year onwards.

Eleven sections plus the shared General Aptitude section make up the 2027 paper. Work from the official MA syllabus PDF; the table condenses it.

Section	What it covers
Section 1: Calculus	Several variables, Taylor's theorem, extrema and Lagrange multipliers, multiple integrals and Jacobians, and vector calculus up to Green's, Stokes' and Gauss divergence theorems
Section 2: Linear Algebra	Vector spaces, linear maps, rank and nullity, eigenvalues, minimal polynomial, Cayley-Hamilton, inner products and Gram-Schmidt, special matrices, Jordan form, bilinear and quadratic forms
Section 3: Real Analysis	Metric spaces and Baire category, uniform convergence, Ascoli-Arzela, Weierstrass approximation, contraction mapping, inverse and implicit function theorems, Lebesgue measure and integral, convergence theorems and Lp spaces
Section 4: Complex Analysis	Analytic functions, Cauchy theory, Liouville and maximum modulus, singularities, Laurent series, residues, Rouche, Schwarz lemma, conformal and Mobius maps
Section 5: Ordinary Differential Equations	Existence and uniqueness, linear equations, Cauchy-Euler, Laplace transforms, Frobenius, Legendre and Bessel functions, Sturm-Liouville problems, stability and Lyapunov functions
Section 6: Algebra	Groups, quotients, group actions, finite abelian groups, Sylow theorems, rings and ideals, UFDs, PIDs and Euclidean domains, Eisenstein's criterion, finite fields and extensions
Section 7: Functional Analysis	Banach spaces, bounded and compact operators, duals, Hahn-Banach, open mapping, closed graph, uniform boundedness, Hilbert spaces, Riesz representation, spectral theorem for compact self-adjoint operators
Section 8: Numerical Analysis	Direct and iterative linear solvers, root-finding methods, interpolation and its error, numerical differentiation and integration, Euler and second-order Runge-Kutta methods
Section 9: Partial Differential Equations	Characteristics for first-order equations, classification and canonical forms, separation of variables, heat, wave and Laplace equations, d'Alembert's formula, transform methods
Section 10: Topology	Bases, subspace, product and quotient topologies, connectedness, compactness, Tychonoff, countability and separation axioms, Urysohn's lemma and Tietze extension
Section 11: Linear Programming	Basic feasible solutions, simplex, two-phase and revised simplex methods, duality, transportation problems and the Hungarian method

If you plan from an M.Sc. course outline, check the PDF for the Baire category theorem, Lp spaces, Lyapunov functions and the revised simplex method. Notice also what is absent: the 2027 MA syllabus has no probability or statistics section.

Three hours, 65 questions, 100 marks, with each question worth 1 or 2 marks. Ten General Aptitude questions carry 15 marks. The other 55 are mathematics, worth 85 marks, and MA belongs to the group of papers with no Engineering Mathematics component, so every one of those marks comes from the MA syllabus.

MCQs have one correct option. NATs ask for a number: the order of a group, the value of a contour integral, the dimension of a subspace, the optimum of a small LP. MSQs are where MA differs most from engineering papers. Each option is in effect a separate true-or-false claim, and you must select exactly the correct set, since no partial credit is given.

A wrong MCQ costs 1/3 mark if it carries 1 mark and 2/3 if it carries 2. MSQs and NATs have no negative marking.

About calculators: recent GATE exams have supplied an on-screen virtual scientific calculator and have not allowed physical ones. The GATE 2027 information brochure will settle the 2027 rules. You will need it mainly for Newton-Raphson iterations and quadrature in Numerical Analysis, so practise those on a virtual calculator.

Some sections are prerequisites for others, and ignoring that wastes weeks.

Start with Linear Algebra and Real Analysis together. Linear algebra feeds ODE systems, numerical linear algebra, quadratic forms and functional analysis. Metric spaces and modes of convergence feed Topology, Functional Analysis and a good part of Complex Analysis. Let Calculus run beside them as computational practice.

Complex Analysis comes next. Once you know convergence it stands on its own, and residues are learnable in a fortnight. Then Algebra, in the order groups, rings, fields; Sylow theorems and the classification of finite abelian groups need many worked examples, so give them time.

Topology fits naturally after metric spaces. Functional Analysis should be the last pure section, because it draws on linear algebra, analysis and topology at once.

On the applied side, do ODE before PDE, since Sturm-Liouville theory and separation of variables carry straight across. Slot Numerical Analysis and Linear Programming into the middle of your plan. They are procedural, and procedural marks are the safest marks in this paper.

Add 20 to 30 minutes of General Aptitude three or four days a week.

Built for about 4 to 5 focused hours a day, assuming you met most sections in your B.Sc. or M.Sc. Stretch blocks if your hours are fewer.

Weeks	Focus	Finish the block with
1	Linear Algebra: vector spaces, linear maps, rank-nullity, eigenvalues	Rank, eigenvalue and diagonalisation questions
2	Linear Algebra: minimal polynomial, inner products, Jordan form, quadratic forms; Calculus of several variables	A timed mixed test
3	Real Analysis: metric spaces, compactness, connectedness, uniform convergence	True-or-false lists with counterexamples
4	Real Analysis: Lebesgue measure and integral, convergence theorems, Lp; vector calculus	Questions on the convergence theorems
5	Complex Analysis: analytic functions, Cauchy theory, series, singularities	Laurent series and singularity questions
6	Complex Analysis: residues, Rouche, argument principle, conformal and Mobius maps	Real integrals by residues until error-free
7	Algebra: groups, group actions, Sylow theorems, finite abelian groups	Counting questions on orders and subgroups
8	Algebra: rings, ideals, domains, polynomial rings, fields and finite fields	Irreducibility and field extension questions
9	Ordinary Differential Equations, including series solutions and stability	Frobenius, Sturm-Liouville and stability questions
10	Topology; Numerical Analysis	Compactness and separation axiom questions; error estimates
11	Functional Analysis; Linear Programming	The big theorems; simplex and duality
12	Partial Differential Equations; transportation and assignment problems	Characteristics, canonical forms, d'Alembert questions
13	Three full mocks; weak-topic repair	An error log sorted by section
14	Three mocks, theorem sheets, light revision	A calm last week

From week 3, keep one weekly session for older sections. Counterexamples you built in week 3 need refreshing by week 10.

Many MA candidates are in the final year of a B.Sc. or M.Sc., and some are school or college teachers. At 2 to 3 hours on weekdays with longer weekends, the 14 weeks become roughly 24 to 28.

Align GATE with your semester wherever you can. If Functional Analysis or Topology is being taught this term, prepare that section now while the lectures are fresh, and treat university problem sets as MSQ practice: for each exercise, ask what breaks if one hypothesis is removed.

Teachers have a different advantage. Explaining Cauchy-Riemann conditions or row reduction to a class is revision, so spend your own hours on the sections you do not teach.

Calculus

Largely computation. Classify critical points with the Hessian, use Lagrange multipliers, change variables with Jacobians, and apply the three integral theorems. Each standard type should take two to three minutes.

Linear Algebra

Its ideas reappear everywhere. Know how characteristic and minimal polynomials relate, when a matrix is diagonalisable, how Jordan form follows from eigenvalue data, and what Hermitian, normal and unitary matrices guarantee.

Real Analysis

The broadest section. Keep a notebook of standard counterexamples: pointwise but not uniform convergence, continuous but not uniformly continuous, closed and bounded but not compact in a metric space. In measure theory, know exactly when monotone and dominated convergence apply, and which inclusions hold between Lp spaces on a finite measure space.

Complex Analysis

Classify singularities at sight, compute residues several ways, and count zeros inside a contour with Rouche's theorem. A real integral evaluated by residues makes a natural NAT.

Ordinary Differential Equations

Lipschitz conditions for existence and uniqueness, Wronskians, Cauchy-Euler equations, Laplace transforms, Frobenius series, Legendre and Bessel properties. For planar systems, classify equilibria from the eigenvalues of the linearised matrix.

Algebra

Counting is the core skill: elements of a given order in cyclic and symmetric groups, the number of Sylow p-subgroups, abelian groups of a given order up to isomorphism. For rings, hold the chain Euclidean domain, PID, UFD with an example separating each link.

Functional Analysis

Learn Hahn-Banach, open mapping, closed graph and uniform boundedness with their hypotheses and one counterexample each where a hypothesis fails. Know operator norms of simple operators on sequence spaces and the spectrum of a compact self-adjoint operator.

Numerical Analysis

Orders of convergence for bisection, secant, Newton-Raphson and fixed-point iteration; error terms for interpolation and quadrature; conditions under which Jacobi and Gauss-Seidel converge.

Partial Differential Equations

Classify second-order equations by the discriminant, solve first-order ones by characteristics, and apply d'Alembert's formula and separation of variables.

Topology

Definition-driven. For compactness, connectedness and each separation and countability axiom, know which constructions preserve it: subspaces, products, quotients.

Linear Programming

Simplex tableaux, the two-phase method, writing a dual, and spotting unbounded, infeasible and alternate-optimum cases.

General Aptitude

Fifteen marks in about 20 minutes. Quantitative questions will feel easy, so spend practice on the verbal and spatial ones.

Officially, MA may be combined with CS, DA, PH or ST in 2027. A second paper is optional. Protect your MA score first.

DA shares linear algebra and calculus with MA, then adds probability, statistics, programming, machine learning and AI. For a mathematics student moving towards data science, it is the most natural pairing; the GATE DA preparation guide explains the paper, and the GATE DA syllabus shows how much of it you already know.

ST is the choice if your degree carried a strong statistics strand, and it fills the probability gap MA leaves; see how to prepare for GATE ST. If you studied physics beside mathematics, read the GATE PH preparation guide. CS is a full computer science paper and needs substantial new study, as the GATE CSE preparation guide makes clear.

Read the second paper's official syllabus before you register.

Recent MA question papers with answer keys are on the official GATE 2026 download page at IIT Guwahati.

Go section by section while you are learning. After the Algebra weeks, for example, collect every group-counting question from several years and do them in one sitting. In the final month, sit whole papers in three hours and mark them against the key.

For every MSQ, write one line on why each wrong option is wrong. Within a few weeks that becomes your own bank of counterexamples, the thing this paper tests most. Log other errors by cause too: a missing theorem, a wrong example, an arithmetic slip, a misread. Topics that rarely appear in old papers are still examinable, so read them from the textbook.

Six to eight full mocks over the last five weeks is a good target, each taken at your exam session's time of day.

Inside the exam, clear General Aptitude in about 20 minutes. Then take the direct questions: definitions, standard results, short group-order counts, a residue, an eigenvalue fact. Come back for long computations and MSQ statement lists on a second pass, and leave anything needing an extended proof-style argument for the end.

Guess an MCQ only if two options are already ruled out. A NAT or MSQ answer you have worked out should always go in, since neither is penalised.

Your M.Sc. reading list probably contains most of these. One book per section is enough.

Section	Widely used texts
Calculus	Tom M. Apostol, Calculus, Volume II
Linear Algebra	Hoffman and Kunze, Linear Algebra; Sheldon Axler, Linear Algebra Done Right
Real Analysis	Walter Rudin, Principles of Mathematical Analysis; H. L. Royden, Real Analysis
Complex Analysis	Churchill and Brown, Complex Variables and Applications; John B. Conway, Functions of One Complex Variable
Ordinary Differential Equations	G. F. Simmons, Differential Equations with Applications and Historical Notes; Earl A. Coddington, An Introduction to Ordinary Differential Equations
Algebra	Joseph A. Gallian, Contemporary Abstract Algebra; Dummit and Foote, Abstract Algebra
Functional Analysis	Erwin Kreyszig, Introductory Functional Analysis with Applications
Numerical Analysis	Kendall E. Atkinson, An Introduction to Numerical Analysis
Partial Differential Equations	Ian N. Sneddon, Elements of Partial Differential Equations
Topology	James R. Munkres, Topology
Linear Programming	Hamdy A. Taha, Operations Research: An Introduction

Free mathematics lectures by IIT and IISc faculty on most sections are on NPTEL.

• Learning a theorem without its hypotheses. MSQs love the case where one condition is dropped.
• Having no stock of counterexamples for analysis, topology and algebra.
• Treating Numerical Analysis, ODE, PDE and Linear Programming as an afterthought, when they are among the most dependable marks.
• Avoiding Functional Analysis and Topology because they feel abstract. Their questions are often short once definitions are clear.
• Guessing on MSQs.
• Working from four analysis books at once.

Close the syllabus four weeks out.

Two or three full mocks a week, each with as much time again for review. Rework your error log. Then build two kinds of sheet. Theorem sheets list each result with its hypotheses and one counterexample. Formula sheets for the applied sections hold error terms, convergence orders, Laplace transforms and canonical forms.

Keep a daily timed set of General Aptitude, and in the last week keep a fixed routine that matches your session.

Your GATE 2027 score is valid for three years from the date the result is announced.

IITs make M.Tech offers through COAP, and NITs, IIITs and many other institutes admit through CCMT. IISc and several IITs also hold their own MS and PhD admissions, and each department decides which GATE papers it accepts, so read the admission notice before applying with MA. Some public sector organisations use GATE scores in recruitment under their own notifications.

For a wider view, see all 30 GATE papers and the complete set of GATE preparation guides.