The goal of the course is to train the future teachers for teaching algorithmic thinking. The approach is based on principles described on http://csunplugged.org. Concrete illustrations will roughly follow the list of topics proposed in the IEEE/ACM K12 curriculum for computer science:
- binary presentation of data, representation of images and sound,
- data compression, information theory, error detection,
- cryptography,
- searching algorithms, sorting algorithms,
- routing and deadlock, finite state automata, and algorithms on graphs and others.
Besides these concrete examples, students will learn about general didactical principles that need to be observed when teaching algorithmic thinking.
In addition to practice classes in partner schools under appropriate supervision, the students will gain practical experience by helping in the summer schools at the faculty, by teaching computer groups at schools, preparing school children for the international Bebras competition etc.