CTiS2023 Session 3 - The Three Roots of Computer Science - Juraj Hromkovic _ Regula Lacher
Channel: CSpathshala
Date: 2023-07-25

The Three Roots of Computer Science - Juraj Hromkovic  and  Regula Lacher
Teaching CT from kindergarten to high school in a spiral curriculum
Juraj Hromkovič, is Professor of Information Technology and Education at ETH Zurich. His research and teaching interests focus on informatics education, algorithmics for hard problems, complexity theory with special emphasis on the relationship between determinism, randomness, and nondeterminism. In addition to active research in theoretical computer science, his focus is education for teachers of Computer Science and the illustration of basics of Computer Science to non-professionals. One of his main activities is writing textbooks which make complex recent discoveries and methods accessible for students and practitioners. He has many books to his credit. His most popular book is Algorithmic Adventures: From Knowledge to Magic. In order to introduce the subject of informatics to school education, he founded the Centre for Computer Science Education in 2005. He is responsible for the master program Lehrdiplom Informatik at ETH devoted to the education of computer science teachers
Regula Lacher is also at ETH Zurich and she is the Director of ABZ, a consortium of materials for teachers of all grades. See https://abz.inf.ethz.ch/. She is co-author of 8 textbooks for computer science from kindergarten to maturity. She has worked on
Bebras tasks and on designing informatics curriculum for K-12 education from concepts to implementations.
She is active in teacher training for primary schools and is a co-author of the series of popular “Informatik-Biber”-cards for teaching computer science concepts to pupils. She regularly contributes to the competition “Beaver” that annually conveys informatics to almost 3 million children. In this context, she co-authored tasks that have been selected by the international beaver community as the best task of the year in 2018 and 2019, and in 2020 the second best task.