Algorithmic Thinking

Question 1

what is an algorithm?

Answer 1

Is a sequence of steps that must be followed to complete a task

Question 2

Abstraction

Answer 2

The process of removing unnecessary details from a problem

Question 3

decomposition

Answer 3

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

Question 4

Linear search

Answer 4

Starting at the beginning of the data set, each item of data is examined until a match is made. Once the item is found, the search ends

Question 5

Binary search

Answer 5

A binary search checks the middle value in the
list. If that middle item is higher than the search
value it disregards the top half of the list. Then it
checks the middle of the remaining values. This
process repeats until the value is found, or no
data remains.

Question 6

Pseudocode

Answer 6

It can be used to draft algorithms to ‘dry run’ them before programming

Question 7

Trace tables

Answer 7

Trace tables are used alongside pseudocode to help test algorithms before they are programmed. This is called a ‘dry run’ test.