Data Structures (STACKs)

Which principle does a stack follow?

• First-In, First-Out (FIFO)

• Last-In, First-Out (LIFO)

• Random Access

• Middle-In, Middle-Out

Where do insertion and removal of elements take place in a stack?

• Bottom

• Middle

• Top

• Random location

What is the term for adding an element to a stack?

•  Pop

• Push

• Top

• Empty

What is the term for removing an element from a stack?

• Push

• Pop

• Top

•  IsEmpty

Which operation checks if the stack is empty?

• Push

• Pop

• Top

• IsEmpty

What does the size() operation on a stack return?

• The top element

• True if the stack is empty, false otherwise

• The number of elements in the stack.

What is the time complexity for push and pop operations on a stack?

• O(n)

• O(log n)

• O(1)

• O(n^2)

What is the primary data structure used to implement a stack?

• Array

• Both Array and Linked List

• Tree

• Linked List

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

• Returns null

• No operation

• Overflow

• Underflow

Which of the following is a common application of stacks?

• Undo functionality in applications

• Queue management

• Graph traversal

• Sorting algorithms