The 'Choc-Machine' - an Introduction to Algorithmic Thinking using Finite State Machines

被引:0
|
作者
Vielsack, Annika [1 ]
Klein, Miriam [1 ]
Niesenhaus, Thomas [1 ]
Ulbrich, Mattias [1 ]
机构
[1] Karlsruhe Inst Technol, Karlsruhe, Germany
来源
PROCEEDINGS OF THE 18TH WIPSCE CONFERENCE IN PRIMARY AND SECONDARY COMPUTING EDUCATION RESEARCH, WIPSCE 2023 | 2023年
关键词
automata; finite state machines; education; algorithmic thinking; chocolate; teaching concept; modeling and design;
D O I
10.1145/3605468.3609772
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Computational thinking, in particular its central component algorithmic thinking, is one of the more important skills in the 21st century. Therefore it should be taught at school. This work proposes a low-threshold course to introduce algorithmic thinking to students in lower secondary education using the concept of finite state machines. The course is action-based and transitions from unplugged to plugged and even into the real world while sticking to the same topic and using the same visualisations throughout the entire course. It revolves around a chocolate vending machine, the Choc-Machine, which teaches the basics of finite state machines and eventually enables the students to design and formulate their own algorithms that then drive a physical hardware machine.
引用
收藏
页数:2
相关论文
共 37 条
  • [1] The grassfire transform using finite-state machines
    Waltz, FM
    Miller, JWV
    MACHINE VISION AND THREE-DIMENSIONAL IMAGING SYSTEMS FOR INSPECTION AND METROLOGY II, 2002, 4567 : 113 - 120
  • [2] STATE ASSIGNMENT OF FINITE-STATE MACHINES USING A GENETIC ALGORITHM
    ALMAINI, AEA
    MILLER, JF
    THOMSON, P
    BILLINA, S
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1995, 142 (04): : 279 - 286
  • [3] A Finite State Machine Approach to Algorithmic Lateral Inhibition for Real-Time Motion Detection
    Lopez, Maria T.
    Bermudez, Aurelio
    Montero, Francisco
    Sanchez, Jose L.
    Fernandez-Caballero, Antonio
    SENSORS, 2018, 18 (05)
  • [4] Inferring Finite State Machines Without Reset Using State Identification Sequences
    Groz, Roland
    Simao, Adenilso
    Petrenko, Alexandre
    Oriat, Catherine
    TESTING SOFTWARE AND SYSTEMS, ICTSS 2015, 2015, 9447 : 161 - 177
  • [5] Predictable component architectures using dependent finite state machines
    Schmidt, HW
    Krämer, BJ
    Poernomo, I
    Reussner, R
    RADICAL INNOVATIONS OF SOFTWARE AND SYSTEMS ENGINEERING IN THE FUTURE, 2004, 2941 : 310 - 324
  • [6] Accelerating Finite State Machine-Based Testing Using Reinforcement Learning
    Turker, Uraz Cengiz
    Hierons, Robert M.
    El-Fakih, Khaled
    Mousavi, Mohammad Reza
    Tyukin, Ivan Y.
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 50 (03) : 574 - 597
  • [7] Matrix approach to simplification of finite state machines using semi-tensor product of matrices
    Yue, Jumei
    Yan, Yongyi
    Chen, Zengqiang
    ASIAN JOURNAL OF CONTROL, 2020, 22 (05) : 2061 - 2070
  • [8] Modeling of discrete event systems using finite state machines with parameters
    Chen, YL
    Lin, F
    PROCEEDINGS OF THE 2000 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS, 2000, : 941 - 946
  • [9] Modeling and Simulation of an Operational Transformation Algorithm using Finite State Machines
    Gadea, Cristian
    Ionescu, Bogdan
    Ionescu, Dan
    2018 IEEE 12TH INTERNATIONAL SYMPOSIUM ON APPLIED COMPUTATIONAL INTELLIGENCE AND INFORMATICS (SACI), 2018, : 119 - 124
  • [10] Formal Modeling of RESTful Systems Using Finite-State Machines
    Zuzak, Ivan
    Budiselic, Ivan
    Delac, Goran
    WEB ENGINEERING, ICWE 2011, 2011, 6757 : 346 - 360