Research on collaborative learning of computer science has been conducted primarily in programming. This paper extends this area by including short tasks (such as those used in contests like the Bebras Challenge) that cover many other computer science topics. The aim of this research is to explore how problem-solving in pairs differs from…

Recently, computational thinking (CT) has attracted much research attention, especially within primary and secondary education settings. However, incorporating in mathematics or other disciplines is not a straightforward process and introduces many challenges concerning the way disciplines are organised and taught in school. The aim of this paper…

A central issue in the design of curricula for all school levels is the development of the learners' high-order thinking skills and metacognitive skills. Among such required skills is the ability to solve problems. The literature dealing with the development of problem-solving skills is vast and primarily addresses the scientific disciplines, even…

This article describes the system ProofWeb developed for teaching logic to undergraduate computer science students. The system is based on the higher order proof assistant Coq, and is made available to the students through an interactive web interface. Part of this system is a large database of logic problems. This database will also hold the…

Conventional introduction to computer science presents individual algorithmic paradigms in the context of specific, prototypical problems. To complement this algorithm-centric instruction, this study additionally advocates problem-centric instruction. I present an original problem drawn from students' life that is simply stated but provides rich…

Reduction is a problem-solving strategy, relevant to various areas of computer science, and strongly connected to abstraction: a reductive solution necessitates establishing a connection among problems that may seem totally disconnected at first sight, and abstracts the solution to the reduced-to problem by encapsulating it as a black box. The…

This correspondence describes an adaptation of puzzle-based learning to teaching an introductory computer programming course. Students from two offerings of the course--with and without the puzzle-based learning--were surveyed over a two-year period. Empirical results show that the synthesis of puzzle-based learning concepts with existing course…

Reversing is the notion of thinking or working in reverse. Computer science textbooks and tutors recognize it primarily in the form of recursion. However, recursion is only one form of reversing. Reversing appears in the computer science curriculum in many other forms, at various intellectual levels, in a variety of fundamental courses. As such,…

Non-determinism is one of the most important, yet abstract, recurring concepts of Computer Science. It plays an important role in Computer Science areas such as formal language theory, computability theory, distributed computing, and operating systems. We conducted a series of studies on the perception of non-determinism. In the current research,…

Computer science education should not be based on short-term developments but on content that is observable in multiple domains of computer science, may be taught at every intellectual level, will be relevant in the longer term, and is related to everyday language and/or thinking. Recently, a catalogue of "central concepts" for computer…

This paper reviews the literature related to the learning and teaching of debugging computer programs. Debugging is an important skill that continues to be both difficult for novice programmers to learn and challenging for computer science educators to teach. These challenges persist despite a wealth of important research on the subject dating…

Abstraction is a major concept in computer science and serves as a powerful tool in software development. Pattern-oriented instruction (POI) is a pedagogical approach that incorporates patterns in an introductory computer science course in order to structure the learning of algorithmic problem solving. This paper examines abstraction processes in…

This thesis addresses problems from two areas of theoretical computer science. The first area is that of computational learning theory, which is the study of the phenomenon of concept learning using formal mathematical models. The goal of computational learning theory is to investigate learning in a rigorous manner through the use of techniques…

Two kinds of secret writing, codes and ciphers, are discussed. The weakness of a ciphering system mentioned in the March 1981 issue is pointed out, and an alternate method is presented. Programs written in BASIC are presented which can be used to encipher messages and help break ciphers. (MP)

The early development of computers and computer technology is traced, and the relationship of the computer and mathematics is discussed. (SD)