2016华南理工大学数据结构试卷A及答案.docVIP

《 Data Structure 》B试卷 第 PAGE 4 页 共 NUMPAGES 5 页 ，A姓名 ，A姓名 学号 学院 专业 座位号 ( 密 封 线 内 不 答 题 ) ……………………………………………………密………………………………………………封………………………………………线……………………………………线……………………………………… _____________ ________ … 华南理工大学期末考试 《 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: ( B ) (A) Partially correct (B) Ambiguous (C) terminate (D) Concrete steps (2) Pick the growth rate that corresponds to the most efficient growing algorithm as n gets larger: ( B ) (A) 4n3 (B) 5n2logn (C) 3n! (D) 2n (3) If a data element requires 12 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) 1/3 (B) 3/4 (C) 3/5 (D) 2/3 (4) Which is the realization of a data type as a software component: ( A ) (A) An abstract data type (B) A real data type (C) A type (D) A data structure (5) The most effective way to reduce the time required by a disk-based program is to: ( B ) (A) Improve the basic I/O operations. (B) Minimize the number of disk accesses. (C) Eliminate the recursive calls. (D) Reduce main memory use. (6) In the hash function, collision refers to ( B ). (A) Two elements have the same key value. (B) Different keys are mapped to the same position of hash table. (C) Two records have the same requiring number. (D) Data elements are too much. (7) Given an array as A[m][n]. Supposed that A[0][0]is located at 644(10) and A[4][4]is stored at 676(10). “(10)” means that the number is presented in decimals. Then the element A[2][2](10)