This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal for filtering even numbers involves checking each element with the modulo operator and collecting those where n % 2 == 0. Key principles include understanding that even numbers have no remainder when divided by 2. In this problem, the array given is [7, 8, 9, 10, 11, 12], and the task is to filter for even numbers. Choice A is correct because 8, 10, and 12 are the even numbers in the array (8%2=0, 10%2=0, 12%2=0). Choice B ([7, 9, 11]) is incorrect because it results from filtering for odd numbers instead, a common mistake when students reverse the condition or misunderstand modulo operations. To help students: Emphasize testing the modulo condition with specific values. Practice distinguishing between even (n%2==0) and odd (n%2==1) filtering conditions.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal for summation involves accessing each element and accumulating their values into a running total. Key principles include initializing a sum variable to 0 and adding each array element to this accumulator. In this problem, the array given is [1, 2, 3, 4, 5], and the task is to find the sum of all elements. Choice B is correct because 1 + 2 + 3 + 4 + 5 equals 15, the accurate sum of all array elements. Choice C (120) is incorrect because it results from multiplying the elements instead of adding them (1×2×3×4×5 = 120), a common mistake when students confuse summation with product operations. To help students: Emphasize the importance of using the correct operator (+= for sum, *= for product). Practice tracing through accumulator patterns with small arrays to build intuition.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal for filtering involves checking each element against a condition and collecting those that meet the criteria. Key principles include using modulo operator (%) to check for even numbers and building a new collection with matching elements. In this problem, the array given is [1, 2, 3, 4, 5, 6], and the task is to filter for even numbers (where n % 2 == 0). Choice A is correct because it accurately identifies that 2, 4, and 6 are the even numbers in the array. Choice B ([1, 3, 5]) is incorrect because it results from filtering for odd numbers instead of even, a common mistake when students confuse the modulo conditions or misunderstand what 'even' means. To help students: Emphasize the difference between n % 2 == 0 (even) and n % 2 == 1 (odd). Practice with various filtering conditions to build confidence in conditional logic during traversal.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal for finding maximum values involves comparing each element against a running maximum, updating when a larger value is found. Key principles include initializing the maximum to the first element or a very small value, then systematically comparing all elements. In this problem, the array given is [-3, 0, 2, 7, -1], and the task is to find the maximum value through traversal. Choice B is correct because 7 is indeed the largest value in the array, found by comparing all elements sequentially. Choice C (-3 as maximum) is incorrect because it results from only checking the first element or reversing the comparison logic, a common mistake when students confuse minimum and maximum algorithms. To help students: Emphasize tracing through the algorithm step-by-step with the actual values. Practice with arrays containing negative numbers to ensure proper handling of all cases.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal involves accessing each element in a sequence to perform operations like counting occurrences of a specific value. In this problem, the array given is [5, 4, 3, 4, 2, 4], and the task is to count how many times the number 4 appears. The operation requires iterating from index 0 to 5 and checking if each element equals 4. Choice A is correct because it accurately reflects that 4 appears at indices 1, 3, and 5, giving us 3 occurrences total. Choice B (2 occurrences) is incorrect because it results from missing one of the 4s, a common mistake when students lose track during manual counting or have an off-by-one error in their loop. To help students: Emphasize the importance of careful iteration through all indices and using a counter variable to track occurrences. Practice with arrays containing duplicate values to build pattern recognition skills.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array reversal by swapping elements involves exchanging elements from opposite ends of the array during traversal. Key principles include using the swap algorithm correctly and stopping at the midpoint to avoid re-reversing. In this problem, the array given is ["red", "blue", "green"], and the task is to reverse it by swapping elements. Choice A is correct because it shows the proper reversal: "green" moves to position 0, "blue" stays in position 1 (middle element in odd-length array), and "red" moves to position 2. Choice D (original order) is incorrect because it results from either not performing any swaps or swapping twice, a common mistake when students don't understand the stopping condition. To help students: Emphasize visualizing each swap operation. Practice with both odd and even length arrays to understand different midpoint behaviors.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array traversal for counting occurrences involves checking each element against a target value and incrementing a counter when matches are found. Key principles include initializing a counter to 0 and systematically checking all array positions. In this problem, the array given is [-2, 1, -2, 3, -2, 4], and the task is to count occurrences of -2. Choice B is correct because -2 appears at indices 0, 2, and 4, giving us 3 occurrences total. Choice A (2 occurrences) is incorrect because it results from missing one instance of -2, possibly due to an off-by-one error or stopping the loop early. To help students: Emphasize the importance of checking all indices from 0 to length-1. Practice with negative numbers to ensure students don't confuse negative values with subtraction operations.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Array reversal using index-based traversal involves swapping elements from opposite ends of the array, working inward until the middle is reached. Key principles include using two pointers (start and end) and swapping elements at these positions. In this problem, the array given is ["apple", "banana", "cherry", "date"], and the task is to reverse it using index-based traversal. Choice A is correct because it shows the proper reversal: "date" moves to position 0, "cherry" to position 1, "banana" to position 2, and "apple" to position 3. Choice D (alphabetical order) is incorrect because it results from sorting the array instead of reversing it, a common mistake when students confuse different array operations. To help students: Emphasize visualizing the swap operations and using the two-pointer technique. Practice with arrays of different sizes to understand the stopping condition.

This question tests AP Computer Science A array traversal skills, specifically implementing and understanding basic iteration over data structures. Finding the maximum value through array traversal involves comparing each element against a running maximum and updating when a larger value is encountered. Key principles include proper initialization and complete traversal of all elements. In this problem, the array given is [10, -4, 6, 6, 2], and the task is to find the maximum value. Choice C is correct because 10 is indeed the largest value in the array, found at index 0. Choice A (6 as maximum) is incorrect because it results from starting the comparison at index 1 and missing the first element, a common mistake when students improperly initialize their maximum variable. To help students: Emphasize always considering all elements including the first one. Practice with arrays where the maximum is at different positions to avoid pattern-based assumptions.