table of Contents
In modern computer systems, the computer for more non-numerical processing control, management and data processing, unlike the prior process only numeric data. This time, the data type becomes a data structure having a certain combination of characters, tables, and the like obtained by the image format.
The treatment program how to deal with these data has become increasingly important, and the resulting discipline called data structures. Following up on a study it
1. The basic concepts and terminology relating to a data structure
(1) Data
Data are symbolic representations of objective things, it is a general term for all energy input to the computer and a computer program processing symbols.
(2) the data element
Data element is a basic unit of data, as a whole process, a data element may be composed of a plurality of data items.
(3) Data Object
Data object is a collection of data elements of the same nature, it is a subset of the data.
(4) Data Types
In order to characterize the operation characteristics of the data objects, the introduction of the concept.
Is a collection of data types and values define a general term for a set of operations on a set value.
In accordance with the "values" of different characteristics, it can be divided into high-level programming language and the atomic structure of the type of non-structural types of structure (can be seen as a data structure defined thereon and a method of operating on).
Therefore, the relationship between the data structures and data types are:
a data structure type = type + a method of operating a data structure in such a data structure.
(5) the abstract data structure
Abstract data type is a triplet (D, S, P). Where D is a data object, S is set on the relationship between the D, P is the set of basic operations on D.
Abstract data types according to different characteristic values, can be subdivided into three types: atom type, the fixed and variable type polymerization type polymerization.
Abstract here refers to the abstract mathematical characteristics. Abstract data types may not rely on the inherent structure of the specific hardware and compiler can be run on most machines, it can be described by a variety of programming languages.
2. Data Structure
When we solve a specific problem, specific ideas are:
abstracting a suitable mathematical model -> design a solution algorithm for this model -> programming -> debug, test was the final solution.
But some non-numerical calculation can not be described by mathematical equations, because the data is not numerical these problems may be encountered. Briefly:
the data structure is a programming problem a numerical study in non-operation target (specific relationship) and the computer subjects the relationship between them and the like operations .
Is a data structure between the core curriculum in mathematics, computer hardware and computer software, the structure of the data should not only discuss the mathematical structure of the data, but also consider the storage structure of the data.
Operating object data elements of a computer are not isolated, there is a relationship, it is the data structure. Data structure is divided into four basic structure:
a set of linear structures, and tree-like structure.
Storing configuration data structure in a computer, a data element in combination with a plurality of bits of a bit string said bit string is called the element (or node), a binary number is represented by a specific bit configuration.
And the relationship between data elements, there are two, one is a sequential storage structure (the relative position is stored), the other is a chain storage structure (memory pointer). In high-level programming language, described the storage structure with the "data type" .