The second edition of the source data structure (C language version) after-school answer
Data Structure answer
5. Multiple Choice
(1) in a data structure, the data structure can be logically divided into (C).
A. Static structure and dynamic structure B. Non-compact and compact structure
C. Linear and nonlinear structural configuration D. Inner and outer structures
Form (2) and the data element itself, content, relative position, regardless of the number of data (C).
A. Storage structure B. Storage implementation
C. Logical structure D. Operations to achieve
Data structure (C language version) after-school answer
(3) generally requires that all elements of the same logical data structure has the same characteristics, which means (B).
A. Data having the same characteristics
B. Not only the number of data items to the data elements included in the same, and data items corresponding to the type to be consistent
C. Each data element is the same
D. The number of data items to be included in the data element is equal to
(4) The following statement is correct (D).
A. Data element is the smallest unit of data
B. Data entry is the basic unit of data
C. It is a collection of data structures with each structure data item
Data structure (C language version) after-school answer
D. On the surface of some very same data may have the same logical structure
Explanation: Data Element is the basic unit of data, the data item is the smallest unit of data, the data structure is a collection of data elements with each structure.
Time (5) depends on the complexity of the algorithm (D).
A. Scale of the problem B. Initial state data to be processed
C. Computer configuration D. A and B
Explanation: The time complexity of the algorithm is not only related to the size of the problem, but also with other factors issues. As some of the ordering algorithm, the initial state of the execution time of the relevant records to be sorted. To this end, the algorithm will sometimes have the best, worst and average time complexity of the evaluation.
(6) the following data structure, (A) is a non-linear data structures
A. Tree B. String C. D. queue Stack
6. Analyze the time complexity of each segment below.
(1) x = 90; y = 100;
while(y>0)
if(x>100)
{X = x-10; and--;}
else x++;
The answer: O (1)
Explanation: The number of executions is a constant program of the order.
（2）for (i=0; i<n; i++)
for (j=0; j<m; j++)
a[i][j]=0;
Answer: O (m * n)
"Data structure (C language version)," the second edition of Yan Wei Min, Wu Weimin edited after-school exercise answers + source code
Original link: https://www.cnblogs.com/readlearn/p/12506860.html
The second edition of the source data structure (C language version) after-school answer
Data Structure answer
5. Multiple Choice
(1) in a data structure, the data structure can be logically divided into (C).
A. Static structure and dynamic structure B. Non-compact and compact structure
C. Linear and nonlinear structural configuration D. Inner and outer structures
Form (2) and the data element itself, content, relative position, regardless of the number of data (C).
A. Storage structure B. Storage implementation
C. Logical structure D. Operations to achieve
Data structure (C language version) after-school answer
(3) generally requires that all elements of the same logical data structure has the same characteristics, which means (B).
A. Data having the same characteristics
B. Not only the number of data items to the data elements included in the same, and data items corresponding to the type to be consistent
C. Each data element is the same
D. The number of data items to be included in the data element is equal to
(4) The following statement is correct (D).
A. Data element is the smallest unit of data
B. Data entry is the basic unit of data
C. It is a collection of data structures with each structure data item
Data structure (C language version) after-school answer
D. On the surface of some very same data may have the same logical structure
Explanation: Data Element is the basic unit of data, the data item is the smallest unit of data, the data structure is a collection of data elements with each structure.
Time (5) depends on the complexity of the algorithm (D).
A. Scale of the problem B. Initial state data to be processed
C. Computer configuration D. A and B
Explanation: The time complexity of the algorithm is not only related to the size of the problem, but also with other factors issues. As some of the ordering algorithm, the initial state of the execution time of the relevant records to be sorted. To this end, the algorithm will sometimes have the best, worst and average time complexity of the evaluation.
(6) the following data structure, (A) is a non-linear data structures
A. Tree B. String C. D. queue Stack
6. Analyze the time complexity of each segment below.
(1) x = 90; y = 100;
while(y>0)
if(x>100)
{X = x-10; and--;}
else x++;
The answer: O (1)
Explanation: The number of executions is a constant program of the order.
（2）for (i=0; i<n; i++)
for (j=0; j<m; j++)
a[i][j]=0;
Answer: O (m * n)
"Data structure (C language version)," the second edition of Yan Wei Min, Wu Weimin edited after-school exercise answers + source code