Exam 2

There will be one programing problem. 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 questions will be the following.

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

There will also be several multiple choice or short answer questions covering the following topics. There will be a practice exam for the multiple choice short answer segment on PL starting Monday afternoon.

• Pointers and References in C++
• Pass by value, by reference, and by pointer
• Indirection in C++:
• 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

Points:60

Registration: Thursday, February 02

Start: Sunday, February 19

End: Tuesday, February 21