paper 2 section 7

Question 1

Trace Tables

Answer 1

Used to show what happens to variables during a program

Question 2

Syntax Error

Answer 2

An error in the grammar of the program - the code will not run
name=rina
print(name)

Question 3

Merge Sort

Answer 3

Splits the data into individuals and then sorts and continuously re-pairs it

Question 4

Logic Error

Answer 4

An error where the code runs, but produces an unexpected result/incorrect output
name=”rina”
print(“name”)

Question 5

Linear Search

Answer 5

Goes through each number one by one, until the required value is found
Doesn’t need an ordered list, however it’s much slower than binary searching

Question 6

Insertion Sort

Answer 6

Takes one piece of data and places it in the correct position in a new list

Question 7

Flowchart Symbols

Answer 7

rectangle = square
paralellogram = input/output
diamond = decision
square in square = sub program
circle square = terminal

Question 8

Decomposition

Answer 8

Breaking down a complex problem into smaller, manageable parts which are easier to solve.

Question 9

Bubble Sort

Answer 9

Go through the array, comparing each number to the one next to it, if it’s bigger swap it.
After the first round the last number is in the right place
Repeat this for the other numbers. Each time reducing the number of comparisons by 1

Question 10

Binary Search

Answer 10

Ordered list is halved and depending on the value of the middle item, it will search the lower or higher half of the list
Useful and fast for large lists, but the list has to be ordered for it to work

Question 11

Algorithmic Thinking

Answer 11

The consideration that goes into how to solve a problem using one or more algorithms.

Question 12

Abstraction

Answer 12

Identifying the key parts of a problem and hiding those that aren’t important so that it becomes easier to solve.