Tuesdays and Thursdays, 10:10AM - 11:00AM, Olin Hall 155

Examinations (prelims and the final)

The course has two evening prelims and one final examination:

• Prelim 1: 11 March 2004, 7:30--9:00PM. Statistics on Prelim I
• Prelim 2: 20 April 2004, 7:30--9:00PM. Statistics on Prelim II
• Final: Exam period 4. Fri. 14 May, 9:00--11:30AM
  See http://cuinfo.cornell.edu/Academic/EXSP.html.

Please be sure that you are free at these times. If you have a conflict, let the appropriate person know well in advance.

Prelim I       prelim1.pdf       prelim1answers.pdf
• Review session: Sunday, 7 March, 3:00PM-5:00PM, place to be determined
• Review material: Note that older exams (below) had different choices of topics. So, pick out the questions that are relevant based on this semester's topics.
• Prelim 1 topics: everything up to, and including, inner classes; expect questions about induction, recursion, interfaces, inner classes, hashing, and a few algorithms that use loops: linear search, binary search, and the partition algorithm. There are no questions directly about strings and arrays, although they may be used in questions.

• Review handout   pdf file
• Prelim 1: fall 2001, with answers
• Prelim 1: spring 2002: exam, solutions
• Prelim 1: fall 2002: exam & solutions
• Prelim 1: spring 2003: exam, solutions
• Prelim 1: fall 2003: exam, solutions, comments

Prelim II     prelim2.pdf      prelim2answer.pdf
• Review session: Sunday, 18 April, 3:00PM-5:00PM
• Review handout      pdf file
   Answer to questions on handout     pdf file
• Prelim 2 topics: everything up to, but not including, GUIs.
• Prelim 2, fall 2001, with answers
• Prelim 2: spring 2002: exam, solutions
• Prelim 2: fall 2002: exam & solutions
• Prelim 2, spring 2003: exam, solutions
• Prelim 2, fall 2003: exam, solutions, comments

Final

• To come