1
Discrete Mathematics. Instructor: Prof. Ashish Choudhury, Department of Computer Science, IIIT Bangalore.
FREE
This course includes
Hours of videos
2027 years, 6 months
Units & Quizzes
73
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Discrete mathematics is the study of mathematical structures that are discrete in the sense that they assume only distinct, separate values, rather than in a range of values. It deals with the mathematical objects that are widely used in almost all fields of computer science, such as programming languages, data structures and algorithms, cryptography, operating systems, compilers, computer networks, artificial intelligence, image processing, computer vision, natural language processing, etc. The subject enables the students to formulate problems precisely, solve the problems, apply formal proof techniques and explain their reasoning clearly. (from nptel.ac.in)
Course Currilcum
-
- Lecture 01 – Introduction to Mathematical Logic Unlimited
- Lecture 02 – Logical Equivalence Unlimited
- Lecture 03 – SAT Problem Unlimited
- Lecture 04 – Rules of Inference Unlimited
- Lecture 05 – Resolution Unlimited
- Lecture 06 – Tutorial 1: Part 1 Unlimited
- Lecture 07 – Tutorial 1: Part 2 Unlimited
-
- Lecture 08 – Predicate Logic Unlimited
- Lecture 09 – Rules of Inferences in Predicate Logic Unlimited
- Lecture 10 – Proof Strategies I Unlimited
- Lecture 11 – Proof Strategies II Unlimited
- Lecture 12 – Induction Unlimited
- Lecture 13 – Tutorial 2: Part I Unlimited
- Lecture 14 – Tutorial 2: Part II Unlimited
- Lecture 15 – Sets Unlimited
- Lecture 16 – Relations Unlimited
- Lecture 17 – Operations on Relations Unlimited
- Lecture 18 – Transitive Closure of Relations Unlimited
- Lecture 19 – Warshall’s Algorithm for Computing Transitive Closure Unlimited
- Lecture 20 – Tutorial 3 Unlimited
- Lecture 27 – Countable and Uncountable Sets Unlimited
- Lecture 28 – Examples of Countably Infinite Sets Unlimited
- Lecture 29 – Cantor’s Diagonalization Argument Unlimited
- Lecture 30 – Uncountable Functions Unlimited
- Lecture 31 – Tutorial 5 Unlimited
- Lecture 39 – Solving Linear Non-Homogeneous Recurrence Equations Unlimited
- Lecture 40 – Catalan Numbers Unlimited
- Lecture 41 – Catalan Numbers – Derivation of Closed Form Formula Unlimited
- Lecture 42 – Counting using Principle of Inclusion-Exclusion Unlimited
- Lecture 43 – Tutorial 7 Unlimited
- Lecture 50 – Euler Path and Euler Circuit Unlimited
- Lecture 51 – Hamiltonian Circuit Unlimited
- Lecture 52 – Vertex and Edge Coloring Unlimited
- Lecture 53 – Tutorial 9: Part I Unlimited
- Lecture 54 – Tutorial 9: Part II Unlimited
- Lecture 61 – Group Theory Unlimited
- Lecture 62 – Cyclic Groups Unlimited
- Lecture 63 – Subgroups Unlimited
- Lecture 64 – More Applications of Groups Unlimited
- Lecture 65 – Discrete Logarithm and Cryptographic Applications Unlimited
