CSE101 - Intro to Data Structures and Algorithms


Date Topic Slides Handout Reference
01/07/20 Introduction intro   lec1 Responsibility
01/09/20 Linked lists lec2
01/14/20 Linked lists continued, Stacks lec3
01/16/20 Recursion through stacks lec4
01/21/20 Asymptotic analysis, Big-Oh notation lec5 Chap 3, CLRS
01/23/20 Binary search analysis, starting Binary heaps lec6 Chap 3, 6, CLRS
01/28/20 Binary heaps lec7 Heap viz by Melezinek Chap 6, CLRS
01/30/20 BST (Binary Search Trees) lec8 BST viz by Melezinek Chap 10, CLRS
02/04/20 BSTs continued, self-balancing BSTs lec9 AVL viz by Galles
02/06/20 Hash tables, mergesort lec10 Chap 11, Chap 2, CLRS
02/11/20 Analysis of mergesort, quicksort lec11 Chap 2, 3, 7 CLRS
02/13/20 Solving algorithms problems: I lec12
02/18/20 Solving algorithms problems: II lec13
02/20/20 Class cancelled
02/25/20 Graphs, BFS lec15 Chap 22, CLRS
02/27/20 BFS continued lec16 Chap 22, CLRS
03/03/20 Single source shortest path, Dijkstra's algorithm lec17 Chap 24, CLRS
03/05/20 Cancelled (old DFS notes here) old DFS Chap 22, CLRS
03/10/20 DFS lec19 Video (not good) Chap 22, CLRS
03/12/20 All Questions Answered