Exploring Stacks in Python

What are the main operations performed on a stack?

• insert, delete, view

• add, remove, top

• The main operations performed on a stack are push, pop, and peek.

• enqueue, dequeue, front

How do you implement a stack using a Python list?

• Use list.insert() to add elements and list.delete() to remove elements.

• Use list.push() to add elements and list.remove() to remove elements.

• Use list.add() to push elements and list.take() to pop elements.

• Use list.append() to push and list.pop() to pop elements.

What is a common application of stacks in programming?

• Sorting data in arrays.

• Storing key-value pairs in dictionaries.

• Managing function calls and recursion.

• Implementing linked lists.

Describe the stack data structure and its characteristics.

• A stack is a LIFO data structure that allows push and pop operations.

• A stack is a FIFO data structure that allows only peek operations.

• A stack is a data structure that allows random access to elements.

• A stack can only store integers and does not support dynamic resizing.

How can a Python list be utilized as a stack?

• Use list.append() to push and list.pop() to pop elements.

• Use list.insert() to add elements at the beginning.

• Use list.sort() to manage stack order.

• Use list.remove() to pop elements from the end.

What error might occur when trying to pop from an empty stack?

• Syntax error

• NullPointerException

• Overflow error

• Underflow error or IndexError

Explain the concept of stack overflow.

• Stack overflow is a method for managing memory efficiently.

• Stack overflow occurs when memory is allocated incorrectly.

• Stack overflow is a type of data structure.

• Stack overflow is an error that occurs when the call stack pointer exceeds the stack bound.

What is the time complexity of push and pop operations in a stack?

• O(n)

• O(log n)

• O(n^2)

• O(1)

How can stacks be used in recursive function calls?

• Stacks are used to optimize memory usage in iterative functions.

• Stacks prevent infinite loops in recursive calls by limiting depth.

• Stacks automatically manage variable scope in recursive functions.

• Stacks manage the state of recursive function calls by storing function frames.

What is the difference between a stack and a queue?

• A stack can hold only integers, while a queue can hold any data type.

• A stack uses LIFO, while a queue uses FIFO.

• A stack uses FIFO, while a queue uses LIFO.

• Both stack and queue use LIFO.