数据结构试题(英文版)C++.docVIP

Final Examination Paper on Data Structures(A) I、Fill Vacant Position (1′×10=10′) 1、____________is the name for the case when a function invokes itself or invokes a sequence of other functions,one of which eventually invokes the __________again. 2、In a __________ data structure, all insertions and deletions of entries are made at one end. It is particularly useful in applications involving __________. 3、In c++ , we use ____________operator to implement the circular queues. 4、In processing a contiguous list with n entries: insert and remove require time approximately to _________. And clear, empty, full, size operate in ________ time. 5、One of method of searching is ____________________that requires ordered list. 6、The time complexity of the quicksort is______________. 7、Only __________ ____________graph has topological order. II、Multiple choice (2′×10=20′) 1、In a tree, ______are vertices with the same parent. ( ) A. children B. sibling C. adjacent D. leaf 2、A queue is a version of ( ) A. linked list B. LIFO list C. sequential list D. FIFO list 3、How many shapes of binary trees with four nodes are there ( ) A. 12 B.15 C. 14 D. 13 4、Among sorting algorithms, which kind of algorithm is divide-and-conquer sorting ( ) A. shell sort B. heap sort C. merge sort D. inserting sort 5、For the following graph, one of results of depth_first traversal is ( ) A. abcdefghi B. abcdeighf C. acbdieghf D.abdeighfc 6、In a binary tree, if the result of traversing under preorder is the same as that under inorder, then ( ) A. It is only a binary tree with one node B. It is either empty, or the left subtree of any node of the tree is empty C. It is only an empty binary tree D. It is either empty, or the right subtree of an node of the tree is empty 7、There are _______solutions to the problem of placing four queens on a 4×4 board. ( ) A. 2 B. 3 C. 6 D. 4 8、Which function is smallest order o