AP Computer Science A · ⁨APコンピュータサイエンスA⁩

Learning Objective 1.1.A: Represent patterns and algorithms found in everyday life using written language or diagrams.

• 1.1.A.1 Algorithms define step-by-step processes to follow when completing a task or solving a problem. These algorithms can be represented using written language or diagrams.
• 1.1.A.2 Sequencing defines an order for when steps in a process are completed. Steps in a process are completed one at a time.

Learning Objective 1.1.B: Explain the code compilation and execution process.

• 1.1.B.1 Code can be written in any text editor; however, an integrated development environment (IDE) is often used to write programs because it provides tools for a programmer to write, compile, and run code.
• 1.1.B.2 A compiler checks code for some errors. Errors detectable by the compiler need to be fixed before the program can be run.

Learning Objective 1.1.C: Identify types of programming errors.

• 1.1.C.1 A syntax error is a mistake in the program where the rules of the programming language are not followed. These errors are detected by the compiler.
• 1.1.C.2 A logic error is a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly. These errors are detected by testing the program with specific data to see if it produces the expected outcome.
• 1.1.C.3 A run-time error is a mistake in the program that occurs during the execution of a program. Run-time errors typically cause the program to terminate abnormally.
• 1.1.C.4 An exception is a type of run-time error that occurs as a result of an unexpected error that was not detected by the compiler. It interrupts the normal flow of the program's execution.

Learning Objective 1.2.A: Identify the most appropriate data type category for a particular specification.

• 1.2.A.1 A data type is a set of values and a corresponding set of operations on those values. Data types can be categorized as either primitive or reference.
• 1.2.A.2 The primitive data types used in this course define the set of values and corresponding operations on those values for numbers and Boolean values.
• 1.2.A.3 A reference type is used to define objects that are not primitive types.

Learning Objective 1.2.B: Develop code to declare variables to store numbers and Boolean values.

• 1.2.B.1 The three primitive data types used in this course are int, double, and boolean. An int value is an integer. A double value is a real number. A boolean value is either true or false.
  • Exclusion statement: The other five primitive data types (long, short, byte, float, and char) are outside the scope of the AP Computer Science A course and exam.
• 1.2.B.2 A variable is a storage location that holds a value, which can change while the program is running. Every variable has a name and an associated data type. A variable of a primitive type holds a primitive value from that type.

Learning Objective 1.4.A: Develop code for assignment statements with expressions and determine the value that is stored in the variable as a result of these statements.

• 1.4.A.1 Every variable must be assigned a value before it can be used in an expression. That value must be from a compatible data type. A variable is initialized the first time it is assigned a value. Reference types can be assigned a new object or null if there is no object. The literal null is a special value used to indicate that a reference is not associated with any object.
• 1.4.A.2 The assignment operator = allows a program to initialize or change the value stored in a variable. The value of the expression on the right is stored in the variable on the left.
  • Exclusion statement: The use of assignment operators inside expressions (e.g., a = b = 4; or a[i += 5]) is outside the scope of the AP Computer Science A course and exam.
• 1.4.A.3 During execution, an expression is evaluated to produce a single value. The value of an expression has a type based on the evaluation of the expression.

Learning Objective 1.4.B: Develop code to read input.

• 1.4.B.1 Input can come in a variety of forms, such as tactile, audio, visual, or text. The Scanner class is one way to obtain text input from the keyboard.
  • Exclusion statement: Any specific form of input from the user is outside the scope of the AP Computer Science A course and exam.

Learning Objective 1.5.A: Develop code to cast primitive values to different primitive types in arithmetic expressions and determine the value that is produced as a result.

• 1.5.A.1 The casting operators (int) and (double) can be used to convert from a double value to an int value (or vice versa).
• 1.5.A.2 Casting a double value to an int value causes the digits to the right of the decimal point to be truncated.
• 1.5.A.3 Some code causes int values to be automatically cast (widened) to double values.
• 1.5.A.4 Values of type double can be rounded to the nearest integer by (int)(x + 0.5) for non-negative numbers or (int)(x - 0.5) for negative numbers.

Learning Objective 1.5.B: Describe conditions when an integer expression evaluates to a value out of range.

• 1.5.B.1 The constant Integer.MAX_VALUE holds the value of the largest possible int value. The constant Integer.MIN_VALUE holds the value of the smallest possible int value.
• 1.5.B.2 Integer values in Java are represented by values of type int, which are stored using a finite amount (4 bytes) of memory. Therefore, an int value must be in the range from Integer.MIN_VALUE to Integer.MAX_VALUE inclusive.
• 1.5.B.3 If an expression would evaluate to an int value outside of the allowed range, an integer overflow occurs. The result is an int value in the allowed range but not necessarily the value expected.

