DSC 40B – Theoretical Foundations of Data Science II
Final Exam Week
Minimum Spanning Trees 🏁
Lecture 18 on Complexity Theory is optional, and won't appear in the homework. Feel free to watch it at your leisure if you'd like to know more about one of the most important open problems in mathematics and computer science: does P = NP?.
Lecture 18 — Complexity Theory (Optional)
Lecture 17 — Kruskal's Algorithm
Reminder: there is no lecture this week due to the midterm exam and the Thanksgiving holiday. Happy holidays!
Weighted Shortest Paths
Lecture 15 — Dijkstra's Algorithm
Reminder: no lecture on Thursday, November 11 due to Veterans Day.
Lecture 12 — BFS for Shortest Paths
BSTs and Hashing
Lecture 9 — Hashing
Sorting and Faster Selection
Lecture 7 — Quickselect
Expected Time and Recursion
Lecture 5 — Recurrences and Binary Search
Lecture 3 — Asymptotic Time Complexity, pt. II
Welcome to DSC 40B!
Here is how to get started:
- Read the syllabus.
- Join our
with the email invitations you received earlier this week. If
you didn't receive an email, you can use access code
7589for Campuswire and
- Fill out the poll to determine when our second midterm should be.
- Come to the first lecture on Thursday:
- Prof. Wang's lecture is at 9:30 am in WLH 2207;
- Prof. Eldridge's is at 12:30 pm in WLH 2204.
See you in lecture!