YoVDO

Introduction To Algorithms and Analysis

Offered By: Indian Institute of Technology, Kharagpur via Swayam

Tags

Algorithms and Data Structures Courses Mathematical Modeling Courses Algorithms Courses Data Structures Courses Sorting Algorithms Courses Graph Algorithms Courses Computational Complexity Courses Dynamic programming Courses Divide-and-Conquer Courses

Course Description

Overview

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 : UG,PG, B. Tech., M. Tech., M. Sc.PREREQUISITES : NILLINDUSTRY SUPPORT : IT companies

Syllabus

Week 1: Sorting problem, time complexity, asymptotic analysis.Week 2: Solving recurrence, Divide-and-Conquer.Week 3: Quicksort and Heap Sort, Decision Tree.Week 4: Linear time Sorting, Order Statistics.Week 5: Hash Function, Binary Search Tree (BST) Sort.Week 6: Randomly build BST, Red Black Tree, Augmentation of data structure.Week 7: Van Emde Boas, Amortized analysis, Computational Geometry.Week 8: Dynamic Programming, Graphs, Prim's Algorithms.Week 9: BFS & DFS, Shortest path problem, Dijktra, Bellman Ford.Week 10: All pairs shortest path, Floyd-Warshall, Johnson Algorithm.Week 11: More amortized analysis, disjoint set data structure.Week 12: Network flow, computational complexity.

Taught by

Prof. Sourav Mukhopadhyay

Tags

Related Courses

Design of Computer Programs
Stanford University via Udacity
Algorithms, Part I
Princeton University via Coursera
Algorithms, Part II
Princeton University via Coursera
Intro to Algorithms
Udacity
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera