数据结构与算法析 复习试卷B2.doc

四川大学期末考试试题（闭卷） （2009~2010学年第1学期） 课程号： 座机电话号码0课程名称： 数据结构与算法分析（B卷） 任课教师： 孙界平，张卫华 适用专业年级： 软件工程 2008级 学号： 姓名： 考试须知 四川大学学生参加由学校组织或由学校承办的各级各类考试，必须严格执行《四川大学考试工作管理办法》和《四川大学考场规则》。有考试违纪作弊行为的，一律按照《四川大学学生考试违纪作弊处罚条例》进行处理。 四川大学各级各类考试的监考人员，必须严格执行《四川大学考试工作管理办法》、《四川大学考场规则》和《四川大学监考人员职责》。有违反学校有关规定的，严格按照《四川大学教学事故认定及处理办法》进行处理。 题 号 一 40% 二 8% 三 42% 四 10% 卷面成绩 得 分 阅卷时间 注意事项：1. 请务必将本人所在学院、姓名、学号、任课教师姓名等信息准确填写在试题纸和添卷纸上； 2. 请将答案全部填写在本试题纸上； 3. 考试结束，请将试题纸、添卷纸和草稿纸一并交给监考老师。 一、单项选择题（本大题共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. 4. If an algorithm is Theta f n in the average case, then it is: a Omega f n in the best case. *b Omega f n in the worst case. c O f n in the worst case. 5 When we say that a list implementation enforces homogeneity, we mean that: a All list elements have the same size. *b All list elements have the same type. c All list elements appear in sort order. 6. The height of a binary tree is: a The height of the deepest node. b The depth of the deepest node. *c One more than the depth of the deepest node. 7. A full binary tree is one in which: *a Every internal node has two non-empty children. b all of the levels, except possibly the bottom level, are filled. 8. If a node is at position r in the