Teaching graph algorithms to children of all ages

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We report on our experiences in teaching graph theory and algorithms to school children, aged 5 to 17. Our objectives were to demonstrate that children can discover quite complex mathematical concepts, and are able to work with abstractions and use computation reasoning from quite an early age. We provide details of our incremental approach, which can be used with students of a wide range of abilities. Also, we comment on the importance of problem based learning where the algorithms are presented as possible solutions to games or puzzles. Finally, we conclude with a number of important observations with regard to the introduction of computer science into schools.

Original languageEnglish
Title of host publicationITiCSE'12 - Proceedings of the ACM Conference on Innovation and Technology in Computer Science Education
Pages34-39
Number of pages6
DOIs
Publication statusPublished - 13 Aug 2012
Event17th ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE'12 - Haifa, Israel
Duration: 3 Jul 20125 Jul 2012

Publication series

NameAnnual Conference on Innovation and Technology in Computer Science Education, ITiCSE
ISSN (Print)1942-647X

Conference

Conference17th ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE'12
Country/TerritoryIsrael
CityHaifa
Period3/07/125/07/12

Keywords

  • abstraction
  • computational thinking
  • k-12 education
  • modelling
  • problem based learning

Fingerprint

Dive into the research topics of 'Teaching graph algorithms to children of all ages'. Together they form a unique fingerprint.

Cite this