DSC 40B – Theoretical Foundations of Data Science II
This Week
BFS
Lecture 12 — BFS for Shortest Paths
- 📖 Reading Section 3.3 in course notes
- 🎞️ Slides
Lecture 13 — Depth-First Search
- 📖 Reading Section 3.4 in course notes
- 🎞️ Slides
past weeks
Week 6
Graph Theory
Lecture 10 — Graph Theory
- 📖 Reading Section 3.1 and 3.2 in course notes
- 🎞️ Slides
Lecture 11 — Breadth First Search
- 📖 Reading Section 3.3 in course notes
- 🎞️ Slides
Week 5
Hashing
Midterm 01 on Thursday, May 01
Week 4
Sorting and Selection
Week 3
Average, Best, and Worst Case
Lecture 5 — Recurrences and Binary Search
- 📖 Reading Sections 2.4.1 and 2.2 in course notes
- 🎞️ Slides
Lecture 6 — Sorting
- 📖 Reading Section 2.1 and 2.3 in course notes
- 🎞️ Slides
Week 2
Time Complexity
Lecture 3 — Asymptotic Time Complexity, pt. II
- 📖 Reading Section 1.5 in course notes
- 🎞️ Slides
Week 1
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
3XRZ4R
for Gradescope and code6020
for Campuswire. - The first lecture is on
Tuesday, April 01
at the following time and place:
- 11:00 AM in PCYNH 109.
- The first discussion is
at the following time and place:
- Friday, April 04 at 5:00 PM in PCYNH 106.
See you in lecture!
Lecture 1 — Introduction
- 📖 Reading Section 1.6 in course notes
- 🎞️ Slides
Lecture 2 — Asymptotic Time Complexity, pt. I
- 📖 Reading Section 1.1 - 1.4 in course notes
- 🎞️ Slides
future weeks
Week 8
DFS
Week 9
Weighted Shortest Paths
Midterm 02 on Thursday, May 29
Week 10
Minimum Spanning Trees
Week 11
Final Exam Week
Redemption Exams on Tuesday, Jun 10