Development of a data structure
What is a data structure
Related concepts and terminology of data structures
Data (the Data), can be entered into the computer and the computer program set of symbols and the identification process, the operation target of the computer is a generic term
Data element (Data Element) is the basic unit of data, and considered as a whole process, is the basic unit of the data structure
The data item (Data Item) is composed of data elements indivisible minimum unit, a data element may be formed of a plurality of data items
Data objects (Data Object) is a collection of data elements of the same nature, is a subset of the data
Data structure (Data Structure) refers to the relationship between the presence of one or more data elements of the particular relationship between each set of data elements called structural
Four basic structure
- Collection : between data elements is "a collection belonging to the same", in addition to any relationship
- Linear structure : it exists between the data elements of one linear
- Tree structure : the existence of data elements between many levels of relationships
- FIG structure or mesh structure : exists between data elements -many arbitrary relationship
Logical structure (Logical Structure)
- Overall logical relationships between data elements
- Logic: associatively or adjacency relationship between data elements, a mathematical description of the operation object
Physical structure (Structure)
- Data represent means in the computer (image), also known as the storage structure (Storage Structure)
- Study of the data structure in the computer representation
Bit (Bit)
- The smallest unit of information in a computer
- Letter B can be represented by bit strings 001,000,010, the bit string corresponding to each data item called a sub-bit string element (Element) or a node (Data Field)
- When data elements from the plurality of data items, the sub-bit string corresponding to each bit string of data items referred to as a data field (Data Field)
The order of maps (Sequential Mapping) (sequential storage structure)
- By means of the relative position of the data element in memory to represent logical relationships between data elements
- The physical position of the adjacent memory cells, thereby obtaining logically adjacent storage element stores a data storage structure called a sequential
Non-sequential image (Non-Sequential Mapping) (Storage Structure)
- By means of stored data elements pointer indicates the address (the Pointer) represent logical relationships between data elements
- The chain storage is to use a set of memory cells for storing data of any element, which does not require the physical location adjacent the logical relationships between data elements is represented by a pointer field attached