Code.org AP Computer Science Principles Unit 6

This is known as a precise sequence of instructions for processes that can be executed by a computer and are implemented using programming languages.

• Function

• Parameter

• Algorithm

• Command

Which of the following is FALSE regarding algorithms?

• Option 1: Different algorithms can be developed to solve the same problem

• Option 2: Different code can never be written to implement the same algorithm

• Both Option 1 and 2 are true

• Both Option 1 and 2 are false

Every algorithm can be constructed on using:

• Sequencing

• Selection

• Iteration

• Questions

When your programming is achieving some desired outcome while minimizing wasted effort or resources, we would say that its:

• Top Notch

• Comparable

• Efficient

• Problematic

Looking at Lines 3 and 5 above, the "IF" statements in these particular parts of the algorithm are constructed with:

• Selection

• Iteration

• Sequencing

Placing Lines 1-9 of your algorithm in a particular order shows which of the following is important?

• Sequencing

• Selection

• Iteration

Looking at the image above, looping (through iteration) can be seen in which of the following lines of this algorithm?

• Line 2

• Line 7

• Line 3

• Line 9

The ordered steps in a program.

• Sequence

• If...Then...Else

• Conditional

• Value

________________ is a sequence of instructions (or algorithm) written in a language or code that a computer can understand and put into action. Must be accurate to be correct.

• Procedure

• Algorithm

• Program

• Loop/ Repeat

A student wants to create an algorithm that can determine, given any program and program input, whether or not the program will go into an infinite loop for that input. The problem the student is attempting to solve is considered an undecidable problem. Which of the following is true?

• It is possible to create an algorithm that will solve the problem for all programs and inputs, but the

  algorithm can only be implemented in a low-level programming language.

• It is possible to create an algorithm that will solve the problem for all programs and inputs, but the

  algorithm requires simultaneous execution on multiple CPUs.

• It is possible to create an algorithm that will solve the problem for all programs and inputs, but the

  algorithm will not run in reasonable time.

• It is not possible to create an algorithm that will solve the problem for all programs and inputs.