What are the write answers and include the steps or definitions how you solve th

Question

What are the write answers and include the steps or definitions how you solve them?

Using a while loop with one statement in its body put all elements of a queue (Q) inside a stack (S) [the last element of the queue should be in the top of the stack]. You are allowed to use any required stack's and/or queue's operation. Please visualize recursion trace for the call LinearFibonacci(6) for the following algorithm: F_0 = 0 F_1 = 1 F_i = F_i - 1 + F_i - 2 for i > 1 Algorithm LinearFibonacci(k): Input: A nonnegative integer k Output: Pair of Fibonacci numbers (F_k, F_k - 1) if k = l then return (k,0) else (i, j) = LinearFibonacci(k - 1) return (i + j, i)

Explanation / Answer

15)

Lets assume : Queue has methods: isEmpty(), enqueue(), dequeue()
               Stack has methods: push(), pop()
Then,

   while(!Q.isEmpty()){
       S.push(Q.dequeue());
   }

16)
  
   Lets assume LinearFibonacci => F

   THen F(6)

                               F(6)   (8, 5)
                               |
                               F(5)   (5, 3)
                               |
                               F(4)   (3, 2)
                               |
                               F(3)   (2, 1)
                               |
                               F(2)   (1, 1)
                               |
                               F(1)   (1, 0)

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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