Dale - Computer Science Illuminated 175

Dale - Computer Science Illuminated 175 - 148 Chapter 6...

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

View Full Document Right Arrow Icon
148 Chapter 6 Problem Solving and Algorithm Design Algorithm Development Phase Analyze Understand (define) the problem. Propose algorithm Develop a logical sequence of steps to be used to solve the problem. Test algorithm Follow the steps as outlined to see if the solution truly solves the problem. Implementation Phase Code Translate the algorithm (the general solution) into a programming language. Test Have the computer follow the instructions. Check the results and make corrections until the answers are correct. Maintenance Phase Use Use the program. Maintain Modify the program to meet chaining requirements or to correct any errors. Figure 6.2 The computer problem-solving process a solution that requires us to process more information than we are capable of processing. These constraints must be explicit in a computer solution, so the definition of an algorithm includes them. The third step in Polya’s list is to carry out the plan, that is, to test the solution to see if it solves the problem. The fourth step is to examine the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online