IIT Kanpur · Computer Science

Data Structures and Algorithms Design

Prof. Nitin Saxena · 40 free video lectures

The modern economy is run by algorithms. This a first-level course to introduce the students to the world of algorithm design, data structures, analysis, and programming. We'll start with the asymptotics notation which captures time and space of algorithms in the worst-case. The basic data…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 01: What is an Algorithm?
  2. Lecture 02: Efficient Algorithms
  3. Lecture 03: Sorting, Searching and Arrays
  4. Lecture 04: Clever Algorithms
  5. Lecture 05: Asymptotics, Fast Max-Sum Subarray
  6. Lecture 06: Local Minima in 1D
  7. Lecture 07: Local Minima in 2D
  8. Lecture 08: Efficient Local Minima in 2D
  9. Lecture 09: Recurrence & Efficient Data Structures
  10. Lecture 10: Range Minima in 1D array
  11. Lecture 11: Abstract Data Structures: Lists
  12. Lecture 12: Linked Lists
  13. Lecture 13: Binary Search Inspired Tree
  14. Lecture 14: BST : Search, Insertion
  15. Lecture 15: Balancing a BST, Stack Data Structure
  16. Lecture 16: Stack: Expression Evaluation
  17. Lecture 17: Queue DS
  18. Lecture 18: Red Black Tree DS
  19. Lecture 19: RB Tree: Balance
  20. Lecture 20: Divide and Conquer Paradigm
  21. Lecture 21: Integer Multiplication & Inversions
  22. Lecture 22: Graph Theory & Algorithms
  23. Lecture 23: Graph DS & Breadth First Search
  24. Lecture 24: Complexity & Applications of BFS
  25. Lecture 25: Check Bipartiteness using BFS, Depth First Search
  26. Lecture 26: DFS tree and biconnected graph
  27. Lecture 27: Articulation Points, Heap Data Structure
  28. Lecture 28: Binary Heap
  29. Lecture 29: Heapification
  30. Lecture 30: Augmented tree Data Structure
  31. Lecture 31: Multi Increment and Dynamic Range Min Problems
  32. Lecture 32: Disjoint-Set Data Structure
  33. Lecture 33: Fast Union and the i-th Statistic Problem
  34. Lecture 34: i-th Statistic Problem: Approx Median
  35. Lecture 35: Greedy Algorithms: Job Scheduling
  36. Lecture 36: Minimum Spanning Tree
  37. Lecture 37: MST Cycle, Mobile Towers
  38. Lecture 38: Shortest Path Algorithm
  39. Lecture 39: Djikstra's Algorithm
  40. Lecture 40: Counting Sort, Radix Sort

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kanpur.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights