Which of the following statements declares a template stack of characters? Stack

Question

Which of the following statements declares a template stack of characters? StackTypemyStack StackType myStack char myStack You can't do this in C++ The smaller the height of the tree, the faster the search. True False Which of the following statements could possibly describe the base case of a recursive algorithm? F(x) = x - F(x - 1) If the array length is 100, do nothing. All parameters are integers. F(0) = 27 b and d above At times the base case in recursion can be a "do-nothing" case. True False The following definition of N factorial is a valid recursive definition. N! = N * (N -1)!, if N > 1 N! = 1, if N = 0 True False Recursion uses stack data structure True False

Explanation / Answer

20.

A. StackType<char> myStack

Here StackType is of char type and myStack is the variable of type StackType

21.

A. True

The search time corresponds to the height of the tree.

22.

D. F(0) = 27

23.

B.False

24.

B. False

because condition N = 1 is not taken care of.

25.

A. True

Recursion saves return address of functions on stack

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.