2012-2013(中加DS)期中试卷A答案.docVIP

天津理工大学考试试卷 2012 ～ 2013 学年度第 一 学期 《数据结构》 期中考试试卷 课程代码： 0666126 试卷编号： 1-A 命题日期： 2012 年 11 月 20 日 答题时限： 45 分钟 考试形式：闭卷笔试 得分统计表： Number Score I II III IV V I．For each question, choose the best answer and write its letter clearly as a large plain capital in the answer form. (4 points for each question, total is 40 points.) Score Note：Please write all of your answers in the following sheet Question Number 1 2 3 4 5 6 7 8 9 10 Answer A C D A D B B D C B For a sequential list (a list implemented by an array), which of the following operation is a O(1) algorithm? ___ ___ A. Access the i-th element（1≤i≤n） B. Insert a new element after the i-th element（1≤i≤n） C. Delete the i-th element（1≤i≤n） D. All of the above Assume that a binary tree with n nodes, nodes on its level i at most. A. 2i B. 2i+1 C. 2i-1 D. 2n The addresses which store Linked List ___ ____. A. must be sequential B. must be partly sequential C. must be no sequential D. can be sequential or discontinuous A Binary Tree will have nodes on its level i at most. A. 2i B. 2i C. 2i+1 D. 2i-1 In the context of this course, what are the most two aspects of algorithm analysis? ___ ____ A. Correctness Conciseness B. Readability Standardization C. Time complexity Space complexity D. Data complexity Program complexity Consider the following C code, the Big-Oh running time is _______. sum=0; for ( i = 0; iN; i++ ) for ( j = 0; ji; j++ ) sum++; A. O(1) B. O(N) C. O(logN) D. O(N2) For a singly linked list, assume that pointer p points to ai. In order to delete the node behind ai, which statement is correct? ___ ____ A. p-next= p-next-next B. p=p-next C. p=p-next-next D. next=p In a singly linked list, p and q point to 2 different nodes. If the element of q is the predecessor of p, then insert node s between p and q, which statement is correct? ________ A. s-next=p-next; p-next=s; B. q-next=s; s-next