Below are links to the written exercises: There is one exercise corresponding to each lecture. Once the exercise moves above the "Exercises below have not yet been updated for Spring 2012" part of the table, no significant changes will be made. All readings refer to Algorithms, 4th edition by R. Sedgewick and K. Wayne unless otherwise specified.
|2||2/13||Analysis of Algorithms||1.4||submit|
|4||2/20||Stacks and Queues||1.3||submit|
|9||3/5||Binary Search Trees||3.2||submit|
|10||do not turn in||Balanced Search Trees||3.3||submit|
|11||do not turn in||Hash Tables||3.4||submit|
|13||3/26||Geometric Applications of BSTs||–||submit|
|16||4/9||Minimum Spanning Trees||4.3||submit|
|24||do not turn in||Reductions/Intractability||903–921||submit|
Submission policy. You may submit your solutions either in writing or electronically. Be sure to include your name, login, and precept number at the top of every exercise you submit. Submissions are accepted in .pdf format only.
Lateness policy. Written exercises are due at the beginning of lecture on the date given. Late exercises will not be accepted without approval by a preceptor, the recommendation of a Dean, or a letter from McCosh Health Center.
Grading policy. Grades on the problem set questions will be: 4 (correct), 3 (minor mistake), 2 (major mistake), 1 (low comprehension), or 0 (all wrong or not submitted). Also, some of the exam questions will be based on these exercises, so it is to your advantage to complete them in a timely manner.
In calculating your course grade, we will drop your lowest two exercise scores.
Collaboration policy. You are permitted to work with up to two other classmates, provided that you all work on the exercises together, in the same room. All group members are responsible for jointly contributing to and understanding all parts of the exercise solutions. Submit one solution for the group; be sure to include the names, logins, and precepts of all group members. Do not, under any circumstances, copy another person's solutions.