Mathematics: Decision 1

Mathematics: Decision 1

1. Algorithms

   • First-fit and first-fit decreasing
   • Interpret and apply flow diagrams or instructions
   • Bubble and shuttle sort
   • Order of an algorithm
   • Uses and limitations
   • Definition

2. Graph Theory

   • Order of vertices
     • Eulerian
     • Semi-Eulerian
   • Understand...
     • Arc or edge
     • Node or vertex
     • Path
     • Tree
     • Cycle

3. Networks

   • Travelling salesperson problem
     • Upper bound using nearest neighbour
     • Short cuts to improve upper bound
     • Lower bound using minimum connector methods
   • Prim's and Kruskal's
     • Graph or matrix
     • Minimum connector problem and minimum spanning trees
   • Route inspection
     • Pairing odd nodes
   • Dijkstra's
   • A graph with a weight for each arc

4. Linear Programming

   • Graphical solution to 2-variable problems
   • Simplex method
     • Interpret values in context of problem
   • Formulate algebraic terms from a wordy problem
     • Constraints
     • Define variables
     • Objective function
     • Slack variables