[Solved] An algorithm that calls itself directly or indirectly is known as ____________.

McqMate

Q.	An algorithm that calls itself directly or indirectly is known as ____________.
A.	Sub algorithm. .
B.	Recursion.
C.	Polish notation.
D.	Traversal algorithm.
Answer» B. Recursion.

1.3k

0

Do you find this helpful?

19

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs

Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
How do the nested calls of the function get managed?
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
What is the time complexity of an infix to postfix conversion algorithm?
Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
In infix to postfix conversion algorithm, the operators are associated from?
What is an external sorting algorithm?
What is an internal sorting algorithm?
What is an in-place sorting algorithm?