Data Structures and Algorithms

CS 130A - Fall 2024


[ Home | Lectures ]

TENTATIVE LECTURE SCHEDULE



Tentative schedule (exam date may change):


Monday, September 30:
  • Course Introduction, review of O() notation
  • Graphs: undirected/directed and adjacency list/matrix
  • Reading: Big-O() review: [DPV] Chapter 0.3
    Reading: Graphs: [DPV] Chapter 3.1

    Wednesday, October 2:
  • DFS and Connected components of undirected graphs
  • Topologically sorting a DAG
  • Reading: [DPV] Chapters 3.2 and 3.3

    Monday, October 7:
  • Strongly Connected Components (SCCs)
  • Reading: [DPV] Chapter 3.4
    See notes here and Lecture video GR 1 from Eric's Algorithms MOOC (accessible via Ed)

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

    Monday, October 14:
  • Min-heap data structure
  • Reading: [DPV] Chapter 4.5

    Wednesday, October 16:
  • Shortest paths in general graphs: Bellman-Ford
  • Detecting negative weight cycles
  • Reading: [DPV] Chapter 4.6

    Monday, October 21:
  • MST: Prim's and Kruskal's
  • Reading: [DPV] Chapter 5.1
    See notes here and Lecture video GR 3 from Eric's Algorithms MOOC (accessible via Ed)

    Wednesday, October 23:
  • Cut property
  • Reading: [DPV] Chapter 5.1
    See notes here and Lecture video GR 3 from Eric's Algorithms MOOC (accessible via Ed)
    Drop deadline is typically today, check UCSB registration calendar.
    (Note, ≥ 70% is needed to pass the course.)

    Monday, October 28:
  • Union-Find data structure
  • Reading: [DPV] Chapter 5.1
    See notes here and Lecture video GR 3 from Eric's Algorithms MOOC (accessible via Ed)

    Wednesday, October 30:
  • Exam review

  • Monday, November 4:
  • Midterm Exam

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

    Monday, November 11:
    No Class -- UCSB Holiday (Veteran's Day)

    Wednesday, November 13:
  • Bloom filters
  • Reading: See notes here and Lecture video RA 3 from Eric's Algorithms MOOC (accessible via Ed)

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

    Wednesday, November 20:
  • Binary Search Trees (BSTs) review and Balanced BSTs intro
  • Reading: [Weiss] Chapters 4.1-4.3 and Notes from Subhash Suri

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

    Wednesday, November 27:
    No Class -- Thanksgiving

    Monday, December 2:
  • 2-SAT Algorithm
    For 2-SAT, see notes here and Lecture video GR 2 from Eric's Algorithms MOOC (accessible via Ed)

  • Wednesday, December 4 (last class):
  • Final exam review

  • Final Exam, see: UCSB Final Exam Schedule
  • Thursday, December 12, Noon-3pm.