文档介绍：姓名学号学院专业座位号
( 密封线内不答题)
……………………………………………………密………………………………………………封………………………………………线……………………………………线………………………………………
_____________ ________
…
诚信应考,***将带来严重后果!
华南理工大学期末考试
《 Data Structure and Algorithms 》试卷B
注意事项:1. 考前请将密封线内填写清楚;
2. 所有答案请直接答在试卷上;
:闭卷;
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 )
The number of empty sub-trees in a non-empty binary tree is one less than the number of nodes in the tree.
The Mergesort is a stable sorting algorithm.
A general tree can be transferre