Learning Objective 1.5.C: Describe conditions that limit accuracy of expressions.

• 1.5.C.1 Computers allot a specified amount of memory to store data based on the data type. If an expression would evaluate to a double that is more precise than can be stored in the allotted amount of memory, a round-off error occurs. The result will be rounded to the representable value. To avoid rounding errors that naturally occur, use int values.
  • Exclusion statement: Other special decimal data types that can be used to avoid rounding errors are outside the scope of the AP Computer Science A course and exam.

Learning Objective 1.6.A: Develop code for assignment statements with compound assignment operators and determine the value that is stored in the variable as a result.

• 1.6.A.1 Compound assignment operators +=, -=, *=, /=, and %= can be used in place of the assignment operator in numeric expressions. A compound assignment operator performs the indicated arithmetic operation between the value on the left and the value on the right and then assigns the result to the variable on the left.
• 1.6.A.2 The post-increment operator ++ and post-decrement operator -- are used to add 1 or subtract 1 from the stored value of a numeric variable. The new value is assigned to the variable.
  • Exclusion statement: The use of increment and decrement operators in prefix form (e.g., ++x) is outside the scope of the AP Computer Science A course and exam. The use of increment and decrement operators inside other expressions (e.g., arr[x++]) is outside the scope of the AP Computer Science A course and exam.

Learning Objective 1.7.A: Identify the attributes and behaviors of a class found in the libraries contained in an API.

• 1.7.A.1 Libraries are collections of classes. An application programming interface (API) specification informs the programmer how to use those classes. Documentation found in API specifications and libraries is essential to understanding the attributes and behaviors of a class defined by the API. A class defines a specific reference type. Classes in the APIs and libraries are grouped into packages. Existing classes and class libraries can be utilized to create objects.
• 1.7.A.2 Attributes refer to the data related to the class and are stored in variables. Behaviors refer to what instances of the class can do (or what can be done with them) and are defined by methods.

Learning Objective 1.8.A: Describe the functionality and use of code through comments.

• 1.8.A.1 Comments are written for both the original programmer and other programmers to understand the code and its functionality, but are ignored by the compiler and are not executed when the program is run. Three types of comments in Java include /* */, which generates a block of comments; //, which generates a comment on one line; and /** */, which are Javadoc comments and are used to create API documentation.
• 1.8.A.2 A precondition is a condition that must be true just prior to the execution of a method in order for it to behave as expected. There is no expectation that the method will check to ensure preconditions are satisfied.
• 1.8.A.3 A postcondition is a condition that must always be true after the execution of a method. Postconditions describe the outcome of the execution in terms of what is being returned or the current value of the attributes of an object.

Learning Objective 1.9.A: Identify the correct method to call based on documentation and method signatures.

• 1.9.A.1 A method is a named block of code that only runs when it is called. A block of code is any section of code that is enclosed in braces. Procedural abstraction allows a programmer to use a method by knowing what the method does even if they do not know how the method was written.
• 1.9.A.2 A parameter is a variable declared in the header of a method or constructor and can be used inside the body of the method. This allows values or arguments to be passed and used by a method or constructor. A method signature for a method with parameters consists of the method name and the ordered list of parameter types. A method signature for a method without parameters consists of the method name and an empty parameter list.

Learning Objective 1.9.B: Describe how to call methods.

• 1.9.B.1 A void method does not have a return value and is therefore not called as part of an expression.
• 1.9.B.2 A non-void method returns a value that is the same type as the return type in the header. To use the return value when calling a non-void method, it must be stored in a variable or used as part of an expression.
• 1.9.B.3 An argument is a value that is passed into a method when the method is called. The arguments passed to a method must be compatible in number and order with the types identified in the parameter list of the method signature. When calling methods, arguments are passed using call by value. Call by value initializes the parameters with copies of the arguments.
• 1.9.B.4 Methods are said to be overloaded when there are multiple methods with the same name but different signatures.
• 1.9.B.5 A method call interrupts the sequential execution of statements, causing the program to first execute the statements in the method before continuing. Once the last statement in the method has been executed or a return statement is executed, the flow of control is returned to the point immediately following where the method was called.

Learning Objective 1.10.A: Develop code to call class methods and determine the result of those calls.

