This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Computer Programming TA C162 Second Semester 20082009 Algorithms and Problem Solving What is an Algorithm? Algorithm Properties Representation of Algorithm i.e. Flow Chart Examples 2 Computer Programming TA C162 Second Semester 20082009 Solving Problems using a Computer Methodologies for creating computer programs that perform a desired function. Problem Solving • How do we figure out what to tell the computer to do? • Convert problem statement into algorithm, using Stepwise Refinement . • Convert algorithm into programming statements Ex. LC3 instructions 3 Computer Programming TA C162 Second Semester 20082009 Three Basic Constructs There are three basic ways to decompose a task: Task Subtask 1 Subtask 2 Subtask 1 Subtask 2 Test condition Subtask Test condition Sequential Conditional Iterative True True False False 4 Computer Programming TA C162 Second Semester 20082009 What is an Algorithm? What is an Algorithm? An algorithm is a precisely defined and ordered sequence of instructions that is guaranteed to solve a specific problem. The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem....
View
Full
Document
This note was uploaded on 05/14/2010 for the course MATHEMATIC mathe taught by Professor Xyz during the Spring '10 term at Birla Institute of Technology & Science.
 Spring '10
 XYZ
 Math

Click to edit the document details