Introduction to Using Data Sets MCQ Practice

Question 1 of 10

Quillferry Box Office logs weekday matinee tickets in the table. Which sentence best describes that table?

Day Matinee tickets
Tue 12
Wed 19
Thu 15
  1. A. It is a data set: several related pieces of information collected together.
  2. B. It is a single boolean, because tickets are whole numbers.
  3. C. It is a printer, because the table might be posted.
  4. D. It cannot be a data set until someone writes a Java class.

Question 2 of 10

A clerk uses this plan on Quillferry's 12, then 19, then 15.

1. Set total to 0
2. Look at the next matinee-ticket value
3. Add that value to total
4. If unused values remain, go back to step 2
5. Report total

What total is reported?

  1. A. 19
  2. B. 3
  3. C. 46
  4. D. 12

Question 3 of 10

Which statement best describes how the Quillferry plan uses the data set?

  1. A. It ignores Wednesday because 19 is already large.
  2. B. It accesses each day's ticket count one at a time and updates a running total.
  3. C. It requires all three numbers to be stored in an ArrayList before step 1.
  4. D. It processes values only if they are printed as words, not digits.

Question 4 of 10

Cinderwell Garden logged rainfall in millimeters. Why would a student put the readings in a table before writing steps?

Day Rain (mm)
Fri 4
Sat 0
Sun 9
  1. A. Tables are only for cafeteria menus.
  2. B. A table hides the numbers so they cannot be processed.
  3. C. Planning is finished only after System.out.print is written.
  4. D. A table lays out each reading so the algorithm can be planned as "look at the next value."

Question 5 of 10

An algorithm reports the rainiest Cinderwell day by starting with Friday's 4 mm and replacing the stored maximum when a later reading is greater. Using 4, then 0, then 9, which result is reported?

  1. A. 9 mm (Sunday)
  2. B. 0 mm, because Saturday is in the middle
  3. C. 4 mm, because the first value can never be replaced
  4. D. 13 mm, the sum of Friday and Sunday

Question 6 of 10

Driftwood Branch lists evening checkouts. A clerk counts titles with fewer than 3 checkouts, one row at a time.

Title Checkouts
Harbor Kite 1
Maple Drum 4
Soft Lantern 2
Night Ferry 5

What count is reported?

  1. A. 4, the number of titles
  2. B. 12, the sum of checkouts
  3. C. 2, because Harbor Kite and Soft Lantern are the only rows below 3
  4. D. 5, the largest checkout number

Question 7 of 10

A student writes a rain-total plan that never returns to the next day.

1. Set total to 0
2. Add Friday's 4 mm to total
3. Report total

What is wrong with this plan as an algorithm for the whole weekend data set?

  1. A. It uses addition, which is never allowed with millimeters.
  2. B. It processes only the first value and never accesses Saturday or Sunday one at a time.
  3. C. It should have used a switch statement.
  4. D. Reporting a total is not a kind of algorithm.

Question 8 of 10

Which written pattern reports how many Cinderwell days had rain (a reading greater than 0) for 4, 0, and 9?

  1. A. Report 3, because the table has three rows.
  2. B. Report 0 only, because one day was dry.
  3. C. Report 13, the sum of all three readings.
  4. D. Start a count at 0; look at each reading; if it is greater than 0, add 1 to the count; after Sunday report 2.

Question 9 of 10

A flowchart for Driftwood checkouts shows: "next checkout number" to "if number < 3, add 1 to count" and an arrow back to "next checkout number" until the list ends. What is the purpose of the return arrow?

  1. A. To process the next title in the data set the same way
  2. B. To delete Maple Drum from the table
  3. C. To convert library data into ferry tickets
  4. D. To skip Soft Lantern every time

Question 10 of 10

A classmate says Quillferry's "which day sold the most matinee tickets" question cannot be planned without Java arrays. Which reply matches this topic?

  1. A. Arrays are the only way to look at more than one number.
  2. B. Ticket questions cannot use tables.
  3. C. Numbered steps can start with Tuesday's count and compare Wednesday and Thursday one at a time, keeping the day with the larger count.
  4. D. The only allowed written algorithm is printing the table with no processing.