CS
112 Intro. to Data Structures
Course Outcomes:
Welcome to CS 112, Intro to Data Structures, at
Calvin College.
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 unittests 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 "bigoh" notation.

Apply and use objectoriented 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.
Calvin >
CS >
112
This page maintained by
Joel Adams.