|
COP 3530: Data Structures and Algorithms
Sample Tests
Provided below are some sample tests from past semesters of the course.
Please note that none of these tests are from my course, and are provided only as a guide
to possible types of questions you may see on the tests. They come from both Dr. Sahni and
Kristian Damkjer and their COP 3530 courses.
Test 1 Samples
Test 1 typically focuses on linear list based data structues. Test topics will most
likely be pulled from Chapters 5 through 10 of the text. You are responsible for
the material in Chapters 1 through 4, but topics from these chapters will only be
included in support of the material in Chapters 5 through 10. For example, you must
know how to analyse the time and space complexity of your program, accurately measure
runtime, and write iterative and recursive methods.
Test 2 Samples
Test 2 typically focuses tree based data structues. Test topics will most likely be
pulled from Chapters 10 through 16 of the text. You are responsible for the material
in Chapters 1 through 9, but topics from these chapters will only be included in
support of the material in Chapters 10 through 16. For example, you must know how to
use Chains, Stacks, and Queues to solve problems.
Test 3 Samples
Test 3 typically focuses on graphs and algorithm design methods. Test topics will most
likely be pulled from Chapters 17 through 22 of the text. You are responsible for the
material in Chapters 1 through 16, but topics from these chapters will only be included
in support of the material in Chapters 17 through 22. You must be fluent in all data
structures covered to date.
|
|
