Reductive thinking in undergraduate CS courses

Authors:
Michal Armoni;Judith Gal-Ezer;Orit Hazzan
Affiliations:
Tel-Aviv University;The Open University of Israel, Raanana, Israel;Technion, Haifa
Venue:
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Year:
2006

Citing 2
Cited 4

Efficiency of algorithms for programming beginners

SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
Reduction -- an abstract thinking pattern: the case of the computational models course

Proceedings of the 37th SIGCSE technical symposium on Computer science education

Computer lab work on theory

Proceedings of the fifteenth annual conference on Innovation and technology in computer science education
From theory to practice: NP-completeness for every CS student

Proceedings of the 18th ACM conference on Innovation and technology in computer science education
Why is big-O analysis hard?

Proceedings of the 13th Koli Calling International Conference on Computing Education Research
What makes big-O analysis difficult: understanding how students understand runtime analysis

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes research on the perception of undergraduate students of the concept of reduction. Specifically, based on an analysis of students' answers to questions addressing different CS topics, we present several findings regarding the ways in which undergraduate students conceive of and apply reduction. In addition to the research description and results, the paper discusses the role of reduction in CS and suggests several teaching applications.