See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
14 cards from this deck
First In, First Out (FIFO)
First In, First Out
Adds an item to the rear of the queue
Removes an item from the front of the queue
Returns item at front without removing it
Checks if the queue is empty
Queue
Using a linked list
Using a static array with fixed size
Rear wraps around to front when end of array is reached
Based on priority rather than arrival time
Enqueuing into a full queue (static implementation)
Dequeuing from an empty queue
Queue uses FIFO, Stack uses LIFO
Select your subjects, and get access to A+ resources today.