数据结构与算法试卷B

诚信应考,考试作弊将带来严重后果！ 华南理工大学期末考试《 Data Structure and Algorithms 》试卷 B注意事项：1. 考前请将密封线内填写清楚； 2. 所有答案请直接答在试卷上； 3．考试形式：闭卷； 4. 本试卷共十大题，满分 100 分，考试时间 120 分钟。题 号一二三四五六七八九十总分得 分评卷人1. Select the correct choice. (20 scores, each 2 scores)(3) If a data element requires 6 bytes and a pointer requires 3 bytes, then a standard array representation will be more space efficient than a linked list representation when the fraction of non-null elements is more than about: ( D ) (A) 1/3 (B) 1/2 (C) 3/4 (D) 2/3(5) We use the parent pointer representation for general trees to solve ( C ) problem(A) Shortest paths (B) General tree traversal (C) Determining if two nodes are in the same tree (D) Exact-match query(1) An algorithm must be or do all of the following EXCEPT: ( C )(A) Correct (B) No ambiguous (C) General steps (D) terminate(2) Pick the growth rate that corresponds to the most efficient _____________ ________ …姓名 学号 学院 专业 座位号 ( 密 封 线 内 不 答 题 )…………………………………………………… 密………………………………………………封………………………………………线……………………………………线………………………………………algorithm as n gets large: ( A )(A) 100n3logn (B) n4 (C) n! (D) 2n (4) Which statement is not correct among the following four: ( A )(A)The number of empty sub-trees in a non-empty binary tree is one less than the number of nodes in the tree.(B)The Mergesort is a stable sorting algorithm.(C)A general tree can be transferred to a binary tree with the root having only left child.(D)A sector is the smallest unit of allocation for a record, so all records occupy a multiple of the sector size. (6) The mos...