Fundamental Algorithms: Design And Analysis
Offered By: Indian Institute of Technology, Kharagpur via Swayam
Course Description
Overview
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
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
Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsStanford University via Coursera Using Effcient Sorting Algorithms in Java to Arrange Tax Data
Coursera Project Network via Coursera Using Efficient Sorting Algorithms in Java to Arrange Tax Data
Coursera Project Network via Coursera Algorithms (2019)
Brilliant Learn Sorting Algorithms with Python
Codecademy