**Data structure** — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly … Wikipedia

**data structure** — noun (computer science) the organization of data (and its storage allocations in a computer) • Topics: ↑computer, ↑computing machine, ↑computing device, ↑data processor, ↑electronic computer, ↑information processing system … Useful english dictionary

**data structure** — duomenų struktūra statusas T sritis informatika apibrėžtis Sudėtinis ↑duomenų tipas, sudarytas iš kitų duomenų reikšmių, sujungtų kuriuo nors būdu į visumą. Duomenų struktūra apibrėžia struktūrines reikšmes ir jų sujungimo būdą. Pagrindinės… … Enciklopedinis kompiuterijos žodynas

**data structure** — noun Date: 1963 any of various methods or formats (as an array, file, or record) for organizing data in a computer … New Collegiate Dictionary

**data structure** — noun An organization in software of data that allows more optimal searching, categorizing, or storage of information. Examples: matrix, stack, queue, dequeue, list … Wiktionary

**Data structure alignment** — is the way data is arranged and accessed in computer memory. It consists of two separate but related issues: data alignment and data structure padding. When a modern computer reads from or writes to a memory address, it will do this in word sized … Wikipedia

**Data structure diagram** — Example of a Data Structure Diagram. A Data Structure Diagram (DSD) is a data model used to describe conceptual data models by providing graphical notations which document entities and their relationships, and the constraints that binds them. The … Wikipedia

**Data structure augmentation** — In computer science augmenting a data structure means modifying it in some way to create a new one by storing new information in it. Augmenting data structures is quite common in software developing. This is mainly due to specific requirements of … Wikipedia

**Persistent data structure** — In computing, a persistent data structure is a data structure which always preserves the previous version of itself when it is modified; such data structures are effectively immutable, as their operations do not (visibly) update the structure in… … Wikipedia

**Disjoint-set data structure** — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia