Circular Queue Using Array in Java

This repository contains a complete implementation of a Circular Queue in Java using an array. The implementation demonstrates how to efficiently reuse memory using wraparound logic with modulo arithmetic.

🚀 Features

• enqueue(int data) – Insert element at the rear
• deQueue() – Remove element from the front
• isEmpty() – Check if the queue is empty
• isFull() – Check if the queue is full
• print() – Print all elements in the correct order

💡 Learning Focus

This project is part of my DSA (Data Structures & Algorithms) practice. It helped reinforce:

• Modular indexing in circular data structures
• Front and rear pointer management
• Handling edge cases (e.g., full and empty states)
• Avoiding memory waste in fixed-size queues

📂 File Structure

• circularQueue – Class with all operations
• main() – Test logic and sample usage inside the class for simplicity

🛠️ Built With

• Java
• IDE: IntelliJ IDEA

👩‍💻 Author

Noor Fatima
BS Artificial Intelligence Student
GitHub: https://github.com/noor05-creator