DSC 190 – Advanced Algorithms for Data Scientists

This Week

Theory of Computation

Lecture 19 — Complexity Theory

Week 9

Sketching and Streaming

Lecture 17 — Bloom Filters

Lecture 18 — Count-Min Sketch

Homework 9

Was due Wednesday, Mar 09 at 23:59 PM

Discussion 7

Week 8

Strings

Lecture 15 — Tries

Lecture 16 — Suffix Trees

Homework 8

Was due Wednesday, Mar 02 at 23:59 PM

Discussion 6

Week 7

Algorithm Design, pt. III

Lecture 13 — Unit Testing (Optional)

Lecture 14 — Rabin-Karp String Matching

Homework 7

Was due Wednesday, Feb 23 at 23:59 PM

Week 6

Algorithm Design, pt. II

Lecture 11 — Dynamic Programming, pt. I

Lecture 12 — Longest Common Subsequence

Homework 6

Was due Wednesday, Feb 16 at 23:59 PM

Week 5

Algorithm Design, pt. I

Lecture 9 — Greedy Algorithms

Lecture 10 — Backtracking

Homework 5

Was due Wednesday, Feb 09 at 23:59 PM

Discussion 5

Week 4

Disjoint Sets

Lecture 7 — Locality Sensitive Hashing

Lecture 8 — Disjoint Set Forests

Homework 4

Was due Wednesday, Feb 02 at 23:59 PM

Discussion 4

Week 3

Faster NN Queries

Lecture 5 — Treaps

Lecture 6 — k-d Trees

Homework 3

Was due Wednesday, Jan 26 at 23:59 PM

Discussion 3

Week 2

Heaps and Balanced Binary Trees

Lecture 3 — Heaps

Lecture 4 — Binary Search Trees

Homework 2

Was due Wednesday, Jan 19 at 23:59 PM

Discussion 2

Week 1

Introduction

Welcome to DSC 190 - Algorithms!

Here is 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 8336 for Campuswire and 2R36EX for Gradescope.
  • The first lecture video will be posted on YouTube and linked below on Tuesday. If you'd like a synchronous lecture experience, feel free to come to the watch party on Tuesday at 2:00 pm on Zoom.

See you in lecture!

Lecture 1 — Introduction and Review

Lecture 2 — Dynamic Arrays

Homework 1

Was due Wednesday, Jan 12 at 23:59 PM

Discussion 1