第8章-算法.doc

Chapter 8 Algorithms By 黄永平，权勇，孙永雄，王智，丰小月，孙铭会 Knowledge point: 8.1. the concepts of an algorithm and a subalgorithm 8.2. three constructs for developing algorithms 8.3. basic algorithms 8.4. tools for algorithm representation 8.5. recursion Multiple-Choice Questions: 16. is a step-by-step method for solving a problem or doing a task.(8.1) a. A construct b. A recursion c. An iteration d. An algorithm 17. To set the value of a variable before any processing occurs, you the variable. (8.1) a. construct b. iterate c. initialize d.increase 18. There are basic constructs in computer science. (8.2) a. one b. two c.three d. four 19. The construct tests a condition. (8.2) a. sequence b. decision c. repetition d. logical 20. The construct is any action. (8.2) a. sequence b. decision c. repetition d. logical 21. The construct handles repeated actions. (8.2) a. sequence b. decision c. repetition d. logical 22. is a pictorial representation of an algorithm. (8.4) a. A flowchart b. A structure chart c. Pseudocode d. An algorithm 23. is an Englishlike representation of the code. (8.4) a. A flowchart b. A structure chart c. Pseudocode d. An algorithm 24. is a high-level design tool that shows the relationship between different modules of a program. (8.4) a. A flowchart b. A structure chart c. Pseudocode d. An algorithm 25. A subalgorithm is also known as a . (8.1) a. function b. subroutine c. module d. all of the above 26. is a basic algorithm that finds the product of a list of numbers. (8.3) a. Summation b. Product c. Smallest d. Largest 27. is a basic algorithm that arranges data according to their values. (8.3) a. Inquiry b. Sorting c. Searching d. Recursion 28. is a basic algorithm that adds a list of numbers. (8.3) a. Summation b. Product c. Smallest d. Largest 29. is a basic algorithm that finds the smallest of a list of numbers. (8.3) a. Summation b. Product c. Smallest d. Largest 30. In sort