IIT Kharagpur · Computer Science
Fundamental Algorithms:Design and Analysis
Prof.Sourav Mukhopadhyay · 20 free video lectures
20 video lectures. Topics: Insertion Sort and Asymptotic Analysis; Solving Recurrences; Divide and Conquer Paradigm; Quick Sort; Heap Sort; Decision Tree; Linear Time Sorting; Order Statistics; Hashing; Universal Hashing, BST Sort; Red-Black Tree; Augmenting Data Structure; Computational Geometry…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 01 : Insertion Sort and Asymptotic Analysis
- Lecture 02: Solving Recurrences
- Lecture 03: Divide and Conquer Paradigm
- Lecture 04: Quick Sort
- Lecture 05 : Heap Sort
- Lecture 06: Decision Tree
- Lecture 07: Linear Time Sorting
- Lecture 08: Order Statistics
- Lecture 09: Hashing
- Lecture 10: Universal Hashing, BST Sort
- Lecture 11: Red-Black Tree
- Lecture 12: Augmenting Data Structure
- Lecture13: Computational Geometry
- Lecture 14: Van Emde Boas Data Structure
- Lecture 15: Dynamic Programming
- Lecture 16 : Graph Algorithm
- Lecture 17 : BFS and DFS
- Lecture 18 : Dijkstra
- Lecture 19 : Bellman Ford
- Lecture 20 : Floyd Marshall
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kharagpur.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights