GATE CS: Discrete Mathematics

Discrete Mathematics is the single heaviest scoring block in GATE CS, typically 8-10 marks across logic, counting and graph theory.

This course follows the GATE syllabus topic by topic: logic, sets and functions, relations, posets and lattices, counting, recurrences and generating functions, groups, and graph theory. The classic exam computations, such as counting relations and onto functions, spanning trees and chromatic numbers, are taught inside the topic they belong to. It closes on a mastery topic that compares look-alike concepts, shows how to choose a counting or recurrence technique, and applies them to real systems. Every lesson carries audio narration, so a topic can be revised without reading it.