Multiple levels of abstraction in algorithmic problem solving

David Ginat, Yoav Blau

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

Abstract

The notion of abstraction repeatedly appears, in various ways, at all levels of computer science. It involves the aspects of leaving out details and comprehending concepts and mechanisms. It also involves the aspect of recognizing relationships between task elements. The latter aspect was not yet studied with respect to abstraction levels and algorithm design. We study it here. We analyze senior students' algorithmic solutions according to accepted interpretations of multiple abstraction levels, and offer guidelines for enhancing abstraction in students' algorithmics.

Original languageEnglish
Title of host publicationSIGCSE 2017 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education
PublisherAssociation for Computing Machinery
Pages237-242
Number of pages6
ISBN (Electronic)9781450346986
DOIs
StatePublished - 8 Mar 2017
Event48th ACM SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2017 - Seattle, United States
Duration: 8 Mar 201711 Mar 2017

Publication series

NameProceedings of the Conference on Integrating Technology into Computer Science Education, ITiCSE

Conference

Conference48th ACM SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2017
Country/TerritoryUnited States
CitySeattle
Period8/03/1711/03/17

Keywords

  • Abstraction
  • Algorithm design

Fingerprint

Dive into the research topics of 'Multiple levels of abstraction in algorithmic problem solving'. Together they form a unique fingerprint.

Cite this