Stack and Queue

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

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

A queue of characters currently contained a,b,c,d. What would be the contents of queue after the following operationDELETE, ADD W, ADD X, DELETE, ADD Y.

• A,B,C,W,Y

• A,B,C,D,W

• C,D,W,X,Y

• W,Y,X,C,D

If front=rear ,then the queue is?

• full

• undeflow

• overflow

• empty

What is the term for inserting into a full queue known as?

• underflow

• overflow

• front

• rear

Only top element can be accessed in stack

• TRUE

• FALSE

LIFO stands for

• List of Outputs

• Last in First Out

• First in Last Out

• None of them

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

• ABCD

• DCBA

• DCAB

• ABDC

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 numbers 5, 10, 3, 42 are enqueued onto a queue in that order, what does dequeue return?

• 5

• 10

• 3

• 42