DSC 40B – Theoretical Foundations of Data Science II

This Week

Sorting and Selection

Lecture 7 — Quickselect

Lecture 8 — Binary Search Trees

  • 📖 Reading None
  • 🎞️ Slides

Lab 4

Due Sunday, Apr 27 at 23:59 PM

Homework 4

Due Tuesday, Apr 29 at 23:59 PM

Discussion 4

past weeks

Week 3

Average, Best, and Worst Case

Lecture 5 — Recurrences and Binary Search

Lecture 6 — Sorting

Lab 3

Was due Sunday, Apr 20 at 23:59 PM

Homework 3

Was due Wednesday, Apr 23 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, Apr 13 at 23:59 PM

Homework 2

Was due Wednesday, Apr 16 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 3XRZ4R for Gradescope and code 6020 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

Lecture 2 — Asymptotic Time Complexity, pt. I

Lab 1

Was due Sunday, Apr 06 at 23:59 PM

Homework 1

Was due Wednesday, Apr 09 at 23:59 PM

Discussion 1

future weeks

Week 5

Hashing

Midterm 01 on Thursday, May 01

Week 6

Graph Theory

Week 7

BFS

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