Queue Data Structure – Algorithms

This is an explanation of the dynamic data structure known as a queue. It compares a linear queue implemented by means of a dynamic array with a linear queue implemented with a static array. It also includes an explanation of how a circular queue works, along with pseudocode for the enqueue and dequeue operations of a circular queue.

[ComputerScienceLessons]

If you were one of the 15 people who viewed the original version of this video you may have noticed an error which I have since corrected in this version. I suggested that the enqueue operation could check to see if a circular queue was full by checking to see if the front and rear pointers had the same value. If these pointers had the same value, it might be because the queue is full. However, the front and rear pointers would also have the same value if a queue had only one item in it, or indeed if the queue was empty. Therefore, the enqueue operation of a circular queue should check to see if the queue is full by comparing the variable that keeps count of the number of items with the capacity of the array (or whatever underlying data container it employs).

[nouru]

@Kevin Drumm, your the best CS instructor. Your doing a great job!! Keep it up

[muratcanoguzhan]

What happens to a waiting request when a queue is full?

[zubstarshaikh]

is circular queue a dynamic queue or linear?

[shockingvideos]

please paste the link of HashTables video in comment

[rebazomer]

idk why any one can not give meaning full explanation about queue
in queue data structure we only have two slot they called en queue for adding item and queue for delete item
fifo means first item entered must be that item deleted as in real world queue people will do
we have shift operation on items we en queue and
that is the most main operation can be code in coding

[kurama]

If you have Sir the time, please post a VB.Net implementation for this one. Big thanks! :)