Data Structures - Stacks

Which principle of object-oriented programming is most closely related to the implementation of abstract data types like stacks?

• Inheritance
• Polymorphism
• Encapsulation
• Abstraction

What distinguishes a stack from a queue in terms of data access?

• First In First Out (FIFO)
• Last In First Out (LIFO)
• Random Access
• Priority-based Access

Which operation would you use to add an item to the top of a stack?

• Pop
• Peek
• Enqueue
• Push

What is the primary purpose of the 'peek' operation in a stack?

• View the top item without removing it
• Remove the top item
• Add a new item
• Check if the stack is empty

In the context of stack operations, what does 'overflow' refer to?

• Attempting to push onto a full stack
• Attempting to pop from an empty stack
• Exceeding the maximum integer value
• Recursive function calls exceeding memory limits

What is stored in a stack frame during a subroutine call?

• Global variables
• Parameters, return address, and local variables
• The entire program code
• The contents of the CPU registers

What happens to local variables when a subroutine completes execution?

• They are stored in global memory
• They are converted to global variables
• They are popped off the stack
• They remain on the stack indefinitely

In the context of stack implementation, what does 'underflow' mean?

• The stack becomes too large
• Attempting to push onto a full stack
• The stack pointer becomes negative
• Attempting to pop from an empty stack

Which of the following is NOT typically a basic operation for a stack?

• Push
• Sort
• Pop
• Peek

What is the primary advantage of implementing a stack using a dynamic list structure?

• Faster access times
• Reduced memory usage
• No need for a 'stack full' test
• Simplified pop operations