数据结构2013春季A卷.doc

命题人：石锐 组题人： 命题人：石锐 组题人： 审题人：王茜 命题时间：2013.6.16 教务处制 学院 专业、班 年级 学号 姓名 公平竞争、诚实守信、严肃考纪、拒绝作弊 封 线 密  2012 ~2013 学年 第 2 学期 开课学院： 计算机学院 课程号： 考试日期： 2013-7-02 考试时间： 120 分钟 题 号 一 二 三 四 五 六 七 八 九 十 总 分 得 分 一、Single Choice（30 points） 1. Here is a series of C++ statements using the list ADT in the book. L1.append(10); L1.append(20); L1.append(15); If these statements are applied to an empty list, the result will look like:（ ） a) 10 20 15 | b) | 10 20 15 c) 15 20 10 | d) | 15 20 10 2. When comparing the array-based and linked implementations, the array-based implementation has: （ ） a) faster direct access to elements by position,but slower insert/delete from the current position. b) slower direct access to elements by position,but faster insert/delete from the current position. c) both faster direct access to elements by position, and faster insert/delete from the current position. d) both slower direct access to elements by position, and slower insert/delete from the current position. 3. For a list of length n, the linked-list implementations prev function requires worst-case time: （ ） a) O(1) b) O(log n). c) O(n). d) O(n^2). 4. Finding the element in an array-based list with a given key value requires worst case time: （ ） a) O(1). b) O(log n). c) O(n). d) O(n^2). 5. The Full Binary Tree Theorem states that: （ ） a) The number of leaves in a non-empty full binary tree is one more than the number of internal nodes. b) The number of leaves in a non-empty full binary tree is one less than the number of internal nodes. c) The number of leaves in a non-empty full binary tree is one half of the number of internal nodes. d) The number of internal nodes in a non-empty full binary tree is one half of the number of leaves. 6. If a node is at position r in the array implementation for a complete b