The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A model C++ tree iterator class for binary search trees
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Teaching data structure design patterns
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Design patterns for data structures
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Design patterns for the data structures and algorithms course
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Data Structures and Problem Solving Using Java
Data Structures and Problem Solving Using Java
Data Structures and Algorithms
Data Structures and Algorithms
Integrating theoretical and empirical computer science in a data structures course
Proceeding of the 44th ACM technical symposium on Computer science education
| Hi-index | 0.00 |
In recent years, the teaching of data structures has been revolutionised by object-oriented languages, especially Java, in which the concept of each Abstract Data Type is made explicit as an Interface. The existing texts, though, each use a single set of classes: sometimes a standard library such as Sun's SDK, but in other cases these form a library unique to the text. In contrast, this paper advocates an approach which seeks to prepare students for the common situation for software developers, who are asked to regularly adjust to a library they are unfamiliar with. The teaching we describe openly acknowledges the existence of many libraries. A single concept such as Stack is expressed in subtly different ways in each library; these differences are made explicit for the student. We also show examples of assessment tasks that can accompany the teaching.