Midterm Study Guide

• Midterm will consist of:
• Multiple choice (9 questions)
• True/False (9 questions)
• Short definitions (4 questions)
• Short coding problems (3 questions)
• Do not bring a scantron. I will provide a bubble sheet.
• Be prepared to write code for a problem you have not seen before. However, if you fully understand the material thus far, you can apply your knowledge to the problem.
• Look over the quiz solutions provided on the main course web page
• Topics - The midterm will cover all material presented in lecture through Monday Feb 2 (half way through) and chapters 1-8 in the textbook (there will be questions that are from the textbook that I DID NOT cover in lecture). The following is a far from exhaustive list of the topics to be covered on the midterm.
• Lists, Stacks, and Queues
• pointer and array based
• uses/applications
• Abstract Data Types - Lists, Queues, and Stacks
• Object Oriented Programming
• Modular Programming
• Pointer manipulation
• Inheritance
• Templates (function and class)
• Virtural functions
• Friend functions
• NO run time complexities
• more that I can't think of off hand.....but is either in the book or was covered in lecture