w3resource

Python: Create a FIFO queue

Python heap queue algorithm: Exercise-28 with Solution

Write a Python program to create a FIFO queue.

Sample Solution:

Python Code:

import queue
q = queue.Queue()
#insert items at the end of the queue 
for x in range(4):
    q.put(str(x))
#remove items from the head of the queue 
while not q.empty():
    print(q.get(), end=" ")
print("\n")

Sample Output:

0 1 2 3 

Flowchart:

Python heap queue algorithm: Create a FIFO queue.

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to find whether a queue is empty or not.

Next: Write a Python program to create a LIFO queue.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://198.211.115.131/python-exercises/heap-queue-algorithm/python-heapq-exercise-28.php