Mathtec
.
  • HOME
  • EFL TEAM
  • JUNIORS
    • Measurement Circle Circumference and Area
    • Area of Circles
    • 9WHI
    • GEOMETRY1
    • RIGHT ANGLE TRIGONOMETRY >
      • TRIG RATIOS
    • GRAPHING
    • GRAPHS -LINEAR (LINE) INTRO
    • ALGEBRA 1 BEDMAS DISTRIBUTIVE PROPERTY >
      • ALGEBRA 2 WEEKLY TESTS
      • ALGEBRA 3 SIMPLIFYING AND LIKE TERMS
      • ALGEBRA 4 POWERS
      • ALGEBRA 5 EXPANDING/SIMPLIFYING
      • ALGEBRA 6 FACTORISING
      • PROBABILITY EXAMPLE 3
      • PROBABILITY EXAMPLE 2
      • ALGEBRA 7 INDICES
      • ALGEBRA 8 NEGATIVE INDICES
    • NUMBER PART 1 MAIN >
      • NUMBER PART 2 FRACTIONS
      • NUMBER PART 3
      • NUMBER PART 4
      • NUMBER PART 5
      • NUMBER PART PRIMES LCM
      • NUMBER 6 SIGNIFICANT FIGURES
      • NUMBER LET'S PARTY >
        • LETS PARTY AGAIN
        • LET'S PARTY ONE MORE TIME
        • LETS PARTY FOR THE LAST TIME
    • The Decimal System
    • STATISTICS YR 9 AND YR10
    • NUMBER RESULT
    • NUMERIC REASONING
    • NUMERIC REASONING ACTIVIITES
    • INTEGERS
    • PERCENTAGES
    • RESOURCES
  • LEVEL 1
    • PROBABILITY INTRO >
      • PROBABILITY ROLL A SIX ACHIEVED TO EXCELLENCE
      • PROBABILITY EXEMPLAR1
      • ROLLING A 6
      • MONTY HALL PROBLEM
      • PROBABI;ITY GRAPH HOW TO
      • GRAPH SHAPES
      • PROBABILITY WITH/WITHOUT REPLACEMENT
      • PROBABILITY TREES
      • PROBABILITY 2 HEADS/TAILS
      • PROBABILITY 3 ACTIVITY 3 FIVE DICE
      • PROBABILITY 4 EXAMPLE PPDAC DICE
      • PROBABILITY 5 SUM THE DICE
      • PROBABILITY 6 HOUSE OF CARDS
      • PROBABILIYT6 EXAMPLE1
      • TURN OF A FRIENDLY CARD
    • BIVARIATE DATA GOVT EXAMPLE EXCELLENCE >
      • BIVARIATE DATA 10POP
      • BIVARIATE DATA 10FUN
      • BIVARIATE DATA GOVT EXEMPLAR
      • BIVARIATE DATA 10KAY
      • BIVARIATE DATA 10PEN
      • BIVARIATE DATA 10YEA
      • BIVARIATE DATA 10CAT
      • BIVARIATE DATA 3
      • BIVARIATE DATA 2020
      • KIWI LEVEL 1
    • ALGEBRA >
      • Simplifying
      • Word Problems
      • Solving Linear Equations
      • Quadratics - Solving & Linking to the Graph
      • Factorising Simple & Quadratic
      • Factorising Quadratic Fractions
      • Simultaneous Equations
      • Exam Revision
      • Merit & Excellence
      • Exam Revision Term 3
      • Graphics Calculator
    • Graphing with negative slope
    • Inequations
    • GRAPHING >
      • GRAPHING CALCULATOR
      • GRAPH2
      • PRACTICE 5
      • GRAPHING QUADRATIC EQUATIONS >
        • Graphing Externals PDF DOCS
      • 2017 GRAPHS AND TABLES EXAM
      • 2018 GRAPHS AND TABLES EXAM
    • Quadratics - Expanding & Simplifying
    • LEVEL 1 2015 EXAM
    • LEVEL1 2016 EXAM
    • LEVEL1 2017 EXAM
    • LEVEL 1 2018 EXAM
    • MEASUREMENT
    • MULTIVARIATE SHARKS >
      • RUGBY TWO
      • Mr Dee's Math Class
      • RUGBY
      • RUGBY 2
      • RUGBY ACHIEVED ONLY
      • KIWI
      • DRAGONS
      • MULTIVARIATE AUSTRALIAN ATHLETES EXAMPLE
    • MULTIVARIATE PRACTICE
    • Types of Sampling
    • TRIG PRACTICE
  • LEVEL 2
    • L2 INFERENCE >
      • KIWI STATISTICAL INFERENCE 2.9 >
        • Lvl 1 Stats Review
        • Box Plots
        • Comparative Investigation Question
        • Random Number Generating
        • Sampling Variability
        • Making the Call
        • Practice Assessment >
          • Achievement Example
          • Use Inzight to do the Work
    • SYSTEMS OF EQUATIONS >
      • SYSTEMS OF EQUATIONS 2
      • SYSTEMS OF EQUATIONS TANGENT TO CIRCLE
    • TRIGONOMETRY 2.4 >
      • SINE RULE FOR LENGTH
      • Sine Rule - Find Area
      • Cosine Rule - Find Length
      • Cosine Rule - Find Angle
      • TRIG PRACTICE 1
      • TRIG PRACTICE 2
      • TRIG PRACTICE 3
    • NETWORKS >
      • NETWORKS ACTIVITY 2
      • NETWORKS ACTIVITY 5
      • NETWORKS ACTIVITY 6
      • NETWORKS 7
      • NETWORKS 8
    • COORDINATE GEOMETRY >
      • GEOMETRY 2
    • ALGEBRA >
      • SIMPLIFYING
      • QUADRATICS1
      • THE DISCRIMINANT
      • GRAPHICS CALCULATOR
      • MAHOBE TESTS
      • ALGEBRA REVISION
      • 2019 L2 ALGEBRA EXAM >
        • 2018 ALGEBRA EXAM >
          • 2017 ALGEBRA EXAM
          • 2016 ALGEBRA EXAM
          • 2015 ALGEBRA EXAM
          • 2014 ALGEBRA EXAM
          • 2013 ALGEBRA EXAM
          • 2012 ALGEBRA EXAM
    • CALCULUS >
      • 2019 L2 CALCULUS EXAM
      • 2018 CALCULUS EXAM
      • 2017 CALCULUS EXAM
      • 2016 CALCULUS EXAM
      • 2015 CALCULUS EXAM
      • 2014 CALCULUS EXAM
      • 2013 CALCULUS EXAM
      • 2012 CALCULUS EXAM
      • GRAPHICS CALCULATOR DERIVATIVE FUNCTION
    • GRAPHING 1 >
      • GRAPHING 2
      • GRAPHS 3
    • CIRCLE GRAPHS
    • SINEWAVE GRAPHS
  • LEVEL 3
    • LINEAR PROGRAMMING
    • LINEAR PROGRAMMING 2 >
      • LINEAR PROGRAMMING 3
      • LINEAR PROGRAMMING 4
      • LINEAR PROGRAMMING 5
      • LINEAR PROGRAMMING 6
    • BIVARIATE DATA1 >
      • BIVARIATE DATA2
      • AMERICAN CARS
      • AUSTRALIAN ATHLETES
      • DIAMONDS
      • DIAMONDS LEVEL 1
      • RUGBY LEVEL 1
    • TIME SERIES >
      • TIME SERIES 2
      • TIME SERIES 3
      • TIME SERIES 4 PREDICTION
      • TIME SERIES 5
      • TIME SERIES 6
    • CRITICAL PATHWAYS1
    • CRITICALPATHWAYS2
    • SYSTEMS OF EQUATIONS1 >
      • SYSTEMS OF EQUATIONS 2
      • SYSTEMS OF EQUATIONS 3
      • SYSTEMS OF EQUATIONS 4
      • SYSTEMS OF EQUATIONS 5
    • INFERENCE INTRO >
      • INFERENCE KIWI
      • SHARKS
    • TRIG WHEEL 1 >
      • TRIG WHEEL 2
      • TRIG WHEEL 3
      • TRIG WHEEL 4
      • TRIG WHEEL 5
      • TRIG WHEEL 6
      • TRIG WHEEL 7
      • TRIG 8 SYLVESTER AND TWEETY
      • TRIG 9 SYLVESTER AND TWEETY
      • TRIG 10 TOM AND JERRY
      • TRIG 11 SNOOPY AND CHARLIE
      • TRIG 12 DR WHO & THE DALEK
    • VECTORS1
    • DIFFERENTIATION >
      • CHAIN RULE
      • EXPONENTIAL FUNCTION
      • NATURAL LOG FUNCTION
      • PRODUCT RULE
      • QUOTIENT RULE
      • TRIG FUNCTIONS
      • EQUATIONS OF TANGENTS AND NORMALS
      • RELATED RATES OF CHANGE
      • 2018 DIFFERENTIATION EXAM
      • 2017 91578 EXAM
    • COMPLEX NUMBERS >
      • 2018 COMPLEX NUMBER EXAM
  • TECHNOLOGY
    • WOOD PROJECTS
    • PRODUCT >
      • CONCEPTUAL DESIGN
      • PRODUCT MANUFACTURE
    • FABRIC >
      • FABRIC CUSHION
    • MAP MAKING
    • GRAPHICS >
      • MINECRAFT
    • FOOD >
      • TV CHEFS QUIZ
  • PROJECTS
    • ORIGAMI
    • TRAFFIC LIGHT >
      • TRAFFIC LIGHT 2
      • TRAFFIC LIGHT 3
    • Pi COMPETITION
    • THREE DIRHAMS
    • THE ARDUINO MICROCONTROLLER
    • PICAXE AND R2D2 PROJECT
  • PARAMETRIC DIFFERENTIATION
  • GET LOST IN SAMOA
  • GET LOST IN JAPAN
  • GET LOST IN PARIS
  • GET LOST IN SPAIN
  • ON LINE HELP
  • ON LINE HELP 2
  • ONLINE HELP 3
  • DESMOS
  • GET LOST IN CANADA
  • GET LOST IN THAILAND
  • GET LOST IN KOREA
  • GET LOST IN LONDON2