• 1.10.A.1 Class methods are associated with the class, not instances of the class. Class methods include the keyword static in the header before the method name.
• 1.10.A.2 Class methods are typically called using the class name along with the dot operator. When the method call occurs in the defining class, the use of the class name is optional in the call.

Learning Objective 1.12.A: Explain the relationship between a class and an object.

• 1.12.A.1 An object is a specific instance of a class with defined attributes. A class is the formal implementation, or blueprint, of the attributes and behaviors of an object.
• 1.12.A.2 A class hierarchy can be developed by putting common attributes and behaviors of related classes into a single class called a superclass. Classes that extend a superclass, called subclasses, can draw upon the existing attributes and behaviors of the superclass without replacing these in the code. This creates an inheritance relationship from the subclasses to the superclass.
  • Exclusion statement: Designing and implementing inheritance relationships are outside the scope of the AP Computer Science A course and exam.
• 1.12.A.3 All classes in Java are subclasses of the Object class.

Learning Objective 1.12.B: Develop code to declare variables to store reference types.

• 1.12.B.1 A variable of a reference type holds an object reference, which can be thought of as the memory address of that object.

Learning Objective 1.13.A: Identify, using its signature, the correct constructor being called.

• 1.13.A.1 A class contains constructors that are called to create objects. They have the same name as the class.
• 1.13.A.2 A constructor signature consists of the constructor's name, which is the same as the class name, and the ordered list of parameter types. The parameter list, in the header of a constructor, lists the types of the values that are passed and their variable names.
• 1.13.A.3 Constructors are said to be overloaded when there are multiple constructors with different signatures.

Learning Objective 1.13.B: Develop code to declare variables of the correct types to hold object references.

• 1.13.B.1 A variable of a reference type holds an object reference or, if there is no object, null.

Learning Objective 1.13.C: Develop code to create an object by calling a constructor.

• 1.13.C.1 An object is typically created using the keyword new followed by a call to one of the class's constructors.
• 1.13.C.2 Parameters allow constructors to accept values to establish the initial values of the attributes of the object.
• 1.13.C.3 A constructor argument is a value that is passed into a constructor when the constructor is called. The arguments passed to a constructor must be compatible in order and number with the types identified in the parameter list in the constructor signature. When calling constructors, arguments are passed using call by value. Call by value initializes the parameters with copies of the arguments.
• 1.13.C.4 A constructor call interrupts the sequential execution of statements, causing the program to first execute the statements in the constructor before continuing. Once the last statement in the constructor has been executed, the flow of control is returned to the point immediately following where the constructor was called.

Learning Objective 1.14.A: Develop code to call instance methods and determine the result of these calls.

• 1.14.A.1 Instance methods are called on objects of the class. The dot operator is used along with the object name to call instance methods.
• 1.14.A.2 A method call on a null reference will result in a NullPointerException.

Learning Objective 2.1.A: Represent patterns and algorithms that involve selection and repetition found in everyday life using written language or diagrams.

• 2.1.A.1 The building blocks of algorithms include sequencing, selection, and repetition.
• 2.1.A.2 Algorithms can contain selection, through decision making, and repetition, via looping.
• 2.1.A.3 Selection occurs when a choice of how the execution of an algorithm will proceed is based on a true or false decision.
• 2.1.A.4 Repetition is when a process repeats itself until a desired outcome is reached.
• 2.1.A.5 The order in which sequencing, selection, and repetition are used contributes to the outcome of the algorithm.

Learning Objective 2.2.A: Develop code to create Boolean expressions with relational operators and determine the result of these expressions.

• 2.2.A.1 Values can be compared using the relational operators == and != to determine whether the values are the same. With primitive types, this compares the actual primitive values. With reference types, this compares the object references.
• 2.2.A.2 Numeric values can be compared using the relational operators <, >, <=, and >= to determine the relationship between the values.
• 2.2.A.3 An expression involving relational operators evaluates to a Boolean value.

Learning Objective 2.3.A: Develop code to represent branching logical processes by using selection statements and determine the result of these processes.

• 2.3.A.1 Selection statements change the sequential execution of statements.
• 2.3.A.2 An if statement is a type of selection statement that affects the flow of control by executing different segments of code based on the value of a Boolean expression.
• 2.3.A.3 A one-way selection (if statement) is used when there is a segment of code to execute under a certain condition. In this case, the body is executed only when the Boolean expression is true.
• 2.3.A.4 A two-way selection (if-else statement) is used when there are two segments of code—one to be executed when the Boolean expression is true and another segment for when the Boolean expression is false. In this case, the body of the if is executed when the Boolean expression is true, and the body of the else is executed when the Boolean expression is false.

