AP Principles 3.6, 3.7, 3.8, 3.9, 3.10 MCQ - Multiple Choice Questions

Sep 20, 2026

Uploaded by Jiven

AP Computer Science Principles Test Booklet focused on selecting correct algorithms for specified scenarios. Includes questions on flowchart execution results, pairing-based methods to identify the earliest birthdays from month and day, and updating maximum/minimum scores in a running game. Additional items address robot movement strategies on grid worlds with obstacles and conditional rules, including using REPEAT-UNTIL loops and procedures to reach a goal state. Suitable for MCQ assessment of algorithm reasoning and logic.

LanguageEnglish

CategoryExam

FormatPDF

Pages99

Reading Time4 h 9 min

AccessFree to download

Multiple-choice questions

Algorithm tracing and flowcharts

Birthday identification algorithms

Updating maximum and minimum scores

Robot pathfinding in grid worlds

REPEAT-UNTIL and procedure-based control logic

Conditional motor and gate control algorithm

AP COMPUTER SCIENCE PRINCIPLES Test Booklet AP Principles 3.6, 3.7, 3.8, 3.9, 3.10 MCQ 1. A flowchart is a way to visually represent an algorithm. The flowchart below uses the following building blocks. What is displayed as a result of executing the algorithm in the flowchart? Test Booklet AP Principles 3.6, 3.7, 3.8, 3.9, 3.10 MCQ (A) 5 (B) 15 (C) 1 2 3 4 (D) 1 2 3 4 5 2. Suppose a large group of people in a room were all born in the same year. Consider the following three algorithms, which are each intended to identify the people in the room who have the earliest birthday based on just the month and day. For example, a person born on February 10 is considered to have an earlier birthday than a person born on March 5. Which of the three algorithms will identify the correct people? I. All the people in the room stand up. All standing people form pairs where possible, leaving at most one person not part of a pair. For each pair, the person with the earlier birthday remains standing, while the other person in the pair sits down. If there is a tie, both people sit down. Any individual not part of a pair remains standing. Continue doing this until only one person remains standing. That person has the earliest birthday. II. All the people in the room stand up. All standing people form pairs with another standing person that they have not previously been paired with where possible, leaving at most one person not part ofa pair. For each pair, the person with the earlier birthday remains standing, while the other person in the pair sits down. If there is a tie, both people in the pair remain standing. Any individual not part ofa pair remains standing. Continue doing this until only one person remains standing or all persons standing have the same birthday. Anyone still standing has the earliest birthday. III. Beginning with the number 1, ask if anyone was born on that day of any month. Continue with the numbers 2, 3, and so on until a positive response is received. If only one person responds, that person has the earliest birthday. If more than one person responds, determine which person was born in the earliest month, and that person or those persons have the earliest birthday. (A) I only (B) II only (C) I and II (D) II and III 3. A certain game keeps track of the maximum and minimum scores obtained so far. If num represents the mostrecent score obtained, which of the following algorithms correctly updates the values of the maximum and the minimum? (A) Ifthe nummaxiis grmume, asteetrtthhean thmaxeimmuinimumm equa,l setot the mnuminimum equal to num. Otherwise, if num is greater than (B) Ifmanxium imums, lessetstthan the minimumhe maximum equal, steot thenumminimum equal to num. Otherwise, if num is greater than the (C) Ifmanxium imums, lessetstthan the minimumhe maximum equal, steot thenumminimum equal to num. Otherwise, if num is less than the (D) Ifmanxium imums, grseetattheerthmanaxithmuemminimumequal to, set thnume minimum equal to num. Otherwise, if num is less than the Test Booklet AP Principles 3.6, 3.7, 3.8, 3.9, 3.10 MCQ 4. The figure below shows four grids, each containing a robot represented as a triangle. The robot cannot move to a black square or move beyond the edge of the grid. Which of the following algorithms will allow the robot to make a single circuit around the rectangular region of black squares, finishing in the exact location and direction that it started in each of the four grids? Test Booklet AP Principles 3.6, 3.7, 3.8, 3.9, 3.10 MCQ (A) (B) (C) (D) Step 1: Keep moving forward, one square at a time, until the square to the right of the robot is black. Step 2: Turn right and move one square forward. Step 3: Repeat steps 1 and 2 three more times. Step 1: Keep moving forward, one square at a time, until the square to the right of the robot is no longer black. Step 2: Turn right and move one square forward. Step 3: Repeat

FAQs

How do you determine the result shown by executing the flowchart in the first question?

Evaluate the flowchart using the specified building blocks and follow the logic to identify which answer choice matches the final displayed result.

Which birthday-identification algorithm(s) correctly find the people with the earliest birthday?

Compare algorithms I, II, and III based on how ties are handled and how pairing or counting proceeds; the correct options are determined by matching those behaviors to the intended earliest birthday selection.

What replacement code can move the robot into the gray square in question 5?

Use the given REPEAT UNTIL condition and choose the replacement steps that advance the robot appropriately until the GoalReached procedure becomes true, then select the matching option.

Sep 20, 2026

Uploaded by Jiven