Using Objects in AP Computer Science A

An actual instance of an object.

A blueprint for a house.

A template that defines what an object is like and what the object can do.

A reference type that combines primitive and reference data types.

Allowing direct access modification of class fields from outside methods.

Using getter methods to retrieve field values.

Implementing setter methods that validate data before modifying fields.

Wrapping related variables and methods together into single units as classes.

Problems where maintaining sorted data elements is not essential

Small-scale applications where execution time differences are negligible

Problems involving large datasets where performance significantly degrades with quadratic complexity

Situations requiring precise control over low-level memory management

Merge sort

Insertion sort

Bubble sort

Selection sort

do

while

break

for

Recursion provides a way to solve complex problems by breaking them down into simpler subproblems.

Recursion simplifies debugging by reducing the number of lines in code.

Recursion eliminates the need for data storage in a program.

Recursion speeds up every type of algorithm regardless of context.

Compilation time

Number of variables

Big O notation

Lines of code

It creates unnecessary duplicates of items when adding them to the cart.

It uses polymorphism incorrectly by casting Item objects.

It violates encapsulation by directly accessing properties of Item.

There’s an infinite loop because adding items never terminates.

while loop

switch statement

if statement

method declaration

To pause the execution of a program and inspect variables.

To compile the code more quickly.

To speed up the execution of a loop.

To change the value returned by a method.