Learning Objective 2.6.A: Compare equivalent Boolean expressions.

• 2.6.A.1 Two Boolean expressions are equivalent if they evaluate to the same value in all cases. Truth tables can be used to prove Boolean expressions are equivalent.
• 2.6.A.2 De Morgan's law can be applied to Boolean expressions to create equivalent Boolean expressions. Under De Morgan's law, the Boolean expression !(a && b) is equivalent to !a || !b and the Boolean expression !(a || b) is equivalent to !a && !b.

Learning Objective 2.6.B: Develop code to compare object references using Boolean expressions and determine the result of these expressions.

• 2.6.B.1 Two different variables can hold references to the same object. Object references can be compared using == and !=.
• 2.6.B.2 An object reference can be compared with null, using == or !=, to determine if the reference actually references an object.
• 2.6.B.3 Classes often define their own equals method, which can be used to specify the criteria for equivalency for two objects of the class. The equivalency of two objects is most often determined using attributes from the two objects.
  • Exclusion statement: Overriding the equals method is outside the scope of the AP Computer Science A course and exam.

Learning Objective 2.7.A: Identify when an iterative process is required to achieve a desired result.

• 2.7.A.1 Iteration is a form of repetition. Iteration statements change the flow of control by repeating a segment of code zero or more times as long as the Boolean expression controlling the loop evaluates to true.
• 2.7.A.2 An infinite loop occurs when the Boolean expression in an iterative statement always evaluates to true.
• 2.7.A.3 The loop body of an iterative statement will not execute if the Boolean expression initially evaluates to false.
• 2.7.A.4 Off by one errors occur when the iteration statement loops one time too many or one time too few.

Learning Objective 2.7.B: Develop code to represent iterative processes using while loops and determine the result of these processes.

• 2.7.B.1 A while loop is a type of iterative statement. In while loops, the Boolean expression is evaluated before each iteration of the loop body, including the first. When the expression evaluates to true, the loop body is executed. This continues until the Boolean expression evaluates to false, whereupon the iteration terminates.

Learning Objective 2.8.A: Develop code to represent iterative processes using for loops and determine the result of these processes.

• 2.8.A.1 A for loop is a type of iterative statement. There are three parts in a for loop header: the initialization, the Boolean expression, and the update.
• 2.8.A.2 In a for loop, the initialization statement is only executed once before the first Boolean expression evaluation. The variable being initialized is referred to as a loop control variable. The Boolean expression is evaluated immediately after the loop control variable is initialized and then following each execution of the increment statement until it is false. In each iteration, the update is executed after the entire loop body is executed and before the Boolean expression is evaluated again.
• 2.8.A.3 A for loop can be rewritten into an equivalent while loop (and vice versa).

Learning Objective 2.9.A: Develop code for standard and original algorithms (without data structures) and determine the result of these algorithms.

• 2.9.A.1 There are standard algorithms to:
  • identify if an integer is or is not evenly divisible by another integer
  • identify the individual digits in an integer
  • determine the frequency with which a specific criterion is met
  • determine a minimum or maximum value
  • compute a sum or average

Learning Objective 2.10.A: Develop code for standard and original algorithms that involve strings and determine the result of these algorithms.

• 2.10.A.1 There are standard string algorithms to:
  • find if one or more substrings have a particular property
  • determine the number of substrings that meet specific criteria
  • create a new string with the characters reversed

Learning Objective 2.11.A: Develop code to represent nested iterative processes and determine the result of these processes.

• 2.11.A.1 Nested iteration statements are iteration statements that appear in the body of another iteration statement. When a loop is nested inside another loop, the inner loop must complete all its iterations before the outer loop can continue to its next iteration.

Learning Objective 2.12.A: Calculate statement execution counts and informal run-time comparison of iterative statements.

• 2.12.A.1 A statement execution count indicates the number of times a statement is executed by the program. Statement execution counts are often calculated informally through tracing and analysis of the iterative statements.

Learning Objective 3.1.A: Represent the design of a program by using natural language or creating diagrams that indicate the classes in the program and the data and procedural abstractions found in each class by including all attributes and behaviors.

