Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Data Structure

A named way of organizing and storing data so it can be accessed and modified efficiently. Belongs here: Binary Search Tree, Hash Table, Linked List, Queue and Stack, each a specific arrangement of data with its own defined operations. Does not belong here: the algorithms that operate on a data structure, filed under Algorithm, and abstract descriptions of computation that are not themselves a way of storing data, filed under Model.

Facts
Comparison
Era of Emergence
1974 1
Browse By
Sources
1. Wikipedia: Abstract data type
Wikimedia FoundationAbstract data type, History section, Liskov and Zilles 1974 sentence
Quote, Abstract data type, History section, Liskov and Zilles 1974 sentence
ADTs were first proposed by Barbara Liskov and Stephen N. Zilles in 1974, as part of the development of the CLU language.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.