Exam 4

There will be one programing question. The programing question will be in an enviroment identical to the PotDs. 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 question will be to make an iterator on a tree.

There will also be several short answer or multiple choice questions on material covered on previous exams as well as the trees topics listed below.

There is a practice for the iterator question that can be found on PraireLearn.

• Heaps
• Construction of a Heap
• Heap runtime
• HeapifyUp
• HeapifyDown
• Array Representation
• Priority queue ADT
• Iterators

Assignments referenced:

• mp_lists, mp_mosaics, mp_traversals
• lab_trees, lab_heaps

Points:60

Registration: Thursday, March 16

Start: Sunday, April 02

End: Tuesday, April 04