The baffling CS notions of "as-if" and "don't-care"

SIGCSE'10 - Proceedings of the 41st ACM Technical Symposium on Computer Science Education

Volumn , Issue , 2010, Pages 385-389

  Ginat, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Abstraction; Non determinism; Task reformulation

Indexed keywords

AUXILIARY VARIABLES; COGNITIVE ASPECTS; DETERMINISTIC ALGORITHMS; NON-DETERMINISM;

ABSTRACTING; COMPUTER SCIENCE; EDUCATION COMPUTING;

ENGINEERING EDUCATION;

EID: 77952218716     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1734263.1734393     Document Type: Conference Paper

References (10)

1. Armoni, M. & Galezer, J. 2007. Non-determinism - an abstract concept in computer science studies, Computer Science Education, 17(4) 243-262.
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. 2001. Introduction to Algorithms, MIT Press. 2nd Ed.
3. Dijkstra, E.W. 1975. Guarded commands, nondeterminancy and formal derivation of programs, Communications of the ACM, 18(8) 453-457.
4. Dubinsky, E. 1991. Reflective abstraction in advanced mathematical thinking, in Tall, D. (Ed.) Advanced Mathematical Thinking. Kluger 95-123.
5. Hazzan, O. 2003. How students attempt to reduce abstraction in the learning of mathematics and in the learning of computer science, Computer Science Education, 13(2) 95-122.
6. Hopcroft, J.E., Motwani, R., & Ullman, J.D. 2001. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley. 2nd Ed.
7. Lewis, H.R. & Papadimitriou, C.H. 1981. Elements of the Theory of Computation, Prentice-Hall.
8. Lynch, A.N. 1996. Distributed Algorithms, Morgan Kaufman.
9. Wilensky, U. 1991. Abstract meditations on the concrete and concrete implications for mathematical education, in Harel, I., & Papert, S. (Eds.) Constructionism, Ablex Pub, 193-203.
10. Wing, J.M. 2006. Computational Thinking, Communications of the ACM, 49(3) 33-35.