AP CSP 3.8 (Iteration)

• 
• 
• 
• 

Which of the following algorithms display all integers between 1 and 20, inclusive, that are not divisible by 3?

Select two answers.

• Step 1: Set x to 0.

  Step 2: Increment x by 1.

  Step 3: If x is not divisible by 3, then display x.

  Step 4: Repeat steps 2 and 3 until x is 20.

• Step 1: Set x to 0.

  Step 2: If x is divisible by 3, then display x.

  Step 3: Increment x by 1.

  Step 4: Repeat steps 2 and 3 until x is greater than 20.

• Step 1: Set x to 1.

  Step 2: If x is divisible by 3, then do nothing; otherwise display x.

  Step 3: Increment x by 1.

  Step 4: Repeat steps 2 and 3 until x is 20.

• Step 1: Set x to 1.

  Step 2: If x is divisible by 3, then do nothing; otherwise display x.

  Step 3: Increment x by 1.

  Step 4: Repeat steps 2 and 3 until x is greater than 20.

• The number 0 is displayed.

• The number 6 is displayed.

• The number 10 is displayed.

• Nothing is displayed; the program results in an infinite loop.

• I only

• II only

• I and II

• II and III

• 
• 
• 
• 

• REPEAT 1 TIMES

• REPEAT 2 TIMES

• REPEAT 3 TIMES

• REPEAT 4 TIMES