2.3.1 Stacks - Do Now

What does LIFO stand for in the context of stacks?

• Least Important First Out

• Least Input First Output

• Last In First Out

• Last In Final Out

What method is used to insert an element into a stack?

What operation does the 'pop' method perform in a stack?

• Inserts an element at the beginning

• Removes the last element

• Removes the first element

• Checks the first element

For what purposes are stacks used in computing?

• Internet browsing and email sending

• Data encryption and decryption

• Sorting and searching algorithms

• Backtracking and compile-time memory management

​ (a)  

This is where an item is ​ (b)   to the top of the stack. If the stack is full and the item cannot be added then an error is raised.

​ (c)  

This is where an item is removed from the top of the stack and returned to the program for further processing. If the stack is already empty then an ​ (d)   is raised.

​ (e)  

This is where the value contained at the top of the stack is returned to the program without removing the item from the stack. If the stack is empty then an error is raised.

• Push
• added
• Pop
• error
• Peek
• Insert
• Delete
• Retrieve
• Overflow
• Underflow