data structure

In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented using the data types, references and operations on them provided by a programming language.
See more at Wikipedia.org...

Noun
1. (computer science) the organization of data (and its storage allocations in a computer)
(hypernym) arrangement, organization, organisation, system
(hyponym) hierarchical structure, hierarchical data structure
(classification) computer, computing machine, computing device, data processor, electronic computer, information processing system

<data, programming> Any method of organising a collection of data to allow it to be manipulated effectively. It may include meta data to describe the properties of the structure.
Examples data structures are: array, dictionary, graph, hash, heap, linked list, matrix, object, queue, ring, stack, tree, vector.
(2003-09-11)

data structure
(Tech) cấu trúc dữ liệu
(C) 2007 www.TừĐiểnTiếngViệt.net

B: (Matematika) struktur data
Built to Babylon by Hikmat Gumilar Visit my Website;