Question

Consider the following pseudo-code. Assume that IntQueue is an integer queue. What does the function fun do? ``` void fun(int n) l IntQueve q = new IntQueve(); q. enqueve (0); q.enqueue (1); for (int i = 0; i < n; i++) l int a = q. dequeue(); int b - q.dequeue () ; q. enqueue (b); q.enqueue (a + b); ptint(a); } l ``` A. Prints numbers from 0 to $\mathrm{n}-1$ B. Prints numbers from $\mathrm{n}-1$ to 0 C. Prints first n Fibonacci numbers D. Prints first n Fibonacci numbers in reverse order.

   Consider the following pseudo-code. Assume that IntQueue is an integer queue. What does the function fun do?
```
void fun(int n)
l
    IntQueve q = new IntQueve();
    q. enqueve (0);
    q.enqueue (1);
    for (int i = 0; i < n; i++)
    l
        int a = q. dequeue();
        int b - q.dequeue () ;
        q. enqueue (b);
        q.enqueue (a + b);
        ptint(a);
    }
l
```
A. Prints numbers from 0 to $\mathrm{n}-1$
B. Prints numbers from $\mathrm{n}-1$ to 0
C. Prints first n Fibonacci numbers
D. Prints first n Fibonacci numbers in reverse order.

Show more…

Data Structures Using C

Data Structures Using C

Amol M. Jagtap, Ajit… 1st Edition

Chapter 2, Problem 25

Instant Answer

Step 1

Step 1: Let's understand what the function `fun(n)` does by tracing through the code. Show more…

Show all steps

lock

Thanks for your feedback!

Consider the following pseudo-code. Assume that IntQueue is an integer queue. What does the function fun do? ``` void fun(int n) l IntQueve q = new IntQueve(); q. enqueve (0); q.enqueue (1); for (int i = 0; i < n; i++) l int a = q. dequeue(); int b - q.dequeue () ; q. enqueue (b); q.enqueue (a + b); ptint(a); } l ``` A. Prints numbers from 0 to $\mathrm{n}-1$ B. Prints numbers from $\mathrm{n}-1$ to 0 C. Prints first n Fibonacci numbers D. Prints first n Fibonacci numbers in reverse order.

Play audio

Feedback

Powered by NumerAI

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later