Abstract
We show that algorithmic thinking is a key ability in informatics that can be developed independently from learning programming. For this purpose we use problems that are not easy to solve but have an easily understandable problem definition. A proper visualization of these problems can help to understand the basic concepts connected with algorithms: correctness, termination, efficiency, determinism, parallelism, etc. The presented examples were used by the author in a pre-university course, they may also be used in secondary schools to help understanding some concepts of computer science. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Futschek, G. (2006). Algorithmic thinking: The key for understanding computer science. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4226 LNCS, pp. 159–168). Springer Verlag. https://doi.org/10.1007/11915355_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
