Understanding Stacks and Queues

What is the primary operation of a stack?

• The primary operation of a stack is 'push' and 'pop'.

• insert and delete

• enqueue and dequeue

• add and remove

How do you add an element to a stack?

• Use the 'pop' operation to remove an element from a stack.

• Use the 'push' operation to add an element to a stack.

• Add an element by using the 'enqueue' operation.

• Insert an element at the bottom of the stack.

What is the term for removing an element from a stack?

• enqueue

• push

• dequeue

• pop

What is the last element added to a stack called?

• middle

• bottom

• base

• top

What is the primary operation of a queue?

• The primary operation of a queue is merging.

• The primary operation of a queue is enqueue and dequeue.

• The primary operation of a queue is sorting.

• The primary operation of a queue is searching.

How do you add an element to a queue?

• Insert the element in the middle of the queue.

• Add the element to the front of the queue.

• Use the enqueue operation to add an element to the back of the queue.

• Use the dequeue operation to remove an element from the queue.

What is the term for removing an element from a queue?

• stacking

• enqueueing

• removing

• dequeueing

What is the first element added to a queue called?

• Front

• Back

• Middle

• End

Explain the difference between stack and queue operations.

• Stacks use FIFO operations while queues use LIFO operations.

• Stacks use LIFO operations (push, pop) while queues use FIFO operations (enqueue, dequeue).

• Both stacks and queues use LIFO operations.

• Queues use push and pop operations while stacks use enqueue and dequeue operations.

In which data structure is the LIFO principle applied?

• Stack

• Linked List

• Array

• Queue