DSC 40B – Theoretical Foundations of Data Science II


This Week

Graphs

Midterm 01 on Tuesday, Oct 26

Lecture 10 — Graph Theory

  • 📖 Reading Section 3.1 and 3.2 in course notes
  • 🎞️ Slides (Prof. Eldridge) Not yet posted...
  • 🎞️ Slides (Prof. Wang)

Homework 5

Due Saturday, Oct 30 at 23:59 PM
past weeks

Week 4

BSTs and Hashing

Lecture 9 — Hashing

Lecture 8 — Binary Search Trees

Homework 4

Was due Saturday, Oct 23 at 23:59 PM

Midterm 01 Practice

Week 3

Sorting and Faster Selection

Lecture 7 — Quickselect

Lecture 6 — Sorting

Homework 3

Was due Saturday, Oct 16 at 23:59 PM

Discussion 3

Week 2

Expected Time and Recursion

Lecture 5 — Recurrences and Binary Search

Lecture 4 — Expected Time and Lower Bounds

Homework 2

Was due Saturday, Oct 09 at 23:59 PM

Discussion 2

Week 1

Time Complexity

Lecture 3 — Asymptotic Time Complexity, pt. II

Lecture 2 — Asymptotic Time Complexity, pt. I

Homework 1

Was due Saturday, Oct 02 at 23:59 PM

Discussion 1

Week 0

Introduction

Welcome to DSC 40B!

Here's how to get started:

  • Read the syllabus.
  • Join our Campuswire and Gradescope with the email invitations you received earlier this week. If you didn't receive an email, you can use access code 7589 for Campuswire and 3YWRDV for Gradescope.
  • 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!

Lecture 1 — Introduction

future weeks

Week 6

Breadth-First Search

Week 7

Depth-First Search

Week 8

Weighted Shortest Paths

Week 9

Thanksgiving Week

Midterm 02 on Tuesday, Nov 23

Week 10

Minimum Spanning Trees 🏁

Week 11

Final Exam Week

Redemption Exams (Eldridge) on Friday, Dec 10
Redemption Exams (Wang) on Thursday, Dec 09