GATEEngineering Mathematics
Engineering Mathematics for GATE
~13 marks — Discrete Mathematics is the heaviest of the four.
📊 ~9 Q · ~13 marks (13% of the paper)
How toppers play this section
Engineering Mathematics is where the highest marks-per-minute sit, because its questions are short and self-contained. Discrete Mathematics is the heaviest chapter and the one that feeds directly into Theory of Computation and Algorithms — proof by counterexample, counting arguments and graph properties all reappear there. Linear Algebra questions almost always reduce to rank, so establishing rank first answers most of them without further computation. Calculus questions stay at limits, continuity, differentiability and definite integrals, and the marks usually live in the hypotheses of a theorem rather than in its conclusion. Probability questions are won by naming the sample space explicitly before doing any arithmetic, which is exactly where careless candidates go wrong.
Chapters
Built to the GATE blueprint — notes, shortcuts, solved PYQ-style examples and practice in every chapter.
Topic-wise weightage in GATE
Expected question counts from previous-year paper analyses. Topics with an arrow already have a full chapter.
| Topic | GATE CS — single 3-hour CBT paper Q | Score used for M.Tech admission / PSU recruitment Q | Priority |
|---|---|---|---|
| Discrete Mathematics | ~5 | Very high | |
| Linear Algebra | ~3 | High | |
| Calculus | ~2 | Medium | |
| Probability and Statistics | ~3 | High |
Take the next step
GATE Engineering Mathematics — find a tutor
Pair self-study with a tutor, a live course or a coaching centre.