PROGRAM DEVELOPMENT CYCLE. Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this.

Slides:



Advertisements
Similar presentations
CS 240 Computer Programming 1
Advertisements

Algorithms An algorithm is a finite sequence of instructions, logic, an explicit step-by-step procedure for solving a problem. Specific algorithms sometimes.
Prof. B. I. Khodanpur HOD – Dept. of CSE R. V. College of Engineering
UNIT 2. Introduction to Computer Programming
Chapter 1 - An Introduction to Computers and Problem Solving
Chapter 2 - Problem Solving
Reference :Understanding Computers
ME 142 Engineering Computation I Fundamentals of Procedural Computer Programming.
Chapter 2 - Problem Solving
CS 240 Computer Programming 1
Flowchart TA. Maram Al-Khayyal.
Algorithms and flow charts
INTRODUCTION TO PROGRAMMING
II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F.
Flowcharts.
ITEC113 Algorithms and Programming Techniques
Chapter 2- Visual Basic Schneider
Programming Logic and Design, Introductory, Fourth Edition1 Understanding Computer Components and Operations (continued) A program must be free of syntax.
Problem Solving Chapter 2. What is an algorithm? n A solution to a problem that is: –Precise –Effective –Terminating.
Chapter 3 Planning Your Solution
The Program Design Phases
ALGORITHMS AND FLOW CHARTS 1 Adapted from the slides Prepared by Department of Preparatory year Prepared by: lec. Ghader Kurdi.
Programming Logic and System Analysis
Algorithm & Flowchart.
Fundamentals of C programming
Design the program Create a detailed description of program –Use charts or ordinary language (pseudocode) Identify algorithms needed –Algorithm: a step-by-step.
PROGRAMMING LANGUAGES Prof. Lani Cantonjos. PROGRAM - set of step-by-step instructions that tells or directs the computer what to do. PROGRAMMING LANGUAGE.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Flowcharts.
© 2011 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Stewart Venit ~ Elizabeth Drake Developing a Program.
Software Life Cycle What Requirements Gathering, Problem definition
Chapter 2 Problem Solving On A Computer 2.1 Problem Solving Steps Solving a problem on a computer requires steps similar to those followed when solving.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
INTRODUCTION TO COMPUTING CHAPTER NO. 04. Programming Languages Program Algorithms and Pseudo Code Properties and Advantages of Algorithms Flowchart (Symbols.
ALGORITHM List of instructions for carrying out some process step by step. A sequence of instructions which has a clear meaning and can performed with.
Algorithms & Flowchart
ITEC113 Algorithms and Programming Techniques
Basic problem solving CSC 111.
1 Program Planning and Design Important stages before actual program is written.
Introduction to Flow Chart It is pictorial representation of process of a system or processes. Types of Flow charts –Program Flow Chart –System Flow chart.
Structured Programming (4 Credits)
Chapter 2 - VB 2005 by Schneider- modified by S. Jane '081 Chapter 2 - Problem Solving 2.1 Program Development Cycle 2.2 Programming Tools.
WHAT IS THIS? Clue…it’s a drink SIMPLE SEQUENCE CONTROL STRUCTURE Introduction A computer is an extremely powerful, fast machine. In less than a second,
Flowchart. a diagram of the sequence of movements or actions of people or things involved in a complex system or activity. a graphical representation.
FLOWCHARTING AND ALGORITHMS
Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.
STEP 3- DEVELOP AN ALGORITHM At this stage we break down the problem into simple manageable steps so that they can be handled easily.
Program Program is a collection of instructions that will perform some task.
How Computers Solve Problems Computers also use Algorithms to solve problems, and change data into information Computers can only perform one simple step.
Program Design & Development EE 201 C7-1 Spring
Victoria Ibarra Mat:  Generally, Computer hardware is divided into four main functional areas. These are:  Input devices Input devices  Output.
 Problem Analysis  Coding  Debugging  Testing.
Pseudocode (pronounced SOO-doh-kohd)  is a detailed yet readable description of what a computer program or algorithm must do, expressed in a formally-styled.
Chapter One Problem Solving
Chapter One Problem Solving
Presentation of Flowchart
Chapter 2- Visual Basic Schneider
Algorithms An algorithm is a sequence of steps written in the form of English phrases that specific the tasks that are performed while solving the problem.It.
Lecture 2 Introduction to Programming
ALGORITHM Basic CONCEPTS of Basic Concepts of Algorithm
Algorithm Algorithm is a step-by-step procedure or formula or set of instruction for solving a problem Its written in English language or natural language.
Introduction to Computer Programming
Unit# 9: Computer Program Development
Chapter 2- Visual Basic Schneider
Introduction to Algorithms and Programming
CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING
Chapter 2- Visual Basic Schneider
ME 142 Engineering Computation I
Lecture 7 Algorithm Design & Implementation. All problems can be solved by employing any one of the following building blocks or their combinations 1.
Basic Concepts of Algorithm
Presentation transcript:

PROGRAM DEVELOPMENT CYCLE

Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this stage include Algorithms and flowcharts for identifying the expected steps of a process. Therefore to solve any problem, Collect and analyze information and data Talk with people familiar with the problem If at all possible, view the problem first hand Confirm all findings

An Algorithm: Baking a Cake Algorithm: A predetermined series of instructions for carrying out a task in a finite number of steps.

An Algorithm: Baking a Cake Algorithm: A predetermined series of instructions for carrying out a task in a finite number of steps.

Algorithm The Term Algorithm refers to the logic of a program. It is a step-by-step description of a solution to the given problem. When sequence of instructions are executed in the specified format and sequence the desired result are obtained. Definition:- A format or set of steps for solving a particular problem is called as algorithm. It has clear starting and stopping point. With specific step by step instructions in each line.

Characteristics of Algorithm Each instruction should be precise and clear. Each instruction should be executed in a finite time. One or more instructions should not be repeated Infinitely. After executing the instructions the desired result are obtained. It range from Simple to the Complex.

Process of algorithm An algorithm must express the steps in the solution in a way that will be suitable for computer processing. It Read Value perform a simple procedure and output the required result. After algorithm a Flowchart is prepared and than it is run in the language form in the computer.

Algorithm: The algorithm is part of the blueprint or plan for the computer program, an algorithm is: “An effective procedure for solving a class of problems in a finite number of steps.” Every algorithm should have the following 5 characteristic feature: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination

Algorithm To find largest of three numbers 1) Start 2) Read 3 numbers: num1, num2, num3 3) if num1 > num2 then go to step 5 4) if num2 > num3 then print num2 is largest else print num3 is largest goto step 6 5) if num1 > num3 then print num1 is largest else print num3 is largest 6) end.

