CS2013-final-report

CSC 207 – Object-Oriented Problem Solving and Algorithms
http://www.cs.grinnell.edu/courses/csc207
CSC 207 explores object-oriented problem solving with Java programming. Topics covered
include principles of object-oriented design, abstract data types and encapsulation, data
structures, algorithms, algorithmic analysis, elements of Java programming, and an integrated
development environment (IDE). Recent work on this course has included introducing a general
theme of “Computing for Social Good”, as well as a modest updating of topics to more clearly
reflect the evolution of the discipline as described in CS 2013, including coverage of GUIs. The
course involves a workshop environment that encourages collaborative learning. CSC 207 is
described in further detail in CSC 2013, Appendix C, on Course Exemplars.
MAT/CSC 208 – Discrete Structures
http://www.cs.grinnell.edu/courses/csc208
CSC 208 is a recent addition to Grinnell's curriculum. It provides the mathematical foundations
for upper-division courses, particularly courses in algorithms and data structures. The course has
both calculus and CSC 151 as prerequisites, allowing the instructor to mix mathematical and
computational concepts. The next offering of MAT/CSC 208 will add more coverage of
Discrete Probability in response to CS 2013.
CSC 211 – Computer Organization and Architecture
http://www.cs.grinnell.edu/courses/csc211
CSC 211 is a fairly traditional organization and architecture course. In its last offering, it relied
upon the Patterson and Hennessy text. The regular course sessions are accompanied by a weekly
one-hour laboratory in which students get experience with a wide variety of topics, including
some breadboarding. A few adjustments are anticipated in response to CS 2013, but no major
changes are required.
CSC 213 – Operating Systems and Parallel Algorithms
http://www.cs.grinnell.edu/courses/csc213
CSC 213 combines a traditional course in operating systems with a third of a semester coverage
of parallel algorithms. As in the case of CSC 211, CSC 213 required a few minor changes, but
no significant changes were required by CS 2013.
CSC 264 – Computer Security (2 credits, new course)
http://www.cs.grinnell.edu/courses/csc264
CSC 264 is a newly proposed course, created initially in response to student interest in additional
coverage of security topics in the curriculum. It introduces students to an adversarial experience
with computer security – students serve as both attackers and security personnel.
CSC 301 – Analysis of Algorithms
http://www.cs.grinnell.edu/courses/csc301
CSC 301 is a CLRS-style algorithms course (although not all faculty use the book). Students
delve deeply into algorithm design and analysis. Students prove algorithm correctness and
implement many common algorithms. CSC 301 did not require changes under CS 2013.
- 490 -