CST211 - Data Structures: Queue (Array-Based)

Overview

Circular array-based queue implementation demonstrating FIFO (First-In-First-Out) behavior with efficient space utilization.

Course Information

• Course: CST211 - Data Structures
• Assignment: Assignment 7 - Queue Array
• Institution: Oregon Institute of Technology

Features

• FIFO queue operations
• Circular buffer implementation
• Efficient use of fixed-size array
• Front and rear pointer management
• Dynamic resizing when capacity reached

Technical Details

Queue Class

• Base Structure: Circular array with wrap-around
• Pointers: Front and rear indices for queue boundaries
• Efficiency: O(1) enqueue and dequeue operations

Key Operations

• Enqueue(T) - Add element to rear of queue
• Dequeue() - Remove and return front element
• Front() - View front element without removal
• isEmpty() / isFull() - Check queue state
• Size() - Get number of elements

Implementation Details

• Circular buffer prevents wasted space
• Modulo arithmetic for wraparound
• Resize strategy when capacity exceeded

Learning Objectives

• FIFO data structure implementation
• Circular buffer technique
• Array wraparound and modulo operations
• Space-efficient queue design

Technologies

• C++
• Visual Studio
• Circular buffer implementation