Practice Exercises

These sample questions are designed to help you study and gain more insight into each topic covered in lecutre. Your exams may consist of these questions, similar but different questions, derivatives of these questions, or questions not found here in any form.

Asymptotic Analysis
- Supplementary Questions (pdf)
List Review
- Supplementary Questions (pdf)
Stack and Queue Review
- Supplementary Questions (pdf)
General/Binary Tree Review
- Supplementary Questions (pdf)
Binary Search Tree Review
- Supplementary Questions (pdf)
K-D Trees Review
- From the text - none
- Supplementary Questions (pdf)
Splay Trees Review
- From the text - 4.27, 4.28, 4.29a,
- >Supplementary Questions (pdf)
Red-Black Trees Review
- From the text - 12.6
- Supplementary Questions (pdf)
B-Trees Review
- From the text - none
- Supplementary Questions (pdf)
PQ, Binary Heap, Leftist Heaps Review
- From the text - 6.2, 6,3, 6.6, 6.8
- Supplementary Questions (pdf)
Hashing Review
- From the text - 5.1, 5.8, 5.10
- Supplementary Questions (pdf)
SkipLists Review
- From the text - none
- Supplementary Questions (pdf)
Disjoint Sets Review
- From the text - 8.1a-b, 8.2, 8.5a-b, (8.1c, 8.4, 8.8 if we cover union-by-height)
- Supplementary Questions (pdf)
Graph Review
- From the text - 9.5, 9.7a, 9.10, 9.42, 9.53
- Supplementary Questions (pdf)