Route 4

What is an algorithm defined as?

• A plan, or a well-defined set of step-by-step instructions, to solve a problem

• A random set of instructions

• A single step to solve a problem

• A complex mathematical formula

Which of the following is NOT a purpose of an algorithm?

• Automate calculations

• Process computational actions

• Support problem solving

• Increase hardware speed

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

• Be clear, with clearly defined steps

• Have clearly defined inputs and outputs

• Be complex and difficult to understand

• Be language independent

What is one of the advantages of algorithms?

• They are difficult to understand

• They are a step-by-step representation of a solution to a given problem

• They require extensive hardware

• They are always time-consuming

What is one of the disadvantages of algorithms?

• They are easy to understand

• They are always efficient

• Creating a complete algorithm can be time-consuming

• They are always language dependent

What does the characteristic of 'Finiteness' in an algorithm imply?

• The algorithm should solve the problem in a given number of steps

• The algorithm can run indefinitely

• The algorithm should be complex

• The algorithm should be language dependent

What does 'Unambiguous' mean in the context of algorithms?

• The steps should be clear and precise

• The steps should be vague

• The steps should be complex

• The steps should be language dependent

What is meant by 'Iteration' in an algorithm?

• The algorithm should use continuous steps

• The algorithm should use discrete steps and repeat until the required output is produced

• The algorithm should be written in a single step

• The algorithm should not repeat any steps

What does 'Selection' in an algorithm refer to?

• Any input into the algorithm should lead to a specified step

• The algorithm should not have any inputs

• The algorithm should have only one step

• The algorithm should be language dependent

What does 'Feasibility' mean in the context of algorithms?

• The algorithm should be impossible to implement

• The algorithm should be implemented with the specified and defined resources

• The algorithm should be complex

• The algorithm should be language dependent