The versatile list: a pathway to abstraction

Authors:
John Hamer;Adriana Ferraro
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand
Venue:
ACSE '00 Proceedings of the Australasian conference on Computing education
Year:
2000

Citing 2
Cited 0

Foundations of computer science

Foundations of computer science
The top 10 reasons why object-oriented programming can't be taught in CS 1

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

The humble “list” is usually presented early in a first course on data structures and algorithms, one topic among many, generally considered less interesting than trees and graphs. We believe the list deserves better, and show how the list can be used to bring together a wide variety of Computer Science topics, including: algebraic reasoning, proof by induction, abstract data types, recursion, and generic programming. The emphasis is on developing abstraction and design skills, applying both theory and engineering considerations, ultimately arriving at an unexpectedly powerful framework.