edited by
1,902 views
0 votes
0 votes

Consider the following recursive Java function $f$ that takes two long arguments and returns a float value :

public static float f(long m, long n)
{
    float result = (float) m / (float) n;
    if (m<0 || n <0)
        return 0.0f;
    else
        result +=f(m*2, n*3);
    return result;
}

Which of the following integers best approximates the value of $f(2, 3)$?

  1. $0$
  2. $1$
  3. $2$
  4. $3$
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,324 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$