https://github.com/idriskulubi/queue-data-structure-in-java

https://github.com/idriskulubi/queue-data-structure-in-java

Last synced: 9 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/idriskulubi/queue-data-structure-in-java
• Owner: IdrisKulubi
• Created: 2024-02-03T20:59:41.000Z (about 1 year ago)
• Default Branch: master
• Last Pushed: 2024-02-07T11:03:13.000Z (almost 1 year ago)
• Last Synced: 2025-01-12T06:22:07.651Z (26 days ago)
• Language: Java
• Size: 1.95 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Queue Data Structure 

===============================

I was practising  data structures and algorithms in java. I came across a problem where I had to implement the queue

## THIS IS MY UNDERSTANDING ON  QUEUES DATA STRUCTURE:

===============================

A queue is a linear data structure that follows the First-In, First-Out (FIFO) 

principle. This means that the element added first will be removed first. In other words,

the oldest element in the queue is always served or returned first. The operations on this

data structure are:

1. **Enqueue** - Add an element to the end of the queue. If the

queue is full, then it should throw an exception.

2. **Dequeue** - Remove and return the front element from the queue. If the

queue is empty, then it should throw an exception.

3. **IsEmpty** - Return true if the queue is empty, otherwise false.

4. **IsFull** - Return true if the queue is full, otherwise false.

5. **Peek** - Return the value of the front element without removing it. If the

queue is empty, then it should throw an exception.

6. **Size** - Return the number of elements currently present in the queue.

7. **PrintQueue** – Print all the elements present in the queue separated by commas.

8. Implement the code for the above methods using appropriate data structures.

You can use any programming language you prefer.💻

## Note:

You can use an array or linked list to implement the queue.

Make sure to handle exceptions appropriately.

Test your implementation with different test cases.

Have fun coding! 🚀