Question 2 The following is an interrace for a class PriorityQueue: class PriorityQueue { } /* attributes */ int currentSize; // stores current number of elements in PQ FlightNode [] array; // array to store flight nodes, implements PQ int DEFAULT CAPACITY=2>>10; // maximum heap size /* methods */ void clear(); Boolean isEmpty(); Boolean add (FlightNode x); FlightNode remove (); void percolate Down (int hole); Create a class PriorityQueue and write code for the following 2.1 Encapsulate/hide each attribute by adding an appropriate modifier to its definition. 2.2 A default constructor 2.3 A loaded constructor 2.4 Accessor methods for each attribute 2.5 Mutator methods for each attribute 2.6 A method void clear () which empties the heap and resets the current Size attribute 2.7 A method Boolean isEmpty() which returns a Boolean value indicating whether the heap contains elements 2.8 A method Boolean add (FlightNode x) which adds a new element, x, of type FlightNode, to the heap in its correct position. This method should make use of a "percolate up" strategy. The return value indicates whether the element was added successfully. 2.9 A method FlightNode remove () which removes the element at the top of the heap and returns the element that was removed. This method should invoke percolate Down (int hole) to be defined in 2.10. 2.10 A method percolate Down (int hole) which restores the heap property after deletion by moving the hole to the outermost level of the heap.
Question 2 The following is an interrace for a class PriorityQueue: class PriorityQueue { } /* attributes */ int currentSize; // stores current number of elements in PQ FlightNode [] array; // array to store flight nodes, implements PQ int DEFAULT CAPACITY=2>>10; // maximum heap size /* methods */ void clear(); Boolean isEmpty(); Boolean add (FlightNode x); FlightNode remove (); void percolate Down (int hole); Create a class PriorityQueue and write code for the following 2.1 Encapsulate/hide each attribute by adding an appropriate modifier to its definition. 2.2 A default constructor 2.3 A loaded constructor 2.4 Accessor methods for each attribute 2.5 Mutator methods for each attribute 2.6 A method void clear () which empties the heap and resets the current Size attribute 2.7 A method Boolean isEmpty() which returns a Boolean value indicating whether the heap contains elements 2.8 A method Boolean add (FlightNode x) which adds a new element, x, of type FlightNode, to the heap in its correct position. This method should make use of a "percolate up" strategy. The return value indicates whether the element was added successfully. 2.9 A method FlightNode remove () which removes the element at the top of the heap and returns the element that was removed. This method should invoke percolate Down (int hole) to be defined in 2.10. 2.10 A method percolate Down (int hole) which restores the heap property after deletion by moving the hole to the outermost level of the heap.
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
Related questions
Question
Please write the code in Java
![Question 2
The following is an interrace for a class PriorityQueue:
class PriorityQueue.
{
}
/* attributes */
int currentSize; // stores current number of elements in PQ
FlightNode [] array; // array to store flight nodes, implements PQ
int DEFAULT_CAPACITY=2>>10; // maximum heap size
/* methods */
void clear();
Boolean isEmpty();
Boolean add (FlightNode x);
FlightNode remove ();
void percolate Down (int hole);
Create a class PriorityQueue and write code for the following
2.1 Encapsulate/hide each attribute by adding an appropriate modifier to its definition
2.2 A default constructor
2.3 A loaded constructor
2.4 Accessor methods for each attribute
2.5 Mutator methods for each attribute
2.6 A method void clear () which empties the heap and resets the current Size attribute
2.7 A method Boolean isEmpty () which returns a Boolean value indicating whether the
heap contains elements
2.8 A method Boolean add (FlightNode x) which adds a new element, x, of type
FlightNode, to the heap in its correct position. This method should make use of a
"percolate up" strategy. The return value indicates whether the element was added
successfully.
2.9 A method FlightNode remove () which removes the element at the top of the heap and
returns the element that was removed. This method should invoke percolate Down (int.
hole) to be defined in 2.10.
2.10 A method percolate Down (int hole) which restores the heap property after
deletion by moving the hole to the outermost level of the heap.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd096848c-806f-423f-824a-70f6a412600a%2F1781e4a7-43db-457e-8a92-24af8d59bd61%2F9u14nrh_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Question 2
The following is an interrace for a class PriorityQueue:
class PriorityQueue.
{
}
/* attributes */
int currentSize; // stores current number of elements in PQ
FlightNode [] array; // array to store flight nodes, implements PQ
int DEFAULT_CAPACITY=2>>10; // maximum heap size
/* methods */
void clear();
Boolean isEmpty();
Boolean add (FlightNode x);
FlightNode remove ();
void percolate Down (int hole);
Create a class PriorityQueue and write code for the following
2.1 Encapsulate/hide each attribute by adding an appropriate modifier to its definition
2.2 A default constructor
2.3 A loaded constructor
2.4 Accessor methods for each attribute
2.5 Mutator methods for each attribute
2.6 A method void clear () which empties the heap and resets the current Size attribute
2.7 A method Boolean isEmpty () which returns a Boolean value indicating whether the
heap contains elements
2.8 A method Boolean add (FlightNode x) which adds a new element, x, of type
FlightNode, to the heap in its correct position. This method should make use of a
"percolate up" strategy. The return value indicates whether the element was added
successfully.
2.9 A method FlightNode remove () which removes the element at the top of the heap and
returns the element that was removed. This method should invoke percolate Down (int.
hole) to be defined in 2.10.
2.10 A method percolate Down (int hole) which restores the heap property after
deletion by moving the hole to the outermost level of the heap.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education