Loading previous year questions
Engineering Mathematics · Discrete Mathematics
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2017 Set 2 Q23 · NAT · 1 mark
Key concept
No account needed
Sit 5 related Discrete MathematicsPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
In GATE Computer Science, Discrete Mathematics is heavily tested across mathematical logic, set theory, relations & partial orders/lattices, group theory, combinatorics, and graph theory. Questions evaluate formal reasoning, counterexample construction, and structural counting principles. Over recent years, question formats have transitioned from standard single-choice definitions to multi-select properties (MSQs) and exact integer/combinatorial numerical answers (NATs).
Full Discrete Mathematics guide →G is an undirected graph with n vertices and 25 edges such that each vertex of G has degree at least 3. Then the maximum possible value of n is …
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.