Teaching Programming and Algorithmic Complexity with Tangible Machines

被引：5
|
作者：
Kohn, Tobias [1 ]
Komm, Dennis [2 ,3 ]
机构：
[1] Univ Cambridge, Cambridge, England
[2] Swiss Fed Inst Technol, Dept Comp Sci, Zurich, Switzerland
[3] PH Graubunden, Chur, Switzerland
来源：
INFORMATICS IN SCHOOLS: FUNDAMENTALS OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING, ISSEP 2018 | 2018年 / 11169卷
关键词：
!text type='Python']Python[!/text; Turtle graphics; Complexity; Efficiency; Notional machine;
D O I：
10.1007/978-3-030-02750-6_6
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Understanding the notional machine that conceptually executes a program is a crucial step towards mastery of computer programming. In order to help students build a mental model of the notional machine, visible and tangible computing agents might be of great value, as they provide the student with a conceptual model of who or what is doing the actual work. In addition to programming, the concept of a notional machine is equally important when teaching algorithmic design, complexity theory, or computational thinking. We therefore propose to use a common computing agent as notional machine to not only introduce programming, but also discuss algorithms and their complexity.
引用
收藏
页码：68 / 83
页数：16
相关论文
共 50 条
  • [41] Algorithmic Relative Complexity
    Cerra, Daniele
    Datcu, Mihai
    [J]. ENTROPY, 2011, 13 (04) : 902 - 914
  • [42] Tangible Programming Mechatronic Interface for Basic Induction in Programming
    Cardenas Caceres, Pablo
    Paredes Venero, Renato
    Cuellar Cordova, Francisco
    [J]. PROCEEDINGS OF 2018 IEEE GLOBAL ENGINEERING EDUCATION CONFERENCE (EDUCON) - EMERGING TRENDS AND CHALLENGES OF ENGINEERING EDUCATION, 2018, : 183 - 190
  • [43] Introducing Algorithmic Thinking and Sequencing Using Tangible Robots
    Evripidou, Salomi
    Amanatiadis, Angelos
    Christodoulou, Klitos
    Chatzichristofis, Savvas A.
    [J]. IEEE TRANSACTIONS ON LEARNING TECHNOLOGIES, 2021, 14 (01): : 93 - 105
  • [44] Minimization of algorithmic state machines
    Baranov, S
    [J]. 24TH EUROMICRO CONFERENCE - PROCEEDING, VOLS 1 AND 2, 1998, : 176 - 179
  • [45] On social machines for algorithmic regulation
    Nello Cristianini
    Teresa Scantamburlo
    [J]. AI & SOCIETY, 2020, 35 : 645 - 662
  • [46] Minsky Machines and Algorithmic Problems
    Sapir, Mark
    [J]. FIELDS OF LOGIC AND COMPUTATION II: ESSAYS DEDICATED TO YURI GUREVICH ON THE OCCASION OF HIS 75TH BIRTHDAY, 2015, 9300 : 273 - 292
  • [47] On social machines for algorithmic regulation
    Cristianini, Nello
    Scantamburlo, Teresa
    [J]. AI & SOCIETY, 2020, 35 (03) : 645 - 662
  • [48] Algorithmic Cross-Complexity and Relative Complexity
    Cerra, Daniele
    Datcu, Mihai
    [J]. DCC 2009: 2009 DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2008, : 342 - 351
  • [49] Cluster-based tangible programming
    Smith, Andrew Cyrus
    [J]. 2014 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION AND COMMUNICATION TECHNOLOGY AND IT'S APPLICATIONS (DICTAP), 2014, : 405 - 410
  • [50] Use of competitive programming as a contribution to the teaching of Algorithmic Logic. Experience University of Amazonia
    Molina Hurtatiz, Yilver Estiven
    Espinosa Sarmiento, Diana Maria
    Sanchez Trujillo, Elio Fabio
    [J]. REVISTA CIENTIFICA, 2016, 3 (26): : 109 - 116
12345