PREMIUM LOGIN
ClassTools Premium membership gives access to all templates, no advertisements, personal branding and many other benefits!
| Username: | ||
| Password: | ||
|
Submit
Cancel
|
||
| Not a member? | ||
1. Arrange students into groups. Each group needs at least ONE person who has a mobile device.
2. If their phone camera doesn't automatically detect and decode QR codes, ask students to
4. Cut them out and place them around your class / school.
1. Give each group a clipboard and a piece of paper so they can write down the decoded questions and their answers to them.
2. Explain to the students that the codes are hidden around the school. Each team will get ONE point for each question they correctly decode and copy down onto their sheet, and a further TWO points if they can then provide the correct answer and write this down underneath the question.
3. Away they go! The winner is the first team to return with the most correct answers in the time available. This could be within a lesson, or during a lunchbreak, or even over several days!
4. A detailed case study in how to set up a successful QR Scavenger Hunt using this tool can be found here.
Question | Answer |
| 1. Minimum Network Problems | The need to connect all the points so that one can go from any point to any other point, and the desire to make the total cost of the network as small as possible. | 2. Subgraph | Includes each and every vertex of the original graph. | 3. Tree | A graph that is connected and has no circuits. | 4. Spanning Tree | A continued tree graph. | 5. Minimum Spanning Tree (MST) | Graph with the least total weight. | 6. Shortest Network | The network of minimum length connecting the points. | 7. Interior Junction Point | A junction point in the network that is not one of the original points. | 8. Steiner Point | A junction point in the network formed by three line segments coming together forming equal 120 degree angles. | 9. Interior Junction Rule | The only possible interior junction points in a shortest network. | 10. Steiner Tree | Any network without circuits in which every interior junction is a Steiner point. | 11. Shortest Network Rule | The shortest network connecting a set of points is either a minimum spanning tree or a Steiner tree. | 12. Kruskal’s Algorithm | Used to find the minimum span of a tree graph. | 13. Spanning Subgraph | Everyone of the vertices of an original graph. | 14. Torricelli’s Construction | Finding the shortest network connecting vertices of a triangle. |

Question 1 (of 14)

Question 2 (of 14)

Question 3 (of 14)

Question 4 (of 14)

Question 5 (of 14)

Question 6 (of 14)

Question 7 (of 14)

Question 8 (of 14)

Question 9 (of 14)

Question 10 (of 14)

Question 11 (of 14)

Question 12 (of 14)

Question 13 (of 14)

Question 14 (of 14)