Stacks

Question 1

What is data abstraction?

Answer 1

Isolates how a compound data object is used from the details of how it’s constructed.

Question 2

What is a stack?

Answer 2

They are defined as last in first out data structures.

Question 3

What does push do?

Answer 3

Adds elements to the top of the stack.

Question 4

What does peek do?

Answer 4

Returns the top item in a stack.

Question 5

What does pop do?

Answer 5

Deletes the top item in a stack.

Question 6

What are the steps involved in pushing an item onto a stack?

Answer 6

First check if the stack is full. If so, report a stack overflow. If not, increase the stack pointer by one. Insert the item at the memory location indicated by the front pointer.

Question 7

What are the steps involved in popping an item off a stack?

Answer 7

First check if the stack is empty. If so, then report a stack underflow. If not, then delete the top item of the stack and decrease the stack pointer by one.