Answered: In following code of priority queue…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

In following code of priority queue using array, I want a method that displays the array, make front and rear counters and a main method to check above two methods:

Code:

// insert an item at the rear of the queue
void enqueue(int item) {
// Check if the queue is full
if (n == MAX_SIZE - 1) {
printf("%s\n", "ERROR: Queue is full");
return;
}
queue[n++] = item;
}

// removes the item with the maximum priority
// search the maximum item in the array and replace it with
// the last item
int dequeue() {
int item;
// Check if the queue is empty
if (n == 0) {
printf("%s\n", "ERROR: Queue is empty");
return -999999;
}
int i, max = 0;
// find the maximum priority
for (i = 1; i < n; i++) {
if (queue[max] < queue[i]) {
max = i;
}
}
item = queue[max];

// replace the max with the last element
queue[max] = queue[n - 1];
n = n - 1;
return item;
}

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions