Type:

Other

Description:

In this computer science activity about finite-state automaton (on page 45 of the PDF), learners use a map and choose various pathways to find Treasure Island. They learn that different pathways will lead them to dead-ends, continuous circles, or to their goal. This activity includes a simpler demonstration activity and one whole class activity. Background information about finite-state automaton and computer programming is included.

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:

Data Analysis,NSDL,process,Data Representation,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-056,Computer science,oai:nsdl.org:2200/20110926130003726T,Mathematics,technology,information,Data Collection,Upper Elementary,user dependent,program,Computer Science,routing,Informal Education,Middle School,Education,Information Technology,Information Systems,algorithm,computers,programming,General,Information and Communication,Engineering,Elementary School,Computing and Information,automaton,Technology

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