Discrete Structure and Graph Theory
Mathematical foundations for computer science — logic, set theory, relations, functions, combinatorics, and graph theory.
Instructor: Tushar R. Mahore
Term: AY 2020–21
Location: Dr. Rajendra Gode Institute of Technology & Research, Amravati
Course Overview
Provides the mathematical toolkit that underlies algorithms, data structures, databases, and programming language theory.
Topics Covered
- Propositional and predicate logic, proof techniques
- Set theory: operations, power sets, Cartesian products
- Relations: types, closures, equivalence relations, partial orders
- Functions: injective, surjective, bijective, composition, inverse
- Counting: permutations, combinations, pigeonhole principle
- Recurrence relations and generating functions
- Graph theory: types of graphs, paths, cycles, connectivity
- Trees: spanning trees, Kruskal’s, Prim’s algorithms
- Planar graphs, graph colouring, Euler and Hamiltonian paths
- Boolean algebra and logic gates
Materials
Course materials will be uploaded here. Contact mahoretushar@gmail.com for resources.