In this paper, we show how the theory of NP completeness can be introduced to students in secondary schools. The motivation of this research is that although there are difficult issues that require technical backgrounds, students are already familiar with demanding computational problems through games such as Sudoku or Tetris. Our intention is to bring together important concepts in the theory of NP completeness in such a way that students in secondary schools can easily understand them. This is part of our ongoing research about how to teach fundamental issues in Computer Science in secondary schools. We discuss what needs to be taught in which sequence in order to introduce ideas behind NP completeness to students without technical backgrounds.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:6447 |
| Date | January 2013 |
| Creators | Kim, Seungyon, Park, Seongbin |
| Publisher | Universität Potsdam, Extern. Extern |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | Article |
| Format | application/pdf |
| Source | Informatics in schools : local proceedings of the 6th International Conference ISSEP 2013 ; selected papers ; Oldenburg, Germany, February 26–March 2, 2013/Diethelm et al. (Eds.)/ Potsdam: Universitätsverlag Potsdam, 2013/ S.35-38 |
| Rights | http://creativecommons.org/licenses/by/3.0/de/ |
Page generated in 0.0025 seconds