# Exam 2 for the AP CS A Exam (not timed)¶

The following problems are similar to what you might see on the AP CS A exam. Please answer each to the best of your ability.

14-3-1: Consider the Animal, Fish, and Goldfish classes shown below. Which of the following object declarations will compile without error?

public class Animal
{
/* no constructors or other methods have been declared */
}

public class Fish extends Animal
{
/* no constructors or other methods have been declared */
}

public class Goldfish extends Fish
{
/* no constructors or other methods have been declared */
}

I. Goldfish glub = new Fish();

II. Animal glub = new Fish();

III. Fish glub = new Goldfish();

• (A) I only
• A Fish is NOT a type of Goldfish. The Fish class does not inherit from the Goldfish class, so a Fish cannot be instantiated as a Goldfish object.
• (B) II only
• II is correct, but III is correct as well. A Goldfish IS-A type of Fish, and a Fish IS-A type of Animal.
• (C) III only
• III is correct, but II is correct as well. A Goldfish IS-A type of Fish, and a Fish IS-A type of Animal.
• (D) I and II only
• II is correct, but a Fish is NOT a type of Goldfish. A Fish cannot be instantiated as a Goldfish object, because the Fish class does not inherit from the Goldfish class.
• (E) II and III only
• A Goldfish IS-A type of Fish, and a Fish IS-A type of Animal. The Goldfish class inherits from the Fish class, and the Fish class inherits from the Animal class.

14-3-2: Assume that list has been instantiated as an ArrayList of integers containing [6, 2, 9] . What are the contents of list after the code is executed?

list.remove(2);
list.set(2, 7);

• (A) [6, 2, 7, 5]
• When the add method is used with two parameters, the value is added at the specific index, not at the end of the list. In this list, 4 has been added at index 1.
• (B) [6, 4, 2, 7, 5]
• This would be correct if 7 had been placed in the list using add, not set. Remember that the set method replaces the value at the index. It does not move the previous value to the right.
• (C) [4, 7, 9, 5]
• Remember that in ArrayLists, indexing starts at 0, not 1.
• (D) [6, 4, 7, 5]
• The 2 at index 1 is removed resulting in [6, 9], then a 4 is added at index 1 resulting in [6, 4, 9]. A 5 is added to the end of the list resulting in [6,4,9,5], and the value at 2 is replaced with a 7 resulting in [6,4,7,5].
• (E) [4, 7, 6, 9, 5]
• Remember that in ArrayLists, indexing starts at 0, not 1. The set method replaces the value at the specified index with a new value, so the original value is deleted.
14-3-3: A sorted array of integers containing 2000 elements is to be searched for key using a binary search method. Assuming key is in the array, what is the maximum number of iterations needed to find key?
• (A) 8
• 2 ^ 8 = 256. There will not be enough passes to guarantee finding the value. Remember that binary search requires log2 (number of elements) passes to guarantee that a value will be found.
• (B) 10
• 2 ^ 10 = 1024. There will not be enough passes to guarantee finding the value. Remember that binary search requires log2 (number of elements) passes to guarantee that a value will be found.
• (C) 100
• The key will be found in 100 passes, but there is a better answer. Remember that binary search requires log2 (number of elements) passes to find a value.
• (D) 2000
• With binary search, every element of the array does not have to be checked. Remember that although sequential search would require 2000 passes to guarantee the value was found, binary search requires log2 (number of elements) passes to find an object.
• (E) 11
• 2 ^ 11 = 2048. Because 2048 is larger than 2000, 11 passes will be more than enough to guarantee finding the value.

14-3-4: Which of the following code segments creates a 7 x 9 array of integers and fills every space in the array with multiples of two (not including the value 0)?

I.   int[][] arr = new int [7][9];

II.  int[][] arr = new int [7][9];
int count = 1;

for(int i = 0; i < arr.length; i++)
{
for(int j = 0; j < arr[0].length; j++)
{
arr[i][j] = count * 2;
count++;
}
}

III. int[][] arr = new int [7][9];
int count = 1;
int row = 0;
int col = 0;

while (row < arr.length && col < arr[0].length)
{
arr[row][col] = count * 2;
row++;
col++;
count++;
}

