APCSP Cumulative Test 2

Choose 1 answer:

• REPEAT 2 TIMES

  {

  walkForward()

  turnRight()

  walkForward()

  turnRight()

  }

• REPEAT 2 TIMES

  {

  walkForward()

  turnRight()

  walkForward()

  turnLeft()

  turnLeft()

  }

• REPEAT 2 TIMES

  {

  walkForward()

  turnRight()

  walkForward()

  turnLeft()

  }

• REPEAT 2 TIMES

  {

  walkForward()

  turnLeft()

  walkForward()

  turnRight()

  }

An algorithm will be used to calculate the difference between the smallest and largest values in a list. For the list of [10, 3, 5, 6], it should calculate a difference of 7.

There are two proposals for the algorithm:

Algorithm 1: Set minVal to the first value in the list and maxVal to the last value in the list. Iterate through each number in the list. If the number is greater than maxVal, store it in maxVal. If the number is less than minVal, store it in minVal. After loop, set maxDiff to the difference between maxVal and minVal.

Algorithm 2: Set minVal to 1000 and maxVal to 0. Iterate through each number in the list. If the number is greater than maxVal, store it in maxVal. If the number is less than minVal, store it in minVal. After loop, set maxDiff to the difference between maxVal and minVal.

Which of these statements are true about these algorithms?

I. Algorithm 1 does not work on lists where the smallest value is at the start of the list or the largest value is at the end of the list.

II. Algorithm 2 does not work on lists that contain all negative numbers or all numbers over 1000.

Choose 1 answer:

Choose 1 answer:

• I

• II

• I and II

• Neither I or II

"Aba speak" is a game invented by school children to disguise what they're speaking.

When speaking, they transform each word following this algorithm:

For each letter in word:

If letter is vowel:

Add "b" after

Add that letter after "b"

Following that algorithm, how would they transform the word "avocado"?

Choose 1 answer:

Choose 1 answer:

• abvobcabdob

• avabocabadabo

• abavobocabadobo

• abavbvobocbcabadbdobo

• abavobacabadoba

Determine what is printed by the following code.

values ⬅ [5, 6, 7, 0, 3, 3]

baz ⬅ 0

FOR EACH value IN values

{

if( value ≥ 7 )

{

baz ⬅ baz + 1

}

}

DISPLAY( baz )

• 1

• 0

Determine what is printed by the following code.

list ⬅ [11, 2, 8, 6, 4, 2, 5, 6, 9, 12]

fizz ⬅ 0

thud ⬅ 0

FOR EACH item IN list

{

if( item MOD 3 = 2 )

{

thud ⬅ thud + 1

}

fizz ⬅ fizz + 1

}

DISPLAY( thud / fizz )

• 0

• 1

• 0.5

• 5/10

A programmer for a weather website needs to display the proportion of days with freezing temperatures in a given month.

Their algorithm will operate on a list of temperatures for each day in the month. It must keep track of how many temperatures are below or equal to 32. Once it's done processing the list, it must display the ratio of freezing days over total days.

Which of these correctly expresses that algorithm in pseudocode?

• numFreezing ← 0

  numDays ← 0

  FOR EACH temp IN temps {

  IF (temp ≤ 32) {

  numFreezing ← numFreezing + 1

  }

  numDays ← numDays + 1

  DISPLAY(numFreezing/numDays)

  }

• numFreezing ← 0

  numDays ← 0

  FOR EACH temp IN temps {

  IF (temp ≤ 32) {

  numFreezing ← numFreezing + 1

  }

  numDays ← numDays + 1

  }

  DISPLAY(numFreezing/numDays)

• numFreezing ← 0

  numDays ← 0

  FOR EACH temp IN temps {

  IF (temp < 32) {

  numFreezing ← numFreezing + 1

  }

  numDays ← numDays + 1

  }

  DISPLAY(numFreezing/numDays)

• numFreezing ← 0

  numDays ← 0

  FOR EACH temp IN temps {

  IF (temp ≤ 32) {

  numFreezing ← numFreezing + 1

  numDays ← numDays + 1

  }

  }

  DISPLAY(numFreezing/numDays)

A programmer is deciding between using a linear or binary search to find a target value in a sorted list. Which of the following is true?

• In all cases, a binary search of a sorted list requires fewer comparisons than a linear search.

• Generally, the advantage of using a binary search over a linear search increases as the size of the list increases.

• A linear search will generally run faster than a binary search because a linear search requires fewer lines of code to implement.

• Using a linear search is preferable to using a binary search if there is a chance that the target may not be found in the list.

An algorithm has been developed to compute the sum of all the elements in a list of integers.

Which of the following programming structures must be added to the existing algorithm so that the new algorithm computes the sum of only the even integers in the list?

• Iteration

• Searching

• Selection

• Sequencing

An algorithm will be used to identify the maximum value in a list of one or more integers. Consider the two versions of the algorithm below.

Algorithm I : Set the value of a variable max to − 1. Iterate through the list of integer values. If a data value is greater than the value of the variable max, set max to the data value.

Algorithm II : Set the value of a variable max to the first data value. Iterate through the remaining values in the list of integers. If a data value is greater than the value of the variable max, set max to the data value.

Which of the following statements best describes the behavior of the two algorithms?

• Both algorithms work correctly on all input values.

• Algorithm I always works correctly, but Algorithm II only works correctly when the maximum value is not the first value in the list.

• Algorithm II always works correctly, but Algorithm I only works correctly when the maximum value is greater than or equal to − 1.

• Neither algorithm will correctly identify the maximum value when the input contains both positive and negative input values.

Central High School keeps a database of information about each student, including the numeric variables numberOfAbsences and gradePointAverage. The expression below is used to determine whether a student is eligible to receive an academic award.

(numberOfAbsences ≤ 5) AND (gradePointAverage > 3.5)

Which of the following pairs of values indicates that a student is eligible to receive an academic award?

• numberOfAbsences = 3, gradePointAverage = 3.5

• numberOfAbsences = 5, gradePointAverage = 3.8

• numberOfAbsences = 6, gradePointAverage = 3.4

• numberOfAbsences = 6, gradePointAverage = 3.6