Introduction to Using Data Sets FRQ Practice

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

Question 1 of 5

Quillferry matinee tickets: Tuesday 12, Wednesday 19, Thursday 15. (a) Explain what a data set is and identify this collection as one. (b) Write numbered steps that total the tickets one value at a time. (c) Show the running total after each day.

Question 2 of 5

Cinderwell rainfall: Friday 4 mm, Saturday 0 mm, Sunday 9 mm. (a) Draw or describe a planning table for these readings. (b) Write numbered steps that find the rainiest day by looking at one value at a time. (c) Report the rainiest amount and day.

Question 3 of 5

Driftwood evening checkouts: Harbor Kite 1, Maple Drum 4, Soft Lantern 2, Night Ferry 5. (a) Write numbered steps that count titles with fewer than 3 checkouts, one title at a time. (b) Trace the count after each title. (c) Explain why stopping after Harbor Kite would be an incomplete algorithm.

Question 4 of 5

A student claims a rainfall algorithm cannot be designed without Java arrays. (a) Explain how written language or a diagram can represent the pattern instead. (b) Give one totaling algorithm and one "how many days had rain > 0" algorithm in words. (c) State how a table helps plan either algorithm.

Question 5 of 5

Use two data sets in one written plan. Quillferry tickets: 12, 19, 15. Cinderwell rain: 4, 0, 9. (a) Write steps that report the ticket total and, separately, the rainiest reading, processing each set one value at a time. (b) Explain why rain millimeters should not be added onto the ticket total. (c) Identify the shared one-at-a-time access pattern both algorithms use.