Quiz 2 topics:

• Textbook readings for weeks 1, 2, and 3
• Everything covered in class about Queues and algorithm efficiency.
• Applications of queues
• Code for operations on a linked list (similar to the questions seen on quiz 1 about linked list code)
• Code for queue operations for both array and linked list based
• Array and linked list implementations of 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 and queues.
• Relatives of Big-Oh - who are they? what do they represent?
• Given a snippet of code or polynomial, determine the Big-Oh runtime
• Everything covered in class on object oriented programming
• Exception handling (from the book)