Data Structures and Algorithms

Our sixth and final exercise, Sorting, is now released on our course website and is due 11:59 PM PDT Friday, May 27^th!

This exercise is to help us get in some practice on considering stability & space (in-place), time complexity, and design decisions all related to sorting.

High-level collaboration is allowed, but exercises are to be completed and submitted individually and digitally on Gradescope (not a pdf).

As always, feel free to post on Ed or swing by office hours if you’d like some assistance! :)

Remember, the same late days that apply to projects also apply to the exercises! :)

(Discuss this announcement on Ed)

Our fifth exercise, MSTs & Disjoint Sets, is now released on our course website and is due 11:59 PM PDT Friday, May 20!

This exercise is to help us get in some practice on understanding the difference between MSTs and SPTs, creating MSTs using Kruskal’s and Prim’s algorithms, and working with disjoint sets in both tree and array format and both without and with path compressions.

High-level collaboration is allowed, but exercises are to be completed and submitted individually and digitally on Gradescope (not a pdf).

As always, feel free to post on Ed or swing by office hours if you’d like some assistance! :)

Remember, the same late days that apply to projects also apply to the exercises! :)

(Discuss this announcement on Ed)

P4: Mazes has been released! This is our last project and it is the longest one being a 3-week assignment due Wednesday, June 1.

The full project thread is posted on Ed. You can find the spec here.