DSC 40B – Theoretical Foundations of Data Science II

This Week

Selection and BST

Lecture 11 — Quickselect

  • 📖 Reading None
  • 🎞️ Slides

Lecture 12 — Partition

  • 📖 Reading None
  • 🎞️ Slides

Lecture 13 — BST

  • 📖 Reading None
  • 🎞️ Slides

Lab 4

Due Monday, Oct 27 at 23:59 PM

Homework 4

Due Wednesday, Oct 29 at 23:59 PM

Discussion worksheet 4

past weeks

Week 3

Sorting

Lecture 8 — Binary Search

Lecture 9 — Recurrences

Lecture 10 — Sorting

Lab 3

Was due Monday, Oct 20 at 23:59 PM

Homework 3

Was due Wednesday, Oct 22 at 23:59 PM

Discussion worksheet 3

Week 2

Average, Best, and Worst Case

Lecture 5 — Best, Worst Time Complexity

Lecture 6 — Average Time Complexity

Lecture 7 — Expected Time Complexity, Theoretical Lower Bound

Lab 2

Was due Monday, Oct 13 at 23:59 PM

Homework 2

Was due Wednesday, Oct 15 at 23:59 PM

Discussion worksheet 2

Week 1

Time Complexity

Lecture 2 — Asymptotic Time Complexity, pt. I

Lecture 3 — Asymptotic Time Complexity, pt. II

Lecture 4 — Asymptotic Time Complexity, pt. III

Lab 1

Was due Monday, Oct 06 at 23:59 PM

Discussion worksheet 1

Week 0

Introduction

Welcome to DSC 40B!

Here is how to get started:

  • Read the syllabus.
  • Fill out this pre-course survey.
  • 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 the access code 6055 for Campuswire.
  • The first lecture is on Friday, September 26 at the following time and place:
    • 12:00 PM in MANDE B-202.

See you in lecture!

Lecture 1 — Introduction

Homework 1

Was due Wednesday, Oct 08 at 23:59 PM
future weeks

Week 5

Hashing

Week 6

Graph Theory

Week 7

BFS

Week 8

DFS

Week 9

Weighted Shortest Paths

Week 10

Minimum Spanning Trees

Week 11

Final Exam Week