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:

  1. Use indirection (pointers) to implement dynamic, generic container classes (e.g., vectors, lists, stacks, queues, trees, etc.).
  2. Design, create, and use unit-tests to test the correctness of data structure operations.
  3. Design and implement recursive data structure operations.
  4. Analyze, categorize, and compare the complexity of data structure operations using "big-oh" notation.
  5. Apply and use object-oriented techniques such as encapsulation, inheritance, and polymorphism.
  6. 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.