Institutes
Courses & Exams
News & Articles

GATE-MA:Mathematics Exam Pattern

Exam Pattern

Graduate Aptitude Test in Engineering (GATE) -MA Mathematics has 3 hours duration.

• The question paper will consist of both Multiple choice questions (MCQ) and Numerical answer type (NAT) questions.

• In all the papers, there will be a total of 65 questions carrying 100 marks, out of which 10 questions carrying a total of 15 marks will be on General Aptitude (GA).

Graduate Aptitude Test in Engineering (GATE) -MA Mathematics  would contain questions of two different types in various papers:

• Multiple Choice Questions (MCQ) carrying 1 or 2 marks each in all papers and sections. These questions are objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct answer(s).
• Numerical Answer Questions of 1 or 2 marks each in all papers and sections. For these questions the answer is a real number, to be entered by the candidate using the virtual keypad. No choices will be shown for this type of questions. The answer can be a number such as 10 (an integer only).
• General Aptitude (GA) Questions
• In all papers, GA questions carry a total of 15 marks. The GA section includes 5 questions carrying 1-mark each (sub-total 5 marks) and 5 questions carrying 2-marks each (sub-total 10 marks).
 Paper General Aptitude (GA) Questions Subject Marks Total Marks Total Time MA Mathematics 15 85 100 3 hours

Test duration- 3 hours

Total Marks- 15+85= 100

Total Question- 65

Marking System –

• For 1-mark multiple-choice questions, 1/3 mark will be deducted for a wrong answer.
• Likewise, for 2-mark multiple-choice questions, 2/3 mark will be deducted for a wrong answer.
• There is NO negative marking for numerical answer type questions.

Syllabus Summary

 No. Of Subject 12 13 85
Chapters
1. Analytic functions
2. Complex Integration
3. Cauchy’s Integral Theorem and Formula
4. Liouville’s Theorem
5. Zeros and Singularities
6. Taylor and Laurent’s series
7. Residue Theorem
Chapters
1. Quotient groups and Homomorphism Theorems
2. Automorphisms
3. Sylow’s theorems
4. Euclidean domains, polynomial rings
Chapters
1. Finite dimensional vector spaces
2. Linear transformations and their matrix representations
3. Systems of linear equations
4. Eigenvalues and Eigenvectors
5. Cayley-Hamilton Theorem
6. Jordan-canonical form
7. Hermitian, Skew- Hermitian and unitary matrices
8. Finite dimensional inner product spaces
9. Gram-Schmidt Orthonormalization Process
Chapters
1. Linear programming problem and its formulation
2. Infeasible and Unbounded LPP’s
3. Dual problem and duality Theorems
4. Vogel’s approximation method
5. Hungarian method
Chapters
1. First order ordinary differential equations
2. Initial Value Problems
3. Linear ordinary differential equations of Higher Order
4. Linear second order ordinary differential equations
5. Laplace transforms
6. Frobenius method
7. Legendre and Bessel Functions
Chapters
1. Bisection, Secant method
2. Newton-Raphson method
3. Interpolation
4. Lagrange, Newton interpolations
5. Numerical differentiation
6. Numerical integration
7. Trapezoidal and Simpson rules
8. Gauss elimination, LU decomposition
9. Jacobiand Gauss-Seidel
10. Ordinary Differential Equations
11. Euler’s method
12. Runge-Kutta methods of order 2
Chapters
1. Sequences and series of functions
2. Fourier series
3. Maxima, Minima
4. Riemann Integration
5. Surface and Volume Integrals
6. Theorems of Green, Stokes and Gauss
7. Weierstrass approximation theorem
8. Lebesgue measure
9. Lebesgue integral
10. Fatou’s lemma
11. Dominated Convergence Theorem
Chapters
1. Linear and quasilinear first order partial differential equations
2. Second Order Linear Equations
3. Cauchy, Dirichlet and Neumann problems
4. Solutions of Laplace
5. Interior and exterior Dirichlet problems
6. Fourier Series and Fourier Transform and Laplace transform
Chapters
1. Numerical computation
2. Numerical Estimation
3. Numerical Reasoning
4. Data Interpretation
Chapters
1. English grammar
2. Sentence Completion
3. Verbal Analogies
4. Word Groups
5. Instructions
6. Critical Reasoning
7. Verbal Deduction
Chapters
1. Normed linear spaces, Banach spaces
2. Hahn-Banach extension theorem
3. Inner-product spaces
4. Hilbert spaces
5. Riesz representation theorem
Chapters
1. Definitions of probability and sampling theorems
2. Discrete Random variables
3. Continuous random variables
4. Descriptive statistics
5. Hypothesis testing
Chapters
1. Basic concepts of topology
2. Subspace topology, Order topology
3. Urysohn’s Lemma

How to prepare

Preparation Strategy

Make a proper Time Table

It is very important that you make a time table and stick to it and you will have an exact idea of what you are required to study and the time required for it.

Concept clarity rather than rote learning

It is essential that you have a clear idea of the formulas and concepts rather than rote learning of things for the papers. While you might require it for memorizing formulas it is important that for other stuff you make sure you clear your basis and concepts before moving on.

Prepare Notes

It is very important make small notes or a comprehensive list of formulas on each covered topic and chapter which will come in handy at the time of revision. This will require you to be regular with your work but will surely make things easy at the time of revision.

Seek guidance

It is not possible for you to know everything in your syllabus, at least not at the time of preparation. Sooner or later you will run into a concept or so which will give you trouble and then it is best you seek guidance from an instructor or a teacher. It is necessary that you clear your doubts at regular intervals and don’t prolong things for long. Getting into a good coaching class is nothing to be ashamed off and if anything a regular coaching class will enable you to avoid roadblocks in your preparation.

Sample Papers

Even though there may be a complete change in the exam pattern or the expected questions altogether,it is important that you practice on the sample and previous years question papers available for the engineering exam you’d be attempting. You will know the existing pattern and have a fair idea of the type of questions to expect in the paper along with the time constraint.

Mock tests

The paper pattern, duration of the paper and the number of questions to be attempted in the given amount of time is not something you will be able to pick up on the day of the examination. A Mock Test tests a student’s abilities as it not only provides a similar feel of real exams but also helps in building speed and confident to face the exam. Furthermore, they can improve their performance to get an extra edge in actual exams. Try to build up an Engineering Entrance Exam Test Prep MCQ Question Bank

Time management

Time management can be learnt through thorough practice and regular test taking. So it is important that you practice it and practice it well.

Negative marking

Most the entrance examinations will have negative marking and everyone would suggest you stay clear of questions are not sure about. But some experts are of the opinion that you answer the questions in which you are confused between an option or two because there will also be a chance of getting it right.

Duration : 3 Hours