STACK

Question 1

What is a stack?

Answer 1

A stack is a data structure that follows the Last In, First Out (LIFO) principle.

Question 2

Which operations are primarily associated with stacks?

Answer 2

Push, pop, and peek.

Question 3

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

Answer 3

True.

Question 4

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

Answer 4

O(1).

Question 5

Fill in the blank: A stack is often used to implement _____.

Answer 5

function calls.

Question 6

What is the main use of a stack in programming?

Answer 6

To keep track of function calls and local variables.

Question 7

Which of the following is a common application of stacks?

Answer 7

Undo mechanisms in software.

Question 8

What does the ‘peek’ operation do in a stack?

Answer 8

It retrieves the top element without removing it.

Question 9

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

Answer 9

True.

Question 10

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

Answer 10

It results in an underflow error.

Question 11

What is the maximum size of a stack implemented with a fixed-size array?

Answer 11

It is limited by the size of the array.

Question 12

Which data structure is used to reverse a string?

Answer 12

A stack.

Question 13

What is the stack pointer?

Answer 13

A pointer that indicates the top of the stack.

Question 14

Fill in the blank: The stack follows the _____ principle.

Answer 14

Last In, First Out (LIFO).

Question 15

What is a stack overflow?

Answer 15

It occurs when there is no more space in the stack to add new elements.

Question 16

Multiple Choice: Which one of the following is NOT a valid stack operation?

Answer 16

Insert at a specific position.

Question 17

True or False: The stack data structure can be used for depth-first search in graphs.

Answer 17

True.

Question 18

What does it mean to ‘push’ an element onto a stack?

Answer 18

To add an element to the top of the stack.

Question 19

What is the result of popping an element from a stack with one element?

Answer 19

The stack becomes empty.

Question 20

Which of the following is a characteristic of a stack?

Answer 20

Elements are added and removed from the same end.

Question 21

What is the primary difference between a stack and a queue?

Answer 21

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

Question 22

Fill in the blank: In recursive function calls, each call is stored in a _____.

Answer 22

stack frame.

Question 23

What is a stack frame?

Answer 23

A structure that contains information about a function call, including local variables and return address.

Question 24

Multiple Choice: Which application uses stacks?

Answer 24

Backtracking algorithms.

Question 25

What is the stack data structure commonly used for in compilers?

Answer 25

To manage function calls and local variables.

Question 26

True or False: A stack can dynamically grow in size.

Answer 26

True, if implemented using a linked list.

Question 27

What is the key advantage of using a stack?

Answer 27

It allows for efficient management of data in LIFO order.

Question 28

What is the purpose of the 'isEmpty' function in a stack implementation?

Answer 28

To check if the stack has no elements.

Question 29

Which operation would you use to access the top element of a stack without removing it?

Answer 29

Peek.

Question 30

What is a common problem that can occur with stack-based algorithms?

Answer 30

Stack overflow.

Question 31

True or False: Stacks can be implemented using circular linked lists.

Answer 31

True.

Question 32

What type of problems can be solved using stacks?

Answer 32

Problems that require backtracking, such as maze solving.

Question 33

Fill in the blank: The _____ data structure is used to reverse the order of elements.

Answer 33

stack.

Question 34

What does it mean to 'pop' an element from a stack?

Answer 34

To remove the element from the top of the stack.

Question 35

Multiple Choice: Which of the following best describes a stack?

Answer 35

A collection of elements with a specific order of access.

Question 36

What is the stack's behavior during recursion?

Answer 36

Each recursive call adds a new stack frame.

Question 37

True or False: You can access elements in a stack randomly.

Answer 37

False.

Question 38

What happens to the stack when a function call is completed?

Answer 38

The stack frame for that function is removed.

Question 39

What is a common use of stacks in web browsers?

Answer 39

To manage the history of visited pages.

Question 40

Fill in the blank: In a stack, the _____ operation adds an element.

Answer 40

push.

Question 41

What is the typical implementation of a stack in programming languages?

Answer 41

Using an array or a linked list.

Question 42

Multiple Choice: Which of the following is a real-world analogy for a stack?

Answer 42

A stack of plates.

Question 43

True or False: A stack can be used to evaluate expressions in postfix notation.

Answer 43

True.

Question 44

What is the primary data structure used to implement undo functionality in applications?

Answer 44

Stack.

Question 45

What are the two main types of stacks?

Answer 45

Static stack and dynamic stack.

Question 46

Fill in the blank: A stack is often referred to as a _____ structure.

Answer 46

linear.

Question 47

What is the effect of pushing elements onto a stack until it is full?

Answer 47

It causes a stack overflow error.

Question 48

What is the role of a stack in function calls?

Answer 48

To store return addresses and local variables.

Question 49

True or False: You can push and pop elements in any order in a stack.

Answer 49

False.

Question 50

What is the main disadvantage of using a fixed-size stack?

Answer 50

It can lead to stack overflow if the size limit is exceeded.

Question 51

Multiple Choice: Which of the following operations is not typically associated with stacks?

Answer 51

Searching for an element.

Question 52

What happens during a stack underflow?

Answer 52

An attempt is made to pop an element from an empty stack.

Question 53

Fill in the blank: Stacks are often used in algorithms that require _____.

Answer 53

backtracking.

Question 54

What does a stack's 'top' refer to?

Answer 54

The most recently added element that is available for removal.