Problem 3
For Exercises 1-6, match the problemsolving strategy with the definition or example. A. Ask questions B. Look for familiar things C. Divide and conquer Strategy used in the binary search algorithms
Problem 5
For Exercises 1-6, match the problemsolving strategy with the definition or example. A. Ask questions B. Look for familiar things C. Divide and conquer Strategy used in the Quicksort algorithm
Problem 7
For Exercises 7-10, match the phase with its output. A. Analysis and specification phase B. Algorithm development phase C. Implementation phase D. Maintenance phase Working program
Problem 11
For Exercises 11-15, match the term with the definition. A. Information hiding B. Abstraction C. Data abstraction D. Procedural abstraction E. Control abstraction The practice of hiding the details of a module with the goal of controlling access to the details of the module.
Problem 16
For Exercises 16-36, mark the answers true or false as follows: A. True B. False Count-controlled loops repeat a specific number of times.
Problem 37
Exercises 37-62 are short-answer questions. List the four steps in Polya's How to Solve It list.
Problem 40
Apply the problem-solving strategies to the following situations. a. Buying a toy for your four-yearold cousin b. Organizing an awards banquet for your soccer team c. Buying a dress or suit for an awards banquet at which you are being honored
Problem 42
What is an algorithm?
Problem 46
Describe the steps in the algorithm development phase.
Problem 50
We said that following a recipe is easier than developing one. Go to the supermarket and buy a vegetable that you have not cooked (or eaten) before. Take it home and develop a recipe. Write up your recipe and your critique of the process. (If it is good, send it to the authors.)
