Lesson 5: Queues

Question 1

ordered collection of items from which items may be deleted at one end (front) and into which items may be inserted at the other end (rear)

Answer 1

Queue

Question 2

Is Queue LIFO (last-in, first-out) or FIFO (first-in, first-out)?

Answer 2

FIFO

Question 3

Queue Operation (clue: EDFR)

Answer 3

Enqueue
Dequeue
Queue FRONT
Queue REAR

Question 4

[Queue Operation] inserts an element at the rear of the queue

Answer 4

Enqueue

Question 5

[Queue Operation] If there’s not enough room for another element in the queue, the queue is in an __________ state.

Answer 5

Overflow

Question 6

[Queue Operation] deletes an element at the front of the queue

Answer 6

Dequeue

Question 7

[Queue Operation] If there are no data in the queue when a dequeue is attempted, the queue is in an __________ state

Answer 7

Underflow

Question 8

[Queue Operation] examines the element at the front of the queue

Answer 8

Queue front

Question 9

[Queue Operation] If there are no data in the queue, then the queue is in an __________ state.

Answer 9

Underflow

Question 10

[Queue Operation] examines the element at the rear of the queue

Answer 10

Queue rear

Question 11

Implementations of Queues (clue: CIDREFCD)

Answer 11

Create queue
Insert data into queue
Delete data from queue
Retrieve data at front of queue
Queue EMPTY
Full queue
Queue COUNT
Destroy queue