Grades 9, 10, 11, 12

Computational Thinking Practices

Course Content

Program Design and Algorithm Development

Code Logic

Code Implementation

Code Testing

Documentation

Primitive Types

Using Objects

Boolean Expressions and if Statements

Iteration

Writing Classes

Array

ArrayList

2D Array

Inheritance

Recursion

Determine required code segments to produce a given output.

Determine the output, value, or result of given program code given initial values.

Write and implement program code.

Analyze program code for correctness, equivalence, and errors.

Describe the behavior and conditions that produce identified results in a program.

Call System class methods to generate output to the console.

Create string literals.

Identify the most appropriate data type category for a particular specification.

Declare variables of the correct types to represent primitive data.

Evaluate arithmetic expressions in a program code.

Evaluate what is stored in a variable as a result of an expression with an assignment statement.

Evaluate arithmetic expressions that use casting.

Explain the relationship between a class and an object.

Identify, using its signature, the correct constructor being called.

For creating objects:

Call non-static void methods without parameters.

Call non-static void methods with parameters.

Call non-static non-void methods with or without parameters.

Call static methods.

Define variables of the correct types to represent reference data.

For String class:

For wrapper classes:

Evaluate expressions that usethe Math class methods.

Evaluate Boolean expressions that use relational operators in program code.

Evaluate compound Boolean expressions in program code.

Compare and contrast equivalent Boolean expressions.

Compare object references using Boolean expressions in program code.

Represent branching logical processes by using conditional statements.

Represent branching logical processes by using nested conditional statements.

Represent iterative processes using a while loop.

For algorithms in the context of a particular specification that does not require the use of traversals:

Represent iterative processes using a for loop.

For algorithms in the context of a particular specification that involves String objects:

Represent nested iterative processes.

Compute statement execution counts and informal run-time comparison of iterative statements.

Designate access and visibility constraints to classes, data, constructors, and methods.

Define instance variables for the attributes to be initialized through the constructors of a class.

Describe the functionality and use of program code through comments.

Define behaviors of an object through non-void methods without parameters written in a class.

Define behaviors of an object through void methods with or without parameters written in a class.

Define behaviors of an object through non-void methods with parameters written in a class.

Define behaviors of a class through static methods.

Define the static variables that belong to the class.

Designate private visibility of instance variables to encapsulate the attributes of an object.

Explain where variables can be used in the program code.

Evaluate object reference expressions that use the keyword this.

Explain the ethical and social implications of computing systems.

Represent collections of related primitive or object reference data using onedimensional (1D) array objects.

Traverse the elements in a 1D array.

Traverse the elements in a 1D array object using an enhanced for loop.

For algorithms in the context of a particular specification that requires the use of array traversals:

Represent collections of related object reference data using ArrayList objects.

For ArrayList objects:

For algorithms in the context of a particular specification that requires the use of ArrayList traversals:

Apply sequential/linear search algorithms to search for specific information in array or ArrayList objects.

Apply selection sort and insertion sort algorithms to sort the elements of array or ArrayList objects.

Compute statement execution counts and informal run-time comparison of sorting algorithms.

Explain the risks to privacy from collecting and storing personal data on computer systems.

Represent collections of related primitive or object reference data using two-dimensional (2D) array objects.

For 2D array objects:

For algorithms in the context of a particular specification that requires the use of 2D array traversals:

Create an inheritance relationship from a subclass to the superclass.

Define reference variables of a superclass to be assigned to an object of a subclass in the same hierarchy.

Call methods in an inheritance relationship.

Call Object class methods through inheritance.

Determine the result of executing recursive methods.

Apply recursive search algorithms to information in String, 1D array, or ArrayList objects.

Apply recursive algorithms to sort elements of array or ArrayList objects.

Determine an appropriate program design to solve a problem or accomplish a task (not assessed).

Determine code that would be used to complete code segments.

Determine code that would be used to interact with completed program code.

Apply the meaning of specific operators.

Determine the result or output based on statement execution order in a code segment without method calls (other than output).

Determine the result or output based on the statement execution order in a code segment containing method calls.

Determine the number of times a code segment will execute.

Write program code to create objects of a class and call methods.

Write program code to define a new type by creating a class.

Write program code to satisfy method specifications using expressions, conditional statements, and iterative statements.

Write program code to create, traverse, and manipulate elements in 1D array or ArrayList objects.

Write program code to create, traverse, and manipulate elements in 2D array objects.

Use test-cases to find errors or validate results.

Identify errors in program code.

Determine if two or more code segments yield equivalent results.

Describe the behavior of a given segment of program code.

Explain why a code segment will not compile or work as intended.

Explain how the result of program code changes, given a change to the initial code.

Describe the initial conditions that must be met for a program segment to work as intended or described.

Create objects by calling constructors without parameters.

Create objects by calling constructors with parameters.

Create String objects.

Call String methods.

Create Integer objects.

Call Integer methods.

Create Double objects.

Call Double methods.

Identify standard algorithms.

Modify standard algorithms.

Develop an algorithm.

Identify standard algorithms.

Modify standard algorithms.

Develop an algorithm.

Identify standard algorithms.

Modify standard algorithms.

Develop an algorithm.

Traverse using a for or while loop

Traverse using an enhanced for loop

Identify standard algorithms.

Modify standard algorithms.

Develop an algorithm.

Traverse using nested for loops.

Traverse using nested enhanced for loops.

Identify standard algorithms.

Modify standard algorithms.

Develop an algorithm.