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 条
  • [21] Matrix Conditions of Language Recognition for Finite State Machines Using the Theory of Semi-tensor Product of Matrices
    Yue, Jumei
    Yan, Yongyi
    Li, Zhiqiang
    Jin, Xin
    Gao, Song
    PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 65 - 70
  • [22] Using mutual information to test from Finite State Machines: Test suite selection
    Ibias, Alfredo
    Nunez, Manuel
    Hierons, Robert M.
    INFORMATION AND SOFTWARE TECHNOLOGY, 2021, 132
  • [23] Code Design for Flicker Mitigation in Visible Light Communications Using Finite State Machines
    Mejia, Carlos E.
    Georghiades, Costas N.
    Abdallah, Mohamed M.
    Al-Badarneh, Yazan H.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (05) : 2091 - 2100
  • [24] Modeling of a DC boost converter behavior in PV system using finite state machines
    Latkova, Martina
    Bracinik, Peter
    Bahernik, Michal
    Susko, Filip
    PROCEEDINGS OF THE 2015 16TH INTERNATIONAL SCIENTIFIC CONFERENCE ON ELECTRIC POWER ENGINEERING (EPE), 2015, : 733 - 738
  • [25] USING HOMING, SYNCHRONIZING AND DISTINGUISHING INPUT SEQUENCES FOR THE ANALYSIS OF REVERSIBLE FINITE STATE MACHINES
    Lukac, Martin
    Kameyama, Michitaka
    Perkowski, Marek
    Kerntopf, Pawel
    FACTA UNIVERSITATIS-SERIES ELECTRONICS AND ENERGETICS, 2019, 32 (03) : 417 - 438
  • [26] Using mutual information to test from Finite State Machines: Test suite generation?,??
    Ibias, Alfredo
    JOURNAL OF SYSTEMS AND SOFTWARE, 2022, 192
  • [27] Hierarchical Modeling and abstraction of discrete event systems using finite state machines with parameters
    Chen, YL
    Lin, F
    PROCEEDINGS OF THE 40TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2001, : 4110 - 4115
  • [28] Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
    Bilal Elghadyry
    Faissal Ouardi
    Zineb Lotfi
    Sébastien Verel
    Journal of Big Data, 8
  • [29] Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce
    Elghadyry, Bilal
    Ouardi, Faissal
    Lotfi, Zineb
    Verel, Sebastien
    JOURNAL OF BIG DATA, 2021, 8 (01)
  • [30] Analysis of Reversible and Quantum Finite State Machines using Homing, Synchronizing and Distinguishing Input Sequences
    Lukac, Martin
    Kameyama, Michitaka
    Perkowski, Marek
    Kerntopf, Pawel
    2013 IEEE 43RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2013), 2013, : 322 - 327