differentiate control structures, including branches (also known as
conditional statements and if-statements), pre-checking loops (also
known as while-loop), post-checking loops (also known as do-while loops
or do-loops).
deduce post-condition from pre-condition for control structures,
including assignment statements, branches, and loops.
examine local variables, parameters, and call-stack of a program in
execution using a debugger or other means.
contrast the scopes and lifespan limits and behaviors of local
variables, by-value parameters, and by-reference parameters.
compare the two methods of returning results: by-reference
parameters and return value.
explain the value of subroutines (also known as functions and
procedures)
compare in-line copy-and-paste coding with structured subroutines in
terms of maintainability, defect containment, testability, and other
metrics.
create a subroutine to abstract two or more similar blocks of
in-line code using local variables, parameters, and return values.
encapsulate related data items in a structure instance (also known
as an object, an instance of a struct, an instance of a record, an
instance of a class, a hash)
analyze the objectives of an algorithm
derive the validation conditions of an algorithm
synthesize simple algorithms
topics
installation of development environment
values, operators, types (numerical, string and boolean), variables,
the declaration of variables, assignment operator
conversion between types
command-line arguments
variable scope
debugger environment and commands or other methods to visualize
run-time characteristics of a program