Download presentation

Presentation is loading. Please wait.

1
Flow Chart

2
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.

3
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

4
**Flow Chart shows logic of an algorithm**

emphasizes individual steps and their interconnections e.g. control flow from one action to the next

5
Flow Chart

6
**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”

7
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

8
**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

9
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

10
**“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

11
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 { })

12
**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

13
**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

14
**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

Similar presentations

OK

CHAPTER 4: ALGORITHM 4.1 Introduction stages identified in the program development process: 1. Problem analysis and specification 2. Data organization.

CHAPTER 4: ALGORITHM 4.1 Introduction stages identified in the program development process: 1. Problem analysis and specification 2. Data organization.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on 555 timer calculator Ppt on articles a an the Ppt on 2 stroke ic engine works Slideshare ppt on marketing Ppt on online marketing research Ppt on superstition in indian culture Ppt on network interface card Ppt on construction of 3 phase induction motor Ppt on ip addresses class and range Ppt on google chrome os