文档介绍：土廿
(冥故* M提M歌皿)
诚信应考，考试作弊将带来严重后果!
华南理工大学期末考试
(Data Structure and Algorithms > 试卷 A
注音事项：L考前靖将密封线内填写清楚3
所有答案请直接答在iminate the recursive calls. (D) Reduce main memory use.
Given an array asA[m] [n]. Supposed that A [0] [0] is located at 644 (io) andA4 [2] [2] is stored at
676 (io) a and every element occities one space, means that the number is presented in decimals. Then
the element A [5] [5] (io) is at position:
(D)
(A) 692 (B) 695 (C) 650 (D) 724
If there is working memory, 4KB blocks, and yield 128 blocks fbr working memory. By the
multi-way merge in external sorting, the average run size and the sorted size in one pass of multi-way
merge on average are separately ( C )?
(A) , 128 MB (B) 2MB, 512MB
(C) 128MB (D) IXfB, 256MB
Assume that we have eight records, with key values A to H, and that they are initially phced in
alphabetical order. Now, consider the result of applying the following access pattern: FDFGGFADFG,if
the list is organized by the Transpose heuristic, then the final Est will be ( D ).
(A)GFDACHBE (B)AGFDBCEH
(C)FDGAECBH (D)ABFGDCEH
Fill the blank with correct C++ codes: (16 scores)
Given an array storing integers ordered by distinct value without duplicate, modify the binary search
routines to return the position of the integer with the smallest value greater than K when K itself does not
appear in the array. Return ERROR if