Understanding Stacks and Queues (revisiting)

What data structure is described as last in, first out (LIFO)?

• Stack

• Queue

• Linked List

• Array

What operation adds an item to the top of a stack?

• Pop

• Enqueue

• Push

• Dequeue

What happens when you try to pop an item from an empty stack?

• Stack Underflow

• Queue Overflow

• Stack Overflow

• Queue Underflow

Which of the following is NOT a use case for stacks?

• Process scheduling

• Performing depth-first searches

• Tracking program execution

• Evaluating mathematical expressions

What is it called when a new item is added to a full queue?

• Stack Underflow

• Queue Underflow

• Queue Overflow

• Stack Overflow

Which data structure operates on a first in, first out (FIFO) basis?

• Stack

• Queue

• Array

• Tree

What is the term for viewing the top item of a stack without removing it?

• Popping

• Pushing

• Peeking

• Peering

Which of the following is a potential problem when implementing a queue using an array?

• Stack Overflow

• Infinite looping

• Queue Overflow

• Running out of space

What is a circular queue?

• A queue implemented using a linked list

• A queue that can expand infinitely

• A queue where items can be added in the middle

• A queue that wraps around to the beginning when it reaches the end

What is a priority queue?

• A queue where elements are processed alphabetically

• A queue where elements are processed based on their priority

• A queue that can only hold a fixed number of items

• A queue implemented using stacks