| (L) identify and debug compile, syntax, runtime, and
logic errors;
(M) compare efficiency of search and sort algorithms
by using informal runtime comparisons, exact calculation of statement
execution counts, and theoretical efficiency values using "big-O"
notation, including worst-case, best-case, and average-case time/space
analysis;
(N) count, convert, and perform mathematical operations
in the decimal, binary, octal, and hexadecimal number systems;
(O) identify maximum integer boundary, minimum integer
boundary, imprecision of real number representations, and round-off
errors;
(P) create program solutions to problems using a mathematics
library;
(Q) use random number generator algorithms to create
simulations;
(R) use composition and inheritance relationships to
identify and create class definitions and relationships;
(S) explain and use object relationships between defined
classes, abstract classes, and interfaces;
(T) create object-oriented class definitions and declarations
using variables, constants, methods, parameters, and interface implementations;
(U) create adaptive behaviors using polymorphism;
(V) use reference variables for object and string data
types;
(W) use value and reference parameters appropriately
in method definitions and method calls;
(X) implement access scope modifiers;
(Y) use object comparison for content quality;
(Z) duplicate objects using the appropriate deep or
shallow copy;
(AA) apply functional decomposition to a program solution;
(BB) create objects from class definitions through
instantiation; and
(CC) examine and mutate the properties of an object
using accessors and modifiers.
|