NETWORKS
​currently updating
​Friday 22nd may 2020

What's New:

1) Students have to draw the interconnecting lines between nodes or locations.

2) For Excellence, the optimised network design is no longer required. Application of the Kruskal algorithm used to justify the minimum and maximum spanning tree will be sufficient.

Weebly notes will be updated in due coarse.


​
Picture
The three aspects of Networks we will be investigating are


1) Traversability
2) Shortest Path
3) Minimum Spanning Tree (or maximum)

NAMING THE PARTS OF THE NETWORK

  Nodes are connected by edges, also known as arcs, paths, trails etc. Think of the nodes as towns on a map and the roads (paths) connecting them, edges. Nodes are either odd or even depending on the number of paths or edges entering or leaving a node.
Picture

TRAVERSABILITY- this is really important


A traversable network is one that can be drawn without lifting the pen from the paper and without retracing the same path (arc). The rules that make a network traversable are:
  • if all nodes are even order, we can start anywhere (and finish anywhere including back at the start node which is called an Euler circuit)
  • if there are EXACTLY two nodes with an odd order (all others even), we must start at one odd node (and finish at the other odd node). This is called an Euler path.
​

SHORTEST PATH

Shortest path is the shortest route between two nodes.
Picture
Picture

MINIMUM SPANNING TREE

