CIS 313 Winter 1997
Introduction to Information Structures
Study Guide
The final exam will be a two hour open book and a page of notes
exam. The test will be comprehensive. For the topics covered in the
first half of the term, see the midterm study
guide. Here, follow the topics covered in the second half of the
term.
- Data Structures (Chapter 6), especially subsections 6.5-6.8.
- Binary Search trees (Chapter 18) with the exception of subsection
18.6.
- Priority Queues (Chapter 20) with the exception of the subsection
20.6.
- Binomial Queue mergeable priority queue implementation.
- Loop invariant proofs of correctness.