IB CS Chapter 5

Which principle does a stack follow?

• FIFO
• LIFO
• Random
• Priority

Which operation adds an element to the top of a stack?

• Push
• Pop
• Peek
• Insert

Which operation removes the top element of a stack?

• Push
• Pop
• Peek
• Delete

What does the 'peek' operation do in a stack?

• Removes top
• Shows top element
• Adds to stack
• Clears stack

Which is NOT a stack application?

• Undo in text editor
• Function call management
• Breadth-first search
• Expression evaluation

When a stack is empty, which condition occurs?

• Underflow
• Overflow
• Deadlock
• Crash

Which principle does a queue follow?

• FIFO
• LIFO
• Random
• Circular

Which operation removes the front element of a queue?

• Dequeue
• Enqueue
• Insert
• Push

Which type of queue allows insertion at rear and deletion at front?

• Circular Queue
• Simple Queue
• Priority Queue
• Double-ended Queue

Which is NOT a queue application?

• Print spooling
• Job scheduling
• Undo function
• Breadth-first search