Flow Chart.

Slides:



Advertisements
Similar presentations
ALGORITHMS AND FLOWCHARTS
Advertisements

ALGORITHMS AND FLOWCHARTS
Summer ’12 AP Computer Science APCS Summer Assignments Read thoroughly this ppt and solve examples 6 and 7.
CS 240 Computer Programming 1
ALGORITHMS AND FLOWCHARTS
Representing an algorithm using Flowcharts
PROBLEM SOLVING TECHNIQUES
UNIT 2. Introduction to Computer Programming
ALGORITHMS & FLOWCHARTING II
ALGORITHMS AND FLOWCHARTS
CS 240 Computer Programming 1
Fundamentals of Algorithms MCS - 2 Lecture # 4
Flow Chart.
Chapter 2- Visual Basic Schneider
Developing logic (Examples on algorithm and flowchart)
Kalle Mikkolainen Presenting Flowchart POWERPOINT 2010.
PRE-PROGRAMMING PHASE
Algorithm & Flowchart.
Fundamentals of C programming
Chapter 1 Pseudocode & Flowcharts
ALGORITHMS AND FLOWCHARTS
CSC141 Introduction to Computer Programming
Flow Charts.
Algorithm & Flow Charts
A step-by-step procedure for solving a problem in a finite number of steps.
Creating Table using LOOP By Adnan and M.Qazi Programmers.
ALGORITHMS AND FLOWCHARTS CSCI 105 – Computer Fluency.
Chapter 2: General Problem Solving Concepts
Basic problem solving CSC 111.
Chapter 1 Pseudocode & Flowcharts
PROGRAM DEVELOPMENT CYCLE. Problem Statement: Problem Statement help diagnose the situation so that your focus is on the problem, helpful tools at this.
`. Lecture Overview Structure Programming Basic Control of Structure Programming Selection Logical Operations Iteration Flowchart.
REBUS. REBUS CROSS ROADS HITTING BELOW THE BELT.
Fundamentals of Algorithms MCS - 2 Lecture # 5. Representation of Algorithms (continued) Flowcharts.
Problem, Problem Solving, Algorithm & Flow Charts –Part 1 Presented By Manesh T Course:101 CS 101CS Manesh T1.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
FLOWCHARTING AND ALGORITHMS
ALGORITHMS AND FLOWCHARTS. A typical programming task can be divided into two phases: Problem solving phase  produce an ordered sequence of steps that.
Introduction to Flowcharts
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Lecture 2: Introduction to Programming EEE2108: 공학프로그래밍 서강대학교 전자공학과 2011 학년도 2 학기 - Algorithms and Flowcharts -
| MSC 8102:PROGRAMMING CONCEPTS By Vincent Omwenga, PhD. 1.
Flow Charts And Pseudo Codes Grade 12. An algorithm is a complete step-by- step procedure for solving a problem or accomplishing a task.
 Problem Analysis  Coding  Debugging  Testing.
Program design Program Design Process has 2 phases:
Learning outcomes 5 Developing Code – Using Flowcharts
GC101 Introduction to computers and programs
Algorithm & Flow Charts Week 1
Lesson 2 Flowcharting.
Unit 3: ALGORITHMS AND FLOWCHARTS
Problem , Problem Solving, Algorithm & Flow Charts –Part 1
Chapter 2- Visual Basic Schneider
FLOWCHARTS.
COVERED BASICS ABOUT ALGORITHMS AND FLOWCHARTS
CS111 Computer Programming
Computer Programming Flowchart.
Algorithms and Flowcharts
Numbering System TODAY AND TOMORROW 11th Edition
ALGORITHMS & FLOWCHARTING II
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.
ALGORITHMS AND FLOWCHARTS
ALGORITHMS AND FLOWCHARTS
Structured Program Design
ALGORITHMS AND FLOWCHARTS
Chapter 2- Visual Basic Schneider
` Structured Programming & Flowchart
Chapter 2- Visual Basic Schneider
My Take on the Largest Number Algorithm
Flowchart.
Introduction to Programming
Presentation transcript:

Flow Chart

Flow Chart A flow chart is a graphical or symbolic representation of a process. Each step in the process is represented by a different symbol and contains a short description of the process step. The flow chart symbols are linked together with arrows showing the process flow direction.

Flow Chart This diagrammatic representation can give a step-by-step solution to a given problem. Data is represented in the boxes, and arrows connecting them represent flow / direction of flow of data. Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fields

Flow Chart shows logic of an algorithm emphasizes individual steps and their interconnections e.g. control flow from one action to the next

Flow Chart

Flow Chart Example Step 1: Input M1,M2,M3,M4 START Input M1,M2,M3,M4 GRADE(M1+M2+M3+M4)/4 IS GRADE<50 PRINT “FAIL” STOP Y N Step 1: Input M1,M2,M3,M4 Step 2: GRADE  (M1+M2+M3+M4)/4 Step 3: if (GRADE <50) then Print “FAIL” else Print “PASS” endif PRINT “PASS”

Flow Chart Write an algorithm and draw a flowchart that will read the two sides of a rectangle and calculate its area. Pseudocode Input the width (W) and Length (L) of a rectangle Calculate the area (A) by multiplying L with W Print A

Flow Chart Algorithm Step 1: Input W,L Step 2: A  L x W Step 3: Print A START Input W, L A  L x W Print A STOP

Flow Chart Write an algorithm that reads two values, determines the largest value and prints the largest value with an identifying message. ALGORITHM Step 1: Input VALUE1, VALUE2 Step 2: if (VALUE1 > VALUE2) then MAX  VALUE1 else MAX  VALUE2 endif Step 3: Print “The largest value is”, MAX

“The largest value is”, MAX Flow Chart MAX  VALUE1 Print “The largest value is”, MAX STOP Y N START Input VALUE1,VALUE2 MAX  VALUE2 is VALUE1>VALUE2

Flow Chart Example 11: Write down an algorithm and draw a flowchart to find and print the largest of N (N can be any number) numbers. Read numbers one by one. Verify your result by a trace table. (Assume N to be 5 and the following set to be the numbers {1 4 2 6 8 })

Flow Chart Step 1: Input N Step 2: Input Current Step 3: Max  Current Step 4: Counter 1 Step 5: While (Counter < N) Repeat steps 5 through 8 Step 6: Counter  Counter + 1 Step 7: Input Next Step 8: If (Next > Max) then Max  Next endif Step 9: Print Max

Flow Chart START Input Max  Current Counter 1 N Y Print Max STOP N, Current Max  Current Print Max STOP Y Counter < N N Counter 1 Counter  Counter +1 Next Next >Max Max  Next

Flow Chart N Current Max Next Next > Max 8 output Counter Counter < N Next Next > Max Step 1 Step 2 Step 3 Step 4 Step 5 Step 6 Step 7 Step 8 Step 9 5 1 4 6 8 8 output 2 3 T F