Provide a Java class named SortedPriorityQueue that implements a priority queue  using a Java array of type int. The constructor of the class should be passed the size of  the queue. Each time the add method is called, the value passed to it should be inserted  into the array to ensure that the array remains in sorted order. If the array is full when add is called, a RuntimeException should be thrown. If the array is empty when remove is  called, a RuntimeException should also be thrown Make the implementation as efficient  as possible.

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
icon
Related questions
Question

Provide a Java class named SortedPriorityQueue that implements a priority queue 
using a Java array of type int. The constructor of the class should be passed the size of 
the queue. Each time the add method is called, the value passed to it should be inserted 
into the array to ensure that the array remains in sorted order. If the array is full when add
is called, a RuntimeException should be thrown. If the array is empty when remove is 
called, a RuntimeException should also be thrown Make the implementation as efficient 
as possible.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Consider the following sorting algorithm that uses the class you wrote in the previous problem:

 

void sort(int[] array) {

SortedPriorityQueue queue = new SortedPriorityQueue(100);               for (int i = 0; i < array.length; i++)

queue.add(array[i]);

for (int i = 0; i < array.length; i++)

array[i] = queue.remove();

}

Analyze its execution time efficiency in the worst case. In your analysis you may ignore the possibility that the array may overflow. Indicate whether this implementation is more or less efficient than the one that uses the Java priority queue.

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Arrays
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education