学海网

四川大学2009-2010学年第1学期数据结构与算法分析期末考试试题B卷
一、单项选择题（本大题共20小题，每小题2分，共40分）提示：在每小题列出的备选项中只有一个是符合题目要求的，请将其代码写到答题纸上。错选、多选或未选均无分。
1. A sequence has the following properties:
a) May have duplicates, element have a position.
b) May have duplicates, elements do not have a position.
c) May not have duplicates, elements have a position.
d) May not have duplicates, elements do not have a position.
2. Pick the growth rate that corresponds to the most efficient
algorithm as n gets large:
a) 5n
b) 20 log n
c) 2n^2
d) 2^n
3 When we describe the lower bound for a problem we use:
a) The upper bound for the best algorithm we know.
b) the lower bound for the best algorithm we know.
c) The smallest upper bound that we can prove for the best algorithm that could possibly exist.
d) The greatest lower bound that we can prove for the best algorithm that could possibly exist.
......