Patterns for decoupling data structures and algorithms

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to build a data structure that is extensible and reusable, it is necessary to decouple the intrinsic and primitive behavior of the structure from the application specific behavior that manipulates it. To illustrate such a construction, this paper proposes a uniform object-oriented structural pattern for recursive data structures, and shows how external algorithms can be added without rewriting any code using the visitor design pattern. By presenting data structures iu this mauner, we can more effectively teach students about recursion, abstraction, design, and good software engineering practices.

Cite

CITATION STYLE

APA

Nguyen, D. Z., & Wong, S. B. (1999). Patterns for decoupling data structures and algorithms. In SIGCSE 1999 - Proceedings of the 13th SIGCSE Technical Symposium on Computer Science Education (pp. 87–91). Association for Computing Machinery, Inc. https://doi.org/10.1145/299649.299693

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free