1
Fundamental Algorithms: Design and Analysis. Instructor: Prof. Sourav Mukhopadhyay, Department of Electrical Engineering, IIT Kharagpur
FREE
This course includes
Hours of videos
555 years, 6 months
Units & Quizzes
20
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 and Asymptotic Analysis Unlimited
- Lecture 02 – Solving Recurrences Unlimited
- Lecture 03 – Divide and Conquer Paradigm Unlimited
- Lecture 04 – Quick Sort Unlimited
- Lecture 05 – Heap Sort Unlimited
- Lecture 06 – Decision Tree Unlimited
- Lecture 07 – Linear Time Sorting Unlimited
- Lecture 08 – Order Statistics Unlimited
- Lecture 09 – Hashing Unlimited
- Lecture 10 – Universal Hashing, Binary Search Tree Sort Unlimited
- Lecture 11 – Red-Black Tree Unlimited
- Lecture 12 – Augmenting Data Structure Unlimited
- Lecture 13 – Computational Geometry Unlimited
- Lecture 14 – Van Emde Boas Data Structure Unlimited
- Lecture 15 – Dynamic Programming Unlimited
- Lecture 16 – Graph Algorithm Unlimited
- Lecture 17 – Breadth First Search (BFS) and Depth First Search (DFS) Unlimited
- Lecture 18 – Dijkstra’s Algorithm Unlimited
- Lecture 19 – Bellman Ford Algorithm Unlimited
- Lecture 20 – Floyd Warshall Algorithm Unlimited
