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,…

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…

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'…

Contribution: A systematic approach to MATLAB problem design and automated assessment is described, based on the experience working with the MATLAB server provided by MathWorks and integrated with the edX massive online open class (MOOC) platform. Background: New technologies, such as MOOCs, provide innovative methods to tackle new challenges in…

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 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.

jGRASP has three integrated approaches for interacting with its dynamic viewers for data structures: debugger, workbench, and text-based interactions that allow individual Java statements and expressions to be executed/evaluated. These approaches can be used together to provide a complementary set of interactions with the dynamic viewers. Data…

Online learning material that students use by themselves is one of the typical usages of algorithm animation (AA). Thus, the integration of algorithm animations into hypertext is seen as an important topic today to promote the usage of algorithm animation in teaching. This article presents an algorithm animation viewer implemented purely using…

There is an active research community concentrating on visualizations of algorithms taught in CS1 and CS2 courses. These visualizations can help students to create concrete visual images of the algorithms and their underlying concepts. Not only "fundamental algorithms" can be visualized, but also algorithms used in compilers. Visualizations that…

This article reviews successful educational experiences in using program and algorithm visualizations (PAVs). First, we survey a total of 18 PAV systems that were subject to 33 evaluations. We found that half of the systems have only been tested for usability, and those were shallow inspections. The rest were evaluated with respect to their…

In a context-aware ubiquitous learning environment, learning systems can detect students' learning behaviors in the real-world with the help of context-aware (sensor) technology; that is, students can be guided to observe or operate real-world objects with personalized support from the digital world. In this study, an optimization problem that…