Sample Section Problem Area Points Mean Mean --------------------------------------------------------------- 1 Binary Tree Traversal 6 5.8 5.7 2 Recursive Programming 9 6.5 6.6 3 Details of Inheritance 10 8.5 8.7 4 Stacks/Queues 10 8.3 7.3 5 Binary Trees 10 7.1 8.7 6 Collections Programming 10 7.8 8.4 7 Comparable class 15 13.0 12.0 8 Binary Trees 15 9.6 11.1 9 Linked Lists 15 6.2 8.1 --------------------------------------------------- Total 100 72.8 76.6I said that the actual final will have the same kind of problems with the same distribution of points. The column labeled "Sample Mean" represents my best guess as to the average score that a 143 class would get if given the problems that were included in the sample final (handout #34). The column labeled "Section Mean" represents my best guess as to the average score that a 143 class would get if given the problems from the sample final distributed in section.
I reminded everyone that the exam is closed-book and closed-note. There is a two-page cheat sheet that will be attached to the test.