Data structures 2: Stacks and Queues

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

If you carry out a pop operation on this stack what will you be left with?

• 
• 
• 

What will happen if you carry out a push operation with the word 'Bill'?

• 
• 
• 

What are Stacks Used For?

• Type in data from keyboard

• To remove data

• To stack information

• To keep track of a sequence of operations

When an interrupt occurs, where is the current instruction placed in the stack?

• On top

• The bottom

• The side

• No where