Comp201: Principles of Object-Oriented Programming I
Spring 2008 -- Exam 3 Need-To-Knows   

The following is a non-exhaustive list of topics, concepts and skills that will be covered in Exam 3. This list is subject to frequent changes, so check back often!

This list is in no particular order, nor does it indicate any sort of priority, unless otherwise noted.

All topics covered in Exams 1 & 2 are required for Exam 3!

1. Binary Trees
   1. Constructing them
   2. Navigating through them (getLeftSubTree, getRightSubTree)
   3. Recursive visitors/algorithms on them
   4. Binary Search Trees.
      1. Design and coding of BSTs
      2. Insertion, deletion, finding algos on them.
2. Restricted access containers (RACs)
   1. Implementation of them.
   2. How the delegation and encapsulation work in RACs.
   3. Simple usage of them
3. Arrays
   1. How to instantiate an array.
   2. How to access elements in an array.
   3. How to get an array's length.
   4. multidimensional arrays
      1. Be familiar with what they are (arrays of arrays)
      2. how you would go about processing them (delegation)
4. Array processing
   1. for-loops
      1. initializing them
      2. termination conditions
      3. Incrementing index counters
      4. Using for loops to process arrays.
   2. while-loops
      1. termination conditions
      2. writing for loops as while loops.
   3. Breaking out of loops ("break" statement)
   4. Continuing loops ("continue" statement)
   5. Going through an array front-to-back vs back-to-front
5. Sorting
   1. Template method pattern design for sorting
   2. Understand the how the split and join work for common sorters: insertion, selection, merge, bubble.
   3. Be able to reproduce the above common sorters.

Last Revised Thursday, 03-Jun-2010 09:50:26 CDT

©2008 Stephen Wong and Dung Nguyen