Final Review Information
Topics Covered:
- Remember how linked lists and arrays work
- Trees (Binary, balanced, AVL, Red-Black, traversals, why would you want one, etc)
- Heaps, and heapsort
- Tree and heap representation, linked data structure vs. in an array
- Hash Tables (hash functions, chaining, etc, hash table vs. trees)
- A really easy rust question (if I talk about rust)
- C++ programming constructs that we've used. Classes, public, private, new, delete, template, operators, STL, etc.
- Algorithm analysis and Big O notation
Format
One page of multiple choice, followed by short answer and programming questions.
Notes
Ten pages of notes are allowed, both sides.