Midterm Review 2 Information
Topics Covered: (from last time)
- Trees! Binary search trees in general, AVL Balance, Runtime of tree operations.
- Sorting demos, and how to sort
- Linked Lists: In less detail than last time
- Queues, Stacks: push, pop, enqueue, dequeue, reasons to use one or the other Remember FIFO and LIFO
- Managed arrays, the dynamic_array.cpp demo
- C++ programming:
Classes: public, private, const, this pointer, friends, constructors, destructors
Dynamic memory: new, delete, new[], delete[], malloc, realloc, free
Operator Overloading: "normal" operators like plus, minus, comparisons, etc. Not insertion.
Iterators in principle, you don't have to write one
Passing modes: By value, By pointer, By reference
- Data ownership, reasons for pass by reference
- Not math from lab 1
Format
One page of multiple choice, followed by short answer and programming questions.
Notes
Ten pages of notes are allowed, both sides, can be up to 8.5 by 11