The aim of this course is to introduce the topics and techniques of discrete methods and combinatorial reasoning with wide variety of applications.
Fundamental principle of counting. Introduction to discrete probability. Pigeonhole principle. Fundamentals of logic. The principle of inclusion and exclusion. Recurrence relations. Introduction to graph theory.
1: Lecture, 2: Question-Answer, 3: Lab, 4: Case-study
Course Evaluation Methods:
A: Testing, B: Experiment, C: Homework, D: Project