A)对长度为n的有序链表进行查找,最坏情况下需要的比较次数为n(国外英文资料).doc

A)对长度为n的有序链表进行查找,最坏情况下需要的比较次数为n(国外英文资料) A choice (every day, 2 points, 70 points) Of the following four options, only one option is correct in the A, B, C, and D). Please insert the correct options for filling in the corresponding position on the answer sheet, not on the test paper score. (1) the following statement is correct A) looking for ordered chained lists of length N, and at worst the number of comparisons required is n (B) binary search for ordered chained lists of length n; the worst case requires the number of comparisons (n/2) (C) binary search for ordered chained lists of length n; the worst case requires the number of comparisons (log2n) (D) binary search for ordered chained lists of length n; the worst case requires the number of comparisons (n, log2n) (2) the time complexity of the algorithm is A) the execution time of the algorithm B) the amount of data to be processed by the algorithm (C) the number of statements or instructions in an algorithm program (D) the number of basic operations required by the algorithm during execution (3) software can be divided into application software, system software and support software (or tool software) according to function. The following software that belongs to the system is A) edit software B) operating system C) educational administration system D) browser (4) the task of software (program) debugging is (A) errors in diagnosis and correction procedures B) discover as many bugs as possible in your program (C) find and correct all errors in the program (D) determine the nature of the error in the program (5) the data flow diagram (DFD diagram) is A) tools for software outline design B) a tool for detailed design of software C) a requirements analysis tool for structured methods D) object oriented method requirements analysis tool (6) the software life cycle can be divided into definition stage, development stage and maintenance stage. Detailed design belongs to A) definition phase B) development phase C) mainte