华南农业大学期末考试数据结构试卷（ A 卷）.docVIP

华南农业大学期末考试试卷（　A　卷） 2003学年第一学期　 考试科目：　数据结构　　　 考试类型：（开卷/闭卷）　　　考试时间：　120 　分钟 学号 姓名 年级专业 1. TURE or OR FALSE (10 points) (1) A stack is linear list. (2) Infix expression (a+b)*c-e/d can be changed to postfix express abc*+ed/-. (3) In a circular linked list, the next field in the last node contains a pointer back to the first node rather than the null pointer. (4) In the average case the heapsort can not Guaranteed O(n log n) (5) A sorting algorithm is stable if it preserves the original order of records with equal keys. (6) A heap is priority queue. (7) If we insert n random elements into an initially empty binary search tree, then average path length from the root to a leaf in the worst case must be O(logn) (8) In a forest, if the total number of vertices is n, then the total number of edges must be n-1. (9) The adjacency matrix of a directed graph is symmetric(对称) about the diagonal(对角线). (10) Consider a minimum spanning tree T in a graph G. if the weight of an edge e of T is decreased, then the resulting tree T is still a minimum spanning tree. 2. Fill the blank.( 10 x 1 point) (1) Below are descriptions of three data structures with a blank below each. Write in the correct name for each as taught in course. Each element in this data structure contains a value and a reference to a next element. The reference to the next element may be null. _____①_______. Values are stored sequentially in Random Access Memory and once this data structure is created the amount of data it can store cannot be increased. _____②_______. Each element in this data structure contains a value and a reference to zero, one or two other elements. There is a unique entry point into this data structure. There is no single unique sequential ordering of elements associated with this data structure. _____③_______. (2). Below is the C code for an algorithm studied in course. void sort(int x[], int n) { int hold, j, pass; int switched = TR