Scribd
Upload
11 views

Stringways

1) The document discusses designing efficient networks by connecting a series of towns with minimum total travel distance. This relates to finding minimum spanning trees in graph theory. 2) Finding minimum spanning trees has applications in designing telecommunications, computer, transportation, water, and electrical networks to connect various nodes with optimal efficiency. 3) Careers that work on designing and analyzing such networks include civil engineers, construction managers, transport geographers, network engineers, and urban designers.

Uploaded by

Nachammai S
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Stringways

1) The document discusses designing efficient networks by connecting a series of towns with minimum total travel distance. This relates to finding minimum spanning trees in graph theory. 2) Finding minimum spanning trees has applications in designing telecommunications, computer, transportation, water, and electrical networks to connect various nodes with optimal efficiency. 3) Careers that work on designing and analyzing such networks include civil engineers, construction managers, transport geographers, network engineers, and urban designers.

Uploaded by

Nachammai S
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BACKGROUND

ON THE EVENT DAY


The main scientific tool in Stringways is analytical
Half-day activity
thinking. The ability to consider a problem and
Students develop networks to join a work through a range of solutions, evaluating the
series of towns together in the most merits of each and considering alternatives, to
efficient way possible. The higher the reach the most efficient result.
efficiency of linkage (i.e. minimum travel
distance) the more points each team
earns.
REAL-LIFE EXAMPLES
The cost vs efficiency of designing a network is a
(Please remember that students cannot bring notes, common modern issue. Working out the minimum
models or other paperwork on the event day)
cabling needed is key for efficiency and is referred
to as ‘minimum spanning tree’. Minimum
spanning trees have direct applications in the
ACARA LINKS (Year 9/10) design of networks, including telecommunications
• Advances in scientific understanding networks, computer networks, transportation
often rely on developments in networks, water supply networks and electrical
technology and technological grids. The Australian National Broadband Network
advances are often linked to is a current example.
scientific discoveries (ACSHE158,
ACSHE192) RELATED CAREERS
• Values and needs of contemporary
• Civil Engineer
society can influence the focus of
• Construction Manager
scientific research (ACSHE228,
• Transport Geographer
ACSHE230)
• Network Engineer
• Develop, modify and communicate
• Urban Designer
design ideas by applying design
thinking, creativity, innovation and
enterprise skills of increasing RELATED DEGREES (UON)
sophistication (ACTDEP049) • Bachelor of Engineering (Civil)
• There are also many links to the Year • Bachelor of Science (Geography)
11 General Mathematics curriculum • Bachelor of Mathematics
Visit the ACARA website… • Bachelor of Construction Management
Find out more…

Watch VIDEO – “What is Engineering”?


VOCABULARY
Algorithm A process or set of rules to be followed to solve a problem
Edges Line segment that joins two vertices
Efficiency The ability to produce something with little wastage
Function The relationship between input numbers "x" and output numbers "f(x)"
Graph A series of points that represent the value of a given function
Graph theory The mathematical study of graphs
Min. Spanning Tree Edges of a connected graph that connects all vertices together with the
minimum possible edges
Network An arrangement of intersecting lines that connects people or things,
and the result from joining a series of nodes
Node Point in a network at which lines or pathways intersect or branch
Tree A graph with exactly one path between two vertices
Vertex A corner or point where lines meet

RESOURCES/LINKS
Travelling salesman problem - TSP (Kids Encyclopaedia) – Description of TSP, which is a classic
algorithmic problem in the field of computer science that focuses on optimisation.
Help solve Santa’s logistics troubles with a little maths – Article that relates the travelling
salesman problem to Santa’s route for delivering millions of presents across the world.
How it Works: Engineering bridges to handle stress (BMI Bridge Masters) – This article looks at
how different types of bridges are engineered to handle stress.
Minimum Spanning Tree (Kruskal’s Algorithm) – Visualisation using SCRATCH that finds the
minimum spanning tree of a graph of points, either randomly placed or placed by user.
Ready to Go Lessons: Minimum Spanning Trees (CS Unplugged) – An activity puzzle that
shows students the decision involved in linking a network between houses.
Ready to Go Lessons: A lesson about minimum spanning trees meant as an introduction to
networks. Includes plan, worksheet and spreadsheet.
Ready to Go Lessons: Prim’s Algorithm: Explanations & Examples – Explains what Prim’s
algorithm is used for, the steps involved in using it, and a real-world example of putting it in
practice.
NBN Problems (Behind the News) – An update on the National Broadband Network, which is
the biggest government infrastructure project in Australia’s history.
YouTube Playlist of helpful videos

EXAMPLES OF LEARNING ACTIVITIES


• Have students look up the definitions of the words in the ‘Vocabulary’ section above.
• Draw the difference between a tree, spanning tree and minimum spanning tree.
• Research Czech scientist Otakar Borůvka who developed the first known algorithm for
finding a minimum spanning tree. What was the problem he was originally trying to solve?
• Solve everyday problems using minimum spanning tree.

You might also like