4.1 Queue in Data Structure | Introduction to Queue | Data Structures
Tutorials
in this video we are going to talk about queues in data structure see
what is the data structure it is a way of storing and organizing the data
right we have discussed few data structures like arrays linked lists and
stacks. Q is a structure that is going to follow some restrictions on
insertion and deletion operation fine as well as that rule insertion and.
deletion would be performed from one end and that end is known as rear or
till right. In stab this insertion and deletion is not known as push and
pop fine so insertion or you can see NQ operation would be performed from
rear from here we can insert data in the cube and if you want to delete
data from the queue it means from the front we can DQ we can delete data
right so it is that is why it is no it is known as it will follow FIFO
principal love first-in first out. Q is a structure you can say that is
going to follow the FIFO rules that is first-in first-out right so now we
will see some operation that can be performed on a Q. Q and D Q n 2 means
inserting or adding a data in the q DQ ms deleting a data from the queue.
There is nothing in the queue when there is no queue so we will increase
front and rear both so front plus plus and rear plus plus also right so
now front is also pointing to here and at this point of time rear would
point to minus 1. Huggle implement this through that thing we will
discuss in next video so it means I can insert 5 element in this queue
right here. NQ 0 means from rerai I will know touch this front from rear
I 'm where only I can insert a year plus plus plus a year would be
pointing to here and here. NQ is between from front to rear that is here
to here this is what garbage value this is not a cure. The most common
application of this queue data structure is what it is used where you
want to you know serve the request on a single shared resource. When
friend becomes greater than we are then also it is empathy so we are
going to see how to write down these condition in next video.
queues are also used in real life scenario like you can take an example
of a new oil in customer care then sometimes they tell you to hold on for
a few minutes because their representative is not free so what they do
they use queues to put the people on hold right until their
representative are free. In next video basically we will discuss how to
implement queue using arrays and then using linked lists.
Tutorials
in this video we are going to talk about queues in data structure see
what is the data structure it is a way of storing and organizing the data
right we have discussed few data structures like arrays linked lists and
stacks. Q is a structure that is going to follow some restrictions on
insertion and deletion operation fine as well as that rule insertion and.
deletion would be performed from one end and that end is known as rear or
till right. In stab this insertion and deletion is not known as push and
pop fine so insertion or you can see NQ operation would be performed from
rear from here we can insert data in the cube and if you want to delete
data from the queue it means from the front we can DQ we can delete data
right so it is that is why it is no it is known as it will follow FIFO
principal love first-in first out. Q is a structure you can say that is
going to follow the FIFO rules that is first-in first-out right so now we
will see some operation that can be performed on a Q. Q and D Q n 2 means
inserting or adding a data in the q DQ ms deleting a data from the queue.
There is nothing in the queue when there is no queue so we will increase
front and rear both so front plus plus and rear plus plus also right so
now front is also pointing to here and at this point of time rear would
point to minus 1. Huggle implement this through that thing we will
discuss in next video so it means I can insert 5 element in this queue
right here. NQ 0 means from rerai I will know touch this front from rear
I 'm where only I can insert a year plus plus plus a year would be
pointing to here and here. NQ is between from front to rear that is here
to here this is what garbage value this is not a cure. The most common
application of this queue data structure is what it is used where you
want to you know serve the request on a single shared resource. When
friend becomes greater than we are then also it is empathy so we are
going to see how to write down these condition in next video.
queues are also used in real life scenario like you can take an example
of a new oil in customer care then sometimes they tell you to hold on for
a few minutes because their representative is not free so what they do
they use queues to put the people on hold right until their
representative are free. In next video basically we will discuss how to
implement queue using arrays and then using linked lists.
