Queues in Data Structures & Algorithms 🧩

Queue data structure is first in first out data structure also known as FIFO. It can be used at many places typically for a producer consumer type of architecture where one component is producing information and other components are consuming them. Queue allows us to implement loosely coupled architecture which has many benefits. I've explained that by using example of new york stock exchange sharing stock price information with yahoo finanace or google finance portals. We will also implement Queue using collections.deque in python. At the end we have an interesting exercise for you to solve.
Code in this tutorial: https://github.com/codebasics/data-structures-algorithms-python/tree/master/data_structures/6_Queue/6_queue.ipynb
Exercise: https://github.com/codebasics/data-structures-algorithms-python/tree/master/data_structures/6_Queue/6_queue_exercise.md

Topics
00:00 Stock price exchange without Queue
02:57 Stock price exchange using Queue
05:12 Queue classes in different programming languages
05:45 List as Queue in python
07:55 collections.deque as Queue
12:58 Exercise

#datastructures #algorithms #python

Do you want to learn technology from me? Check https://codebasics.io/ for my affordable video courses.

Next Video: https://www.youtube.com/watch?v=4r_XR9fUPhQ&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=9
Previous video: https://www.youtube.com/watch?v=zwb3GmNAtFk&list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12&index=7
Complete playlist:https://www.youtube.com/playlist?list=PLeo1K3hjS3uu_n_a__MI_KktGTLYopZ12

Website: https://codebasics.io/
Facebook: https://www.facebook.com/codebasicshub
Twitter: https://twitter.com/codebasicshub