数据结构自测题(Data structure self test questions ).docVIP

  • 20
  • 0
  • 约1.3万字
  • 约 22页
  • 2018-06-15 发布于江西
  • 举报

数据结构自测题(Data structure self test questions ).doc

数据结构自测题(Data structure self test questions ).doc

数据结构自测题(2)(Data structure self test questions (2)) The first chapter is introduction First, the multiple-choice question The size of the computation of the 1. algorithm is called computational. Beijing University of Posts and Telecommunications, 2000, two, 3 (20/8) A. efficiency B. complexity, C., reality D. difficulty The time complexity of the 2. algorithm depends on (1998) Two, 1 (2 points) The scale of the A. problem B. initial data to be processed C., A, and B 3. computer algorithms refer to (1) that it must have (2) these three characteristics. (1) A. calculation method, B. sorting method, C., the sequence of steps to solve the problem D. scheduling method (2) A. is executable, portable, extensible, B. executable, deterministic, and poor C. is deterministic, poor, and stable D. readability, stability, security Nanjing University of Science and Technology, 1999, 1 (2 points) (Wuhan Transportation University of science and technology, 1996) One, 1 (4 points) 4., an algorithm should be (). [Zhongshan University 1998, two, 1 (2 points)] A. procedure B. description of problem solving steps C. meets five basic features, D.A and C. 5., the following about algorithm error is () [Nanjing University of Science and Technology, 2000, a, 1 (1.5 points)] The A. algorithm must eventually be implemented by a computer program B.s algorithm for solving a problem is the same as the program written for that problem The feasibility of C. algorithm means that instruction can not have two meanings Several of the above D. are wrong 6. the following statement is wrong [Nanjing University of Science and Technology, 2000, one, 2 (1.5 points)] (1) the meaning of the algorithm in place means that no additional auxiliary space is needed (2) at the same scale n, the complexity O (n) algorithm is always better than the complexity O (2n) algorithm in time (3) the so-called time complexity is the upper bound of the execution time of the estimation algorithm in the worst case (4) the higher the

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档