Key Definitions - 2.1

Question 1

Algorithm

Answer 1

A set of instructions that are all in order to complete a task

Question 1

Computational thinking

Answer 1

Thinking critically and logically when solving a problem. Being able to analytically solve a problem.

Question 2

Decomposition

Answer 2

Breaking down a complex problem into smaller problems so it is more manageable to solve

Question 3

Abstraction

Answer 3

Removing the unnecessary parts of a program so that you only focus on the necessary parts

Question 4

Searching Algorithm

Answer 4

A type of algorithm used to search through a data set to find a specific piece of data

Question 5

Binary Search

Answer 5

A type of searching algorithm. The data set must be in order

Question 6

Linear Search

Answer 6

A type of searching algorithm where the data set doesn’t need to be in order

Question 7

Sorting Algorithm

Answer 7

A type of algorithm used to sort a data set into a specific order.

Question 8

Bubble Sort

Answer 8

A type of algorithm used to sort a data set into a specific order. The data set is passed through, and
two pieces of data are looked at in turn. The process does not stop until a pass is completed without moving any data.

Question 9

Merge Sort

Answer 9

A type of algorithm used to sort a data set into a specific order. The data set is broken up into pairs. Each pair is reorganised in turn. Pairs are then merged together and reorganised. This process is repeated until the whole data set is merged and reorganised.

Question 10

Insertion Sort

Answer 10

A type of algorithm used to sort a data set into a specific order. A new, temporary list is created, and each piece of data is placed into the correct place in
the new list.

Question 11

Pseudocode

Answer 11

A midpoint between programming syntax and written
language. It is not syntax specific therefore can easily be converted to programming code in any language.

Question 12

Flow Diagram

Answer 12

A way of representing algorithms using shapes. All shapes connect up creating a flow

Question 13

Terminator (flow diagram)

Answer 13

Used to stop and start

Question 14

Process (flow diagrams)

Answer 14

Used to give an instruction

Question 15

Decision (flow diagram)

Answer 15

Asks a yes/no question

Question 16

Data (flow diagram)

Answer 16

Used to show input/output within a flow diagram

Question 17

Sub-Program (flow diagram)

Answer 17

Created as a separate flow diagram, which is then called in the main flow diagram

Question 18

Trace Table

Answer 18

Used to test an algorithm for logic errors by simulating the flow of execution