• 3.1.A.1 Abstraction is the process of reducing complexity by focusing on the main idea. By hiding details irrelevant to the question at hand and bringing together related and useful details, abstraction reduces complexity and allows one to focus on the idea.
• 3.1.A.2 Data abstraction provides a separation between the abstract properties of a data type and the concrete details of its representation. Data abstraction manages complexity by giving data a name without referencing the specific details of the representation. Data can take the form of a single variable or a collection of data, such as in a class or a set of data.
• 3.1.A.3 An attribute is a type of data abstraction that is defined in a class outside any method or constructor. An instance variable is an attribute whose value is unique to each instance of the class. A class variable is an attribute shared by all instances of the class.
• 3.1.A.4 Procedural abstraction provides a name for a process and allows a method to be used only knowing what it does, not how it does it. Through method decomposition, a programmer breaks down larger behaviors of the class into smaller behaviors by creating methods to represent each individual smaller behavior. A procedural abstraction may extract shared features to generalize functionality instead of duplicating code. This allows for code reuse, which helps manage complexity.
• 3.1.A.5 Using parameters allows procedures to be generalized, enabling the procedures to be reused with a range of input values or arguments.
• 3.1.A.6 Using procedural abstraction in a program allows programmers to change the internals of a method (to make it faster, more efficient, use less storage, etc.) without needing to notify method users of the change as long as the method signature and what the method does is preserved.
• 3.1.A.7 Prior to implementing a class, it is helpful to take time to design each class including its attributes and behaviors. This design can be represented using natural language or diagrams.

Learning Objective 3.2.A: Explain the social and ethical implications of computing systems.

• 3.2.A.1 System reliability refers to the program being able to perform its tasks as expected under stated conditions without failure. Programmers should make an effort to maximize system reliability by testing the program with a variety of conditions.
• 3.2.A.2 The creation of programs has impacts on society, the economy, and culture. These impacts can be both beneficial and harmful. Programs meant to fill a need or solve a problem can have unintended harmful effects beyond their intended use.
• 3.2.A.3 Legal issues and intellectual property concerns arise when creating programs. Programmers often reuse code written by others and published as open source and free to use. Incorporation of code that is not published as open source requires the programmer to obtain permission and often purchase the code before integrating it into their program.

Learning Objective 3.3.A: Develop code to designate access and visibility constraints to classes, data, constructors, and methods.

• 3.3.A.1 Data encapsulation is a technique in which the implementation details of a class are kept hidden from external classes. The keywords public and private affect the access of classes, data, constructors, and methods. The keyword private restricts access to the declaring class, while the keyword public allows access from classes outside the declaring class.
• 3.3.A.2 In this course, classes are always designated public and are declared with the keyword class.
• 3.3.A.3 In this course, constructors are always designated public.
• 3.3.A.4 Instance variables belong to the object, and each object has its own copy of the variable.
• 3.3.A.5 Access to attributes should be kept internal to the class in order to accomplish encapsulation. Therefore, it is good programming practice to designate the instance variables for these attributes as private unless the class specification states otherwise.
• 3.3.A.6 Access to behaviors can be internal or external to the class. Methods designated as public can be accessed internally or externally to a class, whereas methods designated as private can only be accessed internally to the class.

Learning Objective 3.4.A: Develop code to declare instance variables for the attributes to be initialized in the body of the constructors of a class.

• 3.4.A.1 An object's state refers to its attributes and their values at a given time and is defined by instance variables belonging to the object. This defines a has-a relationship between the object and its instance variables.
• 3.4.A.2 A constructor is used to set the initial state of an object, which should include initial values for all instance variables. When a constructor is called, memory is allocated for the object and the associated object reference is returned. Constructor parameters, if specified, provide data to initialize instance variables.
• 3.4.A.3 When a mutable object is a constructor parameter, the instance variable should be initialized with a copy of the referenced object. In this way, the instance variable does not hold a reference to the original object, and methods are prevented from modifying the state of the original object.
• 3.4.A.4 When no constructor is written, Java provides a no-parameter constructor, and the instance variables are set to default values according to the data type of the attribute. This constructor is called the default constructor.
• 3.4.A.5 The default value for an attribute of type int is 0. The default value of an attribute of type double is 0.0. The default value of an attribute of type boolean is false. The default value of a reference type is null.

Learning Objective 3.5.A: Develop code to define behaviors of an object through methods written in a class using primitive values and determine the result of calling these methods.

• 3.5.A.1 A void method does not return a value. Its header contains the keyword void before the method name.
• 3.5.A.2 A non-void method returns a single value. Its header includes the return type in place of the keyword void.
• 3.5.A.3 In non-void methods, a return expression compatible with the return type is evaluated, and the value is returned. This is referred to as return by value.
• 3.5.A.4 The return keyword is used to return the flow of control to the point where the method or constructor was called. Any code that is sequentially after a return statement will never be executed. Executing a return statement inside a selection or iteration statement will halt the statement and exit the method or constructor.
• 3.5.A.5 An accessor method allows objects of other classes to obtain a copy of the value of instance variables or class variables. An accessor method is a non-void method.
• 3.5.A.6 A mutator (modifier) method is a method that changes the values of the instance variables or class variables. A mutator method is often a void method.
• 3.5.A.7 Methods with parameters receive values through those parameters and use those values in accomplishing the method's task.
• 3.5.A.8 When an argument is a primitive value, the parameter is initialized with a copy of that value. Changes to the parameter have no effect on the corresponding argument.

