DSC 40B – Theoretical Foundations of Data Science II
Midterm 01 on Tuesday, Oct 26
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's 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!
Weighted Shortest Paths
Midterm 02 on Tuesday, Nov 23
Minimum Spanning Trees 🏁
Final Exam Week
Redemption Exams (Eldridge) on Friday, Dec 10
Redemption Exams (Wang) on Thursday, Dec 09