|
CSC 2200
Fall 2002
Up
| |
Midterm exam #2 is cumulative and will cover chapters 1, 2, 3, 5, and
11.1-11.3 from the textbook, and AVL trees. Focus your
preparation on
 | terminology and definitions of basic concepts in chapters 1, 2, and 3, 5,
11.1 |
| mathematical preliminaries in chapter 2 including those subsections that
have not been covered in the class (you are supposed to know them from the
prerequisite courses), |
| summations, recurrences, and proofs including mathematical induction, |
| best, worst, and average cases, asymptotic analysis, upper and lower
bounds, definitions of the bounds, proofs of bounds, calculating of the
running times, |
| construction and manipulation with binary trees, binary search trees, AVL
trees, and tree traversals, |
| construction of min and max heaps and the root node removal, |
| Huffman coding trees, their construction, Huffman Code development and its
efficiency, |
| graph definitions, DFS and BFS graph traversals, topological sorting using
DFS. |
|
