Announcements
The second exam in CMPU241 will be a take-home exam, given out on Thursday, Nov. 21st. The topics covered are listed on the Lectures and Videos link and include:
binary search trees
algorithms to balance binary search trees (2-3 trees, AVL trees, and Red-Black trees)
depth-first search and breadth-first search graph algorithms
topological sort graph algorithm
strongly-connected-components graph algorithm
The exam is due on Tuesday, November 26th in class (or earlier). If you are handing in the exam early, please slip it under my office door.