points to remember queue is fifo data structure in which the element that is inserted first is the first one to be taken out the elements in queue are added at one end called the rear and removed from the other end called the front in the computer ' memoryqueues can be implemented using both arrays and linked lists the storage requirement of linked representation of queue with elements is (nand the typical time requirement for operations is ( in circular queuethe first index comes after the last index multiple queues means to have more than one queue in the same array of sufficient size deque is list in which elements can be inserted or deleted at either end it is also known as headtail linked list because elements can be added to or removed from the front (heador back (tailhoweverno element can be added or deleted from the middle in the computer' memorya deque is implemented using either circular array or circular doubly linked list in an input restricted dequeinsertions can be done only at one endwhile deletions can be done from both the ends in an output restricted dequedeletions can be done only at one endwhile insertions can be done at both the ends priority queue is data structure in which each element is assigned priority the priority of the element will be used to determine the order in which the elements will be processed when priority queue is implemented using linked listthen every node of the list will have three parts(athe information or data part(bthe priority number of the elementand (cthe address of the next element exercises review questions what is priority queuegive its applications explain the concept of circular queuehow is it better than linear queue why do we use multiple queues draw the queue structure in each case when the following operations are performed on an empty queue (aadd abcdef (bdelete two letters (cadd (dadd (edelete four letters (fadd consider the queue given below which has front and rear now perform the following operations on the queue(aadd (bdelete two letters (cadd (dadd (edelete four letters (fadd consider the dequeue given below which has left and right now perform the following operations on the queue(aadd on the left (badd on the right (cadd on the right (ddelete two letters from left (eadd on the right (fadd on the left (gdelete two letters from right programming exercises write program to calculate the number of items in queue write program to create linear queue of values write program to create queue using arrays which permits insertion at both the ends write program to implement dequeue with the help of linked list write program to create queue which permits insertion at any vacant location at the rear end write program to create queue using arrays which permits deletion from both the ends write program to create queue using arrays which permits insertion and deletion at both the ends