Data Structures Using C, 2nd Edition by Pearson

Stacks and Queues 185

{

*Front = (*Front + 1);

*val = pQ[*Front];

return 1;

}

}

void display ( struct proc pQ[], int Front, int Rear)

{

int i;

printf (“\n The contents of queue are:”);

i=Front;

while ( i != Rear)

{

i = i + 1;

printf (“(%s , %d) “, pQ[i].process, pQ[i].priority);

}

}

It may be noted that in order to keep it simple, the priority queue has been implemented as a linear

queue. A sample input is given below:

Enter the process number and its priority to be added P4 7

where ‘P4’ is the name of the process and ‘7’ is its priority.

4.3.4 The Deque

A deque is a queue that allows additions and deletio ...