Skip to content
Marlbridge

AP® Computer Science A · Unit 2 · Topic 2.9

Implementing Selection and Iteration Algorithms: Topic Checklist (Computer Science A 2.9)

Specific I can statements for standard algorithms that combine selection and iteration, each linked to the guide section or practice question that tests it.

Work through the list without notes. If you cannot do a statement, follow its link, then come back. Guide = study guide; Practice = practice questions.

Understanding

  • I can name the five standard algorithms in this topic and say what each computes. (Guide: “Patterns you will use again and again”; Practice question 1)
  • I can explain why n % 10 and n / 10 take a number apart one digit at a time. (Guide: “The digits of an integer”; Practice questions 1 and 5)
  • I can explain what starting value each accumulator needs, and why. (Guide: the patterns table and Worked example 2; Practice question 4)
  • I can explain why sum / count with two ints is not the average. (Guide: “Frequency, minimum, maximum, sum and average”; Practice questions 3 and 8)

Skills

  • I can test divisibility with % and count or list the divisors of a number. (Guide: “Divisibility”; Practice questions 2 and 9)
  • I can write a loop that counts the digits that meet a condition. (Guide: Worked example 1; Practice question 7)
  • I can write a loop that finds a minimum or maximum, a sum and an average. (Guide: “Frequency, minimum, maximum, sum and average”; Practice question 10)
  • I can trace a digit loop in a table. (Guide: Worked example 1; Practice questions 1, 5 and 10)

Reasoning

  • I can find and fix a fault in a standard algorithm (bad start value, integer division, reset inside the loop). (Guide: Worked example 2; Practice questions 4, 6 and 8)
  • I can describe in words what a given loop computes. (Practice questions 1, 5 and 10)
  • I can say what a method returns when a loop finds no match (for example, a prime). (Guide: “Divisibility”; Practice question 9)

All ticked? Move on to the Topic 2.10 study guide, Implementing String Algorithms.

AP® and Advanced Placement® are trademarks registered by the College Board, which is not affiliated with, and does not endorse, this website. Marlbridge is an independent tuition provider. It is not an authorized AP course provider, an AP school or an exam centre, and these resources are not official College Board materials. Reading them or doing simulations does not meet the laboratory requirement of an AP science course.