If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

In linked list implementation of a queue, the important condition for a queue to be empty is?

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.

Which of the following is true about linked list implementation of queue?

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.

What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue?

Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

The following postfix expression with single digit operands is evaluated using a stack:

Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:

If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values