Learn Discrete Mathematics, with pictures you can poke.
Short concepts, every formula in one place, interactive animations, and the question types that keep repeating in past GATE papers.
Syllabus. Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, colouring. Combinatorics: counting, recurrence relations, generating functions.
Study order
Highest yield first. Tick a topic when you are done with it.
0 of 5 topics done
Propositional & First-Order Logic
Almost every paper has a logic question: is a formula valid, which statement is equivalent, which quantifier translation is right, or how many Boolean functions exist.
Sets, Relations & Functions
A steady 2 to 3 marks: count relations with a property, decide whether a relation is an equivalence or partial order, read a Hasse diagram or lattice, and classify functions.
Combinatorics & Recurrences
The counting questions are the easiest marks in Discrete Maths: permutations with restrictions, distributions, pigeonhole, derangements and one recurrence or generating function per paper.
Graph Theory
Four to six marks every year: degree and handshake facts, trees, connectivity, planarity, colouring and Euler/Hamilton questions. (Shortest paths and spanning-tree algorithms are in the Algorithms subject.)
Groups & Algebraic Structures
One question most years: decide whether a set with an operation is a group, find the order of an element, use Lagrange, or count subgroups and generators of a cyclic group.
What gets asked, at a glance
Most frequent question types across topics (rating is approximate).
Importance and frequency ratings are my reading of recurring GATE CSE patterns, not an official count. Cross-check against a PYQ set before relying on them for exact marks.
Frequently asked questions
How many marks does Discrete Mathematics carry in GATE CSE?
By my estimate about 10 to 12 marks per paper. This is an estimate from recurring patterns in past papers, not an official count, and it varies from year to year.
What topics are in Discrete Mathematics for GATE CSE?
Propositional & First-Order Logic; Sets, Relations & Functions; Combinatorics & Recurrences; Graph Theory; Groups & Algebraic Structures.
Which Discrete Mathematics topics are most important for GATE?
The highest-yield topics are Propositional & First-Order Logic; Sets, Relations & Functions; Combinatorics & Recurrences; Graph Theory. Importance is my estimate from recurring question patterns.
Where can I find solved GATE Discrete Mathematics previous year questions?
This page links to 99 previous year question entries from 2012 to 2025, each with the official answer key and a worked solution.