Algorithmic thinking: the key for understanding computer science

Authors:
Gerald Futschek
Affiliations:
Institute of Software Technology and Interactive Systems, Vienna University of Technology, Vienna, Austria
Venue:
ISSEP'06 Proceedings of the 2006 international conference on Informatics in Secondary Schools - Evolution and Perspectives: the Bridge between Using and Understanding Computers
Year:
2006

Citing 2
Cited 6

A New Approach to Learning Algorithms

ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
Preparatory knowledge: propaedeutic in informatics

ISSEP'05 Proceedings of the 2005 Informatics in Secondary Schools - Evolution and Perspectives international conference on From Computer Literacy to Informatics Fundamentals

Design of contents for ICT literacy in-service training of teachers in Korea

Computers & Education
Measuring achievement of ICT competency for students in Korea

Computers & Education
Teaching theoretical informatics to secondary school informatics teachers

ISSEP'11 Proceedings of the 5th international conference on Informatics in Schools: situation, Evolution and Perspectives
Teaching graph algorithms to children of all ages

Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
A new curriculum for junior-high in computer science

Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
A nationwide exam as a tool for improving a new curriculum

Proceedings of the 18th ACM conference on Innovation and technology in computer science education

Quantified Score

Hi-index	0.00

Visualization

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.