GATE CS engineering mathematics syllabus
Engineering Mathematics is the only technical component of GATE CS with a published mark allocation. It carries 13 marks, carved out of the 85 subject marks and stated separately in the official pattern.
That makes it almost certainly larger than any single one of the nine technical sections, none of which has a published figure at all. The GATE CS syllabus hub page covers those.
Pattern
| Component | Marks | Notes |
|---|---|---|
| General Aptitude | 15 | Five one mark and five two mark questions |
| Engineering Mathematics | 13 | Paper specific, inside the subject component |
| Rest of the CS subject | 72 | Across the nine technical sections |
| Total | 100 | 65 questions in three hours |
GATE publishes no weighting for this section. The only published splits are General Aptitude 15 marks, Engineering Mathematics 13 marks and the remaining 72 marks across the nine technical sections. Any per section percentage quoted elsewhere is counted from past papers rather than published by GATE.
| Question type | Negative marking | Partial marking |
|---|---|---|
| MCQ, one mark | One third deducted | Not applicable |
| MCQ, two marks | Two thirds deducted | Not applicable |
| MSQ | None | None |
| NAT | None | None |
Nothing is deducted for a wrong MSQ or NAT answer, so every one of those should be attempted. Nothing is awarded for a partially correct MSQ either.
Even if $9 invested today doubled in five years...
$9 spent on mocks today could change what you’re earning in five years.
GATE CS Pro · one year of access.
Topics
- Discrete Mathematics: propositional and first order logic
- Discrete Mathematics: sets, relations, functions, partial orders and lattices
- Discrete Mathematics: monoids and groups
- Discrete Mathematics: graphs, covering connectivity, matching and colouring
- Discrete Mathematics: combinatorics, covering counting, recurrence relations and generating functions
- Linear Algebra: matrices, determinants, systems of linear equations
- Linear Algebra: eigenvalues and eigenvectors, LU decomposition
- Calculus: limits, continuity and differentiability
- Calculus: maxima and minima, mean value theorem, integration
- Probability and Statistics: random variables
- Probability and Statistics: uniform, normal, exponential, Poisson and binomial distributions
- Probability and Statistics: mean, median, mode and standard deviation
- Probability and Statistics: conditional probability and Bayes theorem
Discrete Mathematics carries five of the thirteen listed topic groups, more than the other three areas put together, and it is the area whose results are reused across Theory of Computation, Algorithms and Databases.
What is not in the syllabus
- No differential equations
- No complex analysis or numerical methods
- No vector calculus
- No transform theory such as Laplace or Fourier
- No published split of the 13 marks across the four areas
How to spend the time
Start with Discrete Mathematics. Logic, sets, relations, functions, graphs and counting are not only the largest part of this section, they are the machinery the rest of the CS syllabus is written in.
Linear algebra here stops at matrices, determinants, linear systems, eigenvalues and LU decomposition. There is no need to go further, and candidates from an engineering mathematics background routinely do.
Probability questions are frequently NAT, which carries no penalty. That makes an attempt free even when you are unsure of the final arithmetic.
Thirteen published marks justify a disproportionate share of revision time, because no technical section is guaranteed to match it. Browse the available GATE CS practice papers.
Common mistakes
- Treating this as a small section when it is the largest published allocation after General Aptitude
- Preparing differential equations, transforms or vector calculus, none of which is listed
- Leaving counting and recurrence relations out, when they feed directly into Algorithms
- Skipping lattices and partial orders because they look abstract, when they are named explicitly
- Leaving probability NAT questions blank, where there is no penalty for a wrong answer
Engineering Mathematics against the rest of the paper
| Feature | Engineering Mathematics | The nine technical sections |
|---|---|---|
| Published marks | 13 | Seventy two in total, with no individual figures |
| Position in the syllabus | Section 1 | Sections 2 to 10 |
| Reused elsewhere in the syllabus | Heavily, especially discrete mathematics | Largely self contained |
| Question types | MCQ, MSQ and NAT | MCQ, MSQ and NAT |
Frequently asked questions
How many marks is Engineering Mathematics worth in GATE CS?
Thirteen, stated separately in the official pattern and carved out of the 85 subject marks.
What are the four areas?
Four: Discrete Mathematics, Linear Algebra, Calculus, Probability and Statistics.
Are differential equations in the syllabus?
No. They are not listed anywhere in the CS Engineering Mathematics section.
Is numerical methods included?
No.
How far does linear algebra go?
Matrices, determinants, systems of linear equations, eigenvalues and eigenvectors, plus LU decomposition.
Which area is largest?
Discrete Mathematics by the topic list, though GATE publishes no split of the 13 marks across the four areas.
Does discrete mathematics overlap with other sections?
Yes, substantially. Logic, sets, relations, graphs and counting are used across Theory of Computation, Algorithms and Databases.
Is probability tested through NAT questions?
Those questions appear as MCQ, MSQ and NAT like the rest of the paper. NAT carries no negative marking.
Is Bayes theorem in the syllabus?
Yes, listed under conditional probability and Bayes theorem.
Does GATE DA have the same Engineering Mathematics section?
No. DA has no separately allocated Engineering Mathematics component. Its mathematics is distributed across its own sections.