计算机应用基础数据结构部分试题及答案(2)

计算机应用基础数据结构部分试题及答案（Computer application

basic data structure part questions and answers） Some things, knowing that is wrong, but also to adhere to, because not reconciled; some people, knowing that love is also to give up, because there is no end; sometimes, knowing that there is no road, but still forward, because used to.

Computer application basic data structure part questions and answers

1. choice questions:

1. the complexity of the time complexity of the following program segments is (

For (i=1; i<=n; i++)

For (j=1; j<=i; j++)

For (k=1; k<=j; k++) X=x+1;

A., O (1), B.O (n), C., O (N2), D.O (N3)

2., in the data structure, the data structure can be logically divided into ()

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

3. data structures include four basic types: set, linear, tree, and graph structures.

A. storage structure, B. logic structure, C. basic operation, D. algorithm description

4. data () include search, insert, delete, update and sort, etc..

A. storage structure, B. logic structure, C. basic operation, D. algorithm description

5. the storage structure of data includes four basic types of sequence, link, hash, and ().

A. linear B. array, C. set, D. index

6., the following () is the best time complexity, i.e., the shortest execution time.

A., O (n), B.O (logn), C., O (nlogn), D.O (N2)

7. the complexity of the time complexity of the following program segment is ()

For (int i=0; i

For (int j=0; j

A[i][j]=i*j;

A., O (M2), B.O (N2), C., O (m*n), D.O (m+n)

8. () is not the basic feature of the algorithm.

A. correctness, B. length is limited, C. within the specified time to complete D. certainty

9. the input sequence of a stack is 1, 2, 3, 4, 5, and the following sequence is the output sequence of the stack.

A. 31245, B.41325, C.23415, D.14253

10., in the N node with two nodes, the number of chains is empty, and the number of fields is ().

A., n-1, B., 2N-1, C., n+1, D., 2n+1

1-5, D, C, B, C, D,, B, C, C, C, C

11. known complete two fork tree has 30 nodes, then the whole two fork tree has () 1 degrees of node.

A. 0, B. 1, C. 2, D. are not sure

12. depth two K full tree, at least () node.

A., 2k-1, B., 2k-2, C., 2k-1, D., 2k-2

13. depth two K full tree, at most () nodes.

A., 2k-1, B., 2k-2, C., 2k-1, D., 2k-2

14. direct insertion sort of a set of records (54, 38, 96, 23, 15, 60, 72, 45, 83, 60). When seventh records are inserted into an ordered table, comparisons (Times) are needed to find the insertion position.

A. 1, B. 2, C. 3, D. 4

15. bisearch ordered table (6, 15, 30, 37, 65, 68, 70, 72, 89, 99, 37) if required in order to find elements, and the elements in the table (compare).

A. 65, 15, 37, B. 68, 30, 37, C. 65, 15, 30, D. 65,, 15, 30, 37

16. a length linear table storage order of the N, to the I elements (1 I n+1) to insert a new element, need from behind the front turn after the shift (elements).

A., n-i, B., n-i+1, C., n-i-1, D., I

17., as shown in the 4 two fork tree, () is not exactly two fork tree.

(A) (B) (C) (D);

18. for the length of an ordered list stored in order of 18,

if the use of binary search, to find the fifteenth elements of the search length ().

A. 3 B. 4 C. 5 D.6

19., there are 10000 unordered elements, and you want to pick out the first 10 largest elements at the fastest speed. You'd better choose () the ranking method.

A. heap sort, B. quick sort, C. bubble sort, D. insert sort

20. computer algorithms refer to ().

A. computing method, B. sorting method, C., solve the problem of ordered sequence, D. scheduling method

11-15, B, C, A, C, D,, B, C, A, B, A

21. a stack of sequences 1, 2, 3, 4, then its unlikely output sequence is ().

A. 1, 2, 3, 4, B., 4, 3, 2, 1, C., 1, 3, 4, 2, D. 4,,, 1, 2, 3

22. for any tree with two branches, if its junction number is N0, and the knot number of 2 is N2, then N0= ().

A., N2-1, B., N2+1, C., N2, D., N2-2