Midterm Review Information
Topics Covered:
- Linked Lists: Adding to either end or the middle, deleting items
- Queues, Stacks: push, pop, enqueue, dequeue, reasons to use one or the other
- Not operations on linked lists with more than one item per node
- C++ programming:
Classes: public, private, const, this pointer, friends, constructors, destructors
Dynamic memory: new, delete, new[], delete[]
Operator Overloading: "normal" operators like plus, minus, comparisons, etc. Not insertion.
Maybe simple template classes
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 buffer overflows
- Not math from lab 1
- Sorting, but I have to actually cover it for this to happen, don't have to write out quicksort on the test.
Format
One page of multiple choice, followed by short answer and programming questions.
Notes
Two pages of notes are allowed, can be up to 8.5 by 11, or one page two sided.