Summary

Here is the summary of what will be assessed in the final exam.

Algorithm
   Problem solving <step-by-step of solving some problem>
Analysis
   Find Big Oh of the given program
Sorting
   Given a sorting program, answer the question about that program.
Searching
   Given a BinarySearchTree class, answer the question.
List-stack-queue
   Write a program to manipulate the given data
   (no priority queue)
Tree
   Given a program, what is the result of running the program.
Hash
   General question about:
     Hash function
     resolve the collision
     size of hash table
(no Heap data structure)

Happy Final Exam!