ABOUT THE COURSE: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.INTENDED AUDIENCE:Core, UG /PG, B.Tech/B.E./M.Tech/M.Sc.PREREQUISITES:NilINDUSTRY SUPPORT: IT companies
Fundamental Algorithms: Design And Analysis
Indian Institute of Technology, Kharagpur and NPTEL via Swayam
This course may be unavailable.
Overview
Syllabus
Week 1: Insertion Sort, Asymptotic Notation, Merge Sort, QuickSort, Divide and Conquer
Week 2: Heap Sort, Linear-time Sorting, Order Statistics
Week 3: Hashing, BST Sort, Augmenting Data Structures, Dynamic Programming
Week 4: Graphs : BFS, DFS, Prim's, Shortest Paths
Taught by
Sourav Mukhopadhyay
Tags
Related Courses
-
Introduction to Algorithms (Fall 2011)
4.0 -
MIT 6.006 Introduction to Algorithms, Spring 2020
4.7 -
Fundamental Algorithms - Design and Analysis
-
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
4.7 -
Design and Analysis of Algorithms
5.0 -
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms
4.8
