Scribd Logo
Upload

Welcome to Scribd!

  • 78 views

    2.1.2 Structure Chart (MT-L)

    Uploaded by

    Tanaka Chivutaise
    The document discusses structure charts, which can be used to show the modular design of algorithms and the relationships between modules. Structure charts represent modules as boxes, with parameters passed between modules shown as arrows. An example structure chart is given for calculating the average of two numbers. Structure charts can also show control structures like selection and repetition. Sample exam questions are provided about creating a structure chart and pseudocode for testing a random number generator.

    Copyright:

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

    2.1.2 Structure Chart (MT-L)

    Uploaded by

    Tanaka Chivutaise
    78 views8 pages
    The document discusses structure charts, which can be used to show the modular design of algorithms and the relationships between modules. Structure charts represent modules as boxes, with parameters passed between modules shown as arrows. An example structure chart is given for calculating the average of two numbers. Structure charts can also show control structures like selection and repetition. Sample exam questions are provided about creating a structure chart and pseudocode for testing a random number generator.

    Original Description:

    Computer science notes enjoy

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses structure charts, which can be used to show the modular design of algorithms and the relationships between modules. Structure charts represent modules as boxes, with parameters passed between modules shown as arrows. An example structure chart is given for calculating the average of two numbers. Structure charts can also show control structures like selection and repetition. Sample exam questions are provided about creating a structure chart and pseudocode for testing a random number generator.

    Copyright:

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

    2.1.2 Structure Chart (MT-L)

    Uploaded by

    Tanaka Chivutaise
    The document discusses structure charts, which can be used to show the modular design of algorithms and the relationships between modules. Structure charts represent modules as boxes, with parameters passed between modules shown as arrows. An example structure chart is given for calculating the average of two numbers. Structure charts can also show control structures like selection and repetition. Sample exam questions are provided about creating a structure chart and pseudocode for testing a random number generator.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 8

    Paper 2. Sec 2.1.

    2) Built-in-Functions Computer Science 9608


    with Majid Tahir

    Syllabus Content:
    2.1.2 Structure chart
    use a structure chart to express the parameters passed between the various
    modules/ procedures/functions which are part of the algorithm design
    describe the purpose of a structure chart
    construct a structure chart for a given problem
    derive equivalent pseudocode from a structure chart

    Structure charts:
    An alternative approach to modular design is to choose the sub-tasks and then construct a
    structure chart to show the interrelations between the modules. Each box of the structure chart
    represents a module. Each level is a refinement of the level above.

    A structure chart also shows the interface between modules, the variables. These variables are
    referred to as 'parameters'.

    A parameter supplying a value to a lower-level module is shown as a downwards pointing


    arrow. A parameter supplying a new value to the module at the next higher level is shown as an
    upward pointing arrow.

    Figure below shows a structure chart for a module that calculates the average of two numbers.
    The top-level box is the name of the module, which is refined into the three subtasks of Level 1.
    The input numbers (parameters Number1 and Number2) are passed into the 'Calculate
    Average' sub-task and then the Average parameter is passed into the 'OUTPUT Average' sub-
    task. The arrows show how the parameters are passed between the modules.

    This parameter passing is known as the 'interface'.

    1
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    Answer:

    Structure charts can also show control information: selection and repetition.

    The simple number-guessing game could be modularised and presented as a structure


    chart, as shown in Figure below

    2
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    Structure chart for number-guessing game with only one guess allowed

    Past paper questions on structure charts:


    MJ 2015/ 21
    Q 3:
    When the guarantee on a computer runs out, the owner can take out insurance to cover
    breakdown and repairs.

    The price of the insurance is calculated from:


    the model of the computer
    the age of the computer
    the current insurance rates

    Following an enquiry to the insurance company, the customer receives a quotation letter with
    the price of the insurance.
    A program is to be produced.

    The structure chart below shows the modular design for this process:

    3
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    4
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    Answer:

    Answer:

    5
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    Exam-style Questions
    1 A random number generator is to be tested to see whether all numbers within the range
    1 to 20 are generated equally frequently.

    The structured English version of the algorithm is:


    Initialise a tally for the numbers 1 to 20
    Repeatedly generate numbers in range 1 to 20
    For each number generated, increment the relevant count
    Calculate how often each number should be generated (expected frequency)
    Output expected frequency
    Output the list of numbers as a table with actual frequency

    6
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    The identifiers required are:

    Answer:

    7
    Paper 2. Sec 2.1.2) Built-in-Functions Computer Science 9608
    with Majid Tahir

    (b) Pseudo code of Random Number Tally

    DECLARE Tally : ARRAY[1..20] OF INTEGER

    CALL InitialiseTally(Tally)

    FOR Count ← 1 TO NumberOfTests

    RandomNumber ← GenerateRandomNumber(20)

    CALL UpdateTally(RandomNumber, Tally)

    ENDFOR
    CALL OutputTally(Tally)

    Reference:

    Cambridge International AS & A level Computer Science Course book by Sylvia Langfield and Dave Duddell

    You might also like