• (A) I only
• I correctly creates the 7 x 9 matrix, but every value in the matrix remains 0.
• (B) II only
• II correctly creates and fills the matrix with multiples of 2.
• (C) II and III only
• II is correct, but III does not fill every space correctly. Only diagonal spaces are filled, so most of the spaces are still filled with 0 at the end of the loop. Notice that every time the while loop cycles, the values of row and col both increase.
• (D) I and II only
• II is correct, but I does not fill the matrix.
• (E) III only
• III does not fill every space correctly. Only spaces lying on the diagonal are filled because the row and column index change at the same time, and the values are incorrect. Most of the spaces remain filled with 0. Notice that every time the while loop cycles, the values of row and col both increase.

14-3-5: Consider the method printString shown below. What is printed as a result of printString(“sandwich”)?

public void printString(String s)
{
if (s.length() > 0)
{
printString(s.substring(1));
System.out.print(s.substring(0, 1));
}
}

• (A) hciwdnas
• The recursive call occurs until the length of s equals 0, then the letters of the word are printed in reverse order.
• (B) sandwich
• This would occur if the print statement came before the recursive call. Because the compiler works through the recursive call before moving to the other statements, the letters are printed in reverse order.
• (C) andwichandwichndwichdwichwichichchh
• This would occur if the print statement came before the recursive call and included s.substring(1), not s.substring(0, 1). The statements are printed after the recursive call is made, so the compiler works through every recursive call before it prints out the letters, and the letters are printed in reverse order.
• (D) hchichwichdwichndwichandwich
• This would occur if the print statement included s.substring(1). Each call of the printString method prints only one letter at a time, because the substring that is printed is s.substring(0,1).
• (E) Nothing is printed because an infinite loop occurs
• This method ends when s.length() equals zero, so the base case is reached after eight passes for the word "sandwich". An infinite loop will not occur.

14-3-6: The Dog class is shown below. The GoldenRetriever class inherits from the Dog class. Which methods and variables does the GoldenRetriever class inherit?

public class Dog
{
private int numLegs = 4;
private String name = "Spot";

public Dog(String theName)
{
/* implementation not shown */
}

public String bark()
{
return "Woof!";
}

public String getName()
{
return name;
}

public int getNumLegs()
{
return numLegs;
}
}

I. public Dog(String theName)

II. bark()

III. getName()

IV. private String name;

• (A) I only
• Remember that subclasses do not inherit constructors from the parent class.
• (B) I and II only
• II is correct, but constructors are not inherited.
• (C) III only
• III is correct, but remember that all public methods are inherited by the subclass.
• (D) II and III only
• Subclasses inherit mutator and accessor methods from the parent class, but they do not inherit constructors or private instance variables.
• (E) I, II, III, and IV
• Constructors and private instance variables are not inherited from the parent class. II and III are correct, but GoldenRetriever would not inherit the constructor or the private instance variables.

14-3-7: Which of these loops will output 02468?

I. for (int i = 0; i <= 8; i++)
{
System.out.print(i);
}

II. int i = 0;
while (i < 8)
{
i +=2;
System.out.print(i);
}

III. for (int i = 0; i <= 8; i +=2)
{
System.out.print(i);
}

• (A) I only
• Notice the incrementing in the for loop. The value i increments by 1, not by 2, so "012345678" is printed.
• (B) II only
• Notice the order of the incrementing and the print statement in the while loop. The value i increments before it is printed. The code never prints out 0, so "2468" is printed.
• (C) III only
• The value i starts at 0 and increments by 2, correctly printing out every value.
• (D) I and II only
• Notice the incrementing in the loops for I and II. In I, the value i increments by 1 and prints out too many values. In II, the first value is not printed.
• (E) I, II, and III
• III is correct, but I prints out every value between 0 and 8 and II does not print the first value.

14-3-8: Consider the following method mystery. Assuming x is an integer greater than 1, in which case does mystery result in an infinite loop?

public int mystery(int x, int y)
{
if (x <= y)
return x;
else
return mystery(x, y * 10);
}

• (A) y is greater than 1
• Eventually, the recursive calls will reach the base case, where y is greater than or equal to x. If y is greater than 1, multiplying by 10 will increase y and y will remain positive.
• (B) y is less than or equal to 0
• If y is less than or equal to 0, multiplying by 10 will not make the value greater than x. The base case will never be reached, and the method will continue running until the computer runs out of memory.
• (C) y is greater than x
• If y is greater than x, the method will reach its base case on the first pass of the method.
• (D) all of the above
• Not all of the statements are correct. If y is greater than x or if y is greater than 1, the method will eventually reach its base case and end.
• (E) none of the above
• One of the statements is correct. If y is less than or equal to 0, multiplying by 10 will not make y become greater than x.

