Quiz 2 (True/False and Multiple Choice)

A recursive method without a base case will ________________ A. repeat forever B. return immediately C. call itself only once D. overflow the stack

D. overflow the stack

All recursive functions must return a value

FALSE

In a recursive function, return immediately goes back to the main method.

FALSE

The compiler gives an error if a recursive function doesn't have a base case.

FALSE

A facade function hides recursive parameters from the implementation.

TRUE

A recursive function may have more than one base case.

TRUE

A recursive method may use a while loop

TRUE

The termination point of a recursive method is called a base case.

TRUE

The call __________ is where active method data is stored whenever a method is called. A. stack B. list C. queue D. center

A. stack

Merge Sort has a worst case run time of _____________________ A. O(n) B. O(n log (n)) C. O(log (n^2)) D. O(n^2)

B. O(n log (n))

Two or more functions that repeatedly call each other is known as _________________. A. dual recursion B. shared recursion C. mutual recursion D. pair recursion

C. mutual recursion