Q. Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) is true; for all positive integers n, if P(n) is true then P(n+2) is true.

View solution

Q. 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.

View solution

Q. A polygon with 25 sides can be triangulated into _______

View solution

Q. Which of the following is contained in a recursive grammar?

View solution

Q. ________ is the consequence of dynamic programming.

View solution

Q. How many types of self-referential recursive data are there in computer programs?

View solution

Q. _______ recursion consists of multiple self-references.

View solution

Q. 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?

View solution

Q. The mutual recursion is also termed as ______

View solution

Q. In which of the following problems recurrence relation holds?

View solution

Q. Which of the following functions generates new data at each step of a method?

View solution

Q. Every recursive algorithm must have the problem of ________

View solution

Q. If the height of a binary tree is 54, how many null pointers are there as children?

View solution