• Read over and think about both interesting problems.
• Designate a leader, a recorder, and a presenter in your group. These roles will change throughout the project, so don't debate the roles too much.
• Think about an initial strategy for solving and coding a solution to your interesting problem
• Be prepared to give a brief 5-10 minute presentation on Thursday on how your groups plan to attack your problem. You will also need to submit a written summary of 1-2 typed pages of your groups meeting notes and plan.
• Read chapters 3,4 and Appendix A
• Woot! inc. sells woot widgets in pack of 6,9 and 20? What is the largest number of widgets that cannot be orderd by combining an integral number of packs of each size. Prove your answer and be prepared to discuss it in class.

• Read chapters 6,7,8
• Written solutions to problems (A.4), A.2-1, A-1(part b), 4.2-3, and 4.2-4 are due at the beginning of class.

• Be prepared to give a brief 5-10 minute presentation on Thursday on group progress on your interesting problem. You will also need to submit a written summary of 1-2 typed pages of your groups meeting notes and plan.

• Be prepared to give a brief 5-10 minute presentation on Thursday on group's final summary of your interesting problem. You will also need to submit a written summary of 1-2 typed pages of your groups meeting notes and plan. Also email me code and data samples of an implementation of your solution
• Written solutions to 4.3-2, 4.3-4, 4-3a, 4-6, and 7-3a are due at the beginning of class.

Be prepared to discuss 8-4, 9.3-1, and 9.3-8 in class. You do not need written solutions Read the papers on NetApps WAFL file system and persistent B-trees for planar point location. You can safely skim the experimental results on PBtrees. I want you to have a basic understanding of how persistence is used in both applications.

Read/Skim 10.1, 10.2, 10.4, 12. Read in detail 13, 14, and 18.

You may also be interested in a Red-Black Tree tune-up, the Left Leaning Red Black Tree
CS41 home

Written solutions to 13.2-4, 13-3, 14.1-5, and 14.2-1 are due at the beginning of class. For 14.2-1, all functions are of the form MINIMUM(x), where x is a reference to a node in a tree, meaning you do not have to search for the key that has the key of x, you all already placed at a node. All functions should report the appropriate statistic for the subtree rooted at x. Thus MINIMUM(x) should return (in O(1) time) the minimum element in the subtree rooted at x, and SUCCESSOR(x) should return the successor of the element x that is in the subtree rooted at x. Written solutions to 16-1, 17.1-3, 17.2-1, and 17.3-6 are due at the beginning of class. Due before Thanksgiving break Written solutions to the problems in the PDF link are due Thursday December 4.

Home Page

Last updated: Tuesday, September 22, 2020 at 01:07:43 PM