Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/reduction-in-cs-a-mostly-quantitative-analysis-of-reductive-solutions-28DeGYAimu
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2009 by ACM Inc.
- ISSN
- 1531-4278
- DOI
- 10.1145/1482348.1482350
- Publisher site
- See Article on Publisher Site
Abstract
Reduction is a problem-solving strategy, relevant to various areas of computer science, and strongly connected to abstraction: a reductive solution necessitates establishing a connection among problems that may seem totally disconnected at first sight, and abstracts the solution to the reduced-to problem by encapsulating it as a black box. The study described in this article continues a previous, qualitative study that examined the ways undergraduate computer science students perceive, experience, and use reduction as a problem-solving strategy. The current study examines the same issue, but in the context of a larger population, using also quantitative analysis, and focusing on algorithmic problems. The findings indicate difficulties students have with the abstract characteristics of reduction and with acknowledging reduction as a general problem-solving strategy.
Journal
Journal on Educational Resources in Computing (JERIC) – Association for Computing Machinery
Published: Jan 1, 2009