Background and Context: Considerable numbers of Computer science (CS) undergraduate majors struggle in Theory of Computation (ToC) courses, which strengthen bimodality beliefs of student performance. Reasons for students struggling are assumed to be manifold but substantial ground is based on studies providing singular insights into this matter.…

Background and Context: Though still a nascent area of research, serious games have been presented as means of engaging students in computer programming and computational thinking due to their immersive and interactive nature. Existing research is limited in its ability to provide systems based on sound instructional design models, and only a few…

Background & Context: This research focused on an online professional development (PD), the Inclusive Computer Science Model of PD, to support integrating computer science and computational thinking for all learners into K-5 literacy instruction. Objective: This research was conducted to understand elementary teachers' perceptions of the PD.…

Background and Context: Although context-based teaching and learning has been investigated extensively in science education, little is known regarding the use of contexts for teaching CS in secondary education. Objective: The aim of this study was to examine the characteristics of contexts suitable for teaching algorithms and to investigate…

Background and Context: There is a need for teachers who are prepared to teach integrated CS/CT throughout the K-12 curriculum. Drawing on three vignettes of teacher instructional practice, we build on a growing body of literature around how teachers integrate CS/CT into their classrooms after attending CS/CT focused professional development.…

Background and Context: While assessment of computational thinking concepts, practices, and perspectives is at the forefront of K-12 CS education, supporting student "communication about computation" has received relatively little attention. Objective: To examine the usability of process-based portfolios for capturing students'…

Reduction is one of the key techniques used for problem-solving in computer science. In particular, in the theory of computation and complexity (TCC), mapping and polynomial reductions are used for analysis of decidability and computational complexity of problems, including the core concept of NP-completeness. Reduction is a highly abstract…

Reduction is a central ingredient of computational thinking, and an important tool in algorithm design, in computability theory, and in complexity theory. Reduction has been recognized to be a difficult topic for students to learn. Previous studies on teaching reduction have concentrated on its use in special courses on the theory of computing. As…

The paper presents a study of novice difficulties with range conceptions in loop design. CS2 students were asked to solve four related enumeration tasks, which required various loop boundary specifications. The student solutions varied considerably in conciseness and efficiency. The solution diversity reveals significant differences in range…