Data structures and algorithm analysis in C++
Data structures and algorithm analysis in C++
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Classic Data Structures in Java: A Visual and Explorational Approach
Classic Data Structures in Java: A Visual and Explorational Approach
Data Structures and the Java Collections Framework
Data Structures and the Java Collections Framework
Data Structures with C++ Using STL
Data Structures with C++ Using STL
A framework approach to teaching data structures
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
MCSTL: the multi-core standard template library
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Making sense of data structures exams
Proceedings of the Sixth international workshop on Computing education research
Applying data structures in exams
Proceedings of the 42nd ACM technical symposium on Computer science education
Injecting parallel computing into CS2
Proceedings of the 45th ACM technical symposium on Computer science education
Hi-index | 0.00 |
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list, stack, queue, tree, graph), and second, the usage of these basic data structures as provided by a data structures framework in solving larger application problems. We see a further evolution of data structures to include new generations of hybrid and custom data structures, implying that our students must not only understand how to use these new data structures but that they continue to understand low-level implementation issues so that they can develop the next generation of data structures needed in the future. We suggest that the data structures course evolve to reflect these new generations of data structures.