CS2013-final-report

• Use functional encapsulation mechanisms such as closures and modular
interfaces.
• Define and use iterators and other operations on aggregates, including operations
that take functions as arguments, in multiple programming languages, selecting
the most natural idioms for each language.
• Explain why an event-driven programming style is natural in domains where
programs react to external events.
• Describe an interactive system in terms of a model, a view, and a controller.
• Explain how typing rules define the set of operations that are legal for a type.
• Write down the type rules governing the use of a particular compound type.
• Explain why undecidability requires type systems to conservatively approximate
program behavior.
• Define and use program pieces (such as functions, classes, methods) that use
generic types, including for collections.
• Discuss the differences among generics, subtyping, and overloading.
• Explain multiple benefits and limitations of static typing in writing, maintaining,
and debugging software.
• Explain how programs that process other programs treat the other programs as
their input data.
• Describe an abstract syntax tree for a small language.
• Describe the benefits of having program representations other than strings of
source code.
• Write a program to process some representation of code for some purpose, such
as an interpreter, an expression optimizer, or a documentation generator.
• Distinguish syntax and parsing from semantics and evaluation.
• Sketch a low-level run-time representation of core language constructs, such as
objects or closures.
• Explain how programming language implementations typically organize memory
into global data, text, heap, and stack sections and how features such as recursion
and memory management map to this memory model.
• Identify and fix memory leaks and dangling-pointer dereferences.
• Discuss the benefits and limitations of garbage collection, including the notion of
reachability.
SDF Core-Tier1:
• Discuss how a problem may be solved by multiple algorithms, each with
different properties.
• Identify the data components and behaviors of multiple abstract data types.
• Implement a coherent abstract data type, with loose coupling between
components and behaviors.
• Identify the relative strengths and weaknesses among multiple designs or
implementations for a problem.
• Trace the execution of a variety of code segments and write summaries of their
computations.
- 221 -