Quiz 1 topics:

• Textbook readings and lecture material for for weeks 1-4 through overloading (nothing on templates or inheritance)
• Make sure to do the textbook readings because I may ask questions from the book that I did not cover in class
• You now know all of the basics of linked lists so you should be able to write code for any operation on a linked list. There will be one coding question on an operation that you have not seen yet.
• Operations and concepts of lists implemented with an array or a linked list. Compare and contrast both methods.
• Anything from the proficiency exam is fair game
• Applications of stacks and queues and implementation (for example convert infix to postfix)
• Code for stack and queue operations for 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.
• 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)
• This list is non-inclusive but it is as complete as I can get off the top of my head.