CSF3013 QUIZ 3 (CHAPTER 3 STACK)

Why is a stack described as a LIFO structure?

• Elements are accessed randomly

• The last inserted element is removed first

• The first inserted element is removed first

• Elements are sorted automatically

Why are push and pop restricted to one end of the stack?

• To reduce memory usage

• To maintain stack order and control operations

• To simplify coding syntax

• To allow faster searching

What is the role of the “top” in a stack?

• It stores all elements

• It marks the first element inserted

• It indicates the current position for insertion and deletion

• It stores the bottom element

Why is stack suitable for recursion?

• It sorts recursive calls

• It stores function calls and restores them in reverse order

• It reduces memory usage

• It avoids function calls

Why is array implementation convenient for stacks?

• Arrays allow random insertion

• Arrays are sequential and match stack structure

• Arrays support multiple data types

• Arrays eliminate overflow

Given stack operations: Push(10), Push(20), Pop(), what is the output?

• 10

• 20

• Both 10 and 20

• No output

If top = -1, what happens when POP is executed?

• Stack overflow

• Stack underflow

• Element removed

• Top becomes 0

Given stack operations: Push(5), Push(8), Push(3), Pop(), Push(2), what is the top element?

• 5

• 8

• 3

• 2

Which situation BEST applies stack behavior?

• Queue at a ticket counter

• Undo operation in a text editor

• Sorting numbers

• Searching database

In postfix evaluation, what happens when an operator is encountered?

• Push operator into stack

• Ignore operator

• Pop operands, evaluate, and push result

• Clear the stack