chapter14_6e..docVIP

TRUE/FALSE There can be more than one stopping case in a recursive function. ANSWER: TRUE You may have at most 1 recursive call in a recursive function. ANSWER: FALSE Recursive functions must return a value. ANSWER: FALSE The operating system uses a stack to control recursion. ANSWER: TRUE A class member function may be recursive. ANSWER: TRUE Recursive functions may return any type of value ANSWER: TRUE Not all recursive definitions may be written iteratively. ANSWER: FALSE Recursive functions always execute faster than an iterative function. ANSWER: FALSE Only functions that do not return a value may be recursive. ANSWER: FALSE Every recursive definition may be rewritten iteratively. ANSWER: TRUE Short Answer A recursive function is a function that ______________. ANSWER: calls itself A stack exhibits what behavior? ANSWER: Last In – First Out In a recursive function, the statement(s) that invoke the function again are called the ______________. ANSWER: recursive calls If the recursive function call does not lead towards a stopping case, you have ______________. ANSWER: infinite recursion or a stack overflow How do you ensure that your function does not have infinite recursion? ANSWER: All recursive calls must lead to a stopping case. What is the output of the following code fragment? int f1(int base, int limit) { if(base limit) return -1; else if(base == limit) return 1; else return base * f1(base+2, limit); } int main() { cout f1(2,4)endl; return 0; } ANSWER: 2 Given the following code fragment, what is the stopping condition(s)? int f1(int x, int y) { if(x0 || y0) return x-y; else return f1(x-1,y) + f1(x,y-1); } int main() { cout f1(1,2)endl; return 0; } ANSWER: x0, y0 In a recursive power function that calculates some base to a positive exp power, at what value of exp do you stop? The function will continually multiply the base times the value returned by the power function with the ba