Stacks and Queues: Selecting the Ideal Data Structure
[Misafirler Kayıt Olmadan Link Göremezler Lütfen Kayıt İçin Tıklayın ! ]
MP4 | Video: h264, 1920x1080 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English | Duration: 10 Lessons (40m) | Size: 77.7 MB
There are a variety of ways for storing and managing data in your program and the choice of the right data structure has an effect on the readability of your code, ease of writing, and performance. Python has a wide selection of built-in mechanisms that meet most of your data structure needs. This course introduces you to three types of data structures: stacks, queues, and priority queues.
There are multiple types and classes for all of these data structures and this course discusses them and provides information on how to choose the right one.
In this course you'll learn about:
How stacks are defined with Last-In/First-Out (LIFO) semantics
How to use the collections.deque object
How concurrency will affect your choice
What are priority queues
Which data structure methods are thread safe
How to decide between all of implementations of these data structures
The course is the third part of an ongoing series, exploring how to find the right Data Structure for your projects. The first course is Dictionaries and Arrays: Selecting the Ideal Data Structure and the second course is Records and Sets: Selecting the Ideal Data Structure.
Kod:
rapidgator_net:
https://rapidgator.net/file/acb3737c7223bda381cf31c4b691965e/hswzk.Stacks.and.Queues.Selecting.the.Ideal.Data.Structure.rar.html
nitroflare_com:
https://nitroflare.com/view/B81C7E041C4D4E1/hswzk.Stacks.and.Queues.Selecting.the.Ideal.Data.Structure.rar
Links are Interchangeable - No Password - Single Extraction
