Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Distributed Algorithms
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction to Algorithms
Communications of the ACM - Self managed systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Detecting and understanding students' misconceptions related to algorithms and data structures
Proceedings of the 43rd ACM technical symposium on Computer Science Education
| Hi-index | 0.01 |
The notions of "as if" and "don't care" are essential notions in computational thinking. The former appears in the reformulation of tasks, reduction between tasks, auxiliary variables, and more. The latter is the core of non-determinism, asynchronous execution, and arbitrary choices in deterministic algorithms. The two notions are not intuitive, and require abstraction. We expect computer science (CS) graduates, who developed computational thinking during their studies, to demonstrate comprehension of these notions. Unfortunately, this may not be the case. In this paper we present a study of CS graduates, which reveals difficulties of limited comprehension and acceptance of these notions. We characterize the difficulties, relate them to cognitive aspects of abstraction, and offer some didactic suggestions.