Discrete Mathematics

Por: Swayam . en: ,

Overview

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 doesn't 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.

Syllabus

COURSE LAYOUT

Week 1: CountingWeek 2: Set TheoryWeek 3: LogicWeek 4: RelationsWeek 5: FunctionsWeek 6: Mathematical Induction and Pegionhole PrincipleWeek 7: Graph Theory - 01Week 8: Graph Theory - 02Week 9: Graph Theory - 03 and Generating FunctionsWeek 10:Principle of Inclusion-ExclusionWeek 11:Recurrence relationsWeek 12:Advanced Topics

Plataforma