Exploring Stacks in Data Structures

What are the primary operations of a stack?

• enqueue, dequeue, top

• add, remove, inspect

• insert, delete, view

• The primary operations of a stack are push, pop, and peek.

Explain the push operation in a stack.

• The push operation removes an element from the stack.

• The push operation checks if the stack is empty.

• The push operation retrieves the top element of the stack.

• The push operation adds an element to the top of the stack.

What is the pop operation in a stack?

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

• The pop operation checks if the stack is empty.

• The pop operation retrieves the bottom element from a stack.

• The pop operation adds an element to the stack.

Define the peek operation in a stack.

• The peek operation removes the top element of the stack.

• The peek operation retrieves the top element of the stack without removing it.

• The peek operation retrieves all elements in the stack.

• The peek operation adds a new element to the top of the stack.

What is the time complexity of stack operations?

• O(1)

• O(n)

• O(log n)

• O(n^2)

List two applications of stacks in real-world scenarios.

• Image processing in graphics software

• Data storage in databases

• Queue management in operating systems

• 1. Function call management in programming languages. 2. Undo mechanisms in applications.

How are stacks used in function call management?

• Stacks are used to execute functions in parallel without waiting for returns.

• Stacks are used to manage function calls by maintaining a stack frame for each active function, allowing for proper return and local variable management.

• Stacks are used to store global variables for all functions.

• Stacks are used to manage memory allocation for static variables.

Describe how stacks can be used for expression evaluation.

• Stacks can evaluate expressions by managing operands and operators, using LIFO to process postfix and infix expressions.

• Stacks cannot manage operands and operators simultaneously.

• Stacks are used to store only the final result of an expression.

• Stacks can only evaluate infix expressions without any operators.

What are the two common methods for implementing a stack?

• Hash Table and Set

• Graph and ArrayList

• Queue and Tree

• Array and Linked List

Explain the difference between an array-based stack and a linked-list-based stack.

• An array-based stack uses more memory for pointers than a linked-list-based stack.

• An array-based stack has a fixed size and can waste space or overflow, while a linked-list-based stack is dynamic and uses more memory for pointers.

• A linked-list-based stack has a fixed size and can waste space.

• An array-based stack is always faster than a linked-list-based stack.