This course on Discrete Mathematical Structures covers topics such as permutations, combinations, trees, graphs, functions, pigeonhole principle, equivalence relations, partitions, order relations, generating functions, closure properties of relations, special properties of relations, algebras, recurrence relations, finite state automaton, and lattices. The course aims to teach students the fundamental concepts and techniques in discrete mathematics. The teaching method includes lectures and problem-solving sessions. This course is intended for individuals interested in gaining a strong foundation in discrete mathematics.
Overview
Syllabus
Permutations and Combinations.
Trees and Graphs.
Functions.
Pigeonhole principle.
Trees.
Equivalence Relations and partitions.
Graphs (Continued.).
Functions (Continued).
Order and Relations and Equivalence Relations.
Graphs.
Order Relations.
Generating Functions (Continued).
Closure of Relations.
Closure Properties of Relations (Contd..).
Generating Functions.
Special properties of Relations.
Functions (Continued).
Algebras (Continued).
Algebras.
Recurrence Relations (Continued).
Recurrence Relations (Continued).
Recurrence Relations.
Finite State Automaton.
Algebras (Continued).
Lattices.
Finite State Automaton (Continued).
Taught by
Ch 30 NIOS: Gyanamrit
