Generic Tasks for Algorithms

被引:3
|
作者
Milicic, Gregor [1 ]
Wetzel, Sina [1 ]
Ludwig, Matthias [1 ]
机构
[1] Goethe Univ Frankfurt, Inst Math & Comp Sci Educ, D-60325 Frankfurt, Germany
来源
FUTURE INTERNET | 2020年 / 12卷 / 09期
关键词
computational thinking; generic tasks; algorithms; K-12; problem solving; COMPUTATIONAL THINKING;
D O I
10.3390/fi12090152
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to its links to computer science (CS), teaching computational thinking (CT) often involves the handling of algorithms in activities, such as their implementation or analysis. Although there already exists a wide variety of different tasks for various learning environments in the area of computer science, there is less material available for CT. In this article, we propose so-called Generic Tasks for algorithms inspired by common programming tasks from CS education. Generic Tasks can be seen as a family of tasks with a common underlying structure, format, and aim, and can serve as best-practice examples. They thus bring many advantages, such as facilitating the process of creating new content and supporting asynchronous teaching formats. The Generic Tasks that we propose were evaluated by 14 experts in the field of Science, Technology, Engineering, and Mathematics (STEM) education. Apart from a general estimation in regard to the meaningfulness of the proposed tasks, the experts also rated which and how strongly six core CT skills are addressed by the tasks. We conclude that, even though the experts consider the tasks to be meaningful, not all CT-related skills can be specifically addressed. It is thus important to define additional tasks for CT that are detached from algorithms and programming.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Generic Incremental Algorithms for Local Search
    Magnus Ågren
    Pierre Flener
    Justin Pearson
    Constraints, 2007, 12 : 293 - 324
  • [22] DERIVING PROGRAMS USING GENERIC ALGORITHMS
    YAKHNIS, VR
    FARRELL, JA
    SHULTZ, SS
    IBM SYSTEMS JOURNAL, 1994, 33 (01) : 158 - 181
  • [23] Generic systolic array for genetic algorithms
    Megson, GM
    Bland, IM
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1997, 144 (02): : 107 - 119
  • [24] Generic algorithms for the generation of combinatorial objects
    Martínez, C
    Molinero, X
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 572 - 581
  • [25] Scheduling multiprocessor tasks with genetic algorithms
    Correa, RC
    Ferreira, A
    Rebreyend, P
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (08) : 825 - 837
  • [26] ANALYSIS OF THE FRBR IN THE EXECUTION OF GENERIC TASKS IN SHARED CATALOGUES
    Orduna-Malea, Enrique
    ANALES DE DOCUMENTACION, 2008, 11 : 129 - 144
  • [27] Answer validation for generic crowdsourcing tasks with minimal efforts
    Nguyen Quoc Viet Hung
    Duong Chi Thang
    Nguyen Thanh Tam
    Matthias Weidlich
    Karl Aberer
    Hongzhi Yin
    Xiaofang Zhou
    The VLDB Journal, 2017, 26 : 855 - 880
  • [28] Tasks in modular proofs of concurrent algorithms
    Castaneda, Armando
    Hurault, Aurelie
    Queinnec, Philippe
    Roy, Matthieu
    INFORMATION AND COMPUTATION, 2023, 292
  • [29] ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORS
    DAVIS, E
    JAFFE, JM
    JOURNAL OF THE ACM, 1981, 28 (04) : 721 - 736
  • [30] Tasks in Modular Proofs of Concurrent Algorithms
    Castaneda, Armando
    Hurault, Aurelie
    Queinnec, Philippe
    Roy, Matthieu
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 69 - 83