Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Algorithm and Pseudo Codes

    Uploaded by

    Hassan
    objectives of algorithm

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Algorithm and Pseudo Codes

    Uploaded by

    Hassan
    23 views33 pages
    objectives of algorithm

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    objectives of algorithm

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views33 pages

    Algorithm and Pseudo Codes

    Uploaded by

    Hassan
    objectives of algorithm

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 33

    Algorithms

    Pseudocode and Flow Charts


    OBJECTIVES
    After this lesson, student should be able to:

    Understand the Problem Solving .

    Understand the concept of an algorithm.

    Define and use the three constructs for developing


    algorithms: sequence, decision, and repetition.

    Understand and use two tools to represent algorithms:


    flowchart and pseudocode.
    CONCEPT
    Problem Solving and Implementation
    A programming task can be divided into two phases:

    1. Problem solving
    Define : Clearly describe a problem
    Design its solution: Produce an ordered sequence of
    steps that describe solution to the problem;

    2. Implementation phase
    Implement the program in some programming
    language
    write code, compile, link, Test & Debug
    Developing a program

    Problem solving
    Phase

    Implementation
    phase
    Defining a Problem:
    Break the definition of the problem down into manageable
    steps. Example; input, Processing; Output

    Input ; Read the temperature from keyboard


    Processing; Test the Temperature below or above
    freezing
    Output; Display the result on Screen

    Users: Identify the users.

    Feasibility & Implementation.


    Design the solution
    Algorithm
    A sequence of language independent steps which may be
    followed to solve a problem. An Algorithm can be
    developed with a:

    • Pseudo Code
    • Flowchart

    Preferably using Control Structures.


    Figure 8-1
    Informal definition of an algorithm
    used in a computer
    Figure 8-2
    Finding the largest integer
    among five integers
    Figure 8-3
    Defining actions in FindLargest algorithm
    Figure 8-4
    FindLargest refined
    Figure 8-5
    Generalization of FindLargest
    THREE CONSTRUCTS
    Figure 8-6
    Three constructs
    ALGORITHM
    REPRESENTATION
    The language of Flowcharts
    Syntax Semantic
    Begin/End

    Process

    Input/Output

    Decision

    Connector

    Flowlines
    Figure 8-7
    Flowcharts for three constructs
    Build Flowchart
    to Design Program

    The equivalent pseudocode


    is:
    Begin
    sum = 0
    count = 1
    REPEAT
    IF count is even THEN
    sum = sum + count
    count = count + 1
    UNTIL count > 20
    DISPLAY sum
    End

    DISPLAY SUM

    18
    Algorithm
    Pseudo code
    • Pseudo code is a method of designing a program using
    English like statement to describe the logic and
    processing flow.

    • There are no real rules; organizations follow their


    own standards. Conveniently understood and
    exchanged between IT professionals.
    Figure 8-8
    Pseudocode for three constructs
    Example 1

    Write an algorithm in pseudocode that finds


    the average of two numbers

    Solution
    See Algorithm 8.1 on the next slide.
    Algorithm 8.1: Average of two
    BEGIN
    Input: Two numbers
    1. Add the two numbers
    2. Divide the result by 2
    3. Return the result by step 2
    END
    Example 2

    Write an algorithm to change a numeric


    grade to a pass/no pass grade.

    Solution
    See Algorithm 8.2 on the next slide.
    Algorithm 8.2: Pass/no pass Grade
    BEGIN
    Input: One number
    1. if (the number is greater than or equal to 70)
    then
    1.1 Set the grade to “pass”
    else
    1.2 Set the grade to “nopass”
    End if
    2. Return the grade
    END
    Example 3

    Write an algorithm to change a numeric


    grade to a letter grade.

    Solution
    See Algorithm 8.3 on the next slide.
    Algorithm 8.3: Letter grade
    BEGIN
    Input: One number
    1. if (the number is between 90 and 100, inclusive)
    then
    1.1 Set the grade to “A”
    End if
    2. if (the number is between 80 and 89, inclusive)
    then
    2.1 Set the grade to “B”
    End if
    Continues on the next slide
    Algorithm 8.3: Letter grade (continued)
    3. if (the number is between 70 and 79, inclusive)
    then
    3.1 Set the grade to “C”
    End if
    4. if (the number is between 60 and 69, inclusive)
    then
    4.1 Set the grade to “D”
    End if

    Continues on the next slide


    Algorithm 8.3: Letter grade (continued)
    5. If (the number is less than 60)
    then
    5.1 Set the grade to “F”
    End if
    6. Return the grade
    END
    Example 4

    Write an algorithm to find the largest of a set


    of numbers. You do not know the number of
    numbers.
    Solution
    See Algorithm 8.4 on the next slide.
    Algorithm 8.4: Find largest
    BEGIN
    Input: A list of positive integers
    1. Set Largest to 0
    2. while (more integers)
    2.1 if (the integer is greater than Largest)
    then
    2.1.1 Set largest to the value of the integer
    End if
    End while
    3. Return Largest
    END
    Example 5

    Write an algorithm to find the largest of


    1000 numbers.

    Solution
    See Algorithm 8.5 on the next slide.
    Algorithm 8.5: Find largest of 1000 numbers
    BEGIN
    Input: 1000 positive integers
    1. Set Largest to 0
    2. Set Counter to 0
    3. while (Counter less than 1000)
    3.1 if (the integer is greater than Largest)
    then
    3.1.1 Set Largest to the value of the integer
    End if
    3.2 Increment Counter
    End while
    4. Return Largest
    END
    Activity

    BEGIN
    Set sum  0
    While (x < 2)
    sum  sum + x
    x  x + 2
    END FOR
    Display sum
    END

    You might also like