AP COMPUTER SCIENCE A

Scoring Guidelines
Question 1: Methods and Control Structures

This question involves the use of check digits, which can be used to help detect if an error has occurred when a number
is entered or transmitted electronically. An algorithm for computing a check digit, based on the digits of a number, is
provided in part (a).
The CheckDigit class is shown below. You will write two methods of the CheckDigit class.

public class CheckDigit

{
/** Returns the check digit for num, as described in part (a).

* Precondition: The number of digits in num is between one and

* six, inclusive.
* num >= 0

*/
public static int getCheck(int num)
{

/* to be implemented in part (a) */

}

/** Returns true if numWithCheckDigit is valid, or false

* otherwise, as described in part (b).

* Precondition: The number of digits in numWithCheckDigit

* is between two and seven, inclusive.
* numWithCheckDigit >= 0
*/
public static boolean isValid(int numWithCheckDigit)

{
/* to be implemented in part (b) */
}

/** Returns the number of digits in num. */

public static int getNumberOfDigits(int num)
{
/* implementation not shown */
}

/** Returns the nthdigit of num.

* Precondition: n >= 1 and n <= the number of digits in num
*/
public static int getDigit(int num, int n)
{
/* implementation not shown */
}

// There may be instance variables, constructors, and methods not shown.

AP Computer Science A Course and Exam Description | SG 1

(a) Complete the getCheck method, which computes the check digit for a number according to the following rules.
§ Multiply the first digit by 7, the second digit (if one exists) by 6, the third digit (if one exists) by 5, and so on. The
length of the method’s int parameter is at most six; therefore, the last digit of a six-digit number will be multiplied
by 2.
§ Add the products calculated in the previous step.
§ Extract the check digit, which is the rightmost digit of the sum calculated in the previous step.

The following are examples of the check-digit calculation.

Example 1, where num has the value 283415

§ The sum to calculate is (2 × 7) + (8 × 6) + (3 × 5) + (4 × 4) + (1 × 3) + (5 × 2) = 14 + 48 + 15 + 16 + 3 + 10 = 106.
§ The check digit is the rightmost digit of 106, or 6, and getCheck returns the integer value 6.

Example 2, where num has the value 2183

§ The sum to calculate is (2 × 7) + (1 × 6) + (8 × 5) + (3 × 4) = 14 + 6 + 40 + 12 = 72.
§ The check digit is the rightmost digit of 72, or 2, and getCheck returns the integer value 2.

Two helper methods, getNumberOfDigits and getDigit, have been provided.

§ getNumberOfDigits returns the number of digits in its int parameter.
§ getDigit returns the nth digit of its int parameter.

The following are examples of the use of getNumberOfDigits and

getDigit.

Return
Method Call Value Explanation
getNumberOfDigits(283415) 6 The number 283415 has 6 digits.
getDigit(283415, 1) 2 The first digit of 283415 is 2.
getDigit(283415, 5) 1 The fifth digit of 283415 is 1.

Complete the getCheck method below. You must use getNumberOfDigits and getDigit appropriately to
receive full credit.
/** Returns the check digit for num, as described in part (a).
* Precondition: The number of digits in num is between one and six,
* inclusive.
* num >= 0
*/

public static int getCheck(int num)

AP Computer Science A Course and Exam Description | SG 2

(b) Write the isValid method. The method returns true if its parameter numWithCheckDigit, which
represents a number containing a check digit, is valid, and false otherwise. The check digit is always the rightmost
digit of numWithCheckDigit.

The following table shows some examples of the use of isValid.

Return
Method Call Value Explanation
getCheck(159) 2 The check digit for 159 is 2.
The number 1592 is a valid combination of a
isValid(1592) true
number (159) and its check digit (2).
The number 1593 is not a valid combination of a
isValid(1593) false number (159) and its check digit (3) because 2 is
the check digit for 159.

Complete method isValid below. Assume that getCheck works as specified, regardless of what you wrote in
part (a). You must use getCheck appropriately to receive full credit.
/** Returns true if numWithCheckDigit is valid, or false
* otherwise, as described in part (b).
* Precondition: The number of digits in numWithCheckDigit is
* between two and seven, inclusive.
* numWithCheckDigit >= 0
*/

public static boolean isValid(int numWithCheckDigit)

AP Computer Science A Course and Exam Description | SG 3

Applying the Scoring Criteria

Apply the question scoring criteria first, which always takes precedence. Penalty points can only be deducted in a part of
the question that has earned credit via the question rubric. No part of a question (a, b, c) may have a negative point total.
A given penalty can be assessed only once for a question, even if it occurs multiple times or in multiple parts of that question.
A maximum of 3 penalty points may be assessed per question.
1-Point Penalty
v) Array/collection access confusion ([ ] get)

w) Extraneous code that causes side-effect (e.g., printing to output, incorrect precondition check)
x) Local variables used but none declared
y) Destruction of persistent data (e.g., changing value referenced by parameter)

