The course covers the basics of Discrete Mathematics, focusing on Set Theory, Relations, Functions, Counting Principles, Permutation, Combination, and Propositional Logic. By the end of the course, students will be able to understand and apply fundamental concepts in discrete mathematics. The teaching method includes lectures and summaries of each section. This course is intended for individuals interested in fields such as compiler programming, machine learning, and AI, who need a foundational understanding of discrete mathematics.
Overview
Syllabus
Basics of Discrete Mathematics Part 1.
Introduction to Discrete mathematics.
Introduction to Set Theory.
Types of Sets.
Operations on Sets.
Laws of Set Algebra.
Sums on Algebra of Sets.
Relations.
Types of relations.
Closure properties in relations.
Equivalence relation.
Partial ordered Relation.
Functions.
Types of Functions.
Identity Functions.
Composite Functions.
Mathematical Functions.
Summary of Basics of Discrete Mathematics Part 1.
Basics of Discrete Mathematics Part 2.
Introduction to Counting Principle.
Sum and Product Rule.
Pigeon-hole principle.
Permutation and combination.
Propositional logic.
Connectives.
Tautology.
Contradiction.
Contingency.
Propositional equivalence.
Inverse, Converse and contrapositive.
Summary of Basics of Discrete Mathematics Part 2.
Taught by
Great Learning
