Basic Principles
Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by an address—a bit string that can be itself stored in memory and manipulated by the program. Thus the record and array data structures are based on computing the addresses of data items with arithmetic operations; while the linked data structures are based on storing addresses of data items within the structure itself. Many data structures use both principles, sometimes combined in non-trivial ways (as in XOR linking)
The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure. The efficiency of a data structure cannot be analyzed separately from those operations. This observation motivates the theoretical concept of an abstract data type, a data structure that is defined indirectly by the operations that may be performed on it, and the mathematical properties of those operations (including their space and time cost).
Read more about this topic: Data Structure
Famous quotes containing the words basic and/or principles:
“Good shot, bad luck and hell are the five basic words to be used in a game of tennis, though these, of course, can be slightly amplified.”
—Virginia Graham (b. 1912)
“[The sceptic] must acknowledge, if he will acknowledge any thing, that all human life must perish, were his principles to prevail. All discourse, all action would immediately cease, and men remain in a total lethargy, till the necessities of nature, unsatisfied, put an end to their miserable existence.”
—David Hume (1711–1776)