Course Syllabus: CS 112: Intro. to Data Structures at Calvin College


The primary focus of this course is data structures: objects that can store data and/or contain other objects. A tentative syllabus for the semester is as follows...

Week Readings
(Chapters)
Lecture Topic Lab Project Visual
Part I
1 1 Getting Started 0 0 1
2 2 Classes, Inheritance & Polymorphism 1 1 2
3 3 Pointers 2 2 3 3a
4 4 Pointers in Classes 3 3 4
5 5 Generic Containers (Templates) 4 4 5
6 6 Lists 5 5 6 6a
7 10.4 Algorithm Analysis and "Big Oh" Notation 6 6 7
8 7 Stacks and Exceptions 7 7 8
Part II
9 8 Queues 8 8 9 9a
10 12 Recursion and Binary Search Trees 9 9 10 10a
10b 10c
11 15 Processing Data Structures in Parallel Using OpenMP 10 10 11
12 15 The STL set and map containers 11   12

The two exams will cover Parts I and II, respectively, with the second test being cumulative.


Calvin > CS > 112 > Syllabus
This page maintained by Joel Adams.