Stack Data Structures

What is a stack data structure?

• A stack data structure allows elements to be added and removed from both ends.

• A stack data structure supports operations such as insert and delete at any position.

• A stack data structure is a Last In First Out (LIFO) data structure where elements are added and removed from the same end, called the top. It supports two main operations: push (adds an element to the top of the stack) and pop (removes the top element from the stack).

• A stack data structure is a First In First Out (FIFO) data structure.

What are the two primary operations that can be performed on a stack?

• insert and delete

• push and pop

• push and peek

• add and remove

Explain the 'push' operation in a stack.

• The 'push' operation in a stack involves updating an element in the middle of the stack.

• The 'push' operation in a stack involves removing an element from the top of the stack.

• The 'push' operation in a stack involves sorting all elements in the stack.

• The 'push' operation in a stack involves adding a new element to the top of the stack.

Explain the 'pop' operation in a stack.

• The 'pop' operation in a stack removes the top element from the stack.

• The 'pop' operation in a stack clears the entire stack.

• The 'pop' operation in a stack rearranges the elements in the stack.

• The 'pop' operation in a stack adds an element to the top of the stack.

What happens when you try to pop from an empty stack?

• Underflow error

• Overflow error

• Data corruption

• No error

How is a stack different from a queue?

• Stacks are typically implemented using a linked list, while queues are implemented using arrays.

• In a stack, elements are added and removed from the same end following the Last In First Out (LIFO) principle. In a queue, elements are added at the rear and removed from the front following the First In First Out (FIFO) principle.

• In a stack, elements are removed from the front, while in a queue, elements are removed from the rear.

• Stacks allow random access to elements, while queues only allow sequential access.

What is the underlying data structure commonly used to implement a stack?

• hash table

• linked list

• binary tree

• array

How do you check if a stack is empty?

• Check if the stack is full.

• Check if the stack size is greater than 0.

• Check if the stack size is equal to 0.

• Check if the stack has any elements.

How do you check if a stack is full when implemented using an array?

• Check if the stack is empty

• Count the number of elements in the stack

• Compare the current size of the stack to the maximum capacity of the array.

• Verify the data type of the stack elements

Explain the concept of 'top' in a stack.

• The 'top' in a stack is the element at the top of the stack, representing the most recently added element.

• The 'top' in a stack is the middle element

• The 'top' in a stack is the bottom element

• The 'top' in a stack is the smallest element