[Home] [Syllabus] [Assignments] [Resources]

This page has problem set assignments for the course. The assignments will be added as they become available.

- Lab 1. Monday, May 24th. Due Tuesday, May 25th at 11:59pm.
- Lab 2. Wednesday, May 26th. Due Thursday, May 27th at 11:59pm.
- Lab 3. Thursday, May 27th.
- Lab 6. Tuesday, June 8th. Due Wednesday, June 9th at 11:59pm
- Lab 7. Wednesday, June 9th. Due Thursday, June 10th at 11:59pm
- Lab 8. Thursday, June 10th. Due Monday, June 14th at 11:59pm
- Lab 9 Monday, June 14th. Due Tuesday, June 15th at 11:59pm.
- A catch-up day: a chance to work on the midterm and/or catch up on late assignments and labs. If you are done with all of this (including the midterm), you don't have to attend. Otherwise you have to.
- Thursday, Friday June 24, 25. Lab 10: priority heaps and binary search trees.
- Monday, June 21. Lab 11: AVL trees
- Wednesday, June 23. Lab 12. Work in pairs or groups of three. Finish the three methods of the graph class: BFS traversal and DFS traversal. Write tests for all these methods (at least two for each), make sure the tests are correct and pass. Note that these problems may have different correct solutions (depending on the order in which you add neightbors of a vertex to a stack or a queue), you might want to adjust your tests. Due Thursday, June 24th at 11:59pm.
- The last lab Thursday, June 24th. Due at the end of the lab.

- Problem set 1. Due Thursday, May 27th at 11:59pm.
- Problem set 2. Due Friday, May 28th at 11:59pm.
- Problem set 3. Due Tuesday, June 1st at 11:59pm.
- Problem set 4. Due Wednesday, June 9th at 11:59pm.
- Questions on Chapter 2. Due Monday, June 7th at 10am (note the unusual time!)
- Problem set 5. Due Monday, June 21st at 11:59pm.
- Problem set 6. Due Thursday June 24th at 11:59pm

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.