Discrete Mathematics is the study of discrete objects as opposed to continuous objected like real numbers. The discrete objects like proofs, sets, graphs, colorings, algebraic structures, algorithms etc. These object arise naturally and frequently in many areas of mathematics and computer science and are fundamental in an undergraduate curriculum of computer science and mathematics. In this course, we will focus on Logic, Set Theory, Number Theory, Algebraic Structures, Combinatorics and Graph Theory. INTENDED AUDIENCE: UG students interested in computer science, combinatorics, etc. PRE-REQUISITES: NIL
COURSE LAYOUT
WEEK 1:Mathematical LogicWEEK 2:Mathematical LogicWEEK 3: Set TheoryWEEK 4: Set Theory,Number TheoryWEEK 5: Number TheoryWEEK 6:Algebraic StructuresWEEK 7:Algebraic StructuresWEEK 8:RecurrencesWEEK 9: Recurrences,CombinatoricsWEEK 10: CombinatoricsWEEK 11: Graph TheoryWEEK 12:Graph Theory
Prof. Sajith Gopalan and Prof. Benny George K