notes summary 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 queue exhibits the fifo (first in first outproperty to represent queue we require one-dimensional array of some maximum size say to hold the data items and two other variables front and rear to point to the beginning and the end of the queue as in stacksa queue could be implemented using linked list one major application of the queue data structure is in the computer simulation of real-world situation queues are also used in many ways by the operating systemthe program that schedules and allocates the resources of computer system each device has its own queue of requests to printread or write to these devices priority queue is collection of elements such that each element has been assigned priority an element of higher priority is processed before any element of lower priority two elements with the same priority are processed according to the order in which they were inserted into the queue keywords fifo(first in first outthe property of linear data structure which ensures that the element retrieved from it is the first element that went into it frontthe end of queue from where elements are retrieved queuea linear data structure in which the element is inserted at one end while retrieved from another end rearthe end of queue where new elements are inserted self assessment choose the appropriate answer priority queue is (acollection of elements such that each element has been assigned priority (bcollection of / devices (ccollection of fifo (dnone of the above every insertion implies that the rear of the queue increases by except when rear (an- (bn- (cn- (dn- fill in the blanks during the initialization of queue qits front and rear are made to lovely professional university