|
TENTATIVE LECTURE SCHEDULE
Tentative schedule (topics and exam dates may change):
Monday, September 29:
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 1:
DFS and Connected components of undirected graphs
Topologically sorting a DAG
Reading: [DPV] Chapters 3.2 and 3.3
Monday, October 6:
Strongly Connected Components (SCCs)
Reading: [DPV] Chapter 3.4
See notes here and
Lecture video GR 1 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Wednesday, October 8:
BFS, Dijkstra's alg.
Reading: [DPV] Chapter 4.1-4.4
Monday, October 13:
Min-heap data structure
Shortest paths in general graphs: Bellman-Ford
Detecting negative weight cycles
Reading: [DPV] Chapter 4.6 (for min-heaps)
and Chapter 4.5 (for Bellman-Ford)
Wednesday, October 15:
2-SAT Algorithm
For 2-SAT, see notes here and
Lecture video GR 2 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Monday, October 20:
MST: Prim's and Kruskal's
Reading: [DPV] Chapter 5.1
See notes here and
Lecture video GR 3 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Wednesday, October 22:
Cut property
Reading: [DPV] Chapter 5.1
See notes here and
Lecture video GR 3 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Drop deadline is typically today, check UCSB registration calendar.
(Note, ≥ 70% is needed to pass the course.)
Monday, October 27:
Union-Find data structure
Reading: [DPV] Chapter 5.1
See notes here and
Lecture video GR 3 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Wednesday, October 29:
Exam review
Monday, November 3:
Midterm Exam
Wednesday, November 5:
Hashing
Reading: Notes from Subhash Suri
and [Weiss] Chapter 5
Monday, November 10:
Bloom filters
Reading:
See notes here and
Lecture video RA 3 from Eric's Algorithms MOOC, you need to first follow this link:(to access via Ed)
Wednesday, November 12:
More Hashing: Cuckoo hashing
Reading:
For more about Cuckoo hashing see the nice lecture notes by Rasmus Pagh
Monday, November 17:
Binary Search Trees (BSTs) review and Balanced BSTs intro
Reading: [Weiss] Chapters 4.1-4.3 and
Notes from Subhash Suri
Wednesday, November 19:
Balanced BST: AVL Trees
Reading: [Weiss] Chapter 4.4 and
Notes from Subhash Suri
Monday, November 24:
Intro to Markov chains and PageRank
Wednesday, November 26:
No Class -- Thanksgiving
Monday, December 1:
Perfect hashing and the birthday paradox
Wednesday, December 3 (last class):
Final exam review
Final Exam, see: UCSB Final Exam Schedule
Tuesday, December 9, Noon-3pm.
|