algorithms

An algorithm is a precise set of rules or instructions to solve a specific problem or task.

The three main ways to design an algorithm are structure diagrams, flowcharts, and pseudocode.

A structure diagram shows hierarchical top-down design in a visual form, dividing problems into sub-problems.

True. Flowcharts use shapes to represent different functions to describe an algorithm.

Pseudocode uses short English words/statements to describe an algorithm.

A flowchart is a visual tool that uses shapes to represent different functions to describe an algorithm.

In a flowchart, lines represent the flow of control.

False. Pseudocode is more structured than writing sentences in English but is very flexible.

Inputs and outputs.

Sub-process.

Algorithms can be written using flowcharts, pseudocode, or high-level programming language code such as Python.

True. A well-designed algorithm should be interpretable by a new user who can explain what it does.

The purpose of an algorithm is to solve a problem.

Pseudocode is a method of writing algorithms using short English words/statements that is more structured than plain English but less formal than actual programming code.

Three ways to understand a complex algorithm are: look for comments in the code, consider the context of where the algorithm is being used, and test the algorithm with different inputs.

Initialisation refers to setting initial values for variables at the beginning of an algorithm.

False. The purpose of an algorithm should become clear by following its instructions, even if not explicitly stated.

An array in an algorithm is used to store multiple values under a single variable name, typically accessed by an index.

In pseudocode, "REPEAT...UNTIL" represents a loop that continues to execute until a specified condition is met.

The "IF...THEN...ELSE" structure in algorithms is used for decision-making, allowing different actions to be taken based on whether a condition is true or false.