数据结构英文试题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
Examination Paper on Data Structure
Ⅰ Fill Vacant Position ()
1.In a ________ data structure, all insertions and deletions of entries are made at
one end. It is particularly useful in application involving________.
2.In processing a sequential list with n entries: insert and remove require time
approximately to ________.
3.One of method of searching is ________ that requires ordered list.
4.The time complexity of the quicksort is ________.
5.Only ________ ________ graph has topological order.
6.According the definition of Binary Tree, there will be ________ different
Binary Trees with 5 nodes.
ⅡSingle choice ()
1.The Linked List is designed for conveniently ________data item.
a. getting
b. inserting
c. finding
d. locating
2.Assume a sequence list as 1,2,3,4,5,6 passes a stack, an impossible output
sequence list Is ________ .
a. 2,4,3,5,1,6
b.3,2,5,6,4,1
c.1,5,4,6,2,3
d.4,5,3,6,2,1
3. A queue is a structure not implementing ________.
a. first-in/first-out
b. first-in/last-out
c. last-in/last-out
d. first-come/first-serve
4.Removing the data item at index i from a sequential list with n
items, ________ items need to be shifted left one position.
a. n-i
b. n-i+1
c. i
d. n-i-1
5.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 discontiguous
6.The time requirement of retrieving a given target in hash table with n entries
is _______
a. O(n)
b. O(log2n)
c. O(1)
d. O(nlog2n)
7.If the Binary Tree T2 is transformed from the Tree T1, then the postorder of
T1 is the ________ of T2.
a. preorder
b. inorder
c. postorder
d. level order
8.In the following sorting algorithm, ________ is an unstable algorithm.
a. the insertion sort
b. the bubble sort
c. quicksort
d. mergesort
9.Assume there is a ordered list consisting of 100 data items, using binary
search to find a special item, the maximum comparisons is ________ .
a. 25
b.1
c. 10
d.7
10.The result from scanning a Binary Search Tree in inorder traversal is
in ________ order.
a. descending or ascending
b. descending
c. ascending
d. out of order
11.The ________ case is worst for quicksort.
a. the data which will be sorted is too larger.