C Program for Simple DSC order Priority QUEUE Implementation

C Program for Simple DSC order Priority QUEUE Implementation.
Source: Dr. G T Raju, Professor & Head, Dept. of CSE, RNSIT

```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 #define SIZE 5 /* Size of Queue */ int PQ[SIZE],f=0,r=-1; /* Global declarations */   PQinsert(int elem) { int i; /* Function for Insert operation */ if( Qfull()) printf("\n\n Overflow!!!!\n\n"); else { i=r; ++r; while(PQ[i] <= elem && i >= 0) /* Find location for new elem */ { PQ[i+1]=PQ[i]; i--; } PQ[i+1]=elem; } }   int PQdelete() { /* Function for Delete operation */ int elem; if(Qempty()){ printf("\n\nUnderflow!!!!\n\n"); return(-1); } else { elem=PQ[f]; f=f+1; return(elem); } }   int Qfull() { /* Function to Check Queue Full */ if(r==SIZE-1) return 1; return 0; }   int Qempty() { /* Function to Check Queue Empty */ if(f > r) return 1; return 0; }   display() { /* Function to display status of Queue */ int i; if(Qempty()) printf(" \n Empty Queue\n"); else { printf("Front->"); for(i=f;i<=r;i++) printf("%d ",PQ[i]); printf("<-Rear"); } }   main() { /* Main Program */ int opn,elem; do { clrscr(); printf("\n ### Priority Queue Operations(DSC order) ### \n\n"); printf("\n Press 1-Insert, 2-Delete,3-Display,4-Exit\n"); printf("\n Your option ? "); scanf("%d",&opn); switch(opn) { case 1: printf("\n\nRead the element to be Inserted ?"); scanf("%d",&elem); PQinsert(elem); break; case 2: elem=PQdelete(); if( elem != -1) printf("\n\nDeleted Element is %d \n",elem); break; case 3: printf("\n\nStatus of Queue\n\n"); display(); break; case 4: printf("\n\n Terminating \n\n"); break; default: printf("\n\nInvalid Option !!! Try Again !! \n\n"); break; } printf("\n\n\n\n Press a Key to Continue . . . "); getch(); }while(opn != 4); }```