z) Void method or constructor that returns a value

No Penalty
• Extraneous code with no side-effect (e.g., valid precondition check, no-op)
• Spelling/case discrepancies where there is no ambiguity*
• Local variable not declared provided other variables are declared in some part
• private or public qualifier on a local variable
• Missing public qualifier on class or constructor header
• Keyword used as an identifier
• Common mathematical symbols used for operators (× • ÷ < > <> ≠)
• [ ] vs. ( ) vs. < >
• = instead of == and vice versa
• length/size confusion for array, String, List, or ArrayList; with or without ( )
• Extraneous [ ] when referencing entire array
• [i,j] instead of [i][j]
• Extraneous size in array declaration, e.g., int[size] nums = new int[size];
• Missing ; where structure clearly conveys intent
• Missing { } where indentation clearly conveys intent
• Missing ( ) on parameter-less method or constructor invocations
• Missing ( ) around if or while conditions

*Spelling and case discrepancies for identifiers fall under the “No Penalty” category only if the correction can be
unambiguously inferred from context, for example, “ArayList” instead of “ArrayList”. As a counterexample, note that if the code
declares “int G = 99, g = 0;”, then uses “while (G < 10)” instead of “while (g < 10)”, the context does not
allow for the reader to assume the use of the lower case variable.

AP Computer Science A Course and Exam Description | SG 4

 Question 3: Array/ArrayList

The Gizmo class represents gadgets that people purchase. Some Gizmo objects are electronic and others are
not. A partial definition of the Gizmo class is shown below.

public class Gizmo

{

/** Returns the name of the manufacturer of this Gizmo. */

public String getMaker()

/* implementation not shown */

/** Returns true if this Gizmo is electronic, and false

* otherwise.

*/

public boolean isElectronic()

/* implementation not shown */

/** Returns true if this Gizmo is equivalent to the Gizmo

* object represented by the

* parameter, and false otherwise.

*/

public boolean equals(Object other)

/* implementation not shown */

// There may be instance variables, constructors, and methods not shown.

The OnlinePurchaseManager class manages a sequence of Gizmo objects that an individual has purchased from
an online vendor. You will write two methods of the OnlinePurchaseManager class. A partial definition of the
OnlinePurchaseManager class is shown below.

public class OnlinePurchaseManager

/** An ArrayList of purchased Gizmo objects,

* instantiated in the constructor.

*/

private ArrayList<Gizmo> purchases;

/** Returns the number of purchased Gizmo objects that are electronic
* whose manufacturer is maker, as described in part (a).
*/

public int countElectronicsByMaker(String maker)

/* to be implemented in part (a) */

AP Computer Science A Course and Exam Description | SG 7

 /** Returns true if any pair of adjacent purchased Gizmo objects are
* equivalent, and false otherwise, as described in part (b).
*/

public boolean hasAdjacentEqualPair()

/* to be implemented in part (b) */

// There may be instance variables, constructors, and methods not shown.

(a) Write the countElectronicsByMaker method. The method examines the ArrayList instance variable
purchases to determine how many Gizmo objects purchased are electronic and are manufactured by maker.

Assume that the OnlinePurchaseManager object opm has been declared and initialized so that the
ArrayList purchases contains Gizmo objects as represented in the following table.
Index in purchases 0 1 2 3 4 5
Value returned
by method call true false true false true false
isElectronic()
Value returned
by method call "ABC" "ABC" "XYZ" "lmnop" "ABC" "ABC"
getMaker()

The following table shows the value returned by some calls

to countElectronicsByMaker.
Method Call Return Value
opm.countElectronicsByMaker("ABC") 2
opm.countElectronicsByMaker("lmnop") 0
opm.countElectronicsByMaker("XYZ") 1
opm.countElectronicsByMaker("QRP") 0

Complete method countElectronicsByMaker below.

/** Returns the number of purchased Gizmo objects that are electronic and
* whose manufacturer is maker, as described in part (a).
*/

public int countElectronicsByMaker(String maker)

(b) When purchasing items online, users occasionally purchase two identical items in rapid succession without intending
to do so (e.g., by clicking a purchase button twice). A vendor may want to check a user’s purchase history to detect such
occurrences and request confirmation.

Write the hasAdjacentEqualPair method. The method detects whether two adjacent Gizmo objects in
purchases are equivalent, using the equals method of the Gizmo class. If an adjacent equivalent pair is found,
the hasAdjacentEqualPair method returns true. If no such pair is found, or if purchases has fewer than
two elements, the method returns false.

Complete method hasAdjacentEqualPair below.

/** Returns true if any pair of adjacent purchased Gizmo objects are
* equivalent, and false otherwise, as described in part (b).
*/

public boolean hasAdjacentEqualPair()

AP Computer Science A Course and Exam Description | SG 8