To review for the final: review the sample exams posted on
the web, review the two midterms, review the two midterm review sheets,
and study these topics:
Searching and SortingAlgorithms (and their efficiencies)bubble insert 'straight' selection quicksort BST-sort heapsort Choosing when to use the above linear search binary search BST/AVLTree search Hashinghash functions definition, desirable properties hash collision rehashing rehash function primary and secondary clustering chaining coalesced hashing separate chaining |
Review problems: 5.3.4, 6.2.5, 6.2.4, 6.2.9, 7.1.3, 7.1.12,
7.2.2,7.4.1, 7.4.2