An Introduction to Algorithms and Analysis. Instructor: Prof. Sourav Mukhopadhyay, Department of Mathematics, IIT Kharagpur.
FREE
This course includes
Hours of videos
1638 years, 8 months
Units & Quizzes
59
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Insertion Sort Unlimited
- Lecture 02 – Analysis of Insertion Sort Unlimited
- Lecture 03 – Asymptotic Notation Unlimited
- Lecture 04 – Recurrence for Merge Sort Unlimited
- Lecture 05 – Substitution Method for Solving Recurrence Unlimited
- Lecture 06 – The Master Method Unlimited
- Lecture 07 – Divide and Conquer Unlimited
- Lecture 08 – Divide and Conquer (cont.) Unlimited
- Lecture 10 – Quicksort Unlimited
- Lecture 11 – Analysis of Quicksort Unlimited
- Lecture 12 – Randomized Quicksort Unlimited
- Lecture 13 – Heap Unlimited
- Lecture 14 – Heap Sort Unlimited
- Lecture 15 – Decision Tree Unlimited
- Lecture 16 – Linear Time Sorting Unlimited
- Lecture 17 – Radix Sort and Bucket Sort Unlimited
- Lecture 18 – Order Statistics Unlimited
- Lecture 19 – Randomized Order Statistics Unlimited
- Lecture 20 – Worst Case Linear Time Order Unlimited
- Lecture 21 – Hash Function Unlimited
- Lecture 22 – Open Addressing Unlimited
- Lecture 23 – Universal Hashing Unlimited
- Lecture 24 – Perfect Hashing Unlimited
- Lecture 25 – Binary Search Tree (BST) Sort Unlimited
- Lecture 26 – Randomly Built BST Unlimited
- Lecture 27 – Red Black Tree Unlimited
- Lecture 28 – Red Black Tree (cont.) Unlimited
- Lecture 29 – Augmentation of Data Structure Unlimited
- Lecture 30 – Interval Trees Unlimited
- Lecture 31 – Fixed Universe Successor Unlimited
- Lecture 32 – Van Emde Boas Data Structure Unlimited
- Lecture 33 – Amortized Analysis Unlimited
- Lecture 34 – Computational Geometry Unlimited
- Lecture 35 – Computational Geometry (cont.) Unlimited
- Lecture 36 – Dynamic Programming Unlimited
- Lecture 37 – Longest Common Subsequence Unlimited
- Lecture 38 – Graphs Unlimited
- Lecture 39 – Prim’s Algorithm Unlimited
- Lecture 40 – Graph Search Unlimited
- Lecture 41 – Breadth-First Search and Depth-First Search Unlimited
- Lecture 42 – Shortest Path Problem Unlimited
- Lecture 43 – Dijkstra’s Algorithm Unlimited
- Lecture 44 – Example of Dijkstra’s Algorithm Unlimited
- Lecture 45 – Bellman-Ford Algorithm Unlimited
- Lecture 46 – Correctness of Bellman-Ford Algorithm Unlimited
- Lecture 47 – Application of Bellman-Ford Algorithm Unlimited
- Lecture 48 – All Pairs of Shortest Path Unlimited
- Lecture 49 – Floyd-Warshall Algorithm Unlimited
- Lecture 50 – Johnson Algorithm Unlimited
- Lecture 51 – Disjoint Set Data Structure Unlimited
- Lecture 52 – Union-Find Unlimited
- Lecture 53 – Augmented Disjoint Set Data Structure Unlimited
- Lecture 54 – Network Flow Unlimited
- Lecture 55 – Network Flow (cont.) Unlimited
- Lecture 56 – Network Flow (cont.) Unlimited
- Lecture 57 – More On Dynamic Programming Unlimited
- Lecture 58 – More On Dynamic Programming (cont.) Unlimited
- Lecture 59 – Computational Complexity Unlimited
- Lecture 60 – Computational Complexity (cont.) Unlimited
