9.2 Algorithms Cambridge iAS 9618

What is an algorithm?

• A solution to a problem expressed as a sequence of defined steps.

• A random sequence of actions without any structure.

• A process for generating random numbers.

• A single step in a computational process.

Which of the following is a characteristic of an algorithm?

• It must have a defined start and end, and must be unambiguous.

• It must involve continuous repetition without any end.

• It must only involve the manipulation of numbers.

• It does not need to have a clearly defined set of steps.

What is the purpose of using identifiers in algorithms?

• To represent data used by a problem in a meaningful way.

• To create random names that have no significance in the algorithm.

• To represent fixed values that never change.

• To represent complex mathematical formulas.

What should be included in an identifier table when representing data in an algorithm?

• Suitable names for the data, alongside a description of their purpose.

• Random names for each data element without explanation.

• Only numbers without any descriptive context.

• Detailed mathematical equations for every data point.

What is pseudocode used for in algorithm design?

• To describe the algorithm in a readable, human-understandable format without strict syntax.

• To write exact, machine-readable code.

• To generate random numbers in a program.

• To represent the final code output in a specific programming language.

Which of the following is a basic construct of pseudocode?

• Sequence

• Encryption

• Data mining

• Web design

What is the role of the sequence construct in pseudocode?

• To define steps that are executed one after the other.

• To make decisions based on conditions.

• To repeat steps multiple times.

• To manipulate and format data.

Which pseudocode construct is used for decision-making?

• Selection

• Sequence

• Iteration

• Sorting

Which pseudocode construct is used for repeating a set of steps?

• Iteration

• Sequence

• Selection

• Data storage

Which of the following is NOT an element of documenting an algorithm?

• Creating a random sequence of operations.

• Using pseudocode to express steps.

• Drawing a flowchart to represent the algorithm.

• Writing a structured English description.