DSC 40B – Theoretical Foundations of Data Science II
This Week
BFS
Lecture 11 — Breadth First Search
- 📖 Reading Section 3.3 in course notes
- 🎞️ Slides
Lecture 12 — BFS for Shortest Paths
- 📖 Reading Section 3.3 in course notes
- 🎞️ Slides Not yet posted...
past weeks
Week 5
Graph Theory
Midterm 01 on Tuesday, Oct 29
Lecture 10 — Graph Theory
- 📖 Reading Section 3.1 and 3.2 in course notes
- 🎞️ Slides
Week 4
Hashing
Week 3
Sorting and Selection
Lecture 6 — Sorting
- 📖 Reading Section 2.1 and 2.3 in course notes
- 🎞️ Slides
- 🎥 Videos
Week 2
Average, Best, and Worst Case
Lecture 4 — Best, Worst, and Expected Time
Lecture 5 — Recurrences and Binary Search
- 📖 Reading Sections 2.4.1 and 2.2 in course notes
- 🎞️ Slides
Week 1
Time Complexity
Lecture 2 — Asymptotic Time Complexity, pt. I
- 📖 Reading Section 1.1 - 1.4 in course notes
- 🎞️ Slides
Lecture 3 — Asymptotic Time Complexity, pt. II
- 📖 Reading Section 1.5 in course notes
- 🎞️ Slides
Week 0
Introduction
Welcome to DSC 40B!
Here is how to get started:
- Read the syllabus.
- Join our
Campuswire message board
and
Gradescope
with the email invitations you received earlier this week. If
you didn't receive emails, you can use access code
XGKP8P
for Gradescope and code6036
for Campuswire. - The first lectures are on
Thursday, September 26
at the following times and places:
- 11:00 AM in WLH 2111.
- 2:00 PM in CSB 001.
- There will be no discussion in Week 0. Instead, the first discussions are
at the following times and places
- Friday, October 04 at 9:00 AM in PODEM 1A18.
- Monday, October 07 at 6:00 PM in PODEM 1A19.
See you in lecture!
Lecture 1 — Introduction
- 📖 Reading Section 1.6 in course notes
- 🎞️ Slides
future weeks
Week 7
DFS
Week 8
Weighted Shortest Paths
Week 9
Minimum Spanning Trees
Midterm 02 on Tuesday, Nov 26
Week 10
Conclusion 🏁
Redemption Exams on Saturday, Dec 07