Search Header Logo

AP CSP 3.10 (Lists) Pt. 2

Authored by Herman Galioulline

Computers

9th - 12th Grade

Used 36+ times

AP CSP 3.10 (Lists) Pt. 2
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

About

This quiz focuses on list manipulation and algorithm analysis within the context of computer science programming. The content is designed for AP Computer Science Principles students, typically found at the high school level (grades 10-12). The questions assess students' understanding of list traversal algorithms, debugging procedures that count occurrences of values in lists, and analyzing the correctness of maximum-value finding algorithms. Students need to demonstrate proficiency in tracing through algorithmic steps, identifying logical errors in code, comparing algorithm efficiency and correctness, and understanding how variables are updated during iteration. The core concepts require students to think systematically about loop structures, conditional statements, variable initialization, and the relationship between algorithm design and expected outcomes. Created by Herman Galioulline, a Computers teacher in CH who teaches grade 9-12. This quiz serves as an excellent formative assessment tool for AP Computer Science Principles Unit 3.10, specifically targeting list processing concepts. Teachers can deploy this quiz as a warm-up activity to gauge student understanding before diving deeper into complex list algorithms, or use it as targeted practice following instruction on list manipulation techniques. The question format makes it ideal for homework assignments where students can work through algorithm tracing at their own pace, while also serving as an effective review tool before summative assessments. This assessment directly supports learning objectives related to AP CSP Computational Thinking Practices, particularly analyzing algorithms for correctness and identifying errors in programming constructs involving lists and iteration.

    Content View

    Student View

5 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

17

14

11

4

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

Step 3: Increase the value of position by 1.

Step 4: Repeat steps 2 and 3 until the value of count is greater than 100.

Step 3: Increase the value of position by 1.

Step 4: Repeat steps 2 and 3 until the value of position is greater than n.

Step 3: Repeat step 2 until the value of count is greater than 100.

Step 4: Increase the value of position by 1.

Step 3: Repeat step 2 until the value of position is greater than n.

Step 4: Increase the value of count by 1.

3.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

The following procedure is intended to return the number of times the value val appears in the list myList. The procedure does not work as intended.


Which of the following changes can be made so that the procedure will work as intended?

Changing line 6 to IF(item = count)

Changing line 6 to IF(myList[item] = val)

Moving the statement in line 5 so that it appears between lines 2 and 3

Moving the statement in line 11 so that it appears between lines 9 and 10

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

An algorithm will be used to identify the maximum value in a list of one or more integers. Consider the two versions of the algorithm below.


Algorithm I : Set the value of a variable max to − 1. Iterate through the list of integer values. If a data value is greater than the value of the variable max, set max to the data value.


Algorithm II : Set the value of a variable max to the first data value. Iterate through the remaining values in the list of integers. If a data value is greater than the value of the variable max, set max to the data value.


Which of the following statements best describes the behavior of the two algorithms?

Both algorithms work correctly on all input values.

Algorithm I always works correctly, but Algorithm II only works correctly when the maximum value is not the first value in the list.

Algorithm II always works correctly, but Algorithm I only works correctly when the maximum value is greater than or equal to − 1.

Neither algorithm will correctly identify the maximum value when the input contains both positive and negative input values.

5.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

A teacher stores the most recent quiz scores for her class in the list scores. The first element in the list holds the maximum possible number of points that can be awarded on the quiz, and each remaining element holds one student’s quiz score. Assume that scores contains at least two elements. Which of the following code segments will set the variable found to true if at least one student scored the maximum possible number of points on the quiz and will set found to false otherwise?

Media Image
Media Image
Media Image
Media Image

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?