文档介绍：四川大学期末考试试题（闭卷）
（2009~2010
学年第
2 学期）
课程号：
311036030
课程名称：
数据结构与算法（ D 卷）
任课教师： 孙界平 杨秋辉 张orst-case cost: ( )
O(log n).
O(n).
O(n log n).
O(n2)
8. In the worst case, the very best that a sorting algorithm can do when sorting n records is: ( )
O(log n).
O(n).
O(n log n).
O(n2)
9. The most time-consuming part of a random access to disk is usually: ( )
The seek.
The rotational delay.
The time for the data to move under the I/O head.
None of the above.
10. Self-organizing lists attempt to keep the list sorted by: ( )
(A) Value
注：字迹务必清晰，书写工整。 本题共 5页，本页为第 2 页
教务处试题编号：
课程名称： 数据结构与算法 任课教师： 孙界平 杨秋辉 张卫华 学号： 姓名：
frequency of record access
size of record
None of the above
A collision resolution technique that places all records directly into the hash table is called: ( )
Open hashing.
Separate chaining.
Closed hashing.
Probe function.
12. The primary key is: ( )
A unique identifier for a record.
The main search key used by users of the database.
The first key in the index.
Order of arrival.
13. Which is not the name for a standard graph traversal? ( )
Preorder.
Depth first.
Breadth first.
None of the above.
14. Dijkstra's algorithm requires that vertices be visited in: ( )
Depth-first order.
Breadth-first order.
Order of dista