计算机学院北航算法作业,北航《算法与数据结构》在线作业一（BUAA algorithms and data structures online homework）.doc...

北航《算法与数据结构》在线作业一(BUAA algorithms and data structures online homework)

BUAA "algorithms and data structures" online homework

Total score: 100 test time: -

Radio examination

Radio examination questions (25 questions, 100 points)

1. using sequential lookup methods to find linear tables of length N, the average length of each element is ().

A. n

B. n/2

C. (n+1) /2

D. (n-1) /2

Full marks: 4

2. about the logical structure, the following statement is wrong

The A. logical structure has nothing to do with the formation and content of the data element itself

The B. logical structure is relative to the relative position of the data elements

The logical structure of C. is independent of the number of nodes contained

D. some of the very different data on the surface can have the same logical structure

Full marks: 4

3. in the following four sorting methods, the largest additional memory requirement is ()

A. insertion sort

B. select sort

C. quick sort

D. merge sort

Full marks: 4

4. in all sorting methods, the number of key comparisons is independent of the initial order of records

A. Hill sorting

B. bubble sort

C. insertion sort

D. select sort

Full marks: 4

5., with two strings (S1 and S2), the calculation of the location of the first occurrence of S1 in S2 is called ().

A. connection

B. pattern matching

C. substr

D. string length

Full marks: 4

6., the sequential search method is suitable for storing linear tables with (linear) structure.

A. hash table

B. sequentially stores or connects storage

C. compressed storage

D. index storage

Full marks: 4

7. a sequence with 24 records, using bubble sort, at least the number of comparisons is ()

A. 1

B. 23

C. 24

D. 529

Full marks: 4

8. determine the condition that an order stack (the most element is m) is empty.

A. top = = 0

B. top = = m

C. top = 0

D. top = = m

Full marks: 4

9. in a two fork tree, the number of knots on the fourth layer is the maximum.

A. 8

B. 15

C. 16

D. 31

Full marks: 4

10. in the following sorts of sorting methods, the l