Basic concepts and data structures basic operation order table

True or False

If the chain is represented by a linear address table, the elements in the table must be continuous. F

Analysis: storage of a chain store, the address may be continuous or may be scattered.

Abstract data types are defined and related to the specific implementation of the basic operation. F

Analysis: !! abstract data types, defined storage structure

Multiple choice

In the data structure, the machine-independent data structure is used (A)
A. logical structure
B. storage structure
C. Structure and logical storage structure
D. physical structure
From the physical memory data structure can be divided into B
A. dynamic structures, the static structure
B. sequential structure, chain structure
C. linear structure, a tree structure, a collection of graphical structures and structures
basic structure D., Structural arrangement
The following description of the logical structure of data on, (A) is correct.
A. logical structure data is to describe the relationship between elements of a data
logical structure data B. reflects the data is stored in the computer
C. logical structure data into sequential structure chain structure and
logical structure data into D. static structure and dynamic structure
The presence of (C) the relationship between the structure of the graphical elements.
A. one
B. many
C.-many
D. Many-to
The following statement is correct (D).
A. Data Element is the smallest unit of data
B. Data items are the basic unit of data
C. Data structure is a collection of data items each having the structure
D. some very upper surface of the same data may have the same logical structure
, Linear structure, a tree structure, and pattern of four basic types (B) comprises a set of data.
Storage structure A.
B. Logical Structure
C. basic operation
D. algorithm description
When deciding which storage structure selection, are generally not considered (A)
A. how the value of each node
B. The node number of the number of points
C. What operational data
D. As used programming languages such a structure is easy
Programming data structure is a problem in the study of non-numerical subject computer (A) and the relationship between them and calculating the like.
Operation target A.
B. Calculation Method
C. logical memory
D. Data Mapping
Data representing in computer memory means (A).
A. data storage structure (i.e., a physical structure)
B. Data Structure
logical structure of the data C.
The relationship between the data element D.
The presence of (B) the relationship between the elements of the tree structure.
A. one
B. many
C.-many
D. Many-to
Exists () a linear relationship between the elements of the structure.
A. one
B. many
C.-many
D. Many-to

Knowledge supplement

Logical structure

Collection structure: In addition to "belong to a set of" outside the relationship, no other relationships between elements in a data structure
Linear structure: to-one correlation between the data structure elements
Tree structure: there is a correlation in many of the elements of the data structure
Graph structure: many to many relationship exists in the data structure element

Physical structure (storage structure)

Sequential storage structure: a contiguous memory space.
- Advantages: Random Access
- Cons: Low insertion deleted efficiency, fixed size
Storage Structure: Not necessarily contiguous memory space.
- Pros: size of dynamic expansion, high efficiency insertion deleted
- Disadvantages: not random access.
Index storage structure: For easier access, the overall disorder, but the order between the index block, you need extra space to store the index table.
- Advantages: sequential search for an improved, high search efficiency
- Cons: need extra space to store the index
Hash storage structure: selecting a function, data elements there may be a plurality of data elements stored in the same location, to cause an address conflict is calculated as a function of the storage location.
- Pros: Find based on the data itself can be found, look for high efficiency, high access efficiency.
- Disadvantages: the random access is not easy to sequential search.

Dynamic data structures and static data structure

Based on the data structure is typically obtained anywhere in the computer memory and the ability to store data, designated by a bit string pointer indicating a memory address, it may be stored in memory by the program operation. Thus, the arrays and data structures recorded based on the address arithmetic calculation and data items; the linked data structure is based on the internal structure of the address data items stored.

Static data structures: characterized by a fixed-size storage space allocated by the system, after the program is running, the position and capacity of the storage space will no longer change.
Dynamic data structure: The total amount of data storage uncertain, but a determination of each data element of the conventional definition of the initial size of the space, a plurality of data elements of the same size number distribution space; problem when the data is changed when the size of data storage space also changes. If the amount of data increases, the system will re-apply for a new space; if the amount of data reduction, the extra space will be available to return to the system; data usage when they could be used explicit what attribute fields, these fields are what type of property without the need clearly defined in advance for each attribute field name, type, belongs level.
Summary: static data structures need to advance the remaining space systems, and dynamic data structures are parsed data according to the analytical method and the free allocation of storage space, so much smaller than the redundant static data structures, dynamic data structures.

Review of the data structure of (1) the data structure of the basic concepts and basic operation order table