ALGORITHMS AND FLOWCHARTS BY ASSIST LECS SARMAD K

ALGORITHMS AND FLOWCHARTS BY ASSIST LECS. SARMAD K. IBRAHIM & HUSSAIN M. HATHAL

ALGORITHMS AND FLOWCHARTS • A typical programming task can be divided into two phases: • Problem solving phase • produce an ordered sequence of steps that describe solution of problem • this sequence of steps is called an algorithm • Implementation phase • implement the program in some programming language

STEPS IN PROBLEM SOLVING • First produce a general algorithm (one can use pseudocode) • Refine the algorithm successively to get step by step detailed algorithm that is very close to a computer language. • Pseudocode is an artificial and informal language that helps programmers develop algorithms. Pseudocode is very similar to everyday English.

THE FLOWCHART • (Dictionary) A schematic representation of a • sequence of operations, as in a manufacturing process or computer program. (Technical) A graphical representation of the sequence of operations in an information system or program. Information system flowcharts show data flows from source documents through the computer to final distribution to users. Program flowcharts show the sequence of instructions in a single program or subroutine. Different symbols are used to draw each type of flowchart.

THE FLOWCHART A Flowchart • shows logic of an algorithm • emphasizes individual steps and their interconnections • e. g. control flow from one action to the next

FLOWCHART SYMBOLS Basic

EXAMPLE 1 • Write an algorithm and draw a flowchart to convert the length in feet to centimeter. Pseudocode: • Input the length in feet (Lft) • Calculate the length in cm (Lcm) by multiplying LFT with 30 • Print length in cm (LCM)

EXAMPLE 1 Flowchart Algorithm • Step 1: • Step 2: • Step 3: START Input Lft Lcm Lft x 30 Print Lcm STOP

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

EXAMPLE 2 Algorithm • Step 1: • Step 2: • Step 3: START Input W, L A L x W Print A Input W, L A Lx. W Print A STOP

EXAMPLE 3 • Write an algorithm and draw a flowchart that will calculate the roots of a quadratic equation • Hint: d = sqrt ( ), and the roots are: x 1 = (–b + d)/2 a and x 2 = (–b – d)/2 a

EXAMPLE 3 Pseudocode: • Input the coefficients (a, b, c) of the quadratic equation • Calculate d • Calculate x 1 • Calculate x 2 • Print x 1 and x 2

EXAMPLE 3 START • Algorithm: • Step 1: Input a, b, c • Step 2: d sqrt ( • Step 3: x 1 (–b + d) / (2 x a) • Step 4: x 2 (–b – d) / (2 x a) • Step 5: Print x 1, x 2 Input a, b, c ) d sqrt(b x b – 4 x a x c) x 1 (–b + d) / (2 x a) X 2 (–b – d) / (2 x a) Print x 1 , x 2 STOP

DECISION STRUCTURES The expression A>B is a logical expression • it describes a condition we want to test • if A>B is true (if A is greater than B) we take • the action on left print the value of A • if A>B is false (if A is not greater than B) we • take the action on right print the value of B •

DECISION STRUCTURES Y Print A is A>B N Print B

IF–THEN–ELSE STRUCTURE • The structure is as follows If condition then true alternative else false alternative endif

IF–THEN–ELSE STRUCTURE • The algorithm for the flowchart is as follows: If A>B then print A else print B endif Y Print A is A>B N Print B

RELATIONAL OPERATORS Relational Operators Operator Description > Greater than < Less than = Equal to Greater than or equal to Less than or equal to Not equal to

Example 4 • Write an algorithm to determine a student’s final grade and indicate whether it is passing or failing. The final grade is calculated as the average of four marks.

Pseudocode: • Input a set of 4 marks • Calculate their average by summing and dividing by 4 • if average is below 50 Print “FAIL” else Print “PASS”

• Detailed Algorithm • Step 1: Input M 1, M 2, M 3, M 4 Step 2: GRADE (M 1+M 2+M 3+M 4)/4 Step 3: if (GRADE < 50) then Print “FAIL” else Print “PASS” endif

EXAMPLE 4 START Step 1: Input M 1, M 2, M 3, M 4 Step 2: GRADE (M 1+M 2+M 3+M 4)/4 Step 3: if (GRADE <50) then Print “FAIL” else Print “PASS” endif Input M 1, M 2, M 3, M 4 GRADE (M 1+M 2+M 3+M 4)/4 N IS GRADE<5 0 PRINT “PASS” Y PRINT “FAIL” STOP

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

EXAMPLE 5 START Input VALUE 1, VALUE 2 Y is VALUE 1>VALUE 2 MAX VALUE 1 N MAX VALUE 2 Print “The largest value is”, MAX STOP

NESTED IFS • One of the alternatives within an IF–THEN–ELSE statement • may involve further IF–THEN–ELSE statement

EXAMPLE 6 • Write an algorithm that reads three numbers and prints the value of the largest number.

EXAMPLE 6 Step 1: Input N 1, N 2, N 3 Step 2: if (N 1>N 2) then if (N 1>N 3) then MAX N 1 [N 1>N 2, N 1>N 3] else MAX N 3 [N 3>N 1>N 2] endif else if (N 2>N 3) then MAX N 2 [N 2>N 1, N 2>N 3] else MAX N 3 [N 3>N 2>N 1] endif Step 3: Print “The largest number is”, MAX

EXAMPLE 6 • Flowchart: Draw the flowchart of the above Algorithm.

EXAMPLE 7 • a) Write and algorithm and draw a flowchart to b) determine the bonus payment (PAYMENT). read an employee name (NAME), overtime hours worked (OVERTIME), hours absent (ABSENT) and

LOOPS It is an important part of programing It is divided to two parts 1 - General form 2. Conventional form.

1 - General form This type of counters can be represented according to the following form: Where: I : Counter name (may take any symbol) S: Initial (Starting) value E: End (Final) value ∆: Step size (if not indicated, its value will be 1) I=S 2. Conventional form. The form of this type of counters will be as shown Starting the counter ∆, I=S, E Repeated operation 1 ∆+I=I Repeated operation Yes E ≥I No

EXAMPLE 8 WRITE AN ALGORITHM AND DRAW A FLOW CHART TO FIND THE AREA OF (N) CIRCLES. INPUT THE CIRCLES AND PRINT THE RESULT. USE THE GENERAL FORM.

Solution: 1. Start 2. Put PIE = 3. 14 3. Put I = 1 4. Input Radius (R) 5. Find Area (A), A=R^2*PIE 6. Print R , A 7. Is I ≤ N ? If "Yes" Then I=I+1: Goto step-4 If "No" Then continue 8. End

Example-9 Write an algorithm and draw a flow chart to evaluate Y from the bellow equations for seven entering values of X. If you know that a=-8, print the value of Y for each value of X. Use the conventional form.

1. Start Solution: 2. Put a = -8 3. For I=1 To 7 step 1 4. Input X 5. Is X≥ 0 ? If "Yes" then continue If "No" : then goto Step-7 6. Find Y, Y=3*X^2 -abs(X) : Goto step-8 7. Find Y, Y= X+a 8. Print X, Y 9. Next I 10. End

Example-10 Metal plate cutter machine used to cut plates its length is (5 meters). If you know that the length of each plate is more than (30 meters), write an algorithm and draw a flowchart to clarify this operation.

Solution: 1. Start 2. Take a metal plate. 3. Cut a 5 m. 4. Is the remainder > 5 m If "Yes" then goto step-3 If "No" then continue 5. Is there any more plates ? If "Yes" then goto step-2 If "No" then continue 6. End