Exam Review

The following pages contain review questions that are provided to help you prepare for the exam. These are only for review and to provide examples of the types of questions that will appear on the exam. You are responsible for all material covered in lectures and the readings, even if some topics are not explicitly represented by the review questions.

	Note
	It is important that you understand, you can not simply study these questions and expect to successfully complete the exam. These questions provide examples of the type of questions that may be on the exam. You must study all of the material for all the topics covered in the course.

Exam One Review

• Chapter One Review - Abstract Data Types and Containers
• Chapter Three Review - Vectors and Arrays
• Chapter Four Review - Maps
• Chapter Five Review - Algorithm Analysis

Exam Two Review

• Chapter Five Review - ADT Algorithm Analysis
• Chapter Six Review - Searching
• Chapter Seven Review - Linked Lists
• Chapter Eight Review - Queues
• Chapter Nine Review - Stacks

Final Exam Review

The final exam is comprehensive and will include all material covered throughout the term. The following review questions relate to the new material covered since the last exam.

• Chapter Twelve Review - Recursion
• Chapter Fourteen Review - Binary Trees