DSC 190 – Advanced Algorithms for Data Scientists
This Week
Theory of Computation
Lecture 16 — Bloom Filters
Lecture 17 — Count-Min Sketch
Lab 9
Due
Thursday, Dec 07 at 23:59 PM
Homework 9
Due
Wednesday, Dec 13 at 23:59 PM
Week 9
Sketching and Streaming
Lecture 15 — Suffix Trees
Lab 8
Was due
Monday, Nov 27 at 23:59 PM
Homework 8
Was due
Wednesday, Nov 29 at 23:59 PM
Week 8
Strings
Lecture 13 — Rabin-Karp String Matching
Homework 7
Was due
Monday, Nov 20 at 23:59 PM
Week 7
Algorithm Design, pt. III
Lecture 11 — Dynamic Programming, pt. I
Lecture 12 — Longest Common Subsequence
Lab 7
Was due
Thursday, Nov 16 at 23:59 PM
Homework 6
Was due
Monday, Nov 13 at 23:59 PM
Week 6
Algorithm Design, pt. II
Lecture 10 — Backtracking
Lab 6
Was due
Thursday, Nov 09 at 23:59 PM
Homework 5
Was due
Monday, Nov 06 at 23:59 PM
Week 5
Algorithm Design, pt. I
Lecture 8 — Disjoint Set Forests
Lecture 9 — Greedy Algorithms
Lab 5
Was due
Thursday, Nov 02 at 23:59 PM
Homework 4
Was due
Monday, Oct 30 at 23:59 PM
Week 4
Faster NN Queries
Lecture 7 — Locality Sensitive Hashing
Lab 4
Was due
Thursday, Oct 26 at 23:59 PM
Homework 3
Was due
Monday, Oct 23 at 23:59 PM
Week 3
Balanced BSTs
Lecture 4 — Binary Search Trees
Lab 3
Was due
Thursday, Oct 19 at 23:59 PM
Homework 2
Was due
Monday, Oct 16 at 23:59 PM
Week 2
Dynamic Arrays and Heaps
Lecture 2 — Dynamic Arrays
Lab 2
Was due
Thursday, Oct 12 at 23:59 PM
Homework 1
Was due
Monday, Oct 09 at 23:59 PM
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
0734 for Campuswire and
XX2JJN for Gradescope.
See you in lecture!
Lecture 1 — Introduction and Review
Lab 1
Was due
Thursday, Oct 05 at 23:59 PM