CS 181 Introduction to Computer Science, Honors I
Trace execution
Reason about the operational behavior of a Java program, by tracing
loops, defining informal loop invariants, drawing activation stacks
via object-and-pointer diagrams, determining referents of
identifiers under static and dynamic dispatch, and predicting
behavior of exception-handling code.
BS
CS
A
apply
BS
CyS
A
apply
Design
Design algorithmic solutions to a given problem using suitable
design tools like pseudocode and UML, and implement and test designs
so specified as Java programs.
BS
CS
C
design
BS
CyS
C
design
Data Structures
Implement standard data structures for the collection APIs
(array-based/list-based stacks and queues) and standard sorting
algorithms (insertion sort, selection sort, heap sort, quick sort,
merge sort).
BS
CS
K
construction
BS
CyS
K
construction
Binary data
Explain how computers encode numbers, characters
and images, and do simple calculations in binary arithmetic.
BS
CS
I
currency
BS
CyS
I
currency
Simplify logic
Simplify a program's logical structure by algebraic
manipulation of boolean expressions.
BS
CS
B
analyze
BS
CyS
B
analyze
Software development environment
Use a UNIX-like environment and its development
tools (editor, command-line compiler and interpreter,
debugger). Alternatively, operate within an integrated
development environment to evaluate expressions and debug programs.
BS
CS
K
construction
BS
CyS
K
construction
UI design
Design and implement simple user interfaces using
graphical components and event handlers.
BS
CS
C
design
BS
CyS
C
design
Technical reading
Read and interpret technical documentation; in
particular, to find details about the Java APIs.
BS
CS
I
currency
BS
CyS
I
currency