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…

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…