Applications of Queue Data Structure
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.
References:
http://introcs.cs.princeton.edu/43stack/
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- Queue using Stacks
- Find the largest multiple of 3 | Set 1 (Using Queue)
- Queue Interface In Java
- Implement a stack using single queue
- Circular Queue | Set 1 (Introduction and Array Implementation)
- Circular Queue | Set 2 (Circular Linked List Implementation)
- Queue - Linked List Implementation
- Queue | Set 1 (Introduction and Array Implementation)
- Priority Queue | Set 1 (Introduction)
- Deque | Set 1 (Introduction and Applications)
- Applications of Priority Queue
- Queue based approach for first non-repeating character in a stream
- Reversing the first K elements of a Queue
- Reversing a Queue
- Interleave the first half of the queue with second half
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Minimum number of operations required to set all elements of a binary matrix
- Different Types of Queues and its Applications
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Arrange the array such that upon performing given operations an increasing order is obtained