Learn · NPTEL

Course10610516460 lectures

Introduction to Algorithms and Analysis

Prof. Sourav Mukhopadhyay · IIT Kharagpur

Start with lecture 1 At NPTEL

About

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.

INDUSTRY SUPPORT : IT companies

Lectures

Week 1

  1. Lecture 1: Insertion sort YouTube
  2. Lecture 2: Analysis of Insertion Sort YouTube
  3. Lecture 3: Asymptotic Notation YouTube
  4. Lecture 4: Recurrence for Merge Sort YouTube
  5. Lecture 5: Substitution Method YouTube

Week 2

  1. Lecture 6: The Master Method YouTube
  2. Lecture 7: Divide-and-Conquer YouTube
  3. Lecture 8: Divide-and-Conquer (Contd..) YouTube
  4. Lecture 9: Straseen's Algorithms YouTube
  5. Lecture 10: QuickSort YouTube

Week 3

  1. Lecture 11: Analysis of Quicksort. YouTube
  2. Lecture 12: Randomized Quicksort YouTube
  3. Lecture 13: Heap YouTube
  4. Lecture 14: Heap Sort YouTube
  5. Lecture 15: Decision Tree YouTube

Week 4

  1. Lecture 16: Linear time Sorting YouTube
  2. Lecture 17: Radix Sort & Bucket Sort YouTube
  3. Lecture 18: Order Statistics YouTube
  4. Lecture 19: Order Statistics (Contd.) YouTube
  5. Lecture 20: Worst case linear time order statistics YouTube

Week 5

  1. Lecture 21 : Hash Function YouTube
  2. Lecture 22 : Open Addressing YouTube
  3. Lecture 23 : Universal Hashing YouTube
  4. Lecture 24 : Perfect Hashing YouTube
  5. Lecture 25 : Binary Search Tree (BST) Sort YouTube

Week 6

  1. Lecture 26: Randomly build BST YouTube
  2. Lecture 27: Red Black Tree YouTube
  3. Lecture 28: Red Black Tree (Cont...) YouTube
  4. Lecture 29: Augmentation of data structure YouTube
  5. Lecture 30: Interval trees YouTube

Week 7

  1. Lecture 31 : Fixed Universe Successor YouTube
  2. Lecture 32 : Van Emde Boas data structure YouTube
  3. Lecture 33: Amortized Analysis YouTube
  4. Lecture 34: Computational Geometry YouTube
  5. Lecture 35: Computational Geometry (cont....) YouTube

Week 8

  1. Lecture 36: Dynamic Programming YouTube
  2. Lecture 37: Longest common subsequence YouTube
  3. Lecture 38: Graphs YouTube
  4. Lecture 39: Prim's Algorithms YouTube
  5. Lecture 40: Graph Search YouTube

Week 9

  1. Lecture 41: BFS & DFS YouTube
  2. Lecture 42: Shortest path problem YouTube
  3. Lecture 43: Dijktra's YouTube
  4. Lecture 44:Example of Dijktra YouTube
  5. Lecture 45: Bellman Ford YouTube

Week 10

  1. Lecture 46: Correctness of Bellman Ford YouTube
  2. Lecture 47: Application of Bellman Ford YouTube
  3. Lecture 48: All pairs shortest path YouTube
  4. Lecture 49: Floyd-Warshall YouTube
  5. Lecture 50: Johnson Algorithm YouTube

Week 11

  1. Lecture 51 : Disjoint set data structure YouTube
  2. Lecture 52 : Union-Find YouTube
  3. Lecture 53 : Augmented disjoint set data structure YouTube
  4. Lecture 54 : Network flow YouTube
  5. Lecture 55 : Network Flow (cont...) YouTube

Week 12

  1. Lecture 56 : Network Flow (cont...) YouTube
  2. Lecture 57 : More on Dynamic Programming YouTube
  3. Lecture 58 : More on Dynamic Programming (cont...) YouTube
  4. Lecture 59 : Computational Complexity YouTube
  5. Lecture 60 : Computational Complexity (cont...) YouTube

Syllabus and materials

At NPTEL, as the course publishes them.

Credits and licence

Institution
IIT Kharagpur
Department
Computer Science and Engineering
Teacher
Prof. Sourav Mukhopadhyay
Level
Undergraduate
Language
English
Subjects
Computer science, Engineering
Source
NPTEL
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed