Pseudo abstract composition: The case of language concatenation

Ronnie Alankry, David Ginat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationITiCSE'12 - Proceedings of the ACM Conference on Innovation and Technology in Computer Science Education
Pages28-33
Number of pages6
DOIs
StatePublished - 2012
Event17th ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE'12 - Haifa, Israel
Duration: 3 Jul 20125 Jul 2012

Publication series

NameAnnual Conference on Innovation and Technology in Computer Science Education, ITiCSE
ISSN (Print)1942-647X

Conference

Conference17th ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE'12
Country/TerritoryIsrael
CityHaifa
Period3/07/125/07/12

Keywords

  • abstraction
  • composition
  • computational models
  • concatenation
  • non-determinism

Fingerprint

Dive into the research topics of 'Pseudo abstract composition: The case of language concatenation'. Together they form a unique fingerprint.

Cite this