## Topic 1: Loans, Investments and Annuities

Why do banks pay compound interest?

Calculating compound interest using a recurrence relation

The compound Interest Formula Explained and Examples

## Topic 2: Graphs and Networks

Intro to Networks: part 1

Intro to Networks Part 2: More Terminology

Networks Digraphs and subgraphs

Networks Relationship between Sum of degree of Vertices and Edges

Creating an Adjacency Matrix from a network graph

Adjacency Matrix with Digraphs

Planar Graphs Introduction – Equivalent (Isomorphic Graphs) and Drawing Graphs in Planar Form

Planar Graphs – Euler's Formula – It always works and here's how to work with it

Networks: open and closed walks

Networks Trails and Paths

Networks Eulerian Graphs and Semi-Eulerian Graphs

Hamiltonian and semi hamiltonian graphs

Networks Weighted Graphs shortest paths and the travelling salesperson problem

## Topic 3: Networks and Decision Mathematics

Networks intro to trees

Networks: Kruskal's Algorithm for finding Minimum spanning trees

Networks: Reverse-Delete Algorithm for finding a minimum spanning tree

Networks: Prim's Algorithm for finding Minimum spanning trees

Bipartite graphs and assignment problems

The hungarian algorithm for weighted assignments

Flow Networks and Maximum flow

Maximum flow Minimum Cut Algorithm

Activity networks and precedence tables

Activity Networks and dummy activities

Weighted Precedence tables and float times

Critical Path Analysis Earliest starting time and latest finishing time

Critical Path Analysis Latest Starting Time