Queue is used when things don’t have to be processed immediately, but have to be processed in First In First Out order like Breadth First Search. This property of Queue makes it also useful in following kind of scenarios.
1) When a resource is shared among multiple consumers. Examples include CPU scheduling, Disk Scheduling.
2) When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes. Examples include IO Buffers, pipes, file IO, etc.
See this for more detailed applications of Queue and Stack.
- Applications of Priority Queue
- Difference between Stack and Queue Data Structures
- Stack and Queue in Python using queue Module
- Check if a queue can be sorted into another queue using a stack
- Reversing a Queue using another Queue
- Deque | Set 1 (Introduction and Applications)
- Reversing a Queue
- Queue in Python
- Queue using Stacks
- Queue Interface In Java
- Sharing a queue among three threads
- Priority Queue | Set 1 (Introduction)
- Sort the Queue using Recursion
- Reverse a path in BST using queue
- Priority Queue in Python