1
Design and Analysis of Algorithms. Instructor: Prof. Madhavan Mukund, Chennai Mathematical Institute.
FREE
This course includes
Hours of videos
1527 years, 7 months
Units & Quizzes
55
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course will cover basic concepts in the design and analysis of algorithms: analysis of algorithms; searching and sorting; algorithms on graphs; data structures - union-find and heaps, divide-and-conquer, search trees, greedy algorithms; dynamic programming; linear programming and network flows, intractability. (from nptel.ac.in)
Course Currilcum
-
- Lecture 01 – Course Outline Unlimited
- Lecture 02 – Example: Air Travel Unlimited
- Lecture 03 – Example: Xerox Shop Unlimited
- Lecture 04 – Example: Document Similarity Unlimited
- Lecture 05 – Introduction and Motivation Unlimited
- Lecture 06 – Input Size, Worst Case, Average Case Unlimited
- Lecture 07 – Quantifying Efficiency: O(), Omega(), Theta() Unlimited
- Lecture 08 – Examples: Analysis of Iterative and Recursive Algorithms Unlimited
-
- Lecture 09 – Arrays and Lists Unlimited
- Lecture 10 – Searching in an Array Unlimited
- Lecture 11 – Selection Sort Unlimited
- Lecture 12 – Insertion Sort Unlimited
- Lecture 13 – Merge Sort Unlimited
- Lecture 14 – Merge Sort: Analysis Unlimited
- Lecture 15 – Quicksort Unlimited
- Lecture 16 – Quicksort: Analysis Unlimited
- Lecture 17 – Sorting: Concluding Remarks Unlimited
- Lecture 18 – Introduction to Graphs Unlimited
- Lecture 19 – Representing Graphs Unlimited
- Lecture 20 – Breadth First Search (BFS) Unlimited
- Lecture 21 – Depth First Search (DFS) Unlimited
- Lecture 22 – Application of BFS and DFS Unlimited
- Lecture 23 – Directed Acyclic Graphs: Topological Sort Unlimited
- Lecture 24 – Directed Acyclic Graphs: Longest Paths Unlimited
- Lecture 32 – Union Find using Arrays Unlimited
- Lecture 33 – Union Find using Pointers Unlimited
- Lecture 34 – Priority Queues Unlimited
- Lecture 35 – Heaps Unlimited
- Lecture 36 – Heaps: Updating Values, Sorting Unlimited
- Lecture 37 – Divide and Conquer: Counting Inversions Unlimited
- Lecture 38 – Divide and Conquer: Closest Pair of Points Unlimited
- Lecture 44 – Introduction to Dynamic Programming Unlimited
- Lecture 45 – Memoization Unlimited
- Lecture 46 – Grid Paths Unlimited
- Lecture 47 – Common Subwords and Subsequences Unlimited
- Lecture 48 – Edit Distance Unlimited
- Lecture 49 – Matrix Multiplication Unlimited
