计算机九九级第四学期数据结构试题（Computer 99 grade fourth semester data structure examination questions）.doc

计算机九九级第四学期数据结构试题（Computer 99 grade fourth semester data structure examination questions） There are many ways to destroy the friendship, the most complete one is money Data structure simulation questions eight Question no. One Two Three Four Five Six The total score Fraction Score The marking A RadioButtonList (every day, 2 points, 8 points) In 1, a length of n sequence of linear table in order to find the value of X elements, the success of the average search length (i.e. the average x compared with the number of elements, each element of the search probability hypothesis are equal) (for). A n B n/2 C (n+1) /2 D (n-1) /2 2, in a single linked list, if q is referring to the node P refers to the predecessor node node, if the insertion of a s refers to the node between Q and P, execute (). A s - link=p - link; P, link=s; B, P, link=s; s, link=q; C p - link=s - link; s, link=p; D, Q, link=s; s, link =p; 3, the stack of insertions and deletions in (for). A stack B stack at the bottom of the C D specified position at any position 4, the weights were 11, 8, 6, 2, 5 leaf nodes generate a Huffman tree, its weighted path length (for) A 24 B 71 C 48 D 53 Score The marking Two, fill in the blanks (each 1 points, a total of 32 points) 1, the logical structure of the data is divided into __________, ___________, ________ and ________ four. 2, an abstract data type consists of two parts ______________ and _____________. 3, in the following link storage array a with a linear form, the head pointer is a[o].next, the linear table for _________________________________________________.a 8 Sixty Fifty-six Forty-two Thirty-eight Seventy-four Twenty-five Four Three Seven Six Two Zero One Data Next 4, in the HL header pointer header with additional single node list and circular single linked list, the list is empty the judgment conditions were ________________ and ____________________. 5, with a one-dimensional array of n elements is stored in a circular queue, the head pointer i