Subscribe
Tutorial search

C++ Queue Tutorials


Sort by:
ADTs: Stacks and Queues Part 1: Using Arrays
ADTs: Stacks and Queues Part 1: Using Arrays
Learn about and how to use ADTs: Stacks and Queues in C++.
Difficulty:
ADTs: Stacks and Queues Part 2: Using Lists
ADTs: Stacks and Queues Part 2: Using Lists
Learn about and how to use ADTs: Stacks and Queues for C++ Part 2.
Difficulty:
Sequental Lists The Queue and Stack Class With C#
Sequental Lists The Queue and Stack Class With C#
Sequential lists are collection of objects that can be entered or extracted in a sequential way. They don’t provide access to objects in the middle on the list. You can only access a specific object each time you extract it. The two classes named “Queue” and ”Stack” which belong to the “System.Collections” namespace provide you with this kind of functionality, each of them in a slightly different way. The Queue class offers you access to the first object on the list, whereas the Stack class offers you access to the last object on the list. By first and last we mean the first and last object that entered the list. So, the Queue class is a First-in, First-out collection(FIFO Collection) whereas the Stack class is a Last-in, First-out(LIFO Collection). In this tutorial you will create and use both classes to see how they behave when entering and extracting data. You will usually work with such collections with temporary and disposable data. For a more permanent use, arrays provide much better functionality.
Difficulty:
Search Term(s) (1): queue