Algorithms

Question 1

What’s abstraction?

Answer 1

Removing unnecessary information to focus on the necessary information, to simplify an issue

Question 2

Why is abstraction used?

Answer 2

Simplifies a problem by making it less complex, making it easier to resolve

Question 3

What is decomposition?

Answer 3

Breaking down a problem into smaller parts to make it easier to understand

Question 4

Why is decomposition used?

Answer 4

More people can work on the problem
Each part of the problem can be individually tested

Question 5

What is algorithmically thinking?

Answer 5

The logical steps are followed to solve the problem

Question 6

What is an algorithm?

Answer 6

A set of instructions presented in a logical sequence

Question 7

How does a linear search work?

Answer 7

Each item is searched from start to end/ till item is found
Not efficient for large lists

Question 8

How does a binary search work?

Answer 8

Data must be sorted
Finds the midpoint and checks if item = wanted item
Then decides if its greater or smaller and discards one of the halves
This repeated until the item is found

Question 9

How does a merge sort work?

Answer 9

Divides a list of items in half again and again until each item is individual
The items are then put in pairs and reordered
The items are merged again and reordered until the whole list is ordered

Question 10

How does bubble sort work?

Answer 10

Each item is compared with the other on the right and swapped if wrongly ordered, this will be repeated going down the list till it’s ordered

Question 11

How does insertion sort work?

Answer 11

Items are split, the left side is ordered and right is unordered
An item from the right side is added to the left and order, this repeated till the list is ordered