EXAM 3 Review - Fall 2007 - as of 12/13/07 3pm
===================================================

Given:  Monday, Dec.17th, 2007, 2-4pm
	NO MAKEUPS

PREPARATION:
------------
* Completion of Readings through Chapter 10, Appendices A through L
* intro to advanced topics (see summary from Week15)
* Completion of ALL LECTURES


FORMAT:
-------
* Much like Exam II; with a bit more coding and code tracing
* True/False and/or Multiple Choice; Short Answer; Code Writing
* Code-Writing is CRITICAL. You MUST pass the CODE PORTION to PASS
  the EXAM.

CONTENT:
--------
* comprehensive ... includes topics from previous exams as well

IMPORTANT NEW FOCUS:
  * stacks & stack applications
  * queues & queue implementations
  * recursion (induction&variant expression)
  * binary trees
  * tree traversals
  * binary search tree
  
Reiteration of older concepts:
* dynamic memory ; arrays; linked lists; templates, ...
* operator overloading
* friend functions
* circular list or queue 
  (look at the implementation in ch.7, figure 7.9-7.11 ["back"="rear"],
   notice how "back=(back+1)%MAX_QUEUE"... does this make sense to you?
* class invariants & value semantics

* coding of: class definition; functions
  (Example: write a 'power' function that takes in X and n, and 
            computes "X to the n", using recursion
                  or
            write a tree traversal function that counts the
	    number of descendants in a binary tree)
		  or
            use a queue and a stack to recognize a palindrome


New Advanced Topics (conceptual only)
+ inheritance 
+ heap
+ hashing
+ sorting (insertion/selection)