Lec24-25 - Computer Programming TA C162 Algorithms and...

This preview shows pages 1–5. Sign up to view the full content.

1 Computer Programming TA C162 Second Semester 2008-2009 Algorithms and Problem Solving What is an Algorithm? Algorithm Properties Representation of Algorithm i.e. Flow Chart Examples

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Computer Programming TA C162 Second Semester 2008-2009 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. LC-3 instructions
3 Computer Programming TA C162 Second Semester 2008-2009 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

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Computer Programming TA C162 Second Semester 2008-2009 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. Properties of Algorithm
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/14/2010 for the course CS SS ZG653 taught by Professor Shanta during the Spring '09 term at Birla Institute of Technology & Science.

Page1 / 14

Lec24-25 - Computer Programming TA C162 Algorithms and...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online