算法复习资料（习题）.docVIP

选择题 1、Which of the following formulas can be considered an algorithm for computing the area of triangle whose side lengths are given positive numbers x,y and z?( ) (A) S=√l(l-x)(l-y)(l-z) ,where l=(x+y+z)/2 (B)S=1/2 yzsinA, where A is the angle between sides y and z (C)S=1/2 xh,where h is the height to base x (D)None of above can be considered an algorithm 2、、Among the four pairs of functions,which pair has different order of growth?() (A) (n3+1)5√n and √(n7+n) (B) log22n and log2n2 (C) log10n and ln n (D) 5n-1 and 5n+1 3、Which of the following description about asymptotic notation is correct?( ) (A) O(f(n)) is the set of all functions with a larger of same order of growth as f(n) (B)Θ(f(n)) is the set of all functions that have the same order of growth as f(n) (C)Ω(f(n)) is the set of all functions with a smaller or same order of growth as f(n) (D) None of above is correct 4、How many comparisons will be made by the brute-force string match algorithm to search the pattern=”00……0（m-1个）” in the text=”00……0（n个）”？（） （A）） 7、Which of the following problems can not be solved by using Breadth-First Search algorithm?( ) (A)Finding a path with the fewest number of edges between two given vertices of a graph (B)Check acyclicity of graph (C)Finding articulation points of an undirected graph (D)Check connectivity of a graph 8、Which of the following algorithms belongs to variable-size-decrease technique?() (A)Binary search (B)Interpolation search (C)Sequential search (D)Russian peasant method 9、Which of the followting algorithms for computing a binomial coefficient is most efficient?( ) (A)Apply the dynamic programming algorithm (B)Apply recursively the fomula C(n,k)=C(n-1,k-1)+C(n-1,k) for nk0 C(n,0)=C(n,n)=0 (C)Use the formula C(n,k)=n!/k!(n-k)! (D)Use the formula C(n,k)=n(n-1)……(n-k+1)/k! 10、Which of the following statements is true?( ) (A)If e is a minimum-weighe edge in a connected weighted graph,it must be among edges of at least one minim