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…

One of the subjects that undergraduate students learning Object Oriented (OO) design find hard to apply is the construction of class hierarchies in general, and the use of interface classes in particular. The design process requires decomposition and reconstruction of problems in order to model software classes. The common attributes and behaviors…

We studied students' conceptions of correctness and their influence on students' correctness-related practices by examining how 159 students had analyzed the correctness of error-free and erroneous algorithms and by interviewing seven students regarding their work. We found that students conceptualized program correctness as the sum of the…

This paper discusses the role of reduction in computer science and describes a study on undergraduate students' perception of the concept of reduction. Specifically, based on an analysis of students answers to questions addressing different computer science topics, we present several findings regarding the ways in which undergraduate students…