COSC 2415 - Data Structures and
ITSE 2445 Data Structures
Bob Comer, Professor of Computer Studies
Exam 3 Review Exercises
I recommend that you do the following exercises as you study the chapters in the textbook. Answers to these Self-Test Exercises are at the end of each chapter in the textbook. I have added additional comments to the exercises that are marked with an asterisk. Click here to review my comments.
The exam will emphasize both C++ coding and concepts. Be sure to review the Programming Tips, C++ Feature, and Pitfall sections that are scattered through the chapters. Following is a sample question over concepts.
Give a brief description of pass-by-value and pass-by-reference. In what situations should pass-by-value be used? In what situations should pass-by-reference be used?
Self-Test Exercises: 1,2,3,4,5,7,13,14,16,17.
Note: Section 9.2 on fractals will not be covered on the final exam.
Self-Test Exercises: 1,2,3*,4,8,9,10,11,12,13,15,16,17*,18*,21,22,23,24,25.
Self-Test Exercises: 1,3,4,5,6 (remove 3 largest entries),7.
Self-Test Exercises: 1,2,3,4,5,9,10,11*,12*,13,14,15,16,17,18 (first part only),20,21,22,23,24.
Other Questions over Section 12.4:
1. How does the load factor affect the search time in a table?
2. What is the maximum load factor for a table using open addressing? Using chained hashing?
3. Comparing open addressing with linear probing, open addressing with double hashing, and chained hashing, what happens to the search time as the load factor increases. Just do a relative comparison.
Sections 12.5 and 12.6 will not be covered on the final exam.
Self-Test Exercises: 1,2,3,4,5,7*,8,9,10,11,12,13,15,17.
1. What is the primary advantage of implementing a derived class versus implementing the class from scratch.
Note: Only section 14.1 will be covered on the exam. I will not ask you to write any code for inheritance.
Return to Data Structures Home Page
Copyright: Ó 2006 by the Austin
Department of Computer Studies. All rights reserved.
Comments to: Bob Comer
Last updated: May 5, 2006