14-3-9: Consider the following classes Cat and FluffyCat. What is the result of executing the following code? Cat obj = new FluffyCat();

obj.display();

public class Cat
{
public String display()
{
System.out.print("Cats! ");
}
}

public class FluffyCat extends Cat
{
public String display()
{
System.out.print("Cool!");
}
}

• (A) Cats!
• This would be the case if obj was a Cat at run-time. At run-time, obj is a FluffyCat, so the overwritten method in the Cat class is used.
• (B) Cats! Cool!
• This would be the case if the display method in FluffyCat used 'super' to call on the display method in the Cat class before it printed "Cool!".
• (C) Cool!
• Although obj is declared to be a Cat at compile time, at run-time it is actually a FluffyCat. The overwritten display method defined in the FluffyCat class will be called.
• (D) Cool! Cats!
• The method has been overwritten in FluffyCat, so the display method present in the Cat Class ("Cats! ") will not be printed.
• (E) The code results in an error.
• This code compiles and runs correctly. A FluffyCat IS-A Cat object, so the code will compile and run without issue.

14-3-10: Consider the class showMe, shown below. What is printed as a result of showMe(10)?

public static void showMe(int arg)
{
if (arg > 1)
{
showMe(arg - 1);
}

else
{
System.out.print(arg + " ");
}
}

• (A) 1
• After the recursive call reaches the base case (where arg = 1), the compiler prints "1". The recursive calls all just return and don't print anything.
• (B) 0
• This would be correct if the recursive call specified that arg >= 1 or arg > 0. Because the code ends when arg reaches a value of 1, the code will not print out 0.
• (C) 10 9 8 7 6 5 4 3 2 1
• This would be correct if the method printed out arg + " " before going to the recursive call. Because the print statement is located at the end of the base case and not the recursive call, not every value is printed.
• (D) 1 2 3 4 5 6 7 8 9 10
• This would be correct if the method printed arg + " " after the recursive call in the if statement. Because the method does not return any values or strings, and because only the base case has a print statement, only the last value of arg is printed.
• (E) 10
• This would be correct if the method returned an integer that was the sum of the previous calls. The method does not add any values.

14-3-11: Consider the following code. What is printed as a result of executing this code?

int sum = 0;

for (int x = 0; x < 5; x++)
{
for (int y = x; y < 5; y++)
{
sum++;
}
}

System.out.println(sum);

• (A) 25
• This would be correct if at the beginning of the second for loop, y was equal to 0, not to x. The starting value of y changes every time that x increases.
• (B) 15
• The code loops 15 times, and sum is incremented by 1 each time.
• (C) 21
• This would be correct if the for-loops both continued when the values were less than or equal to 5, not when the values were less than 5.
• (D) 36
• This would be correct if the for-loops both began at 0 and looped until the values were less than or equal to 5. Check the for loop structures.
• (E) 10
• This would be correct if the first for-loop began at 1, not at 0.

14-3-12: You are trying to write a method sumRow that finds the sum of the values in a specified row of a 2-D matrix. Which of the following code segments could replace /* to be determined */ to make the code work correctly?

public int sumRow (int row, int[][] values)
{
int sum = 0;

/* to be determined */

return sum;
}

//I.
for (int[] rowValues : values)
{
for (int x : rowValues)
{
sum += x;
}
}

//II.
for (int i = 0; i < values[0].length;i++)
{
sum += values[row][i];
}

//III.
int col = 0;
while (col < values[0].length)
{
sum += values[row][col];
col++;
}

• (A) I only
• I will find the sum of all the values in the matrix, but it does not find the sum of a specific row.
• (B) II only
• II is correct, but III is also correct. This method can be completed by using a while loop or a for loop.
• (C) III only
• III is correct, but II is also correct. This method can be completed by using a for loop or a while loop.
• (D) II and III
• II and III both correctly add the values in the specified row.
• (E) I, II, and III
• II and III are correct, but I adds every value in the matrix, not just the specified row.
14-3-13: You have an array values filled with 50 integers. Which of the following correctly produces a random index of values?
• (A) (int) (Math.random() + 1) * 50
• This always returns 50. Math.random() + 1 calculates a value between 1 and 1.9, and when this value is cast as an int it becomes 1. 1 * 50 always returns 50.
• (B) (int) (Math.random() * 50) + 1
• This calculates a random number between 1 and 50, but indexes of arrays start at 0 and end at array.length - 1.
• (C) (int) (Math.random() + 1 * 50)
• This always returns 50. 1 * 50 returns 50 since multiplication takes precedence befores addition. The value of Math.random() + 50 always falls between 50.0 and 50.9, and this value becomes 50 when it is cast as an int.
• (D) (int) Math.random() * 50
• This always returns 0, since Math.random() returns a value between 0 and 0.9. When the value of Math.random() is cast an int, its value becomes 0. 0 * 50 returns 0.
• (E) (int) (Math.random() * 50)
• This correctly calculates a random index between 0 and 49 for the array.

