DSC 40B

This Week

Time Complexity

Lecture 2 — Asymptotic Time Complexity, pt. I

Reading

Section 1.1 - 1.4 in the course notes

Slides

Homework 1

Due Tuesday, Oct. 6 at 11:59 PM
past weeks

Last Week

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 EBEJGW for Gradescope and code 6152 for Campuswire.
  • The first lecture is on Thursday, September 24 at 3:30 PM in MANDE B-202.
  • The first discussion is on Monday, October 5 at 4:00 PM in MANDE B-202.

See you in lecture!

Lecture 1 — Introduction

Reading

Section 1.6 in the course notes

Slides

future weeks

Next Week

Expected Time and Recurrences

Week 3

Sorting and Selection

Week 4

BSTs and Hashing

Week 5

Graph Theory

Midterm 01 on Tuesday, October 27

Week 6

BFS

Week 7

DFS and Bellman-Ford

Week 8

Dijkstra's Algorithm and MSTs

Week 9

Midterm 02

Midterm 02 on Tuesday, November 24

Week 10

Kruskal's Algorithm and Complexity Theory

Week 11

Final Exam Week

Redemption Exams on Monday, December 7