Learning Objective 3.6.A: Develop code to define behaviors of an object through methods written in a class using object references and determine the result of calling these methods.

• 3.6.A.1 When an argument is an object reference, the parameter is initialized with a copy of that reference; it does not create a new independent copy of the object. If the parameter refers to a mutable object, the method or constructor can use this reference to alter the state of the object. It is good programming practice to not modify mutable objects that are passed as parameters unless required in the specification.
• 3.6.A.2 When the return expression evaluates to an object reference, the reference is returned, not a reference to a new copy of the object.
• 3.6.A.3 Methods cannot access the private data and methods of a parameter that holds a reference to an object unless the parameter is the same type as the method's enclosing class.

Learning Objective 3.7.A: Develop code to define behaviors of a class through class methods.

• 3.7.A.1 Class methods cannot access or change the values of instance variables or call instance methods without being passed an instance of the class via a parameter.
• 3.7.A.2 Class methods can access or change the values of class variables and can call other class methods.

Learning Objective 3.7.B: Develop code to declare the class variables that belong to the class.

• 3.7.B.1 Class variables belong to the class, with all objects of a class sharing a single copy of the class variable. Class variables are designated with the static keyword before the variable type.
• 3.7.B.2 Class variables that are designated public are accessed outside of the class by using the class name and the dot operator, since they are associated with a class, not objects of a class.
• 3.7.B.3 When a variable is declared final, its value cannot be modified.

Learning Objective 3.8.A: Explain where variables can be used in the code.

• 3.8.A.1 Local variables are variables declared in the headers or bodies of blocks of code. Local variables can only be accessed in the block in which they are declared. Since constructors and methods are blocks of code, parameters to constructors or methods are also considered local variables. These variables may only be used within the constructor or method and cannot be declared to be public or private.
• 3.8.A.2 When there is a local variable or parameter with the same name as an instance variable, the variable name will refer to the local variable instead of the instance variable within the body of the constructor or method.

Learning Objective 3.9.A: Develop code for expressions that are self-referencing and determine the result of these expressions.

• 3.9.A.1 Within an instance method or a constructor, the keyword this acts as a special variable that holds a reference to the current object—the object whose method or constructor is being called.
• 3.9.A.2 The keyword this can be used to pass the current object as an argument in a method call.
• 3.9.A.3 Class methods do not have a this reference.

Learning Objective 4.1.A: Explain the risks to privacy from collecting and storing personal data on computer systems.

• 4.1.A.1 When using a computer, personal privacy is at risk. When developing new programs, programmers should attempt to safeguard the personal privacy of the user.

Learning Objective 4.1.B: Explain the importance of recognizing data quality and potential issues when using a data set.

• 4.1.B.1 Algorithmic bias describes systemic and repeated errors in a program that create unfair outcomes for a specific group of users.
• 4.1.B.2 Programmers should be aware of the data set collection method and the potential for bias when using this method before using the data to extrapolate new information or drawing conclusions.
• 4.1.B.3 Some data sets are incomplete or contain inaccurate data. Using such data in the development or use of a program can cause the program to work incorrectly or inefficiently.

Learning Objective 4.1.C: Identify an appropriate data set to use in order to solve a problem or answer a specific question.

• 4.1.C.1 Contents of a data set might be related to a specific question or topic and might not be appropriate to give correct answers or extrapolate information for a different question or topic.

Learning Objective 4.2.A: Represent patterns and algorithms that involve data sets found in everyday life using written language or diagrams.

• 4.2.A.1 A data set is a collection of specific pieces of information or data.
• 4.2.A.2 Data sets can be manipulated and analyzed to solve a problem or answer a question. When analyzing data sets, values within the set are accessed and utilized one at a time and then processed according to the desired outcome.
• 4.2.A.3 Data can be represented in a diagram by using a chart or table. This visual can be used to plan the algorithm that will be used to manipulate the data.

Learning Objective 4.3.A: Develop code used to represent collections of related data using one-dimensional (1D) array objects.

