DSC 40B – Theoretical Foundations of Data Science II
Recursion and Sorting
Lecture 5 — Recurrences and Binary Search
Lecture 6 — Sorting
Lecture 3 — Asymptotic Time Complexity, pt. II
Lecture 4 — Expected Time and Lower Bounds
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
4210for Campuswire and
- The first lecture video will be posted on YouTube and linked below on Tuesday. If you'd like a synchronous lecture experience, feel free to come to the watch party on Tuesday at 5:00 pm on Zoom.
See you in lecture!
Lecture 1 — Introduction
Faster Selection and BSTs
Midterm 01 on Thursday, Feb 03
Weighted Shortest Paths
Minimum Spanning Trees
Midterm 02 on Thursday, Mar 03
Final Exam Week
Redemption Exams on Thursday, Mar 17