14-3-14: Given the following code, what is returned by mystery(5364)?

public static int mystery(int num)
{
if (num < 10)
{
return 1;
}

else
{
return 1 + mystery(num / 10);
}
}

• (A) The method will produce an infinite loop.
• Eventually, the recursive calls will reach mystery(5). 5 is less than 10, so the base case will have been reached and the method will end.
• (B) 19
• This would be correct if the method found the sum of the digits in the given value, with an extra 1. Instead, the method finds the number of digits.
• (C) 4
• This method finds the number of digits in num.
• (D) 3
• This method finds the number of digits in num. Check your recursive call to make sure you reached the base case correctly.
• (E) 18
• This would be correct if the method added the digits in the value. Instead, the method simply finds the number of digits. Check the recursive call again.
14-3-15: Consider an array of integers that contains [12, 8, 4, 6, 13, 29, 7]. If the array is sorted from smallest to largest using an insertion sort method, what will be the order of the array after the third iteration of the sorting method?
• (A) [4, 6, 12, 8, 13, 29, 7]
• This is what would happen with two iterations of selection sort. Remember that selection sort only swaps two elements at a time, while insertion sort places elements in order in the sorted part of the array.
• (B) [4, 6, 7, 8, 13, 29, 12]
• This is what would happen if selection sort was used instead of insertion sort. Remember that selection sort only swaps two elements at a time, while insertion sort places elements in order in the sorted part of the array.
• (C) [4, 8, 12, 6, 13, 29, 7]
• This is what the array looks like after the second iteration. Do one more iteration.
• (D) [4, 6, 8, 12, 13, 29, 7]
• Using insertion sort, we start at the first index and sort the first two values to create a sorted array at the left side of the array. We repeat this step for the second index, creating a sorted array of three elements, and again for the third index, creating a sorted array of four elements.
• (E) [4, 6, 7, 8, 12, 13, 29]
• This is the final sorted array. Instead of three passes, it takes seven iterations to reach this state.

14-3-16: Consider the classes Car and Minivan, shown below. If obj has been instantiated later in the class as a Minivan, what is printed as a result of obj.drive()?

public class Car
{
public void drive()
{
System.out.print("Vroom vroom! ");
}
}

public class Minivan extends Car
{
public void drive()
{
super.drive();
System.out.print(" Let's go! ");
}
}

• (A) Vroom vroom! Let's go!
• The method drive has been overwritten in the Minivan class. Since obj is of type Minivan, the compiler will use the overwritten method. The overwritten method uses super() to call to the method of the parent class, so "Vroom vroom! " is printed. Then, the overwritten method prints out "Let's go! ".
• (B) Vroom vroom!
• Although the overwritten method has a call to the method in the parent class, there is another line of code that must be printed. The drive method has been overwritten for the Minivan class.
• (C) Let's go!
• This would be the case if the overwritten method did not make a call to the class in the parent class. Because the method has a call to the parent class before it does anything else, "Vroom vroom! " is printed.
• (D) Let's go! Vroom vroom!
• This would be the case if the parent method had been called after "Let's go! " had been printed.
• (E) This would result in a compile-time error.
• This code correctly compiles, so there are no errors present. The Minivan class can make a call to a method in the Car class using super, because the Minivan class extends the Car class.

14-3-17: Consider the following method changeArray. An array is created that contains [2, 8, 10, 9, 6] and is passed to changeArray. What are the contents of the array after the changeArray method executes?

public void changeArray(int[] data)
{
for (int k = data.length - 1; k > 0; k--)
data[k - 1] = data[k] + data[k - 1];
}

