Stacks

Question 1

1) Stack - Definition

A stack is a d__________ set.
When we delete an element from a stack, it is the last element in the list. LIFO = Last In First out.

When we insert an element into a stack it goes at the end (on the tail).

Answer 1

dynamic

Question 2

2) How to Implement Stacks

There are several efficient ways to implement stacks, for now, we will be using a________.

Answer 2

array

Question 3

3) Operations

The insert operation is called = p_______

The delete operation is called = p______

To check if our stack is empty we use = S_____-E_______

They all take O(1) time.

Answer 3

push
pop
STACK-EMPTY

Question 4

4) S.top

When we create a stack using an array, we need to create a pointer
(a variable) called S.top that points to the most recently inserted element.

Question 5

Underflow and Overflow

If we try to PUSH a new item into a list that is full, it is called O___________.

If we try to delete an item from an empty list it is called U__________

Answer 5

overflow
underflow