Hybrid and Custom Data Structures: Evolution of the Data Structures Course

被引：0

作者：

Ernst, Daniel J. ^{[1
]}

Stevenson, Daniel E. ^{[1
]}

Wagner, Paul ^{[1
]}

机构：

[1] Univ Wisconsin, Dept Comp Sci, Eau Claire, WI 54702 USA

来源：

ITICSE 2009: PROCEEDING OF THE 2009 ACM SIGSE ANNUAL CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION | 2009年

关键词：

Data Structures;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：213 / 217

页数：5

共 50 条

[31] Programming Errors and Academic Performance in an Introductory Data Structures Course: A Per Gender Analysis [J].

Dagklis, Evangelos ;

Satratzemi, Maya ;

Koloniari, Georgia ;

Karakasidis, Alexandros .

TOWARDS A HYBRID, FLEXIBLE AND SOCIALLY ENGAGED HIGHER EDUCATION, VOL 4, ICL 2023, 2024, 911 :57-68

[32] Efficient Data Structures for a Hybrid Parallel and Vectorized Particle-in-Cell Code [J].

Barsamian, Yann ;

Violard, Eric ;

Hirstoaga, Sever A. .

2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2017, :1168-1177

[33] Probabilistic Data Structures in Adversarial Environments [J].

Clayton, David ;

Patton, Christopher ;

Shrimpton, Thomas .

PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, :1317-1334

[34] Dynamic range majority data structures [J].

Elmasry, Amr ;

He, Meng ;

Munro, J. Ian ;

Nicholson, Patrick K. .

THEORETICAL COMPUTER SCIENCE, 2016, 647 :59-73

[35] COMPARATIVE VISUALIZATION OF ALGORITHMS AND DATA STRUCTURES [J].

Vateha, Filip ;

Simonak, Slavomir .

COMPUTING AND INFORMATICS, 2025, 44 (02) :336-365

[36] Multiple representation for understanding data structures [J].

Hanciles, B ;

Shankararaman, V ;

Munoz, J .

COMPUTERS & EDUCATION, 1997, 29 (01) :1-11

[37] Characterizing History Independent Data Structures [J].

Jason D. Hartline ;

Edwin S. Hong ;

Alexander E. Mohr ;

William R. Pentney ;

Emily C. Rocke .

Algorithmica , 2005, 42 :57-74

[38] ERROR-CORRECTING DATA STRUCTURES [J].

Chen, Victor ;

Grigorescu, Elena ;

de Wolf, Ronald .

SIAM JOURNAL ON COMPUTING, 2013, 42 (01) :84-111

[39] TOOL SUPPORT FOR DATA-STRUCTURES [J].

GROSCH, J .

STRUCTURED PROGRAMMING, 1991, 12 (01) :31-38

[40] Data structures with dynamical random transitions [J].

Dombry, C. ;

Guillotin-Plantard, N. ;

Pincon, B. ;

Schott, R. .

RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) :403-426

← 1 2 3 4 5 →