Exam 2

The exam will consist of multiple choice questions and one coding question. The programming question will be in an enviroment identical to the PotDs (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.

Instead of a practice programming question, you should prepare on your own to answer one of the following coding questions. In other words, the exam question will loosely require you to:

• Make a Stack or Queue out of a std::list or std:vector

The content on the exam will cover all material up through (and including) September 18th. This will include some overlap with the previous two exams and will primarily focus on lists, arrays, and trees. A practice exam will be released once all material has been covered (as the exact content will change based on the pacing of the class).

For a more detailed breakdown of potential questions (subject to change until September 19th):

---

• Pointers and References in C++
• Pass by value, by reference, and by pointer
• Lists
  • ADT
  • Linked
  • Array
• Stacks and Queues
• Trees
  • Basic tree terminology (CS 173)
  • Tree Property: Binary
  • Tree Property: Height
  • Tree Property: Full
  • Tree Property: Perfect
  • Tree Property: Complete (as defined in data structures)
  • Tree Property: NULL pointers in a BST, including proof
  • Traversal: Pre-Order, In-Order, and Post-Order
  • Traversal: Level-Order

Assignments referenced:

• lab_debug
• lab_memory
• lab_quacks
• mp_lists

Points:60

Registration: Thursday, September 14

Start: Tuesday, September 26

End: Thursday, September 28