topic:
1. Multiple-choice questions
1. Each data structure has 3 basic operations: insertion, deletion and search, this kind of statement (B).
A. Correct B. Incorrect
2. The data structure is formally defined as (D, S), where D is a finite set of (B) and S is a finite set of (H) on D.
A. Algorithm B. Data element C. Data operation D. Logical structure
E. Operation F. Image G. Storage H. Relationship
3. The following terms that have nothing to do with the storage structure of data are (D).
A. Circular queue B. Linked list C. Hash (hash) table D. Stack
4. The purpose of algorithm analysis is (C), and the main two aspects of algorithm analysis are (E).
A. Give the rationality of the data structure B. Study the relationship between the input and output in the
algorithm C. Analyze the efficiency of the algorithm for improvement D. Analyze the ease of understanding and documentation of the algorithm
E. Space complexity and time complexity F . Correctness and conciseness
G. Readability and documentation H. Data complexity and program complexity
5. In the data structure, the data structure can be logically divided into (C).
A. Dynamic structure and static structure B. Compact structure and non-compact structure
C. Linear structure and nonlinear structure D. Internal structure and external structure
6. Computer algorithm refers to (C), it must have input, output and (F) 5 characteristics.
A. Calculation method B. Sorting method
C. Problem solving and finite operation sequence D. Scheduling method
E. Feasibility, portability and scalability F. Feasibility, determinism and finiteness
G. Determinism and finiteness H. Legibility, stability and safety
7. The sequential storage structure of the linear table is a storage structure of (A), and the chain storage structure of the linear table is a storage structure of (B).
A. Random access B. Sequential access
C. Index access D. Hash access
8. If the linear table adopts a chain storage structure, the address of the available storage unit in the memory (D) is required.
A. Must be continuous. B. Part of the address must be continuous.
C. Must be discontinuous. D. Continuous or discontinuous.
9. The time complexity of the algorithm depends on (A).
A. The scale of the problem B. The initial state of the data to be processed
C. The scale of the problem and the initial state of the data to be processed
10. Among the subordinate functions, the smallest asymptotic time is (B).
A.T1(n)=nlog2n+1000log2n B.T2(n)=nlog23-1000log2n
C.T3(n)=n2-1000log2n D.T4(n)=2nlog2n-1000log2n
2. Fill in the blank questions
1. Data logic structure includes (Linear structure tree structure graph structure) Three types, tree structure and graph structure collectively (non-linear structure).
2. For a given n elements, there are four logical structures that can be constructed: (collective structure), (linear structure),
(tree structure) and (graphic structure).
3. The five important characteristics of the algorithm are (infinity, correctness, feasibility, input and output).
4 The performance of the evaluation algorithm is mainly analyzed from the perspective of using computer resources (time complexity and space complexity).
5. There is a (one-to-one) relationship between elements in a linear structure, a (one-to-many) relationship between elements in a tree structure, and a (many-to-many) relationship between elements in a graph structure.
6. The time complexity of the following program segment is (O(n)).
i=s=0;
while(s<n)
{ i++;/ i=i+1 / s++;/ s=s+1 / } 7. The time complexity of the following program segment is (O(m*n)) . s=0; for(i=0;i<n;i++) for(j=0;j<m;j++) s+=a[i][j];