Discrete Mathematical Structures
Offered By: NIOS via YouTube
Course Description
Overview
Explore the fundamental concepts of discrete mathematics in this comprehensive course. Delve into topics such as permutations and combinations, trees and graphs, functions, and the pigeonhole principle. Examine order relations, equivalence relations, and partitions. Study generating functions, closure properties of relations, and special properties of relations. Investigate recurrence relations, finite state automata, algebras, and lattices. Gain a solid foundation in discrete mathematical structures essential for computer science and advanced mathematics.
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
Related Courses
Combinatorial Mathematics | 组合数学Tsinghua University via edX Combinatorics
Indian Institute of Technology Madras via Swayam Problem Solving Techniques
YouTube Discrete Math II - Combinatorics
Kimberly Brehm via YouTube A Brief Tour of Proof Complexity - Lower Bounds and Open Problems - Toniann Pitassi
Institute for Advanced Study via YouTube