Stacks

Question 1

What is an abstract data type (ADT)?

Answer 1

An abstract data type (ADT) is a model for a certain class of data structures that have similar behavior.

Question 2

What is a stack?

Answer 2

A stack is an abstract data type that follows the Last In, First Out (LIFO) principle.

Question 3

True or False: In a stack, the first element added is the first to be removed.

Answer 3

False

Question 4

What are the primary operations of a stack?

Answer 4

The primary operations of a stack are push, pop, and peek (or top).

Question 5

Fill in the blank: The operation that adds an element to the top of the stack is called ____.

Answer 5

push

Question 6

Fill in the blank: The operation that removes the top element from the stack is called ____.

Answer 6

pop

Question 7

What does the ‘peek’ operation do?

Answer 7

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

Question 8

True or False: A stack can be implemented using arrays or linked lists.

Answer 8

True

Question 9

What is a common use case for stacks?

Answer 9

Common use cases for stacks include expression evaluation and backtracking algorithms.

Question 10

True or False: A stack can grow indefinitely without a limit.

Answer 10

False

Question 11

What is stack overflow?

Answer 11

Stack overflow occurs when a stack exceeds its maximum capacity.

Question 12

What is stack underflow?

Answer 12

Stack underflow occurs when a pop operation is attempted on an empty stack.

Question 13

Multiple choice: Which of the following operations is not a standard stack operation? A) push B) pop C) enqueue D) peek

Answer 13

C) enqueue

Question 14

How does a stack differ from a queue?

Answer 14

A stack is LIFO while a queue is FIFO (First In, First Out).

Question 15

Fill in the blank: The maximum number of elements a stack can hold is known as its ____.

Answer 15

capacity

Question 16

What is a real-world analogy for a stack?

Answer 16

A stack can be compared to a stack of plates where the last plate placed on top is the first one to be taken off.

Question 17

True or False: In a stack, elements can be accessed in any order.

Answer 17

False

Question 18

What data structure can be used to implement a stack?

Answer 18

A stack can be implemented using either an array or a linked list.

Question 19

What is the purpose of the ‘isEmpty’ function in a stack?

Answer 19

The ‘isEmpty’ function checks if the stack contains any elements.

Question 20

Multiple choice: Which of the following best describes a stack? A) A linear data structure B) A non-linear data structure C) A tree structure D) A graph structure

Answer 20

A) A linear data structure

Question 21

What is the main advantage of using a stack?

Answer 21

The main advantage of using a stack is its simplicity and efficiency in managing data in a LIFO manner.

Question 22

Fill in the blank: In a stack, the topmost element is the one that is ____ first.

Answer 22

removed

Question 23

True or False: Stacks are commonly used in function call management in programming languages.

Answer 23

True

Question 24

What is a stack frame?

Answer 24

A stack frame is a section of the stack that contains information about a function call, including local variables and return addresses.

Question 25

Multiple choice: Which operation would typically cause a stack underflow? A) push B) pop C) peek D) isEmpty

Answer 25

B) pop

Question 26

What happens to the stack pointer when a push operation is executed?

Answer 26

The stack pointer moves up to point to the new top element.

Question 27

What happens to the stack pointer when a pop operation is executed?

Answer 27

The stack pointer moves down to point to the new top element.