Queue Data Structure Review

This set of vocabulary flashcards covers the fundamental concepts, operations, types, and logic of the Queue data structure as described in the lecture notes.

Queue

A linear data structure that follows the FIFO (First In, First Out) principle.

FIFO

Stands for First In, First Out, the operational principle of a queue.

Enqueue()

A basic operation that adds an element at the REAR of the queue.

Dequeue()

A basic operation that removes an element at the FRONT of the queue.

First()

A function that returns the first element without removing it.

Size()

A function that returns the number of elements contained in the queue.

Is Empty()

A function that checks if the queue has no elements, returning TRUE if $Size == 0$.

Is Full()

A function that checks if the queue has reached its maximum capacity, returning TRUE if $Size == \text{Maximum Array Size}$.

Basic Queue

A type of queue that operates in one direction.

Circular Queue

A type of queue that connects the last position to the first, allowing for efficient memory usage and the reuse of freed space.

Deque (Double-Ended Queue)

A type of queue where elements can be inserted and removed from BOTH ends.

Enqueue Formula

The logic represented by $Rear = Rear + 1$ and $Size = Size + 1$.

Dequeue Formula

The logic represented by $Front = Front + 1$ and $Size = Size - 1$.

EMPTY Condition

A state that occurs if $Size = 0$.

FULL (Condition)

A state that occurs if $Size = \text{Maximum Array Size}$.