华南理工大学数据结构..docVIP

诚信应考,考试作弊将带来严重后果！ 华南理工大学期末考试 《 Data Structure 》A试卷 注意事项：1. 考前请将密封线内填写清楚； 2. 所有答案请直接答在试卷上； 3．考试形式：闭卷； 4. 本试卷共十大题，满分100分，考试时间120分钟。 题 号 一 二 三 四 五 六 七 八 九 十 总分 得 分 评卷人 1. Select the correct choice. (20 scores, each 2 scores) (1) An algorithm must be or do all of the following EXCEPT: ( D ) (A) Correct正确的 (B) Finite有限的 (C) Terminate终止的 (D) Ambiguous模糊 (2) Pick the growth rate增长率 that corresponds to the most efficient有效率的 algorithm as n gets large: ( C ) (A) n! (B) 2n (C) 10nlog n (D) 2n2 (3) If a data element requires 6 bytes and a pointer requires 4 bytes, then a linked list representation will be more space efficient than a standard array representation when the fraction of non-null elements is less than about: ( B ) (A) 2/3 (B) 3/5 (C) 3/4 (D) 1/2 (4) Which statement is not correct among the following four下面那个描述是不正确的: ( A ) The worst case for my algorithm is n becoming larger and larger because that is the slowest. A cluster簇cluster size. The selection sort is an unstable不稳定的 sorting algorithm. The number of leaves in a non-empty full binary tree is one more than the number of internal nodes. (5) Which of the following is a true statement: ( C ) (A) In a BST, the left child of any node is less than the right child, and in a heap, the left child of any node is less than the right child. (B) In a BST, the left child of any node could be less or greater than the right child, but in a heap, the left child of any node must be less than the right child. (C) In a BST, the left child of any node is less than the right child, but in a heap, the left child of any node could be less than or greater than the right child. (D) In both a BST and a heap, the left child of any node could be either less than or greater than the right child. (6) The most effective way to reduce the time required by a disk-based program is to: ( B ) (