Cs 466

For Exercises 1-6, match the problem solving strategy with the definition or example.

A. Ask questions

B. Look for familiar things

C. Divide and conquer

|1. |The first strategy to use when given a problem. |

| |A |

|2. |Don't reinvent the wheel. |

| |B |

|3. |Strategy used in the binary search algorithms |

| |C |

|4. |Is a solution to a previous problem appropriate for the current one? |

| |B |

|5. |Strategy used in the Quicksort algorithm |

| |C |

|6. |There is an apparent contradiction in the problem statement. |

| |A |

For Exercises 7-10, match the following phase with its output.

A. Analysis and specification phase

B. Algorithm development phase

C. Implementation phase

D. Maintenance phase

|7. |Working program |

| |C |

|8. |None |

| |D |

|9....