Background and Context: Multiple studies report that experienced instructors lack consensus on the difficulty of programming tasks for novices. However, adequately gauging task difficulty is needed for alignment: to select and structure tasks in order to assess what students can and cannot do. Objective: The aim of this study was to examine…

Background and Context: Block-based programming is a popular approach to teaching introductory programming. Block-based programming often works in the context of microworlds, where students solve specific puzzles. It is used, for example, within the Hour of Code event, which targets millions of students. Objective: To identify design guidelines…

Background and Context: Integrating computer science (CS) and math in classrooms is an increasingly recognized way for schools to address national CS mandates. There is a need to understand how professional development (PD) can support teachers to integrate. Objective: We examined math teachers' interest, and confidence, in math, CS, and student…

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: Transfer is a process where students apply their learning to different contexts. This process includes using their knowledge to solve problems with similar complexity, and in new contexts. In the context of programming, transfer also includes being able to understand and use different programming languages. Objective: This…

Background and Context: Subgoal labeled worked examples have been extensively researched, but the research has been reported piecemeal. This paper aggregates data from three studies, including data previously unreported, to holistically examine the effect of subgoal labeled worked examples across three student populations and across different…

Background and Context: Recursion in binary trees has proven to be a hard topic. There was not much research on enhancing student understanding of this topic. Objective: We present a tutorial to enhance learning through practice of recursive operations in binary trees, as it is typically taught post-CS2. Method: We identified the misconceptions…

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…

Higher-education students now have more alternatives for searching for information than previous generations had. The Internet is a vast ocean of information sources, albeit with diverse reliability and quality. In Web 2.0 platforms, any participant can be a content creator. This reality is challenging for both the instructors and the students. We…

To design an effective computer science curriculum, educators require a systematic method of classifying the difficulty level of learning activities and assessment tasks. This is important for curriculum design and implementation and for communication between educators. Different educators must be able to use the method consistently, so that…

We propose an expanded definition of Threshold Concepts (TCs) that requires the successful acquisition and internalisation not only of knowledge, but also its practical elaboration in the domains of applied strategies and mental models. This richer definition allows us to clarify the relationship between TCs and Fundamental Ideas, and to account…

This paper reports on a series of introductory programming workshops, initially targeting female high school students, which utilised Lego Mindstorms robots. Cognitive load theory (CLT) was applied to the instructional design of the workshops, and a controlled experiment was also conducted investigating aspects of the interface. Results indicated…

Learning to program is known to be difficult for novices. High attrition and high failure rates in foundation-level programming courses undertaken at tertiary level in Computer Science programs, are commonly reported. A common approach to evaluating novice programming ability is through a combination of formative and summative assessments, with…

This paper describes an exercise in determining the cognitive difficulty of the assessment tasks in six computing courses within an Information Technology (IT) degree, importing Bloom's taxonomy from the field of educational psychology as an analytical framework. Three of the six courses comprise a Programming stream and three a Data…

In this paper, we present the results from a two-part study. We analyze 60 programs written by novice programmers aged 16-19 after their first programming course, in either Java or Python. The aim is to find difficulties independent of the language used, and such originating from the language. Second, we analyze the transition from a…