This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on loop control and iteration mechanics. The for-loop structure ensures systematic traversal through arrays by using an index variable that increments from 0 to the array length minus one. In this problem, the for-loop header 'for (int i = 0; i < gradeList.length; i++)' controls the iteration, visiting each array element exactly once. Choice B is correct because the loop header specifically iterates once per index in gradeList, ensuring every grade is accessed through gradeList[i] and compared to the threshold exactly once. Choice A is incorrect because the cast to double only affects the average calculation, not the iteration count. To help students: Emphasize that for-loop headers control iteration count, not the loop body. Practice tracing through loops with index variables to see how each element is accessed exactly once.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, specifically while loops for indefinite iteration. While loops continue executing their body as long as the condition remains true, making them ideal for situations where the number of iterations is unknown beforehand. In this guessing game, the while loop continues as long as 'guess != secret', allowing the player to make multiple attempts until they guess correctly. Choice B is correct because the while loop allows repeated guesses until the conditional (guess != secret) becomes false, which happens when the correct guess is made. Choice A is incorrect because loops don't guarantee correctness of guesses, they just allow repetition. To help students: Use flowcharts to visualize how while loops check conditions before each iteration. Practice identifying when to use while loops versus for loops based on whether iteration count is known.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on conditional logic within loops. Selection statements allow algorithms to make decisions based on conditions, preventing invalid operations like creating negative inventory. In this inventory system, the nested if-statement 'if (amount <= inventoryCount)' acts as a guard condition before the decrement operation. Choice C is correct because the conditional 'amount <= inventoryCount' guards the decrement, only allowing purchases when sufficient inventory exists, thus preventing negative stock. Choice A is incorrect because while(true) creates an infinite loop that's broken by the END command, not preventing subtraction. To help students: Teach the concept of guard conditions that protect against invalid states. Practice writing conditions that validate operations before executing them, especially in business logic scenarios.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, specifically analyzing time complexity of nested loops. Time complexity measures how execution time grows with input size, and nested loops often multiply their iteration counts. In this traffic light algorithm, the outer loop runs 'cycles' times, and the inner loop always runs exactly 3 times (once for each light state). Choice B is correct because the inner loop has constant size (3 iterations), making the total iterations 3c, which simplifies to O(c) linear time complexity. Choice C is incorrect because two loops don't always imply quadratic time - it depends on whether both loops scale with input size. To help students: Emphasize that constant-size inner loops don't change the order of growth. Practice calculating iterations by multiplying loop counts and identifying which variables affect runtime.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on edge case handling and initialization. Proper initialization ensures algorithms work correctly even with minimal input, such as single-element arrays. In this weather analysis algorithm, both minTemp and maxTemp are initialized to temps[0], which handles the edge case where the array has only one element. Choice B is correct because initializing minTemp and maxTemp to temps[0] ensures that when temps has length 1, both variables already contain the only value, and the loop body never executes (since i starts at 1). Choice A is incorrect because starting i at 1 is intentional to avoid redundant comparison of temps[0] with itself. To help students: Teach the importance of initialization values that handle edge cases. Practice tracing algorithms with minimal inputs like single-element or empty arrays.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, specifically loop termination conditions. Compound conditions in while loops ensure multiple criteria can stop iteration, preventing infinite loops in interactive programs. In this limited guessing game, the while loop condition 'attempts < maxAttempts && !won' uses two criteria to control loop termination. Choice A is correct because the 'attempts < maxAttempts' condition bounds the iterations, ensuring the loop stops after maxAttempts regardless of whether the player wins, thus preventing infinite execution. Choice B is incorrect because feedback messages don't control loop termination, they only provide information to the player. To help students: Teach how compound conditions with && create multiple exit criteria. Practice writing loops that must terminate based on either success conditions or failure limits.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on time complexity analysis of sentinel-controlled loops. Sentinel values like 'END' terminate loops after processing a variable number of inputs, and complexity depends on the number of items processed. In this inventory algorithm, each transaction (BUY or RETURN) is processed exactly once before the END sentinel is encountered. Choice B is correct because the algorithm processes each of the n transactions once, performing constant-time operations (comparison and arithmetic) for each, resulting in O(n) linear time complexity. Choice C is incorrect because conditionals within the loop don't create nested iteration - they only affect which constant-time operation occurs. To help students: Clarify that time complexity counts iterations, not the number of conditional branches. Practice analyzing loops that process sequences terminated by sentinel values.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on modulo operations for periodic events. The modulo operator (%) helps detect when counters reach specific intervals, useful for implementing timed state changes. In this traffic light simulation, the condition 's % 5 == 0' triggers state changes every 5 seconds, but the state change occurs after printing the current state. Choice B is correct because GREEN is printed 5 times (when s = 1, 2, 3, 4, 5), then the state changes to YELLOW after the 5th print when s % 5 == 0 evaluates to true. Choice A is incorrect because it miscounts - GREEN is printed 5 times, not 4. To help students: Emphasize that loop body execution order matters - printing happens before the state change check. Practice tracing loops with modulo conditions to understand periodic behavior.

This question tests AP Computer Science A skills: understanding algorithms with selection and repetition, focusing on efficient algorithm modification. Efficient algorithms minimize redundant operations by combining related tasks within existing loops rather than creating additional passes through data. To count grades above a threshold while already iterating through the array, the most efficient approach is to add the counting logic within the existing loop. Choice B is correct because adding an if statement inside the existing loop to increment countAbove allows both tasks (summing valid grades and counting above-threshold grades) to be accomplished in a single pass through the data. Choice A is incorrect because adding a second full loop would double the time complexity unnecessarily. To help students: Emphasize the efficiency gained by combining related operations in a single loop. Practice identifying opportunities to merge similar tasks that process the same data.