|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
The
Final Exam in CS163 is
|
|
|
|
– |
comprehensive
|
|
|
|
– |
closed
book
|
|
|
|
– |
closed
notes
|
|
|
| • |
It
will focus on:
|
|
|
|
– |
trees
(BST, 2-3, AVL, 2-3-4, red-black, heaps)
|
|
|
|
– |
graphs
(depth first, breadth first traversal)
|
|
|
|
– |
sorting
algorithms (insertion, selection, mergesort,
|
|
|
quicksort)
|
|
|
|