1
Design and Analysis of Algorithms. Instructor: Prof. Abhiram Ranade, Department of Computer Science, IIT Bombay.
FREE
This course includes
Hours of videos
944 years, 4 months
Units & Quizzes
34
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course covers lessons on divide and conquer, greedy algorithm, pattern matching, dynamic programming and approximation algorithm. The main goal of this course teaches you to design algorithms which are fast. In this course you will study well defined design techniques through lots of exercises. We hope that at the end of the course you will be able to solve algorithm design problems that you may encounter later in your life. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Overview Unlimited
- Lecture 02 – Framework for Algorithms Analysis Unlimited
- Lecture 03 – Framework for Algorithms Analysis (cont.) Unlimited
- Lecture 04 – Asymptotic Notations Unlimited
- Lecture 05 – Algorithm Design Techniques: Basics Unlimited
- Lecture 06 – Divide-and-Conquer Unlimited
- Lecture 07 – Divide-and-Conquer: Median Finding Unlimited
- Lecture 08 – Divide-and-Conquer: Surfing Lower Bounds Unlimited
- Lecture 09 – Divide-and-Conquer: Closest Pair Unlimited
- Lecture 10 – Greedy Algorithms I Unlimited
- Lecture 11 – Greedy Algorithms II Unlimited
- Lecture 12 – Greedy Algorithms III Unlimited
- Lecture 13 – Greedy Algorithms IV Unlimited
- Lecture 14 – Pattern Matching I Unlimited
- Lecture 15 – Pattern Matching II Unlimited
- Lecture 16 – Combinational Search and Optimization I Unlimited
- Lecture 17 – Combinational Search and Optimization II Unlimited
- Lecture 18 – Dynamic Programming Unlimited
- Lecture 19 – Longest Common Subsequences Unlimited
- Lecture 20 – Matrix Chain Multiplication Unlimited
- Lecture 21 – Scheduling with Startup and Holding Costs Unlimited
- Lecture 22 – Average Case Analysis of Quicksort Unlimited
- Lecture 23 – Bipartite Maximum Matching Unlimited
- Lecture 24 – Lower Bounds for Sorting Unlimited
- Lecture 25 – Element Distinctness Lower Bounds Unlimited
- Lecture 26 – NP-Completeness I Unlimited
- Lecture 27 – NP-Completeness II Unlimited
- Lecture 28 – NP-Completeness III Unlimited
- Lecture 29 – NP-Completeness IV Unlimited
- Lecture 30 – NP-Completeness V Unlimited
- Lecture 31 – NP-Completeness VI Unlimited
- Lecture 32 – Approximation Algorithms for NP-Complete Problems Unlimited
- Lecture 33 – Approximation Algorithms for NP-Complete Problems (cont.) Unlimited
- Lecture 34 – Approximation Algorithms for NP-Complete Problems (cont.) Unlimited
