Stack and Queue

Choose correct output for the following sequence of operations

push(5)

push(8)

pop

push(2)

push(5)

pop

pop

pop

push(1)

pop

• 8 5 2 5 1

• 8 5 5 2 1

• 8 2 5 5 1

• 8 1 2 5 5

Only top element can be accessed in stack

• TRUE

• FALSE

Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, the no of element present on stack are

• 1

• 2

• 3

• 4

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?

• ABCD

• DCBA

• DCAB

• ABDC

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

• ABCD

• ABDC

• CDBA

• DCAB

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

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

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.

• 1

• 2

• 3

• 4

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.

• 1

• 2

• 3

• 4

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

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above