Scribd Logo
Upload

Welcome to Scribd!

  • Exercise Recursion 2

    Uploaded by

    Suvashinni Murali
    73 views1 page
    The document contains instructions for two recursion exercises: 1) Trace the execution of func3(6,4) and func3(-5,1) by drawing the stack and recursive tree. func3(6,4) will return 1 and func3(-5,1) will return 0. 2) Write a recursive method to calculate the sum of terms from 3 to 2n+3, where n >= 0.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains instructions for two recursion exercises: 1) Trace the execution of func3(6,4) and func3(-5,1) by drawing the stack and recursive tree. func3(6,4) will return 1 and func3(-5,1) will return 0. 2) Write a recursive method to calculate the sum of terms from 3 to 2n+3, where n >= 0.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    73 views1 page

    Exercise Recursion 2

    Uploaded by

    Suvashinni Murali
    The document contains instructions for two recursion exercises: 1) Trace the execution of func3(6,4) and func3(-5,1) by drawing the stack and recursive tree. func3(6,4) will return 1 and func3(-5,1) will return 0. 2) Write a recursive method to calculate the sum of terms from 3 to 2n+3, where n >= 0.

    Copyright:

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

    UNIVERSITI UTARA MALAYSIA

    UUM COLLEGE OF ARTS AND SCIENCES


    STIA2024 DATA STRUCTURES AND ALGORITHM ANALYSIS
    EXERCISE: RECURSION

    1. Study the method func3() below, then trace the execution of the method call
    func3(6,4) and func3(-5,1) by drawing stack of activation record and a recursive tree
    for each call. What are the values that will be returned by these calls?

    private int func3(int m, int n) {


    if (m < n)
    return 0;
    else
    return 1 + func3(m-n, n);
    }

    a) func3(6, 3)

    b) func3(-5, 1)

    2. Write a recursive method for the following function.


    f(n) = 3 + 5 + … + (2n + 3), where n >=0

    You might also like