112 Intro. to Data Structures
Welcome to the second semester computing course at
This course assumes you have already gained experience writing computer programs
to solve problems, and are comfortable at a minimum with:
- manipulating built-in data types such as integers, floats, arrays/lists etc.
- using constructs for selection and repetition
- creating object-oriented abstractions:
- classes to represent new types, and
- functions/methods to represent new operations.
The purpose of this course is to equip you with new tools
that you can use to solve computational problems
Students successfully completing this course will
demonstrate that they can:
Use indirection (pointers) to implement dynamic, generic container classes
(e.g., vectors, lists, stacks, queues, trees, etc.).
Design, create, and use unit-tests to test the correctness of
data structure operations.
Design and implement recursive data structure operations.
Analyze, categorize, and compare
the complexity of data structure operations
using "big-oh" notation.
Apply and use object-oriented techniques such as
encapsulation, inheritance, and polymorphism.
For select algorithms, use simple parallel computing techniques
to improve algorithm performance and measure the improvement.
For more information, please choose a topic from the list below.
This page maintained by