Flowchart A Flowchart is a pictorial representation of an algorithm. It is a symbolic diagram of operation sequence, dataflow, control flow and processing logic in information processing. The symbol used are simple and easy to learn. It is a very help full tool for programmers and beginners.

Purpose of flowchart Provide Communication. Provide an overview. Show all elements and its relationship. Quick method of showing program flow. Check program logic. Facilitate coding. Provide program revision. Provide Program documentation.

Advantages of flowchart. Communication. Effective analysis. Proper documentation. Efficient coding. Proper debugging. Efficient program maintenance. Easy and clear presentation.

Limitation of flowchart Complex logic. Drawing is time consuming. Alteration and modification. Redrawn many times. Difficult to draw and remember. Reproduction ( replica ). Technical detail.

Symbols used in flowchart All symbols are of different shape and size. All have specific meaning and use.

BASIC SYMBOLS Terminal Symbol = for start and stop. INPUT and OUTPUT = Any function of input and output data. Processing = An arithmetic and data movement instruction. Shows mathematical calculation and logic operations.

SYMBOLS Decision = Diamond indicate decision point in the program flow. IT may have 2 way branch or 3 way also. Flow Lines = A Straight line between two boxes shows the path of logic flow in the program. An arrow head on the top of the line shows the direction of the flow, data from top to bottom and left to right. Connectors = 2 small circles are used to connect separated portions of a flowchart without drawing lines between the parts. One connector indicated where the flow breaks off the other where it resumes.

Flowchart for finding the sum of first five natural numbers ( i.e. 1,2,3,4,5):

Flowchart (Example): Flowchart to find the sum of first 50 natural numbers.

Start Read A, B Is A > B Print A Print B End Yes No Flow Chart to find largest of two numbers:

Flowchart to find the largest of three numbers A,B, and C: NO

LIMITATIONS OF USING FLOWCHARTS: Complex logic: Sometimes, the program logic is quite complicated. In that case, flowchart becomes complex and clumsy. Alterations and Modifications: If alterations are required the flowchart may require re-drawing completely. Reproduction: As the flowchart symbols cannot be typed, reproduction of flowchart becomes a problem.