What is the defining principle of a stack?

• First-in-first-out (FIFO)

• Last-in-first-out (LIFO)

• Random order

• None of the above

What happens during a pop operation?

• The stack is duplicated.

• The bottom element is removed.

• The top element is removed.

• Nothing happens.

Which data structure is commonly used to implement a dynamic stack?

• Array

• Linked List

• Queue

• Binary Tree

Which application is NOT a real-life use case of stacks?

• Undo feature in text editors

• Managing memory in recursion

• Routing in computer networks

• Page-visited history in browsers

Which notation is easier for humans to read but harder for computers to evaluate?

• Prefix

• Infix

• Postfix

• Reverse Polish Notation

What does the following code snippet do? void push(struct Stack* stack, int item) { if (isFull(stack)) return; stack->array[++stack->top] = item; }

• Removes an item from the stack

• Adds an item to the stack

• Checks if the stack is full

• Initializes the stack

Which of the following is a valid check for balanced brackets using a stack? if (stack == NULL) return 0; else if (!isMatchingPair(pop(&stack), exp[i])) return 0;

• Checks if the stack is balanced.

• Removes unbalanced brackets.

• Pushes unmatched brackets onto the stack.

• Returns true if brackets are balanced.

How would you reverse a string using a stack in C?

• Push the string into the stack and then pop characters.

• Push characters into the stack and pop them back into a string.

• Sort the stack and print characters.

• None of the above.

Given the stack operations:
Push(2), Push(4), Push(6), Pop(), Push(8), Pop(), Push(10),
what is the stack content (top to bottom)?

• 1. 8, 10, 4

• 1. 10, 8, 2

• 1. 10, 4, 2

• 1. 4, 2

What is the condition for stack underflow?

• a. top == -1

• b. top == capacity - 1

• c. isEmpty(stack)

• d. Both a and c