APCSP Cumulative REview

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()

  }

"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 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

Consider the following code segment, which uses the variables r, s, and t.

r ← 1

s ← 2

t ← 3

r ← s

s ← t

DISPLAY (r)

DISPLAY (s)

• 11

• 12

• 23

• 32

A certain computer game is played between a human player and a computer-controlled player. Every time the computer-controlled player has a turn, the game runs slowly because the computer evaluates all potential moves and selects the best one.

Which of the following best describes the possibility of improving the running speed of the game?

• The game’s running speed can only be improved if the game is played between two human players instead of with the computer-controlled player.

• The game’s running speed might be improved by using a process that finds approximate solutions every time the computer-controlled player has a turn.

• The game’s running speed cannot be improved because computers can only be programmed to find the best possible solution.

• The game’s running speed cannot be improved because the game is an example of an algorithm that does not run in a reasonable time