Scribd Logo
Upload

Welcome to Scribd!

  • 4.1.4 Recursions (MT)

    Uploaded by

    Herman Oduor
    6 views3 pages
    This document contains sample exam questions and answers about recursively defined procedures. It discusses a procedure X that takes an integer n as input. Procedure X uses recursion to divide n by 2 and output the remainder until n is 0 or 1. It provides a trace table to demonstrate how procedure X would work when called with an input of 40. The answers explain that a recursively defined procedure calls itself, and that a stack is used to save the state during recursive calls. Program code is also provided to implement procedure X.

    Original Description:

    Original Title

    4.1.4 RECURSIONS (MT)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains sample exam questions and answers about recursively defined procedures. It discusses a procedure X that takes an integer n as input. Procedure X uses recursion to divide n by 2 and output the remainder until n is 0 or 1. It provides a trace table to demonstrate how procedure X would work when called with an input of 40. The answers explain that a recursively defined procedure calls itself, and that a stack is used to save the state during recursive calls. Program code is also provided to implement procedure X.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views3 pages

    4.1.4 Recursions (MT)

    Uploaded by

    Herman Oduor
    This document contains sample exam questions and answers about recursively defined procedures. It discusses a procedure X that takes an integer n as input. Procedure X uses recursion to divide n by 2 and output the remainder until n is 0 or 1. It provides a trace table to demonstrate how procedure X would work when called with an input of 40. The answers explain that a recursively defined procedure calls itself, and that a stack is used to save the state during recursive calls. Program code is also provided to implement procedure X.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    (P4)Topical Past papers of (4.1.

    4 RECURSIONS)
    Topical Past Paers 9608
    with Sir Majid Tahir

    Past Papers May/June 2015 to 2018:

    9608/43/M/J/15
    Q.6 A recursively defined procedure X is defined below:

    PROCEDURE X(BYVALUE n : INTEGER)


    IF (n = 0) OR (n = 1)
    THEN
    OUTPUT n
    ELSE
    CALL X(n DIV 2)
    OUTPUT (n MOD 2)
    ENDIF
    ENDPROCEDURE

    (a) Explain what is meant by recursively defined.

    ...................................................................................................................................................

    .............................................................................................................................................. [1]

    (b) Explain how a stack is used during the execution of a recursive procedure.

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    .............................................................................................................................................. [2]

    (c) Dry run the procedure X by completing the trace table for the procedure call:
    CALL X(40)

    OUTPUT ............................................................................................................................... [6]

    www.majidtahir.com Contact: 03004003666 Email: majidtahir61@gmail.com


    1
    (P4)Topical Past papers of (4.1.4 RECURSIONS)
    Topical Past Paers 9608
    with Sir Majid Tahir

    (d) State the process that is carried out by procedure X.


    ...................................................................................................................................................

    .............................................................................................................................................. [1]
    (e) Write program code for procedure X.

    Programming language .............................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    ...................................................................................................................................................

    .............................................................................................................................................. [5]

    Answers
    9608/43/M/J/15
    6 (a) A procedure that calls itself // is defined in terms of itself [1]

    (b) Before procedure call is executed current state of the registers/local variables is
    saved onto the stack When returning from a procedure call the registers/local variables
    are re-instated [2]

    www.majidtahir.com Contact: 03004003666 Email: majidtahir61@gmail.com


    2
    (P4)Topical Past papers of (4.1.4 RECURSIONS)
    Topical Past Paers 9608
    with Sir Majid Tahir

    www.majidtahir.com Contact: 03004003666 Email: majidtahir61@gmail.com


    3

    You might also like