Let Q denote a queue containing sixteen numbers and S be an empty stack.…

PYQ GATE 2016

Let Q denote a queue containing sixteen numbers and S be an empty stack.  Head(Q) returns the element at the head of the queue Q without removing it from Q. Similarly, Top(S) returns the element at the top of S without removing it from S. Consider the algorithm given below.

The maximum possible number of iterations of the while loop in the algorithm is ___________ .

Attempted by 240 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…