Dale - Computer Science Illuminated 174

Dale - Computer Science Illuminated 174 - 6.1 Problem...

This preview shows page 1. Sign up to view the full content.

Algorithm Unam- biguous instructions for solving a problem or subproblem in a finite amount of time using a finite amount of data 6.1 Problem Solving 147 Applying These Strategies Now let’s apply these strategies (called heuristics ) to a specific problem: How do we get to the party next Saturday at Sally’s house? Questions : Where is Sally’s house? Where are we coming from? What is the weather like (or likely to be like)? Will we be walking? Driving a car? Taking a bus? Once these questions have been answered, you can begin to plan the solution. If it is raining, the car is in the shop, and the busses have stopped, the best solution might be to call a taxi and give the driver Sally’s address. If we are driving, we look at a map and see that Sally’s address is six blocks west of the building where we work, so the first part of the solution might be to repeat what we do each morning to get to work (providing we are leaving from home). The next part would be to turn west and go six
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online