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

In the 75. sorting method, the whole unordered sequence is divided into several small sub sequences and the insertion sorting method is called.

A. Hill sort, B. bubble sort, C. direct insertion sort, D. direct selection sorting

76. direct insertion sort method to sort the following 4 tables from comparison is the least number of ().

A. (94, 32, 40, 90,, 80, 46, 21, 69)

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.

B. (21, 32, 46, 40,, 80, 69, 90, 94)

C. (32, 40, 21, 46,, 69, 94, 90, 80)

D. (90, 69, 80, 46,, 21, 32, 94, 40)

77. a set of key records (46, 79, 56, 38, 40, 84), using a quick

sorting method, is based on the first record as a benchmark.

A. (38, 40, 46, 56, 84, 79)

B. (40, 38, 46, 79, 84, 56)

C. (40, 38, 46, 56, 84, 79)

D. (40, 38, 46, 84, 79, 56)

78. if the sequence of elements (7, 2, 5, 8, 1, 11) of heap sort, and the use of a small heap, from the initial data of the initial heap (for).

A. (1, 2, 5, 7, 11, 8)

B. (1, 2, 5, 8, 11, 7)

C. (1, 5, 2, 7, 11, 8)

D. (1, 5, 2, 8, 7, 11)

79. as shown, the preorder traversal sequence of the two fork tree is ().

A. EGFACDB

B. EAGCFBD

C. EACBDGF

D. EGACDFB

80., it is known that the preorder traversal sequence of a certain two tree is DACBE, and the ordered sequence is DEBAC, and its preorder traversal sequence is (). A. ACBED B. DEABC C. DECAB D. EDBAC

71-75, C, D, C, C, A,, B, D, C, B, C

81., it is known that the preorder traversal sequence of a two fork tree is ABDEFGC, and the ordered sequence is DEBGFAC, and the corresponding two fork tree is (). 81-85 B

2. fill in the blanks

1. the logical structure of data structure and data including _____, ______, ______, ________ four types.

The storage structure and the physical structure of the 2. data including _____, ______, ______, four basic types of ________.

3. data structure is _____ research data, the relationship

between _____ and them, and the corresponding _____ structure definition, design corresponding _____, and ensure that the new structure is obtained through these operations is _____ type structure.

4. an algorithm should have _____, _____,

_____, _____, the five characteristics of _____.

5. the time complexity of an algorithm is how the algorithm contains _____, it is a relative measure of the running time of the algorithm, the space complexity of an algorithm is that the algorithm for temporary occupation in the operation process of the _____ size.

6. time complexity of an algorithm is usually expressed by its _____ form, when a time complexity of the algorithm and the scale of the problem is independent of the size of N, is expressed as _____; proportional to, said to _____; a logarithmic relationship, said to _____; a square, the table shows _____.

7._____ is a set of symbols that describe the number and characters of an object, and all inputs that can be processed into a computer and processed by a computer program. _____ is the basic unit of data, sometimes this unit is composed of a plurality of _____. In this case, it is also called _____ records, is the smallest unit of data, and the linear form of a collection of records for _____.

8. a collection of data structures, K, and his two - element