Probability theory has extensive applications across various domains, such as statistics, computer science, and finance. In probability education, students are introduced to fundamental principles which may include mathematical topics such as combinatorics and symmetric sample spaces. Students pursuing degrees in computer science possess a robust…

The present study was conducted to determine how implementing computational thinking (via a proxy in AP Computer Science Principles) into a school's curriculum impacted student proficiency rates on the New York State Geometry Regents. Recent research has suggested that computational thinking is a skill that transcends specific content areas and…

When solving counting problems, students often struggle with determining what they are trying to count (and thus what problem type they are trying to solve and, ultimately, what formula appropriately applies). There is a need to explore potential interventions to deepen students' understanding of key distinctions between problem types and to…

A key debate in computer science education is whether and how computational thinking (CT) is used within disciplines other than computer science. Broad definitions provide many avenues for developing integrated instruction, as practices within existing activities can simply be reframed in terms of CT. But such general use of the term CT may…

Previous research proved that teaching spreadsheeting from a programming perspective is much more effective than the widely accepted tool-centered surface approach methods. Spreadsheeting as an introductory programming approach allows students to build up schemata leading to contextualized, concept-based problem-solving. Furthermore, it provides…

Moving among levels of abstraction is an important skill in mathematics and computer science, and students show similar difficulties when applying abstraction in each discipline. While computer science educators have examined ways to explicitly teach students how to consciously navigate levels of abstraction, these ideas have not been explored in…

In order to create professional development experiences, curriculum materials, and policies that support elementary school teachers to embed computational thinking (CT) in their teaching, researchers and teacher educators must understand ways teachers see CT as connecting to their classroom practices. We interviewed 12 elementary school teachers,…

The subject of the research is to build methodologies to evaluate the student knowledge by testing. The author points to the importance of feedback about the mastering level in the learning process. Testing is considered as a tool. The object of the study is to create the test system models for defence practice problems. Special attention is paid…

Within the framework of the Testing Algorithmic and Application Skills project we tested first year students of Informatics at the beginning of their tertiary education. We were focusing on the students' level of understanding in different programming environments. In the present paper we provide the results from the University of Debrecen, the…

Self-regulation is the controlling of a process or activity by the students who are involved in Problem solving in Physics rather than by an external agency (Johnson, 2011). Selfregulated learning consists of three main components: cognition, metacognition, and motivation. Cognition includes skills necessary to encode, memorise, and recall…

This paper offers a tutoring model its objective is to develop and establish the pedagogical-disciplinary knowledge of prospective computer science teachers with respect to guiding learners in problem-solving processes. The paper presents the tutoring model and the research that accompanied its implementation. The research findings indicate that…

Described is automata theory which is a branch of theoretical computer science. A decomposition theorem is presented that is easier than the Krohn-Rhodes theorem. Included are the definitions, the theorem, and a proof. (KR)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

New developments in the use of automatically scorable constructed response item types for large-scale assessment are reviewed for five domains: (1) mathematical reasoning; (2) algebra problem solving; (3) computer science; (4) architecture; and (5) natural language. Ways in which these technologies are likely to shape testing are considered. (SLD)

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)