DSC 40B – Theoretical Foundations of Data Science II

This Week

Hashing

Midterm 01 on Thursday, Feb 05

Lecture 9 — Hashing

Lab 5

Due Sunday, Feb 08 at 23:59 PM

Discussion 5

  • Worksheet not yet posted...
past weeks

Week 4

Sorting and Selection

Lecture 7 — Quickselect

Lecture 8 — Binary Search Trees

Lab 4

Was due Sunday, Feb 01 at 23:59 PM

Homework 4

Was due Tuesday, Feb 03 at 23:59 PM

Discussion 4

Week 3

Average, Best, and Worst Case

Announcement (01/20/2026):

The class on Thu (Jan 22) will be on zoom instead of in person. Here is the zoom link.

Lecture 5 — Recurrences and Binary Search

Lecture 6 — Sorting

Lab 3

Was due Sunday, Jan 25 at 23:59 PM

Homework 3

Was due Wednesday, Jan 28 at 23:59 PM

Discussion 3

Week 2

Time Complexity

Lecture 3 — Asymptotic Time Complexity, pt. II

Lecture 4 — Best, Worst, and Expected Time

Lab 2

Was due Sunday, Jan 18 at 23:59 PM

Homework 2

Was due Wednesday, Jan 21 at 23:59 PM

Discussion 2

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 D6KB74 for Gradescope and code 9509 for Campuswire.
  • The first lecture is on Tuesday, January 06 at the following time and place:
    • 8:00 AM in MANDE B-202.
  • The first discussion is at the following time and place:
    • Friday, January 09 at 12:00 PM in MANDE B-202.

See you in lecture!

Lecture 1 — Introduction

Lecture 2 — Asymptotic Time Complexity, pt. I

Lab 1

Was due Sunday, Jan 11 at 23:59 PM

Homework 1

Was due Wednesday, Jan 14 at 23:59 PM

Discussion 1

future weeks

Week 6

Graph Theory

Week 7

BFS

Week 8

DFS

Week 9

Weighted Shortest Paths

Midterm 02 on Thursday, Mar 05

Week 10

Minimum Spanning Trees

Week 11

Final Exam Week

Redemption Exams on Thursday, Mar 19