Week 10 - Algorithms & Recursions

Question 1

What are the 5 parts which define an algorithm?

F
D
EP
PO
TI

Answer 1

1. Finite - it ends
2. Definite - it isn’t subjective and is precise
3. Effective Procedure - can be carried out effectively
4. Produces Output - has a result or effect
5. Takes Input - obtains values to use

Question 2

What’s an example of an algorithm?

Answer 2

Rounding pi to 5 decimal places.q

Question 3

What does computational complexity measure?

Answer 3

How efficient programs are and the relationship between performance and data sets.

These two things are can be related quadratically, linearly, exponentially, logarithmically or by a constant value.

Question 4

What does n represent?

Answer 4

Can be either time or memory.

Question 5

Recursion

Answer 5

A process of looping where the program will call itself.

It’s also related to the mathematical topic called proof by induction where similar methods are used to show something is true for n and for n+1.

Question 6

What are the 3 parts of recursion?

I
R
T

Answer 6

1. Initialisation: declaring a counter
2. Repetition: incrementing the counter
3. Terminations: ending the counter using conditional statements or end keywords.