A0. This is not really an assignment, but something we'd like you to do early in the course. Please take the background survey. It should take fewer than ten minutes of your time. We'll award 1 point of participation credit to those students who have completed the survey by September 26 at 11:59 PM.
A1. Image Enhancement with Undo and Redo. Due Wednesday, October 8 at 5:00 PM via Catalyst CollectIt. (Lead TA: CJ Liu).
A2. Mathematical techniques for the analysis of algorithms. Due Friday, October 17 at 2:30 PM in class. (Lead TA: Caitlin Bonnar).
A3. Hashing High-Volume Data. Part I due Wednesday, October 22 at 5:00 PM via Catalyst CollectIt. (Lead TA: Andy Borui Li). Part II due Wednesday, October 29 at 5:00 PM via Catalyst CollectId. (Lead TA: Johnson Goh).
A4.
Applying the UNION-FIND technique.
Determining and labeling the
connected components of a spatial data structure.
Part I (written). Lead TA: Andrea Kahn. Due Monday, Nov. 3 at 5:00 PM via Catalyst.
Part II (connected-components labeling implementation). Lead TA: Johnson Goh.
Due Monday, Nov. 10 at 5:00 PM via Catalyst.
Part III (segmentation with minimum-spanning trees). Lead TA: Johnson Goh.
Due Monday, Nov. 17 at 5:00 PM via Catalyst.
A5. Searching Implicit Graphs. Graph representation, depth-first search, breadth-first search, shortest paths, and applications to problem solving techniques. This assignment has a Python option. It also has a partnership option. Lead TAs: CJ Liu (Java version) and Andrea Kahn (Python version).
A6. Empirical Analysis of Sorting Programs. Experimentation in computer science, comparison of sorting algorithm behavior. (Lead TA: Andy Borui Li). Due Wednesday, December 3, at 5:00 PM via Catalyst.