Answer the following statements true (T) or false (F)
1. A recursive function must not return a value.
2. A recursive function can have local variables.
3. A recursive function can have only one stopping case.
4. A recursive function can have only one recursive case.
5. Each recursion causes a new activation frame to be placed on the stack.
1. False
Value returning and void recursive functions are certainly permitted.
2. True
Any function can have local variables.
3. False
There is no reason to prohibit multiple stopping cases, nor, for that matter, multiple recursive cases.
4. False
There is no reason to prohibit multiple recursive cases, nor, for that matter, multiple stopping cases.
5. True
The activation frame contains the local variables and parameters created at each invocation of the function.
You might also like to view...
You can use the Save As command to create a copy of a file with a new name
Indicate whether the statement is true or false
It is possible for Word to save a file as a Portable Document Format, PDF
Indicate whether the statement is true or false
A grammatical error is underlined with a blue wavy line.
Answer the following statement true (T) or false (F)
?home It is always more efficient to search through _____ data than it is to search through _____ data.
A. ?selected/unselected B. ?primary/secondary C. ?queued/stacked D. ?ordered/unordered