In which of the following problems recurrence relation holds? – McqOptions

MCQOPTIONS

1.	In which of the following problems recurrence relation holds?
A.	Optimal substructure
B.	Tower of Hanoi
C.	Hallmark substitution
D.	Longest common subsequence
Answer» C. Hallmark substitution

Discussion

No Comment Found

Related MCQs

Let P(n) be the statement that postage of n cents can be formed using just 3-cents stamps and 5-cents stamps. Is the statements P(8) and P(10) are Correct?
The argument of each recursive call is the content of a field of the original output. This definite characteristic belongs to which of the following function?
Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) and P(2) is true; for all positive integers n, if P(n) and P(n+1) is true then P(n+2) is true.
Every recursive algorithm must have the problem of ________
Which of the following is contained in a recursive grammar?
A polygon with 25 sides can be triangulated into _______
How many types of self-referential recursive data are there in computer programs?
________ is the consequence of dynamic programming.
A polygon with 7 sides can be triangulated into ________
_______ recursion consists of multiple self-references.