数据结构样卷2(英文),数据结构学期样卷答案,2015浙江高考数学样卷,2015浙江高考理综样卷,2015江西中考样卷,2015江西中考数学样卷,四六级改革样卷,2015重庆市中考样卷,2015年重庆市中考样卷,雅思样卷
重庆大学 数据结构 课程样卷2 开课学院: 计算机学院 课程号: 考试日期: 考试时间: 120 分钟题 号一二三四五六七八九十总 分得 分
Single choice
The linear list (a1, a2, ... an), which is in Sequential Storage, when we delete any node, the average number of moving nodes ( ).
A. n B. n/2 C. (n-1)/2 D. (n+1)/2
Which is wrong among the following statements ( ).
Data element is the basic unit of the data
Data element is the smallest unit of the data
Data can be composed of a number of data elements
Data items can be composed of a number of data elements
To insert a data element in a linear structure data conveniently, the best data structure is ( ).
A. Sequential storage B. Linked storage
C.Index storage D. Hash storage
If insert a new node into the doubly linked list which the number of nodes is n, the measurement level of time complexity is ( ).
A.O(1) B. O(n) C. O(nlog2n) D. O(n2)
In virtue of a child’s Brother linked lists as a tree, if we want to find the fifth child of the node x, as long as finding the first child of x, and then ( ).
pointer scans 5 nodes continuously from the child domain
pointer scans 4 nodes continously from the child domain
pointer scans 5 nodes continously from the brother domain
pointer scans 4 nodes continously from the brother domain
The character of Tree structure is: a node can have( )
More than one direct pre-trend
More than one direct successors
More than one pre-trend
A successor
Assume that there are 13 numbers, they form a Huffman tree, calculate the number of nodes on this Huffman tree ( ).
A. 13 B. 12 C. 26 D. 25
A spanning tree of the undirected connected graph is a ( ) which contains the whole vertices of this connected graph.
A. Minimal connected subgraph B. Minimal subgraph
C. Significantly connected sub-graph D. Significantly sub-graph
Which is wrong in the following statements ( ).
Each vertex is only visited once during the graph traversal.