Contribution: In this article, the authors present findings and insights on the efficacy of using an educational block-based programming (BBP) environment--Blocks4DS, to teach the binary search tree (BST). Background: For a decade, BBP environments have been a hot topic in the computer science education (CSEd) community to promote interactive…

Aim/Purpose: This study seeks to present a learning model of discrete mathematics elements, elucidate the content of teaching, and validate the effectiveness of this learning in a digital education context. Background: Teaching discrete mathematics in the realm of digital education poses challenges, particularly in crafting the optimal model,…

Dijkstra algorithm is important to be understood because of its many uses. However, understanding it is challenging. Various methods to teach and learn had been researched, with mixed results. The study proposes question-led approach of the algorithm in a game-based learning context. The game designed based on an existing game model, developed and…

Algorithmic thinking is considered as one of the important steps toward learning to code for novices in programming education. In this study, algorithmic thinking was promoted by introducing a Problem Analysis Algorithmic Model (PAAM) in an Algorithms and Programming 1 (AP) course. A web-based application is developed to offer the PAAM model in…

In this paper the challenge of promoting computational thinking for all by contextualized computing education is addressed. The two phases learning session we designed was implemented in the AlgoRythmics environment which includes ten algorithmic dance choreographies (and attached interactive computer animations). In addition to previous studies…

Abstraction is one of the most fundamental ideas in computer science (CS), and as such, according to Bruner, it should be taught spirally, starting as early as possible and revisited at every level of education. However, teaching CS abstraction to novices is a very challenging task, and CS educational research has often demonstrated students'…

The article presents the integrated course "The History of Science and Technology" developed for the students of pedagogical universities, majoring in physics, mathematics, and computer sciences. The authors highlight the effective forms, methods and means of teaching the course. The qualitative research methods included observations,…

The problem of development of algorithmic competence of students -- future Computer Science teachers as a component of information competence is investigated. The aim of the study is to identify the conditions for effective algorithmization and programming learning, involving a modular representation of the content, blended learning, allocated in…

Sorting is a fundamental computing concept. As for today, it is taught at the secondary school level. However, this kind of algorithm is an obstacle for some students due to its high level of abstraction. To prevent discouragement as well as to incorporate a fun and challenging algorithmic task, a novel tablet-based digital game,…

Intelligent Tutoring Systems (ITSs) have shown success in the domain of programming, in part by providing customized hints and feedback to students. However, many popular novice programming environments still lack these intelligent features. This is due in part to their use of open-ended programming assignments, which are difficult to support with…

Recursion is one of the most difficult programming topics for students. In this paper, an instructional method is proposed to enhance students' understanding of recursion tracing. The proposal is based on the use of rules to translate linear recursion algorithms into equivalent, iterative ones. The paper has two main contributions: the…

This paper describes the development of BOLE, a MATLAB-based interactive learning environment, that facilitates the process of learning bio-inspired optimization algorithms, and that is dedicated exclusively to unmanned aerial vehicle path planning. As a complement to conventional teaching methods, BOLE is designed to help students consolidate the…

This paper outlines a method for teaching topics in undergraduate mathematics or computer science via historical curricular modules. The contents of one module, "Networks and Spanning Trees," are discussed from the original work of Arthur Cayley, Heinz Prüfer, and Otakar Boruvka that motivates the enumeration and application of trees in…

This paper presents the history of algorithm visualization (AV), highlighting teaching-methodology aspects. A combined, two-group pedagogical experiment will be presented as well, which measured the efficiency and the impact on the abstract thinking of AV. According to the results, students, who learned with AV, performed better in the experiment.

Greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve.We present a didacticmethod aimed at promoting active learning of greedy algorithms. The method is focused on the concept of selection function, and is based on explicit learning goals. It mainly consists of an…