Paper 1: 3.1 Fundamentals of algorithms

Question 1

What is an algorithm?

Answer 1

A set of rules followed by a computer to solve a problem

Question 2

A computer program is the implementation of an _________

Answer 2

Algorithm

Question 3

What is abstraction?

Answer 3

Getting rid of unnecessary detail

Question 4

What shape is an input/output in an algorithm?

Answer 4

Rhombus

Question 5

What shape is a start/end in an algorithm?

Answer 5

Rectangle with semi circle on each end

Question 6

What is the shape of a process in an algorithm?

Answer 6

Rectangle

Question 7

What is the shape of a decision is an algorithm?

Answer 7

Diamond

Question 8

What is the purpose of an algorithm?

Answer 8

To solve a problem

Question 9

How do you compare the efficiency of an algorithm?

Answer 9

The shorter algorithm is better if they solve the same problem

Question 10

How does linear search work?

Answer 10

It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched

Question 11

How does binary search work?

Answer 11

Chops the list in half, if it is bigger it gets rid of the other side and repeats until the value is found (must be in order)

Question 12

How does merge sort work?

Answer 12

You split up the list and put it back together in order (merging it)

Question 13

How does bubble sort work?

Answer 13

Look at the first two, check if they’re in the right order. If not, swap them. Repeat with other pairs until it is fully sorted.