Developing Algorithms FRQ Practice

Responses receive AI feedback against a rubric after submission. Scores are practice estimates.

Question 1 of 5

scores = [11,3,11,8]. Count equals 11. (a) Missing step inside FOR EACH value IN scores starting from count ← 0. (b) Final count? (c) Does stopping at the first 11 meet the same goal?

Question 2 of 5

A1: IF (a >= b) { DISPLAY (a) } ELSE { DISPLAY (b) } A2: DISPLAY (a) IF (b > a) { DISPLAY (b) } (a) a=5,b=5: each display? (b) a=2,b=9: each display? (c) Which matches "display exactly one value, the maximum"?

Question 3 of 5

items = [2,8,5]. Sort ascending via adjacent swaps. (a) Valid index-pair swap sequence (1-based). (b) List after each swap. (c) Why swapping indexes 1 and 3 alone does not finish?

Question 4 of 5

Have FindMax(list). Need FindMin(list). (a) How to modify the comparison step. (b) Min of [6,-2,4]? (c) One benefit of adapting FindMax.

Question 5 of 5

Decide whether n is evenly divisible by 3. (a) Boolean expression using MOD. (b) IF/ELSE displaying yes or no. (c) Why DISPLAY (n / 3) alone fails the yes/no goal.