CS21203: Algorithms-1 (Spring 2022-2023)

Lecture slides:

  1. Lecture 01 (2h, Jan 03, 2023): Asymptotic bounds
  2. Lecture 02 (1h, Jan 05, 2023): Binary trees and their traversals
  3. Lecture 03 (1h, Jan 09, 2023): Binary tree traversals (continued)
  4. Lecture 04 (2h, Jan 10, 2023): Binary search trees (BST), tries
  5. Lecture 05 (1h, Jan 12, 2023): BST — average-case searching time
  6. Lecture 06 (1h, Jan 16, 2023): Solving recurrences
  7. Lecture 07 (2h, Jan 17, 2023): Solving recurrences (continued) + AVL tree
  8. Lecture 08 (1h, Jan 19, 2023): AVL tree (continued)
  9. Lecture 09 (1h, Jan 23, 2023): Insights on different sorting techniques, Merge Sort and Quick Sort
  10. Lecture 10 (1h, Jan 30, 2023): Merge Sort and Quick Sort (continued)
  11. Lecture 11 (2h, Jan 31, 2023): Quick Sort (continued), Selection Sort, Bubble Sort, Insertion Sort
  12. Lecture 12 (1h, Feb 02, 2023): Graph intro
  13. Lecture 13 (2h, Feb 06, 2023): BFS
  14. Lecture 14 (1h, Feb 07, 2023): DFS/BFS with numbering, edge classification, uses
  15. Lecture 15 (1h, Feb 09, 2023): Binary min/max Heap, insertion, build

    Midsem exam: Feb 15 (Wed) – 24 (Fri)

  16. Lecture 16 (1h, Feb 27, 2023): Heap sort. Divide and Conquer
  17. Lecture 17 (2h, Feb 28, 2023): Divide and Conquer, Dynamic Prog.
  18. Lecture 18 (1h, Mar 02, 2023): Greedy technique, MST, Kruskal's algorithm
  19. Lecture 19 (1h, Mar 06, 2023): Dijkstra's single-source shortest paths, Prim's MST
  20. Lecture 20 (2h, Mar 07, 2023): Floyd-Warshall's all shortest paths; Lower bounds: searching, sorting, BST construction.
  21. Lecture 21 (1h, Mar 09, 2023): Problem solving with DP [Solution]
  22. Lecture 22 (1h, Mar 13, 2023): Order statistics, median finding
  23. Lecture 23 (2h, Mar 14, 2023): Class Test 2
  24. Lecture 24 (1h, Mar 16, 2023): Disjoint set union find (DSUF), operations, and complexities
  25. Lecture 25 (1h, Mar 20, 2023): DSUF continued
  26. Lecture 26 (2h, Mar 21, 2023): Problem solving with Greedy techniques [Solution]
  27. Lecture 27 (1h, Mar 23, 2023): Hashing
  28. Lecture 28 (1h, Mar 27, 2023): Hashing continued
  29. Lecture 29 (2h, Mar 28, 2023): Problem solving with Graphs [Solution]
  30. Lecture 30 (1h, Mar 30, 2023): Binomial heap
  31. Lecture 31 (1h, Apr 03, 2023): Red-Black tree
  32. Lecture 32 (2h, Apr 04, 2023): (Holiday: Mahavir Jayanti)
  33. Lecture 33 (1h, Apr 06, 2023): String matching
  34. Lecture 34 (1h, Apr 10, 2023): Skip list
  35. Lecture 35 (2h, Apr 11, 2023): Problem solving
  36. Lecture 36 (1h, Apr 13, 2023): Discussions and closing.

    Endsem exam: Apr 18 (Tue) – 28 (Fri)