ITM 207 Study Guide - Final Guide: Linear Search, Problem Solving, Bubble Sort
15 Dec 2016
School
Department
Course
Professor
Document Summary
Ch. 7. 1, 7. 2 algorithm problem solving & design (10. 18. 16) The act of finding a solution to a perplexing, distressing, vexing or unsettled question. How do you solve problems: devise a plan, carry out the plan, look back. How will i recognize that i have found the solution: a good programmer recognizes a task and subtask that has been solved before and plugs in the solution, divide and conquer! Break up a large problem into smaller units and solve each smaller problem. Can be applied over and over until each task is manageable. Analysis and specification phase 1 (test: analyze, specification. Algorithm development phase 2 (general solution) (test: develop algorithm, test algorithm. Implementation phase 3 (concrete solution) (test: code algorithm, test algorithm. A set of unambiguous instructions for solving a problem or subproblem in a finite amount of time using a finite amount of data. An algorithmic step containing unspecified details: concrete step. An algorithmic step in which all details are specified.
