X
X
X

X
Courses » Discrete Mathematics

Discrete Mathematics

ABOUT THE COURSE
 In this course we will cover the basics of discrete mathematics. We will be learning about the different proof techniques and how to use them for solving different kind of problems. We will introduce graphs and see how graphs can be used for modeling of different problems and see how this can help in solving problems. We will learn how to count the number of possibilities that can arise in different situations.

INTENDED AUDIENCE
 B.E/B.Sc I and II year students of Mathematics and Computer Science

 PRE-REQUISITES
 Comfortable with class 12 mathematics

3763 students have enrolled already!!

COURSE INSTRUCTOR



Sourav Chakraborty is an Associate Professor in the Computer Science Department at the Chennai Mathematical Institute. He has been a faculty at the Chennai Mathematical institute since 2010. He obtained his Phd from the University of Chicago in 2008. He did his MS also from the University of Chicago and did his under-graduation from the Chennai Mathematical Institute. He was a postdoctoral fellow at the Technion, Israel Institute of Technology, Haifa, Israel from 2008 to 2009 and at the Centrum Wiskunde Informatica (CWI), Amsterdam from 2009 to 2010. He has also been visiting faculty at the University of California, San Diego and Rice University, Houston. His area of research is algorithms and complexity. In particular he has done research in the classical and quantum complexity of Boolean functions (including property testing, sensitivity and block sensitivity of Boolean functions and quantum database search), in electronic commerce, in graph algorithms and in coding theory. He has over 30 papers in various international Journals and conferences. He has taught a variety of courses (both at the undergraduate level and advanced level) in Chennai Mathematical Institute and various other institute in India and abroad. In particular he has taught Discrete Mathematics for the undergraduates and masters in Chennai Mathematical Institute and also taught both the basic and advanced undergraduate level discrete mathematics course at University of California, San Diego.
COURSE LAYOUT

 Week 1 :Introduction to Propositional Logic, Number System, Sets and Functions
Week 2: Proof Techniques - Direct Proofs
Week 3: Proof Techniques - Contradiction
Week 4: Proof Techniques - Contrapositive, Induction
Week 5: Proof Techniques - Induction
Week 6: Asymptotic Notations, Recurrences
Week 7: Generating functions
Week 8: Introduction to Graph, Modelling in Graphs
Week 9: Proof of Graph Properties
Week 10: Counting- Permutation, Combination, Binomial Coefficients
Week 11: More Counting - Ball and Bins Problem
Week 12: Counting- Catalan Numbers

Certification Exam

The exam is optional. Exams will be on 24 April 2016 and 30 April 2016.
Time: 2pm-5pm

Tentative list of exam cities: http://nptel.ac.in/noc/pdf/Exam%20City-list.pdf

Registration url: Announcements will be made when the registration form is open for registrations.

The online registration form has to be filled and the certification exam fee of approximately Rs 1000 needs to be paid.

Certificate

Certificate will be given to those who register and write the exam. Certificate will have your name, photograph and the score in the final exam.

It will have the logos of NPTEL and IIT Madras. It will be e-verifiable at nptel.ac.in/noc.