1.1 Algorithms

Question 1

What are Algorithms?

Answer 1

1. Algorithms are a sequence of instructions that perform a certain task.
2. They are completely independent and can be implemented

Question 2

What is Pseudocode?

Answer 2

Programmable code written in standard english for easier understanding.

Question 3

What is a Flowchart?

Answer 3

Flowcharts also represent data flow, but the shapes have different meanings.

The oval → Start/End

The Square → Process

The Rhombus → Decision

The Parallelogram → Inputs/Outputs

The Lined Rectangle → Subroutines

Question 4

What is a Linear Search?

Answer 4

1. A linear search checks each element until a match is found, or until the whole list has been checked.
2. Uses Brute Force.

Question 5

What is Binary Search?

Answer 5

1. Binary search is done by dividing a list into two and eliminating the half not containing the targeted element.
2. The list must also be ordered.
3. Works by simplification.

Question 6

How is a Binary Search conducted?

Answer 6

1. Find the Midpoint
2. Eliminate Unneeded half
3. Repeat Until found

Question 7

What is a Bubble Sort?

Answer 7

1. A bubble sort orders an unordered list
2. It does so by making comparisons to adjacent elements and swapping them, largest value to the back
3. Each comparison to the full data set is a pass

Question 8

What is a Merge Sort?

Answer 8

1. Divide and Conquer and Merge:
   
   1. The list is first divided into two, keeps splitting until there is one element left
   2. Sorts the list recursilvely
   3. Merge the lists from the single elements

Question 9

When should Linear/Binary Search be used?

Answer 9

1. Linear Search should be used in unordered lists, whilst binary searches require ordered lists.