The exercises are available via Blackboard for COS226_F2012. There is one set of exercises associated with each lecture; for most weeks, there will be two sets of exercises assigned. An set of exercises consists of three drill questions, designed to ensure that you understand the basics. Once a set of exercises moves above the "Exercises below have not yet been updated for Fall 2012" part of the table, it will be available in Blackboard and no no significant changes will be made. All readings refer to Algorithms, 4th edition by R. Sedgewick and K. Wayne unless otherwise specified.
|2||9/24||Analysis of Algorithms||1.4|
|3||9/24||Stacks and Queues||1.3|
|8||10/15||Binary Search Trees||3.2|
|9||10/15||Geometric Applications of BSTs||–|
|10||–||Balanced Search Trees||3.3|
|15||11/12||Minimum Spanning Trees||4.3|
|Exercises below have not yet been updated for Fall 2012|
Submission policy. The exercises are avaialble in Blackboard. Be sure to follow the formatting requirements (e.g., separate entries by a single space and no leading or trailing whitespace) exactly or the autograder will mark your answer as wrong.
Lateness policy. Written exercises are due at 11pm on the date specified. There is a 3 hour grace period. Late exercises will be accepted only with the recommendation of a Dean or a letter from McCosh Health Center.
Grading policy. You may attempt each exercise set up to ten times. We will record your best score. You will receive a different set of questions on each attempt and we will provide solutions and explanations after each attempt. In calculating your course grade, we will drop your lowest two exercise scores.
Collaboration policy. You must complete the specific exercise questions (that are randomly assigned to you in Blackboard) entirely on your own, with no help from others. However, you are permitted to discuss the specific exercise questions after you have submitted them. To do so, you should post the entire question and answer, including the seed (which is used by the course staff to uniquely identify the question) and the explanation.