Minimum Spanning Trees are used in designing fibre optic networks and water supply distributions in cities. Several mathematical methods exist for finding minimum spanning trees, including Prim's and Kruskal's algorithms (not Krusty the clown!)

NETWORKS ACTIVITY 1

Picture
1) Find the shortest path between nodes A and I. State the order of nodes chosen. You can draw a tree diagram or trial and error is OK for this standard.


this is new
students need to connect the nodes together
​from a blank map or diagram
merit excellence requires use of 
​Dijkstra's algorithm


Picture
Picture
You need to list the nodes as well as the answer for the shortest path. A - B - F - I = 25 If there is a unit in use then use the unit eg in this example the unit of measurement is in 1000's of km so the answer would be 25000 km. (yes I know the distances appear somewhat astronomical).

​


2) ​Can the whole of this set of paths be traveled going on each path once and only once? Give a full explanation for your answer.
​

Picture
In other words is the path traversable? For this to be possible there needs to be no odd nodes (all even) or there are two odd nodes and the others even. Circle all the odd nodes above and you can see that there are 4 odd nodes which breaks the rules of traversability. So this network is not traversable.
3) What is the minimum spanning network for this and what is the distance of span required?



​this has become the new excellence
guessing and checking gets you Achieved

(you are allowed to guess and check)

​

We will use Kruskal's Algorithm to solve this network problem and take it one step at a time. Firstly the number of paths we need is found from a simple formula which states

                                The number of paths = number of nodes - 1
                                                    = 9 -1
                                                    = 8


This doesn't tell us the answer exactly but it puts a limit on what our answer could be. If you have more than or less than this number of pathways the answer is incorrect. Now write out 8 spaces where we will in turn allocate each path starting from the smallest distance to the largest distance. If one pathway creates a circuit, remove it, (that might take a little time to understand).


AC   FG   EH   DH   FI    AD   CE   GI   HG    AB
2       2       3       4     5       6       8      8      9        9
There should only be 8 pathways in use (out of the 14 available) so the paths which cannot be used (indicated in red). Because CE  and GI create a circuit we can eliminate both of those paths. It makes sense to remove the largest paths because we want a minimum distance to span. So don't include both 8's.
If we now add up the 8 paths we get 40, so the answer is 40000 km for the minimum spanning tree. 
How this will look in your assessment.

"Looking at my highlighted network and using Kruskal's algorithm, I found the least distance that connects all 9 locations is 40,000 km".
Picture


​
​4) What is the maximum spanning network for this and what is the distance span required?

​We follow the same process as before for finding the minimum spanning network or tree. This time we begin by selecting the largest spans first. Again we have 8 nodes as before.

​The number of paths = number of nodes - 1

        = 9 - 1 
  = 8
Picture
Justification (Not required in 2020)
With 9 nodes there will be 8 pathways connecting all 9 nodes together.

Start with the largest values which are 13 and 12 connecting B to E and E to F respectively. But connecting B to F would form a circuit which is not permitted. The next largest value is 10 connecting E to G. There are two paths with the same value of 9 connecting A and B, and again  connecting H and G. and they can both be added to the network path. C to E and G to I have the same value of 8 and both can be accepted as no circuits are formed with their addition. Finally the eighth path has a value of 6 and connects A to D. This completes the spanning tree.



You may notice that the path BF which has a distance value of 11 has been ignored because it doesn't improve the connectivity (law - no loops permitted in the network) so it becomes redundant. So the maximum span is 75,000 km.

​"Looking at my highlighted network and using Kruskal's algorithm,  I found the maximum  distance that connects all 9 locations is 75,000 km". 
Powered by Create your own unique website with customizable templates.