In theoretical computer science, an abstract data structure is an abstract storage for data defined in terms of the set of operations to be performed on data and computational complexity for performing these operations, regardless the implementation in a concrete data structure. Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: Computer science ... Complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem. ... A binary tree, a simple type of branching linked data structure. ...
Selection of an abstract data structure is crucial in design of efficient algorithms and in estimating their computational complexity, while selection of concrete data structures is important for efficient implementation of algorithms. Jump to: navigation, search Flowcharts are often used to represent algorithms. ... In engineering and computer science, an implementation is the practical application of a method or algorithm to fulfill a desired purpose. ...
This notion is very close to that of Abstract data type (ADT), used in theory of programming languages. A close notion of data model additionally considers the pattern of interrelations between data elements (structure of the data structure, however awkward that may sound). This article needs to be cleaned up to conform to a higher standard of quality. ... Jump to: navigation, search A programming language or computer language is a standardized communication technique for expressing instructions to a computer. ... A data model is a model that describes in an abstract way how data is represented in a business organization, an information system or a database management system. ... britney was here not therer but here!For specific meanings of structure in specific fields, see Structure (disambiguation). ...
The names of many abstract data structures (and abstract data types) match the names of concrete data structures.
In theoretical computer science, an abstractdatastructure is an abstract storage for data defined in terms of the set of operations to be performed on data and computational complexity for performing these operations, regardless the implementation in a concrete datastructure.
Selection of an abstractdatastructure is crucial in design of efficient algorithms and in estimating their computational complexity, while selection of concrete datastructures is important for efficient implementation of algorithms.
A close notion of data model additionally considers the pattern of interrelations between data elements (structure of the datastructure, however awkward that may sound).
In the design of many types of programs, the choice of datastructures is a primary design consideration, as experience in building large systems has shown that the difficulty of implementation and the quality and performance of the final result depends heavily on choosing the best datastructure.
After the datastructures are chosen, the algorithms to be used often become relatively obvious.
A datastructure can be viewed as an interface between two functions or as an implementation of methods to access storage that is organized according to the associated data type.
Feeds |
Contact