CS Unplugged: Graph Colouring
Use The poor cartographer — Graph Colouring offline activity to explore how a computer deals with a ‘has to be’ rule. In this task, once a country is coloured in, any bordering country ‘has to be’ a different colour. Map colouring belongs to a general class of problems known as graph colouring. In computer science, a graph is an abstract representation of relationships. This task has links to computations and permutations in mathematics as well as rates that increase exponentially when applying the colouring problem to an increasing number of countries to be coloured on a map. Support your teaching and learning with video clips and other related resources.
Additional details
Year band(s) | 5-6, 7-8, 9-10 |
---|---|
Format | Web page |
Keywords | Computation, Maps, Algorithms, Functionality, Usability, Problem solving |
Organisation | University of Canterbury, New Zealand |
Copyright | Creative Commons BY-NC-SA 4.0 |
Related resources
-
A matter of style
In this lesson sequence, students using the Zen Garden website reflect on criteria for effective design.
-
Google CS First: Storytelling
CS First: Storytelling guides students to use block-based coding in Scratch projects through a series of themed activities.
-
Scope and sequence overview
This resource provides a possible set of sequenced topics that could be used in teaching the Australian Curriculum Digital Technologies curriculum to address the content descriptions of the curriculum.
-
F-2: Digital systems: Hardware and software
At the F-2 level, students develop understandings of digital systems (hardware and software) when they use some key functions to undertake authentic curriculum tasks.
-
F-2: Digital systems: Changes in Technology
Changes to technology over time has affected many aspects of life.