Programming and Algorithms: Week 5

What are we doing this week?

This week we are going to look at some common algorithms, first how to detect PRIME NUMBERS, next how to calculate FIBONACCI NUMBERS, and finally we'll look at how COMPRESSION works.
Moving onto the Python side of things we will look at implementations the PRIME NUMBERS and FIBONACCI NUMBERS in Python.

PseudoCode	Python
Powerpoint: Debugging Powerpoint: Prime Numbers Powerpoint: Fibonacci Powerpoint: Compression	Powerpoint: Primes and Fibonacci Powerpoint: Some Common Issues Algorithm - Prime Number Checker Algorithm - Fibonacci Numbers

Total running time of videos is 55 minutes.

Why I fell in love with monster prime numbers - Adam Spencer

The magic of Fibonacci numbers - Arthur Benjamin

Links

Prime Numbers
https://en.wikipedia.org/wiki/Prime_number
https://www.mathsisfun.com/prime_numbers.html

Fibonacci Sequence
https://en.wikipedia.org/wiki/Fibonacci_number
http://mathworld.wolfram.com/FibonacciNumber.html

Compression
https://en.wikipedia.org/wiki/Data_compression
https://en.wikipedia.org/wiki/Image_compression

See Chapter 6:

Sample Code:
Prime Checker * Fibonacci

Lab #5
Lab #5 is all about checking if what you have learned in the episodes above all makes sense, and if you can change the PRIME CHECKER and FIBONACCI code.

If you have any suggestions, corrections, or comments, please feel free to e-mail me at:
Damian.Gordon(a)dit.ie