2.1 - algorithms

Question 1

Computational thinking

Answer 1

The process of thinking about a problem using computational means in order to create a solution which a computer can implement.

Question 2

Abstraction

Answer 2

The process of removing irrelevant or unnecessary information from the problem in order to better understand the basic parts of it.

Question 3

Decomposition

Answer 3

The process of breaking a problem down into smaller parts to make it easier to solve

Question 4

Algorithmic thinking

Answer 4

The process of working out the individual steps needed to solve a problem in order to produce an algorithmic solution

Question 5

Algorithm

Answer 5

A sequence of logical instructions to carry out a particular task

Question 6

Structure Diagram

Answer 6

A diagram which shows in graphical format the steps needed to solve a
problem. There are several different types of structure diagram: for example a flow chart

Question 7

Pseudocode

Answer 7

A way of writing out algorithms or other computer programs in a way which sits somewhere between full sentences and computer code.

Question 8

Flowchart

Answer 8

A way of using pictures and shapes to represent the steps needed to solve a problem or that a program will take.

Question 9

Programming Language

Answer 9

A language which can be understood by computers to produce computer software.

Question 10

Error

Answer 10

Something wrong in computer code which causes it either to not run at all or to produce an incorrect output.

Question 11

Trace table

Answer 11

A table which records the values stored in each of a program’s variables at each stage through the program. It is a useful tool when trying to find errors in the code.

Question 12

Binary search

Answer 12

A way of searching an ordered list by looking at the middle item in the list, then comparing the items above or below depending on if the required value is higher or lower. This process repeats until the value is found or the end of the list is reached

Question 13

Linear search

Answer 13

A way of searching through a list items, checking them one at a time in order of how they appear in the list until the required value is found or the end of the end is reached.

Question 14

Bubble Sort

Answer 14

A way or sorting a list by comparing the items in a list, two at a time, and changing the order if needed. The process repeats until the list is in the correct order.

Question 15

Merge sort

Answer 15

A way of sorting a list by dividing it in two until each item is separated individually. Pairs of items are compared and placed in order until the list as a whole is ordered.

Question 16

Insertion sort

Answer 16

A way of sorting a list by working through the items one at a time and placing them in the correct position in the list.