Unit 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 simplify 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 specific task.

Question 6

Structure diagram

Answer 6

A diagram which shows in a graphical format the steps needed to solve a
problem.

Question 7

Pseudocode

Answer 7

A way of writing out algorithms 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 or 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.

Question 12

Search

Answer 12

Finding a value or piece of information within a set of data.

Question 13

Binary Search

Answer 13

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

Question 14

Advantage of binary search

Answer 14

Is more effective and time efficient for searching long lists

Question 15

Disadvantage of binary search

Answer 15

Can only work on ordered lists.

Question 16

Linear Search

Answer 16

A way of searching through a list items, checking them one at a time until the required value is found.

Question 17

Disadvantage of linear search

Answer 17

Is very time consuming to search long lists and big data sets

Question 18

Advantage of linear search

Answer 18

Somewhat effective and works on any list

Question 19

Sort

Answer 19

A way of placing information into a certain order, such as alphabetically or by number

Question 20

Bubble sort

Answer 20

A way of sorting a list by comparing the items in a list, two at a time, and changing the order, bubbling through until sorted.

Question 21

Merge Sort

Answer 21

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 is ordered

Question 21

Insertion Sort

Answer 21

A way of sorting a list by working through the items one at a time and inserting them in the correct position into an empty ‘sorted’ list.