|CSE 373: Data Structures and Algorithms (Winter 2016)|
Assignment 0. 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 January 6 at 11:59 PM.
Assignment 2. Applying stacks and queues: Image enhancement with undo and redo. Due Wednesday, January 20 at 11:59 PM via Catalyst CollectIt. (lead TAs: Mauricio Vinagre Hernandez, Rahul Nadkarni).
Assignment 3. Mathematical techniques for the analysis of algorithms. Due Wednesday, January 27 at 11:59 PM via Catalyst CollectIt. (lead TAs: Dan Butler, Kuikui Liu). We will accept files in PDF format. You may handwrite answers provided you write clearly, and the photo or scan is easily legible by the graders. The photos of your handwritten pages should then be put into a PDF document with all problems in their proper order. The graders may take off points if they find your writing difficult to read or any of your answers to problems not in the proper order. Latex formatting is great but not required. If you choose to use Latex, then you may wish to start with this template file which consists primarily of Latex source for the questions themselves. (Note: Version V1.01 corrected a minor error in the pseudocode of Problem 4, and was posted at 4:23 PM, Jan. 22.)
Assignment 4. Hashing. Part I (written -- no programming) due
Wednesday, February 3 at 11:59 PM via Catalyst CollectIt.
Assignment 5. Applying the disjoint sets abstract data type. Part I (written) is due February 17. Part II (programming) is due February 24 (changed from February 22). (lead TAs: Hayoun Oh, Dan Butler).
Assignment 6. Graph search. (lead TAs: Kuikui Liu, Rahul Nadkarni, Hunter Zahn).
Assignment 7. Sorting Sleuth. (lead TAs: Dorothy Tsai, Hayoun Oh).
|University of Washington, Winter, 2016|