• 4.3.A.1 An array stores multiple values of the same type. The values can be either primitive values or object references.
• 4.3.A.2 The length of an array is established at the time of creation and cannot be changed. The length of an array can be accessed through the length attribute.
• 4.3.A.3 When an array is created using the keyword new, all of its elements are initialized to the default values for the element data type. The default value for int is 0, for double is 0.0, for boolean is false, and for a reference type is null.
• 4.3.A.4 Initializer lists can be used to create and initialize arrays.
• 4.3.A.5 Square brackets [ ] are used to access and modify an element in a 1D array using an index.
• 4.3.A.6 The valid index values for an array are 0 through one less than the length of the array, inclusive. Using an index value outside of this range will result in an ArrayIndexOutOfBoundsException.

Learning Objective 4.4.A: Develop code used to traverse the elements in a 1D array and determine the result of these traversals.

• 4.4.A.1 Traversing an array is when repetition statements are used to access all or an ordered sequence of elements in an array.
• 4.4.A.2 Traversing an array with an indexed for loop or while loop requires elements to be accessed using their indices.
• 4.4.A.3 An enhanced for loop header includes a variable, referred to as the enhanced for loop variable. For each iteration of the enhanced for loop, the enhanced for loop variable is assigned a copy of an element without using its index.
• 4.4.A.4 Assigning a new value to the enhanced for loop variable does not change the value stored in the array.
• 4.4.A.5 When an array stores object references, the attributes can be modified by calling methods on the enhanced for loop variable. This does not change the object references stored in the array.
• 4.4.A.6 Code written using an enhanced for loop to traverse elements in an array can be rewritten using an indexed for loop or a while loop.

Learning Objective 4.5.A: Develop code for standard and original algorithms for a particular context or specification that involves arrays and determine the result of these algorithms.

• 4.5.A.1 There are standard algorithms that utilize array traversals to:
  • determine a minimum or maximum value
  • compute a sum or average
  • determine if at least one element has a particular property
  • determine if all elements have a particular property
  • determine the number of elements having a particular property
  • access all consecutive pairs of elements
  • determine the presence or absence of duplicate elements
  • shift or rotate elements left or right
  • reverse the order of the elements

Learning Objective 4.7.A: Develop code to use Integer and Double objects from their primitive counterparts and determine the result of using these objects.

• 4.7.A.1 The Integer class and Double class are part of the java.lang package. An Integer object is immutable, meaning once an Integer object is created, its attributes cannot be changed. A Double object is immutable, meaning once a Double object is created, its attributes cannot be changed.
• 4.7.A.2 Autoboxing is the automatic conversion that the Java compiler makes between primitive types and their corresponding object wrapper classes. This includes converting an int to an Integer and a double to a Double. The Java compiler applies autoboxing when a primitive value is:
  • passed as a parameter to a method that expects an object of the corresponding wrapper class
  • assigned to a variable of the corresponding wrapper class
• 4.7.A.3 Unboxing is the automatic conversion that the Java compiler makes from the wrapper class to the primitive type. This includes converting an Integer to an int and a Double to a double. The Java compiler applies unboxing when a wrapper class object is:
  • passed as a parameter to a method that expects a value of the corresponding primitive type
  • assigned to a variable of the corresponding primitive type
• 4.7.A.4 The following class Integer method—including what it does and when it is used—is part of the Java Quick Reference:
  • static int parseInt(String s) returns the String argument as an int.
• 4.7.A.5 The following class Double method—including what it does and when it is used—is part of the Java Quick Reference:
  • static double parseDouble(String s) returns the String argument as a double.

Learning Objective 4.10.A: Develop code for standard and original algorithms for a particular context or specification that involve ArrayList objects and determine the result of these algorithms.

• 4.10.A.1 There are standard ArrayList algorithms that utilize traversals to:
  • determine a minimum or maximum value
  • compute a sum or average
  • determine if at least one element has a particular property
  • determine if all elements have a particular property
  • determine the number of elements having a particular property
  • access all consecutive pairs of elements
  • determine the presence or absence of duplicate elements
  • shift or rotate elements left or right
  • reverse the order of the elements
  • insert elements
  • delete elements
• 4.10.A.2 Some algorithms require multiple String, array, or ArrayList objects to be traversed simultaneously.

Learning Objective 4.12.A: Develop code used to traverse the elements in a 2D array and determine the result of these traversals.

