Recursion is a method in which the solution of a problem depends on ____________

Smaller instances of the same problem

Which of the following statement is correct?

All the parameters of a function can be default parameters.

When flow of control is transferred to the calling program, program execution resumes

on the next statement after the function call

Help

Options

focusNode

Didn't know it?
click below

Knew it?
click below

Don't Know

Remaining cards (0)

Know

retry

shuffle

restart

0:00

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

Normal Size Small Size show me how

M7 - CCS0003

TECHNICAL ASSESSMENT

Question	Answer
Formal parameters are variables used within the function header that receives a copy of the actual argument values. Group of answer choices	True
A function that can be made to return a single value to the calling program is referred to as void function.	False
The program that calls a function is often referred to as the calling program.	True
This symbol specifies that the corresponding arguments in the function are to be passed by reference.	&
A function that can be made to return a single value to the calling program.	non-void
The only difference between the header and the prototype is the colon.	False
Here is a function, double numbers (int x), what is the name of this function?	Numbers
A function is a self contained block of code with a specific purpose.	True
What is the scope of the variable declared in the user defined function?	only inside the { } block
Recursion itself cannot be used as a replacement to iteration or looping	False
The recursive routine always contains a selection statement-either an "if" or a "switch".	True
Only predefined functions can be involved in recursion.	False
A branching structure is the main control structure in a recursive routine while a looping structure is the main control structure in an iterative routine.	True
Recursion is a method in which the solution of a problem depends on ____________	Smaller instances of the same problem
Recursion performs faster while executing the iteration process.	False
Which is NOT an essential feature of a proper recursive function?	Not permitted to do any I/O
Recursion is required in problems concerning advanced algorithms such as Graph and Tree Traversal.	True
In recursion, the condition for which the function will stop calling itself is ____________	Base Case
Recursion makes our code shorter and cleaner.	True
What are mandatory parts in function declaration?	return type, function name
Which of the following is used to terminate the function prototype?	;
If a variable is declared outside a function and can be used by other functions, what kind of variable is this?	global variable
Which of the following statement is correct?	All the parameters of a function can be default parameters.
Where does the execution of the program starts?	main() function
From which function the execution of a C++ program starts?	main() function
When flow of control is transferred to the calling program, program execution resumes	on the next statement after the function call
Recursion takes more memory allocation due to the stack operation of all the function calls.	True
When a recursive function is executed, the recursive calls are implemented instantly.	False
All the recursive calls are pushed onto the stack	True

Created by: tateh21

"Know" box contains:
Time elapsed:
Retries: