Discrete Mathematics (IITRopar)

The course will be an introduction to Discrete Mathematics which comprises of the essentials for a computer science student to go ahead and study any other topics in the subject. The emphasis will be on problem solving as well as proofs. We will be providing motivational illustrations and applications through out the course. The course doesnt assume any pre-requisites except for high school level arithmetic and algebra.
INTENDED AUDIENCE: Any Interested LearnersPREREQUISITES: NILINDUSTRY SUPPORT: Every industry expects candidates to have good aptitude. This course sharpens the overall Quant skills.

COURSE LAYOUT

Week 1: CountingWeek 2: Set TheoryWeek 3: LogicWeek 4: RelationsWeek 5: FunctionsWeek 6: Mathematical InductionWeek 7: Pigeonhole PrincipleWeek 8: Graph Theory - 01Week 9: Graph Theory - 02Week 10:Generating FunctionsWeek 11:Principle of Inclusion-ExclusionWeek 12:Recurrence Relations