Consider the following pseudo-code. Assume that IntQueue is an integer queue. What does the function fun do?
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);
print(a);
}
}
Prints numbers from 0 to n-1
Prints numbers from n-1 to 0
Prints first n Fibonacci numbers
Prints first n Fibonacci numbers in reverse order.
This question is part of this quiz :
Top MCQs on Queue Data Structure with Answers