Introduction to Algorithms

What is the core definition of an algorithm?

• A complex computer program.

• A set of random instructions.

• A well-defined, step-by-step procedure.

• A graphical representation of data.

Which of the following is NOT a key characteristic of an algorithm?

• Finiteness.

• Ambiguity.

• Defined Inputs.

• Logical Sequencing.

"An algorithm must always terminate after a finite number of steps." This describes which characteristic?

• Unambiguousness.

• Defined Outputs.

• Finiteness.

• Logical Sequencing.

"Each step must be clearly and precisely defined." This describes which characteristic?

• Defined Inputs.

• Unambiguousness.

• Finiteness.

• Defined Outputs.

What is the purpose of "defined inputs" in an algorithm?

• To make the algorithm run faster.

• To specify the data the algorithm will work with.

• To make the algorithm easier to read.

• To define the final result.

"The steps must be arranged in a specific, logical order." This describes which characteristic?

• Finiteness.

• Defined Outputs.

• Logical Sequencing.

• Unambiguousness.

Structured English is used to:

• Write complex mathematical formulas.

• Design computer hardware.

• Write algorithms in a clear, understandable way.

• Create graphical user interfaces.

In Structured English, what keyword is used to indicate the starting point of an algorithm?

• START

• BEGIN

• INIT

• RUN

What keyword is commonly used in structured english to show the result of an algorithm?

• RESULT

• SOLVE

• OUTPUT

Which of the following is a good example of an algorithm in everyday life?

• A random guess.

• Following a recipe.

• A philosophical debate.

• A painting.