• (A) [2, 6, 2, -1, -3]
• This would be correct if data[k] was modified in the for-loop. In this for-loop, data[k - 1] is the element that changes.
• (B) [-23, -21, -13, -3, 6]
• This would be correct if data[k - 1] was subtracted from data[k]. Notice that for every instance of the for-loop, data[k] and data[k - 1] are added together and assigned to the index at data[k - 1].
• (C) [10, 18, 19, 15, 6]
• This would be correct if the for-loop began at 1 and continued to data.length - 1. Notice the for-loop indexing.
• (D) This method creates an IndexOutOfBounds exception.
• The indexing of this method is correct. The for-loop begins at the last index and ends at the second index, and the method does not access any values other than the ones specified.
• (E) [35, 33, 25, 15, 6]
• This method starts at the second-to-last index of the array and adds the value of the previous element to the element at index k - 1.
14-3-18: Which statement is equivalent to !( (x > 7) && !(y < 12) )?
• (A) (x <= 7) && (y < 12)
• Use A and B to represent the expressions -- A == (x > 7), B == !(y < 12). The AND needs to be changed to an OR.
• (B) (x <= 7) || (y < 12)
• Use A and B to represent the expressions -- A == (x > 7), B == !(y < 12)Using DeMorgan's law, !(A && B) is equivalent to !A || !B. The negation of (x > 7) is (x <= 7), and the negation of !(y < 12) is (y < 12).
• (C) (x > 7) || (y >= 12)
• Use A and B to represent the expressions -- A == (x > 7), B == !(y < 12)!(A && B) is NOT equivalent to (A || B). It should be (!A || !B). Also, (y >= 12) is equivalent to !(y < 12).
• (D) (x > 7) && (y >= 12)
• Use A and B to represent the expressions -- A == (x > 7), B == !(y < 12)!(A && B) is NOT equivalent to (A && B). !(y < 12) and (y >=12) mean the same thing; changing this does not make the statement the opposite.
• (E) (x <= 7) || (y >= 12)
• Use A and B to represent the expressions -- A == (x > 7), B == !(y < 12)!(A && B) is NOT equivalent to (!A && B). Changing !(y < 12) to (y >= 12) does not negate the statement; these two are equivalent.

14-3-19: Consider the following method evens, which finds the number of even numbers present in an array. Which of the following segments of code would correctly replace /* to be completed */?

public int evens(int [] arr)
{
int count = 0;

for (int x : arr)
{
/* to be completed */
}

return count;
}

// I
if (x % 2 == 0)
count++;

// II
if (x % 2 == 1)
count++;

// III
if (x / 2 == 0)
count++;

// IV
if (x / 2 == 1)
count++;

• (A) I only
• The modulus operator (%) can be used to find if numbers are even or odd. I checks that x is even correctly using x % 2 == 0.
• (B) II only
• II uses the modulus operator to count the number of odd numbers in the array. If x % 2 == 1, then the number is odd, not even.
• (C) III and IV only
• III and IV use the division operator, not the modulus operator. This does not check if the number is even.
• (D) I and II only
• I is correct, but II increments the counter for odd numbers, not even numbers.
• (E) II and IV only
• II counts the odd numbers instead of the even numbers. If x % 2 == 1, the number is odd, not even. IV does not use the modulus operator (%), which checks if numbers are even or odd.

14-3-20: Consider the method findMax, which uses sequential search to find the index of the largest value of an array. In which case would findMax not work properly?

public int findMax(int[] arr)
{
int maxVal = 0;
int index = 0;

for (int i = 0; i < arr.length; i++)
{
if (arr[i] > maxVal)
{
index = i;
maxVal = arr[i];
}
}
return index;
}

• (A) This method will work correctly for all arrays.
• This method will not work correctly for all arrays. Look at the starting value for maxVal, and how maxVal is compared to all the values of the array. What happens if every value in the array is less than maxVal?
• (B) The first value in the array is less than 0.
• Although this might present a problem if EVERY value in the array is less than 0, the compiler will move on to the next index without issue if the first value in the array is less than 0.
• (C) The first value in the array is equal to 0.
• This will not present a problem, as the if-statement has not been met and the for-loop will simply continue to the second element.
• (D) Every value in the array is greater than 0.
• If every value in the array is greater than 0, the method will work properly.
• (E) Every value in the array is less than 0.
• maxVal is set to zero, so if every number in the array is less than 0, the maxVal will remain 0. A better idea would be to set maxVal to the value of the first element in the array.
Next Section - Exam 3 for the AP CS A Exam (not timed)