Example on Queue

Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do?

void fun(int n)
{
    IntQueue q = new IntQueue();
    q.enqueue(0);
    q.enqueue(1);
    for (int i = 0; i < n; i++)
    {
        int a = q.dequeue();
        int b = q.dequeue();
        q.enqueue(b);
        q.enqueue(a + b);
        ptint(a);
    }
}

 

A) Prints numbers from  \(0\)  to \(n-1\)

B) Prints numbers from \(n-1 \ \ to \ \ 0\) 

C) Prints first \(n\) fibonacci numbers.

D) Prints first \(n\) fibonacci numbers in reverse order.

Answer

Lets take , \(n = 4\) 

Hence, Output is first \(n\), fibonacci numbers.

0Comment