Quiz 2 topics:

• Textbook readings for week 2 and week 3
• Everything covered in class about Stacks, Queues and algorithm efficiency.
• Applications of stacks and queues
• Code for stack and queue operations both array and linked list based
• Array and linked list implementations of stacks and queues
• General runtime information. What affects runtime, how runtimes are calculated, how runtimes aren't calculated, etc.
• Big-Oh runtimes for all operations on ADTs covered thus far for both array and pointer based implementations i.e. lists, stacks, queues, vectors, and sequences.
• Given a snippet of code or polynomial, determine the Big-Oh runtime
• Inheritance - know the kinds of inheritance and what they do.
• I highly suggest you do homework questions 1 and 2