Final Prep

Optional Homework - Do Not Submit.

Coursera Exercises

At Princeton, we developed a set of exercises to help build understanding of the mechanics of our algorithms and data structures.

You're welcome to try them out. I'll be building a list here of exercises you might try. You'll have to create a Coursera account in order to access these exercises. Let me know if you end up finding them particularly useful. If you don't know where to start, just try submitting a dummy answer and it'll an example of a correct solution that you can try to use to understand the algorithm in question.

You should skip any problem that is not referenced below, since Princeton covers a different set of topics in COS226 than we cover in CS61B.

LZW (Quiz Link)

Note: The Princeton Course uses 0x80 as an 'end of file' character, whereas we use it for our first new codeword.

Algorithm Runtime Analysis (Quiz Link)

Undirected Graphs (Quiz Link)

Directed Graph: (Quiz Link)

MST: (Quiz Link)

Shortest Paths: (Quiz Link)

Less Useful Coursera Exercises

Max Heaps (Quiz Link)

Basic Sorts (Quiz Link)

Mergesort (Quiz Link)

BSTs (Quiz Link)

Hash Tables (Quiz Link)