全国计算机等考二级C语言模拟试题3（国外英文资料）.docVIP

全国计算机等考二级C语言模拟试题3（国外英文资料） (1) (1) ~ (10) 2 points, (11) - (50) 1 point, 60 points.) The following A), B), c) and D) in the four options, there is only one option is correct, please send the correct option scrawled in sheet on the corresponding position, answer not score on the test paper. (1) the time complexity of the algorithm refers to... A) the time required to execute the algorithm B) the length of the algorithm C) the basic operations required for the execution of the algorithm D) the number of instructions in an algorithm Answer: C Analysis: the time complexity of the algorithm is the computation effort required to perform the algorithm. (2) the following statements are ________. A) linear table is A linear structure B) stack and queue are nonlinear structures C) the linear list is a nonlinear structure D) the binary tree is a linear structure Answer: A, Analysis: there are two types of data structures: linear and nonlinear. Linear tables, stacks, and queues, linear lists are linear, and binary trees are non-linear. (3) in the account of the complete binary tree, the mistake is _________. A) in addition to the last layer, the number of nodes in each layer reaches maximum B) there may be a shortage of left and right leaves C) a full binary tree is not usually full of binary trees D) the depth of a fully binary tree with a node is [log2n] + 1 Answer: B Analysis: full binary tree is a binary tree with two children on every node except the last one. Complete binary tree refers to besides the last layer, each layer nodes on the peak, on the last layer of only a few several child nodes (leaf nodes) to the right of the binary tree. (4) the structural programming mainly emphasizes... A) program of scale B) program readability C) program execution efficiency D) program portability Answer: B T: structured programming mainly emphasizes the structured program clear and easy to read, good understandability, programmers can demonstrated incremental refinement, program and