The exam will consist of multiple choice questions, one free response question, and one coding question. It will require programming complete and correct C++ programs. Partial credit will only be given for working, compilable code that passes some test cases. Code that doesnt compile will not receive any credit. Multiple (but not unlimited) submissions will be allowed.
The coding question will require you to write and use an iterator on a tree (not a graph). There will be a practice question in PL but you are also strongly encouraged to review the iterators you have built in earlier MPs. The iterator will require non-standard movement through the tree, ignoring some values while prioritizing others. See the practice exam for a practical example!
The free response question will require you to identify the best solution to a real world problem and describe in detail your method of choice (as well as its Big O). The methods can include any previously seen data structure in CS 225.
The content on the exam may cover all lecture material up through (and including) November 3. However the exam will only cover graph fundamentals and implementations – graph traversals and graph algorithms are not on the exam.
Assignments referenced:
Points:70
Registration: Thursday, October 30
Start: Wednesday, November 12
End: Friday, November 14