There will be one programing question. The programing question will be in an enviroment identical to the PotDs (run by using make not cmake). 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 programing questions will be working on some recursive function on a binary tree.
There will also be several short answer or multiple choice questions on material up to and including Monday October 9th. For a rough list of topics worth studying (not guaranteed to be exhaustive!):
NULL
pointers in a BST, including prooffind
, including running times in terms of h
and n
insert
, including running times in terms of h
and n
delete
, including running times in terms of h
and n
h
, and propertiesb
find
, including running times in terms of h
and n
insert
, including running times in terms of h
and n
delete
, including running times in terms of h
and n
Assignments referenced:
Points:60
Registration: Thursday, October 05
Start: Monday, October 16
End: Wednesday, October 18