CS2013-final-report

Why do you teach the course this way
The material of the course is somewhat constrained by the department’s curricular needs. However, the
arrangement represents my desires.
In interleaving programming and algorithmic content to demonstrate connections between them, I am especially
interested in ways in which programming techniques enhance algorithmic ones: for instance, the use of
memoization to alter a computation’s big-O performance (and the trade-offs in program structure relative to
dynamic programming).
The course is revised every year, based on the previous year’s outcome.
Students consider the course to be extremely challenging, and of course recommend it only for advanced students.
Body of Knowledge coverage
KA Knowledge Unit Topics Covered Hours
AL
Advanced Data Structures, Algorithms,
and Analysis
Balanced trees, graphs, string-based data
structures, amortized analysis
5
PD Parallelism Fundamentals Parallel data structures, map-reduce 1
PL Object-Oriented Programming All 3
PL Functional Programming All 6
PL
Event-Driven and Reactive
Programming
All 2
PL Basic Type Systems All 2
SDF All All 10
SE Software Design Design recipe 3
SE Software Verification Validation Test suites, testing oracles, test-first development 3
- 448 -