《数据结构》-08数据结构.doc

姓名学号学院专业座位号
( 密封线内不答题)
……………………………………………………密………………………………………………封………………………………………线……………………………………线………………………………………
_____________ ________
…
诚信应考,***将带来严重后果!
华南理工大学期末考试
《 Data Structure 》B试卷
注意事项:1. 考前请将密封线内填写清楚;所有答案请答题纸上;
:闭卷;本试卷共十大题,满分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) Correct (B) Infinite (C) No Ambiguous (D) Concrete steps
(2) Pick the growth rate that corresponds to the most efficient algorithm as n gets large: ( d )
(A) 4n3 (B) 2n (C) n! (D) 30n2logn
(3) If a data element requires 8 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/4 (B) 2/3 (C) 3/5 (D) 3/4
(4) Which is the realization of a data type as a ponent: ( a )
(A) An abstract data type (B) A real data type
(C) A type (D)A data structure
(5) We use the parent pointer representation for general trees to solve (b ) problem?
(A) Shortest paths (B) General tree traversal
(C) Equivalence classes (D) Exact-match query
(6) The most effective way to reduce the time required by a disk-based program is to ( d )
(A) Improve the basic operations. (B) Reduce main memory use.
(C) Eliminate the recursive calls. (D) Minimize the numbe