CSE 326: Data Structures, Autumn 2003

Main Page

Previous Quarters

CSE Home

About Us

Search

Contact Info

Course Content  Syllabus  Calendar & Lecture Slides  Quiz Section (N/A)  Assignments Administrative  Using Course Email  Announcement List Archive  Discussion List Archive  Academic Accomodations  Anonymous Feedback Policies  Grading Policy  Collaboration Policy  Programming Guidelines  Written HW Guidelines Computing  Computing Info  Turnin Info

Written Assignment Guidelines Typed assignments are preferred. Handwritten will be accepted, but note that if the TA has a hard time reading your work, the TA will also have a hard time giving you a good grade. Some problems on the written assignments ask you to give an algorithm to solve a problem. Unless the assignment specifically tells you to implement the code and run it, pseudocode is acceptable. Pseudocode means that you don't have to write every line in Java with correct syntax; English explanations of operations are acceptable. Note that the general rule you should follow is that you can substitute English for any O(1) operation, but not for more complex steps. Thus, the following would not be acceptable:   scan the list and count all elements greater than x while the following would be OK   while list has more elements      increment counter if current element is greater than x      move to next element of list The idea is that you don't have to give all the nitty-gritty coding details (that's what the programming assignments are for), but you should demonstrate a clear understanding of what your algorithm does and where those nitty-gritty details would have to go.

	Department of Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to cse326-staff at cs.washington.edu]