Why Stack Exists and What Problems It Solves in DSA C - Quick Recap

Recall & Review

beginner

What is a stack in simple terms?

A stack is like a pile of plates where you can only add or remove the top plate. It follows Last In, First Out (LIFO) order.

beginner

Why do we need a stack in programming?

Stacks help manage tasks that need to be done in reverse order, like undo actions, function calls, or matching brackets.

intermediate

What problem does a stack solve in function calls?

It keeps track of where each function should return after finishing, so functions can call others and return correctly.

intermediate

How does a stack help in expression evaluation?

Stacks store operators and operands to evaluate expressions in the correct order, especially with parentheses and operator precedence.

beginner

What is the main rule of stack operations?

You can only add (push) or remove (pop) items from the top of the stack, following Last In, First Out (LIFO).

What order does a stack follow?

A Last In, First Out (LIFO)

B First In, First Out (FIFO)

C Random order

D Sorted order

A stack follows Last In, First Out (LIFO), meaning the last item added is the first to be removed.

Which problem is best solved by using a stack?

A Undo feature in text editors

B Finding the shortest path in a graph

C Sorting a list

D Searching in a database

Undo features use stacks to reverse actions in the order they were done.

In function calls, what does the stack keep track of?

A Variable names

B Output results

C Input values

D Return addresses

The stack stores return addresses so the program knows where to continue after a function finishes.

Which operation is NOT allowed directly on a stack?

A Pop

B Insert at bottom

C Peek

D Push

Stacks only allow adding or removing items from the top, not inserting at the bottom.

How does a stack help with matching parentheses?

A By counting the total number of brackets

B By sorting the brackets alphabetically

C By storing opening brackets until a matching closing bracket is found

D By ignoring brackets

Stacks store opening brackets and check for matching closing brackets in correct order.

Explain why a stack is useful in managing function calls.

Think about how functions call other functions and need to return to the right place.

Describe how a stack helps solve problems involving reversing actions or order.

Consider situations where the last thing done must be undone first.