Data Structures and Algorithms

CS 130A - Fall 2023


[ Home | Lectures ]

TENTATIVE LECTURE SCHEDULE



Tentative schedule (exam date may change):


Monday, October 2:
  • Course Introduction, review of O() notation
  • Reading: Big-O() review: [Weiss] Chapter 2 and [DPV] Chapter 0.3

    Wednesday, October 4:
  • DFS, Connected components of undirected graphs
  • Graphs: undirected/directed and adjacency list/matrix
  • Reading: Graphs: [DPV] Chapters 3.1 and 3.2 and [Weiss] Chapter 9.1

    Monday, October 9:
  • DFS on directed graphs
  • Topologically sorting a DAG
  • Reading: [DPV] Chapter 3.3

    Wednesday, October 11:
  • Strongly Connected Components (SCCs)
  • Reading: [DPV] Chapter 3.4
    See also lecture video GR 1 from Eric's Algorithms MOOC

    Monday, October 16:
  • BFS, Dijkstra's alg.
  • Reading: [DPV] Chapter 4.1-4.4

    Wednesday, October 18:
  • Min-heap data structure
  • Reading: [DPV] Chapter 4.5

    Monday, October 23:
  • MST: Prim's and Kruskal's
  • Reading: [DPV] Chapter 5.1
    See also lecture video GR 3 from Eric's Algorithms MOOC

    Wednesday, October 25:
  • Cut property
  • Reading: [DPV] Chapter 5.1
    See also lecture video GR 3 from Eric's Algorithms MOOC
    Drop deadline is today (Oct. 25th) (Note, ≥ 70% is needed to pass the course.)

    Monday, October 30:
  • Union-Find data structure
  • Reading: [DPV] Chapter 5.1
    See also lecture video GR 3 from Eric's Algorithms MOOC

    Wednesday, November 1:
  • Exam review
  • 2-SAT algorithm
  • For 2-SAT, see Lecture video GR 2 from Eric's Algorithms MOOC

    Monday, November 6:
  • Midterm Exam

  • Wednesday, November 8:
  • Hashing
  • Reading: Notes from Subhash Suri and [Weiss] Chapter 5

    Monday, November 13:
  • Bloom filters
  • Reading: lecture video RA 3 from Eric's Algorithms MOOC

    Wednesday, November 15:
  • More Hashing
  • Reading: For more about Cuckoo hashing see the nice lecture notes by Rasmus Pagh

    Monday, November 20:
  • Online async lecture: TBD

  • Wednesday, November 22:
  • No class -- Thanksgiving break

  • Monday, November 27:
  • Binary Search Trees (BSTs) review and Balanced BSTs
  • Reading: [Weiss] Chapter 4.1-4.3 and Notes from Subhash Suri

    Wednesday, November 29:
  • Balanced BST: AVL Trees
  • Reading: [Weiss] Chapter 4.4 and Notes from Subhash Suri

    Monday, December 4:
  • Optional lecture: PageRank
    Lecture video GR 4 from Eric's Algorithms MOOC

  • Wednesday, December 6:
  • Final exam review

  • Final Exam: Wednesday, December 13th, 8 - 11am.