NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 6 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Poole, Frederick J.; Clarke-Midura, Jody; Rasmussen, Melissa; Shehzad, Umar; Lee, Victor R. – Computer Science Education, 2022
There is a growing perception that computational thinking can be developed in unplugged environments. A recent trend among these unplugged approaches is the use of tabletop games. While there are many commercial tabletop games on the market that are promoted as teaching computer science and/or computational skills, little is known about how these…
Descriptors: Teaching Methods, Games, Computation, Thinking Skills
Peer reviewed Peer reviewed
Direct linkDirect link
Akkaya, Ali; Akpinar, Yavuz – Computer Science Education, 2022
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…
Descriptors: Experiential Learning, Educational Games, Instructional Design, Programming
Peer reviewed Peer reviewed
Direct linkDirect link
Fields, Deborah; Lui, Debora; Kafai, Yasmin; Jayathirtha, Gayithri; Walker, Justice; Shaw, Mia – Computer Science Education, 2021
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'…
Descriptors: Computer Science Education, Computation, Thinking Skills, Student Projects
Peer reviewed Peer reviewed
Direct linkDirect link
Gal-Ezer, Judith; Trakhtenbrot, Mark – Computer Science Education, 2016
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…
Descriptors: Computer Science Education, Problem Solving, Computation, Difficulty Level
Peer reviewed Peer reviewed
Direct linkDirect link
Yadav, Aman; Krist, Christina; Good, Jon; Caeli, Elisa Nadire – Computer Science Education, 2018
A number of efforts have focused on preparing teachers to integrate CT within secondary disciplinary subject areas; however, there is little research on how CT ideas could be embedded within elementary subjects. We designed a professional development activity for elementary teachers to embed CT within science and examined how their understanding…
Descriptors: Computation, Thinking Skills, Elementary School Teachers, Faculty Development
Peer reviewed Peer reviewed
Direct linkDirect link
Ginat, David – Computer Science Education, 2004
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…
Descriptors: Novices, Computer Science Education, Grade 12, Programming