What is recursion? What is linear recursion? What is binary recursion? What is t

Question

What is recursion? What is linear recursion? What is binary recursion? What is tail recursion? Suppose the following operations are performed on an empty queue: enqueue ('A'): enqueue ('S'): enqueue ('D'): dequeue (): enqueue ('T'): dequeue (): enqueue ('E'): dequeue (): dequeue(): enqueue ('W'): dequeue (): Insert characters in the following table to show what will be stored in the static queue after the operations above have executed. Where is the front of the queue? Where is the rear of the queue? Give the recursive trace for doSomethingR(5, 0) based on the following recursive function definition. int doSomethingR (int n, int acc) {if {n == 1) retun 1 + acc; return doSomethingR (n-1, n + acc);} Convert the recursice function doSomethingR() into an iteration function doSomethingI()

Explanation / Answer

1.
Recursion:
It is a technique in which 1 function makes a call to itself.
Linear recursion is a technique in which the recursive function makes only 1 recursive call to itself.
Binary recursion is a technique in which the recursive function makes 2 recursive calls to itself.
Tail recursion is the recursion where the recursive call is the very last statement in the function.

2.
enqueue('A');
Queue: A
enqueue('S');
Queue: A S
enqueue('D');
Queue: A S D
dequeue();
Queue: S D
enqueue('T');
Queue: S D T
dequeue();
Queue: D T
enqueue('E');
Queue: D T E
dequeue();
Queue: T E
dequeue();
Queue: E
enqueue('W');
Queue: E W
dequeue();
Queue: W

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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