Algorithm Behavior and Search Techniques

The video tutorial by Sandy Cha from Riverside Brookfield High School covers key concepts in AP CS Principles, focusing on algorithms and programming. It includes analysis of code segments, loops, sum calculation programs, robot movement problems, and search algorithms. The session emphasizes understanding the effects of code changes, iteration, and the behavior of procedures, providing practical examples and problem-solving strategies.

Which of the following changes will not affect the results when the code segment is executed?

• Changing line three to a is B + 20

• Changing line three to B is 20

• Changing line three to B is 10

• Changing line three to a is B + 10

What is the value of result after running the program with Y as a positive integer?

• 3 to the Y power

• Y + 3

• 3Y

• Y cubed

Which of the following best describes the behavior of the two programs intended to calculate the sum of integers from one to n?

• Program two displays the correct sum but program one does not

• Program one displays the correct sum but program two does not

• Neither one nor two displays the correct sum

• Both one and two display the correct sum

Which of the following is a possible result of the robot's movement?

• Directly in the middle of the grid facing up

• Facing down in the same spot at the bottom left

• Facing in the second to the top row towards the right

• Facing to the left in the bottom row

Which initial values for X, Y, and Z can be used to show that the segment does not work as intended?

• X = 3, Y = 2, Z = 1

• X = 1, Y = 2, Z = 3

• X = 1, Y = 3, Z = 2

• X = 2, Y = 3, Z = 1

What does the procedure return when the initial value of number is even?

• True

• False if the number is greater than two

• False

• True if the number is greater than two

Which of the following best describes the result of running the procedure with a positive integer parameter?

• Returns true if the initial value is even, otherwise false

• Returns true if the initial value is two, otherwise false

• Returns true if the initial value is greater than two, otherwise false

• Returns true if the initial value is odd, otherwise false

Which algorithm works correctly when finding the maximum value in a list of integers?

• Neither algorithm works correctly

• Algorithm 1 works only when the maximum is greater than or equal to negative 1

• Algorithm 2 always works correctly

• Algorithm 1 always works correctly

In all cases, does a binary search require fewer comparisons than a linear search?

• Yes, always

• Yes, if the list is unsorted

• No, if the target is the first element

• No, if the list is small

What is the general advantage of using a binary search over a linear search?

• Binary search is faster for small lists

• Linear search is preferable for sorted lists

• Binary search's advantage increases as the list size increases

• Binary search requires fewer lines of code