• 4.12.A.1 Nested iteration statements are used to traverse and access all or an ordered sequence of elements in a 2D array. Since 2D arrays are stored as arrays of arrays, the way 2D arrays are traversed using for loops and enhanced for loops is similar to 1D array objects. Nested iteration statements can be written to traverse the 2D array in row-major order, column-major order, or a uniquely defined order. Row-major order refers to an ordering of 2D array elements where traversal occurs across each row, whereas column-major order traversal occurs down each column.
• 4.12.A.2 The outer loop of a nested enhanced for loop used to traverse a 2D array traverses the rows. Therefore, the enhanced for loop variable must be the type of each row, which is a 1D array. The inner loop traverses a single row. Therefore, the inner enhanced for loop variable must be the same type as the elements stored in the 1D array. Assigning a new value to the enhanced for loop variable does not change the value stored in the array.

Learning Objective 4.13.A: Develop code for standard and original algorithms for a particular context or specification that involves 2D arrays and determine the result of these algorithms.

• 4.13.A.1 There are standard algorithms that utilize 2D array traversals to:
  • determine a minimum or maximum value of all the elements or for a designated row, column, or other subsection
  • compute a sum or average of all the elements or for a designated row, column, or other subsection
  • determine if at least one element has a particular property in the entire 2D array or for a designated row, column, or other subsection
  • determine if all elements of the 2D array or a designated row, column, or other subsection have a particular property
  • determine the number of elements in the 2D array or in a designated row, column, or other subsection having a particular property
  • access all consecutive pairs of elements
  • determine the presence or absence of duplicate elements in the 2D array or in a designated row, column, or other subsection
  • shift or rotate elements in a row left or right or in a column up or down
  • reverse the order of the elements in a row or column

Learning Objective 4.14.A: Develop code used for linear search algorithms to search for specific information in a collection and determine the results of executing a search.

• 4.14.A.1 Linear search algorithms are standard algorithms that check each element in order until the desired value is found or all elements in the array or ArrayList have been checked. Linear search algorithms can begin the search process from either end of the array or ArrayList.
• 4.14.A.2 When applying linear search algorithms to 2D arrays, each row must be accessed then linear search applied to each row of the 2D array.

Learning Objective 4.15.A: Determine the result of executing each step of sorting algorithms to sort the elements of a collection.

• 4.15.A.1 Selection sort and insertion sort are iterative sorting algorithms that can be used to sort elements in an array or ArrayList.
• 4.15.A.2 Selection sort repeatedly selects the smallest (or largest) element from the unsorted portion of the list and swaps it into its correct (and final) position in the sorted portion of the list.
• 4.15.A.3 Insertion sort inserts an element from the unsorted portion of a list into its correct (but not necessarily final) position in the sorted portion of the list by shifting elements of the sorted portion to make room for the new element.

Learning Objective 4.16.A: Determine the result of calling recursive methods.

• 4.16.A.1 A recursive method is a method that calls itself. Recursive methods contain at least one base case, which halts the recursion, and at least one recursive call. Recursion is another form of repetition.
• 4.16.A.2 Each recursive call has its own set of local variables, including the parameters. Parameter values capture the progress of a recursive process, much like loop control variable values capture the progress of a loop.
• 4.16.A.3 Any recursive solution can be replicated through the use of an iterative approach and vice versa.
  • Exclusion statement: Writing recursive code is outside the scope of the AP Computer Science A course and exam.

Learning Objective 4.17.A: Determine the result of executing recursive algorithms that use strings or collections.

• 4.17.A.1 Recursion can be used to traverse String objects, arrays, and ArrayList objects.

Learning Objective 4.17.B: Determine the result of each iteration of a binary search algorithm used to search for information in a collection.

• 4.17.B.1 Data must be in sorted order to use the binary search algorithm. Binary search starts at the middle of a sorted array or ArrayList and eliminates half of the array or ArrayList in each recursive call until the desired value is found or all elements have been eliminated.
• 4.17.B.2 Binary search is typically more efficient than linear search.
  • Exclusion statement: Search algorithms other than linear and binary search are outside the scope of the AP Computer Science A course and exam.
• 4.17.B.3 The binary search algorithm can be written either iteratively or recursively.

Learning Objective 4.17.C: Determine the result of each iteration of the merge sort algorithm when used to sort a collection.

• 4.17.C.1 Merge sort is a recursive sorting algorithm that can be used to sort elements in an array or ArrayList.
  • Exclusion statement: Sorting algorithms other than selection, insertion, and merge sort are outside the scope of the AP Computer Science A course and exam.
• 4.17.C.2 Merge sort repeatedly divides an array into smaller subarrays until each subarray is one element and then recursively merges the sorted subarrays back together in sorted order to form the final sorted array.