Stack & 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

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

What is a stack?

• A data structure that adds the last added data item.

• A data structure that increases data items first.

• Data structure that removes the last added data item first

• A data structure that multiplies data items

What two operations do stacks require?

• Push

• Draw

• Stretch

• Drag

• Pop

What operation adds a new item onto the top of the stack?

• Pull

• Push

• Add

• Multiply

What operation removes the item from the top of the stack

• Pull

• Add

• Pop

• Subtract

If you have a stack containing 'A' 'D' 'G' . What will happen if you push 'C' into the stack?

• 'C' Will be added on top of the stack

• 'C' Will be added from the bottom of the stack

• 'C' Will be removed from the stack

• 'C' Will not be added to the stack

A stack containing 'Dog' 'Cat' & 'Rat' . What will happen if you carry out a pop operation on the stack ?

• Noting

• Cat will be removed

• Dog will be removed

• Rat will be removed