Algorithms

Question 1

What is Abstraction?

Answer 1

Removing any unnecessary details/information from a problem in order to solve it

Question 2

What is decomposition?

Answer 2

Breaking down a problem into smaller, simpler steps/stages

Question 3

What is an algorithm?

Answer 3

A series of steps that a program has to perform in order to solve a problem

Question 4

look at this list of integers:
12 34 54 76 89 13 24
using a linear search, how many items would you have to check to reach the value 13

Answer 4

I would have to check 6 values until I reach the value 13

Question 5

Why wouldn’t a binary search work on the following data?

cow , apple , moose , dog , bird

Answer 5

Because the data is not in the correct order/ is not in order

Question 6

complete a binary search on this data to find the value 450

12 34 56 78 99 102 345 450 567

Answer 6

1. start from the middle value 99,is smaller than the value needed therefore values 12 to 99 are removed from the list
2. Next is value 450, its been found!

Question 7

How does a bubble sort work?

Answer 7

a bubble sort repeatedly goes through a list, comparing each pair of adjacent elements. If they are in the wrong order they are swapped.

Question 8

What is an insertion sort?

Answer 8

An sorting algorithm that sorts one item of data at a time, repeats this process until the list is sorted