Stack Operations Quiz 1

What does the peek() operation do in a stack?

• Returns the top element without removing it.

• Removes the top element.

• Adds an element to the stack.

• Clears the stack.

Given the stack operations: Push(3), Push(5), Pop(), Push(7), Push(9), what is the stack content (top to bottom)?

• 7, 9

• 9, 7, 3

• 3, 9, 7

• None of the above

Which data structure can evaluate postfix expressions?

• Queue

• Stack

• Binary Tree

• Linked List

What does the following code accomplish? if (stack->top capacity / 4) { resizeStack(stack, stack->capacity / 2); }

• Increases the stack size.

• Decreases the stack size.

• Checks if the stack is empty.

• Duplicates the stack.

What is the output of the following sequence? push(5); push(10); pop(); push(20); pop(); peek();

• 5

• 10

• 20

• None of the above

What is the condition to increase the stack size dynamically in an array implementation?

• top == capacity - 1

• top == 0

• capacity > top

• stack isEmpty()

What is the order of operations in infix notation?

• Operators are between operands

• Operators come before operands

• Operators come after operands

• None of the above

Which function checks if a stack is empty?

• isFull()

• isEmpty()

• isempty()

• isStackEmpty()

What is the initial value of the top in an empty stack (array implementation)?

• 0

• -1

• Null

• Undefined

Which operation adds an element to the stack?

• pop()

• peek()

• push()

• insert()