Type:

Other

Description:

In this activity, learners help a poor cartographer color in the countries on a map, making sure each country is colored a different color than any of its neighbors. Through this exercise, learners discover the "has-to-be" rule and the value of place-holders. This activity reveals the complexity of graph coloring algorithms in computer science. Variations, extensions, background information, and solutions are included in the PDF.

Subjects:

  • Computer Science > General
  • Mathematics > General
  • Education > General

Education Levels:

  • Grade 1
  • Grade 2
  • Grade 3
  • Grade 4
  • Grade 5
  • Grade 6
  • Grade 7
  • Grade 8
  • Grade 9
  • Grade 10
  • Grade 11
  • Grade 12

Keywords:

heuristics,cartography,NSDL,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-056,Computer science,Problem Solving,Mathematics,graph coloring,Early Elementary,coloring,Upper Elementary,graph,Engineering,Computer Science,nodes,place-holder,computer science,Informal Education,map,Middle School,oai:nsdl.org:2200/20110926120030181T,exponential time,Patterns,Elementary School,four-color theorem,Representation,Computing and Information,Probability,General,Information and Communication,Computer Engineering,High School,algorithms,logic,Education,Technology,Geoscience

Language:

English

Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution Non-Commercial Share Alike

Collections:

None
This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
NR
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467