research-article

Pseudo abstract composition: the case of language concatenation

Authors:

David Ginat,

Ronnie AlankryAuthors Info & Claims

ITiCSE '12: Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education

Pages 28 - 33

https://doi.org/10.1145/2325296.2325307

Published: 03 July 2012 Publication History

Get Access

Abstract

Composition is a fundamental problem solving heuristic. In computer science, it primarily appears in program design with concrete objects such as language constructs. It also appears in more abstract forms in higher-level courses. One such form is that of language concatenation in the Computational Models course. This concatenation involves the composition of two specifications of infinite sets (source languages) into a third one, and requires both abstraction and non-deterministic conception. In this paper, we illuminate behaviors of advanced high school students, with such composition. Students who encountered difficulties offered pseudo solutions, which enclosed only "surface" features and observations. We orderly display their solutions, discuss them, and offer suggestions for educators to cope with this phenomenon.

References

[1]

Armoni, M. and Gal-Ezer, J. (2006). Introducing non-determinism, Journal of Computers in Mathematics and Science Teaching, 25(4), 325--359.

Google Scholar

[2]

Armoni M. and Gal-Ezer, (2006). Reduction -- an abstract thinking pattern: the case of the computational models course, SIGCSE'06, 389--394.

Digital Library

Google Scholar

[3]

Armoni, M. and Gal-Ezer, J. (2007). Non-determinism: an abstract concept in computer science studies, Computer Science Education, 17(4), 243--262.

Crossref

Google Scholar

[4]

Astrachan, O., Berry, G., Cox, L., and Mitchener, G. (1998). Design patterns: an essential component of CS Curricula. SIGCSE'98, 153--160.

Digital Library

Google Scholar

[5]

Hazzan, O. (1999). Reducing abstraction level when learning abstract algebra concepts, Educational Studies in Mathemartics, 40, 71--90.

Crossref

Google Scholar

[6]

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.

Crossref

Google Scholar

[7]

Muller, O., Ginat, D., and Haberman, B. (2007). Pattern-oriented instruction and its influence on problem decomposition and solution construction, ITiCSE'07, 151--155.

Digital Library

Google Scholar

[8]

Polya, G. (1954). How to Solve It. Princeton University Press.

Google Scholar

[9]

Schank, P. K., Linn, C. M., and Clancy, J. M. (1993). Supporting Pascal programming with an on-line template library and case studies, International Journal of Man-Machine Studies, 38(6), 1031--1048.

Digital Library

Google Scholar

[10]

Schoenfeld, A. E. (1992). Learning to think mathematically: problem solving, metacognition, and sense making in mathematics, in Grouws D. A. (ed.), Handbook of Research on Mathematics Teaching and Learning, 334--370.

Google Scholar

[11]

Soloway, E. (1986). Learning to program=learning to construct mechanisms and explanations. Communications of the ACM, 29(9), 1031--1048.

Digital Library

Google Scholar

[12]

Sphorer, J., Soloway, E., and Pope, E. (1985). A goal/plan analysis of buggy Pascal programs. Human-Computer Interaction, 1(2), 163--207.

Digital Library

Google Scholar

[13]

Wing, J. (2006). Computational thinking. Communications of the ACM, 49(3), 33--35.

Digital Library

Google Scholar

Cited By

View all

Armoni MGal-Ezer J(2023)Computer Science Education Research in IsraelPast, Present and Future of Computing Education Research10.1007/978-3-031-25336-2_18(395-420)Online publication date: 18-Apr-2023
https://doi.org/10.1007/978-3-031-25336-2_18
Vahrenhold JCutts QFalkner K(2019)Schools (K–12)The Cambridge Handbook of Computing Education Research10.1017/9781108654555.019(547-583)Online publication date: 15-Feb-2019
https://doi.org/10.1017/9781108654555.019
(2019)The Cambridge Handbook of Computing Education Research10.1017/9781108654555Online publication date: 15-Feb-2019
https://doi.org/10.1017/9781108654555

Index Terms

Pseudo abstract composition: the case of language concatenation
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Computing education programs
        Computer science education
        Information science education

Recommendations

Towards the Composition of Specifications in Event-B

The development of a system can start with the creation of a specification. Following this viewpoint, we claim that often a specification can be constructed from the combination of specifications which can be seen as composition. Event-B is a formal ...
A power-set construction for reducing Büchi automata to non-determinism degree two

Buchi automata are finite automata that accept languages of infinitely long strings, so-called @w-languages. It is well known that, unlike in the finite-string case, deterministic and non-deterministic Buchi automata accept different @w-language classes,...
Reduction -- an abstract thinking pattern: the case of the computational models course
SIGCSE '06: Proceedings of the 37th SIGCSE technical symposium on Computer science education

Abstraction has been the focus of many researches in mathematics education and to some extent in computer science education. Abstract thinking characterizes the theoretical foundations of computer science, where reduction is one important abstract ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ITiCSE '12: Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education

July 2012

424 pages

ISBN:9781450312462

DOI:10.1145/2325296

Conference Chairs:
Tami Lapidot
Technion, Israel
,
Judith Gal-Ezer
The Open University, Israel
,
Program Chairs:
Michael E. Caspersen
Aarhus University, Denmark
,
Orit Hazzan
Technion, Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ITiCSE '12

Sponsor:

Bilkent University
SIGCSE

ITiCSE '12: Annual Conference on Innovation and Technology in Computer Science Education

July 3 - 5, 2012

Haifa, Israel

Acceptance Rates

Overall Acceptance Rate 544 of 1,597 submissions, 34%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
144
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Armoni MGal-Ezer J(2023)Computer Science Education Research in IsraelPast, Present and Future of Computing Education Research10.1007/978-3-031-25336-2_18(395-420)Online publication date: 18-Apr-2023
https://doi.org/10.1007/978-3-031-25336-2_18
Vahrenhold JCutts QFalkner K(2019)Schools (K–12)The Cambridge Handbook of Computing Education Research10.1017/9781108654555.019(547-583)Online publication date: 15-Feb-2019
https://doi.org/10.1017/9781108654555.019
(2019)The Cambridge Handbook of Computing Education Research10.1017/9781108654555Online publication date: 15-Feb-2019
https://doi.org/10.1017/9781108654555

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Towards the Composition of Specifications in Event-B

A power-set construction for reducing Büchi automata to non-determinism degree two

Reduction -- an abstract thinking pattern: the case of the computational models course