Data Structures | Queue | Question 1
Following is C like pseudo-code of a function that takes a Queue as an argument, and uses a stack S to do processing.
C
void fun(Queue *Q)
{
Stack S;
while (!isEmpty(Q))
{
push(&S, deQueue(Q));
}
while (!isEmpty(&S))
{
enQueue(Q, pop(&S));
}
}
|
What does the above function do in general?
(A)
Removes the last from Q
(B)
Keeps the Q same as it was before the call
(C)
Makes Q empty
(D)
Reverses the Q
Answer: (D)
Explanation:
The function takes a queue Q as an argument. It dequeues all items of Q and pushes them to a stack S. Then pops all items of S and enqueues the items back to Q. Since the stack is LIFO order, all items of the queue are reversed.
Hence option (D) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Last Updated :
08 Jan, 2013
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...