The midterms will be closed book, closed notes, and no electronics permitted, but you will be allowed one double-sided 8.5x11 inch sheet of notes.

If a student misses one or both midterms their final exam mark will be substituted for the missing mark(s).

If a student's final exam mark is higher than their midterm mark(s) then their final exam mark will replace the midterm mark(s).

Topics list and review notes:

A review session will be held in the lecture prior to each midterm.

There will be six programming questions, worth 5 marks each, for a total of 30 marks.

The programming questions will generally be a mix of the following:

• Show the precise output from the following program...

• Write a program that fulfills the following requirements...

• Write a function that fulfills the following requirements...

• Implement a recursive function that does the following ...

• Implement a non-recursive function that does the following ...

• Given the class definition below, implement the ... method

• Use the class definition below to implement ...

• Modify the code segment below to do ...

Question topics can be based on any of our lab/lecture material up to and including material from the review lecture prior to the midterm.

Midterm 1 Sample Solutions (Feb. 13)

The core topics will be file I/O, command line arguments, linked lists, classes, and queues.

For practice problems, see

• questions 1 to 4 from last year's midterm, and sample solutions
• the practice questions from class, and sample solutions
• questions 1 and 2 from last year's final, and sample solutions
• questions 1 and 2 from this old quiz, and sample solutions
• questions 1 to 9 from these practice questions

Midterm 2 with sample solutions (Mar. 20)

The core topics will be binary search trees and inheritance (not dynamic binding).

For practice problems, see

• question 4 from last year's final,
• questions 13 to 15 and 17 to 20 from these practice questions