Fundamental Of Algorithms

Question 1

Define the term ‘algorithm’

Answer 1

An algorithm is a logical, step-by-step process for solving a problem.

Question 2

Explain what is meant by decomposition

Answer 2

Decomposition involves breaking down a complex problem or system into smaller parts that are more manageable and easier to understand.

Question 3

Explain what is meant by ‘abstraction’

Answer 3

Abstraction is the process of filtering out - essentially ignoring - the characteristics of problems that are not needed in order to concentrate on those that are needed. It is also the filtering out of specific details.

Question 4

How to interpret pseudocode:

Question 5

How to write pseudocode:

Answer 5

INPUT – indicates a user will be inputting something
OUTPUT – indicates that an output will appear on the screen
WHILE – a loop (iteration that has a condition at the beginning)
FOR – a counting loop (iteration)
REPEAT – UNTIL – a loop (iteration) that has a condition at the end
IF – THEN – ELSE – a decision (selection) in which a choice is made
any instructions that occur inside a selection or iteration are usually indented

Question 6

How to identify inputs, processes and outputs within a given algorithm:

Question 7

How to describe the purpose of a given algorithm:

Question 8

Define the term ‘efficiency’ regarding algorithms

Answer 8

Efficiency looks at how much time it takes to run a particular algorithm and how much space is needed. By using both measurements, an algorithm that looks much more complex can actually be more efficient.

Question 9

Compare different algorithms’ efficiencies