1

Discrete Mathematics. Instructor: Prof. Sourav Chakraborty, Department of Computer Science, Chennai Mathematical Institute. In this course, we will cover the basics of discrete mathematics.

FREE
This course includes
Hours of videos

1416 years, 6 months

Units & Quizzes

51

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

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. (from nptel.ac.in)

Course Currilcum

    • Lecture 01 – Course Introduction Unlimited
    • Lecture 02 – Sets, Relations and Functions Unlimited
    • Lecture 03 – Propositional Logic and Predicate Logic Unlimited
    • Lecture 04 – Propositional Logic and Predicate Logic (cont.) Unlimited
    • Lecture 05 – Elementary Number Theory Unlimited
    • Lecture 06 – Formal Proofs: Empirical and Mathematical Proofs Unlimited
    • Lecture 07 – Constructive Proofs: Direct Proofs Unlimited
    • Lecture 08 – Constructive Proofs: Case Study Unlimited
    • Lecture 09 – Constructive Proofs: Case Study (Part 2) Unlimited
    • Lecture 09b – Sets, Relations, Function and Logic Unlimited
    • Lecture 10 – Proof by Contradiction (Part 1) Unlimited
    • Lecture 11 – Proof by Contradiction (Part 2) Unlimited
    • Lecture 12 – Proof by Contraposition Unlimited
    • Lecture 13 – Proof by Counter Example Unlimited
    • Lecture 14 – Mathematical Induction (Part 1) Unlimited
    • Lecture 15 – Mathematical Induction (Part 2) Unlimited
    • Lecture 16 – Mathematical Induction (Part 3) Unlimited
    • Lecture 17 – Mathematical Induction (Part 4) Unlimited
    • Lecture 18 – Mathematical Induction (Part 5) Unlimited
    • Lecture 19 – Mathematical Induction (Part 6) Unlimited
    • Lecture 20 – Mathematical Induction (Part 7) Unlimited
    • Lecture 21 – Mathematical Induction (Part 8) Unlimited
    • Lecture 22 – Introduction to Graph Theory Unlimited
    • Lecture 23 – Handshake Problem Unlimited
    • Lecture 24 – Tournament Problem Unlimited
    • Lecture 25 – Tournament Problem (cont.) Unlimited
    • Lecture 26 – Ramsey Problem Unlimited
    • Lecture 27 – Ramsey Problem (cont.) Unlimited
    • Lecture 28 – Properties of Graphs Unlimited
    • Lecture 29 – Problem 1: Transportation Optimization Unlimited
    • Lecture 30 – Problem 2: Bang for Buck in Advertisement Unlimited
    • Lecture 31 – Problem 3: Telephone Towers, Problem 4: Scheduling Meetings Unlimited
    • Lecture 32 – Counting for Selection Unlimited
    • Lecture 33 – Counting for Distribution Unlimited
    • Lecture 34 – Counting for Distribution (cont.) Unlimited
    • Lecture 35 – Some Counting Problems Unlimited
    • Lecture 36 – Counting using Recurrence Relations Unlimited
    • Lecture 37 – Counting using Recurrence Relations (cont.) Unlimited
    • Lecture 38 – Solving Recurrence Relations (Part 1) Unlimited
    • Lecture 39 – Solving Recurrence Relations (Part 2) Unlimited
    • Lecture 40 – Asymptotic Relations 1 Unlimited
    • Lecture 41 – Asymptotic Relations 2 Unlimited
    • Lecture 42 – Asymptotic Relations 3 Unlimited
    • Lecture 43 – Asymptotic Relations 4 Unlimited
    • Lecture 44 – Generating Functions 1 Unlimited
    • Lecture 45 – Generating Functions 2 Unlimited
    • Lecture 46 – Generating Functions 3 Unlimited
    • Lecture 47 – Generating Functions 4 Unlimited
    • Lecture 48 – Proof Techniques Unlimited
    • Lecture 49 – Modeling: Graph Theory and Linear Programming Unlimited
    • Lecture 50 – Combinatorics Unlimited