Exam pseudocode recursive function

Course Queries Competitions/Entrance Exams 2 years ago

0 2 0 0 0 tuteeHUB earn credit +10 pts

5 Star Rating 1 Rating

Posted on 16 Aug 2022, this text provides information on Competitions/Entrance Exams related to Course Queries. Please note that while accuracy is prioritized, the data presented might not be entirely correct or up-to-date. This information is offered for general knowledge and informational purposes only, and should not be considered as a substitute for professional advice.

Take Quiz To Earn Credits!

Turn Your Knowledge into Earnings.

tuteehub_quiz

Answers (2)

Post Answer
profilepic.png
manpreet Tuteehub forum best answer Best Answer 2 years ago

 

I have this exam question:

Look at this example of pseudocode:

algorithm A(a, b) {
    // precond: a & b are type of Int
    // postcond: what does this function return?
    if (a == b)
        return( 0 )
    else if (a < b)
        return (-A(b, a))
    else
        return (A(a-1, b-1));
}

The answers given are:

  • a) a-b
  • b) a+b
  • c) max(a,b)
  • d) Will loop infinitely

Personally I think it's d), but I just wanted to make sure.

profilepic.png
manpreet 2 years ago

The function terminates when a==b; so to show that it doesn't terminate, you could show that a & b never get closer together with successive calls -- which in this case, is pretty easy.

(The above does not take into account overflow. Also, (d) can't be correct, since it doesn't loop at all.)


0 views   0 shares

No matter what stage you're at in your education or career, TuteeHub will help you reach the next level that you're aiming for. Simply,Choose a subject/topic and get started in self-paced practice sessions to improve your knowledge and scores.

tuteehub community

Join Our Community Today

Ready to take your education and career to the next level? Register today and join our growing community of learners and professionals.

tuteehub community