Data Structures and Algorithms

CS 130A - Winter 2024


[ Home | Lectures ]

TENTATIVE LECTURE SCHEDULE



Tentative schedule (exam date may change):


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

    Thursday, January 11:
  • 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

    Tuesday, January 16:
  • DFS on directed graphs
  • Topologically sorting a DAG
  • Reading: [DPV] Chapter 3.3

    Thursday, January 18:
  • Strongly Connected Components (SCCs)
  • Reading: [DPV] Chapter 3.4
    See notes here and Lecture video GR 1 from Eric's Algorithms MOOC

    Tuesday, January 23:
  • BFS, Dijkstra's alg.
  • Reading: [DPV] Chapter 4.1-4.4

    Thursday, January 25:
  • Min-heap data structure
  • Reading: [DPV] Chapter 4.5

    Tuesday, January 30:
  • MST: Prim's and Kruskal's
  • Reading: [DPV] Chapter 5.1
    See notes here and lecture video GR 3 from Eric's Algorithms MOOC

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

    Tuesday, February 6:
  • Union-Find data structure
  • Reading: [DPV] Chapter 5.1
    See notes here and lecture video GR 3 from Eric's Algorithms MOOC

    Thursday, February 8:
  • Exam review

  • Tuesday, February 13:
  • Midterm Exam

  • Thursday, February 15:
  • Hashing
  • Reading: Notes from Subhash Suri and [Weiss] Chapter 5

    Tuesday, February 20:
  • Bloom filters
  • Reading: See notes here and lecture video RA 3 from Eric's Algorithms MOOC

    Thursday, February 22:
  • More Hashing
  • Reading: For more about Cuckoo hashing see the nice lecture notes by Rasmus Pagh

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

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

    Tuesday, March 5:
  • 2-SAT Algorithm
    For 2-SAT, see notes here and Lecture video GR 2 from Eric's Algorithms MOOC

  • Thursday, March 7:
  • Introduction to Markov Chains
    See notes here and Lecture video GR 4 from Eric's Algorithms MOOC

  • Tuesday, March 12:
  • PageRank
    See notes here and Lecture video GR 4 from Eric's Algorithms MOOC

  • Thursday, March 14:
  • Final exam review

  • Final Exam: Monday, March 18th, Noon-3pm.