anil sharmalovely professional university unit queues notes contents objectives introduction queue model array implementation array-based implementation pointer-based implementation applications of queues summary keywords self assessment review questions further readings objectives after studying this unityou will be able todescribe queue model know array implementation describe various applications of queues introduction the queue abstract data type is also widely used one with applications very common in real life an example comes from the operating system software where the scheduler picks up the next process to be executed on the system from queue data structure in this unitwe would study the various properties of queuestheir operations and implementation strategies queue model queue is list of elements in which insertions are made at one end-called the rear and deletions are made from the other end-called the front this meansin particularthat elements are removed from queue in the same order as that in which they were inserted into the queue thusa queue exhibits the fifo (first in first outproperty the following are the allowed operations on queue insert(qe)this inserts an element into the queue delete(qae ethis deletes an element from the queue and stores it into empty(qae true/falsethis checks whether queue is empty or not lovely professional university