Question: Implement a priority queue. Your queue needs to support adding new elements, return the element with the highest priority and removing the element with the

Implement a priority queue. Your queue needs to support adding new elements, return the element with the highest priority and removing the element with the highest priority. Adding an element and removing the element with the highest element should be at most O(log(N)) where N is the size of the queue. Your queue also needs to be able to hold Student objects. A student has a name, student id, email address, a GPA and number of units taken. GPAs are between 0.0 and 4.0. Units taken are between 0 and 150. A students priority is determined 70% by the number of units taken and 30% by their GPA . You need to be able to print out the elements in the queue in priority order. Print out the student id and name of the student.

*** Do not use any existing priority queue library.

*** Use Java

Edited: Probably using binary heap ?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

(C++: Heap Implementation) In class, we covered the algorithms for an array-based heap implementation, paying attention only to the keys in the heap. To use a heap to implement a priority queue, you...

4 Your Task Download the archive assignment4code.tar.gz from the course website. This archive contains a number of classes which you will have to implement. The comments in the code describe how each...

In JAVA, please code the following non-preemptive priority scheduler. 3 java classes and 1 interface is provided after the information below, ONLY singlecorescheduler.java and heap.java WILL BE...

In JAVA, please code the following non-preemptive priority scheduler. 3 java classes and 1 interface is provided after the information below, ONLY singlecorescheduler.java WILL BE MODIFIED. CPU...

In JAVA Implement the Priority Queue ADT using an Unsorted Array. an Unsorted Linked List. a Sorted Linked List (sort in decreasing order). our Binary Search Tree (wrap the tree inside your priority...

In Java a common collection class is the ArrayList, which is a list structure implemented using arrays. Arrays are a natural choice because lists require preserving insertion order of the elements,...

What are the basic differences between a merger, a consolidation, and a share exchange?

a) Air at 70(oF) and 1(atm) is cooled at the rate of 100,000(fit)3 (hr)-3 to 20(oF) by refrigeration. For a surroundings temperature of 70 (oF), what is the minimum power requirement in (hp)? (b) Air...

Question 1 4 ( 1 point ) Saved Because principal is dependent on mortgagees repaying their loans, guarantees can be given only on the interest portion of Mortgage - Backed Security ( MBS )...

QUESTION 15: REACTOR TECHNOLOGY (a) Typically a catalyst is composed of a support, an active material, and a promoter. Discuss the role and nature of each catalyst component and give practical...

Assume that the banking system has total reserves of $100 billion. Assume also that required reserves are 10 percent of checking deposits and that banks hold no excess reserves and households hold no...

As shown in Figure 3, the overall labor-force participation rate of men declined between 1970 and 2000. At the same time, the labor-force participation rate of women increased sharply. This overall...

The Bureau of Labor Statistics announced that in February 2008, of all adult Americans, 145,993,000 were employed, 7,381,000 were unemployed, and 79,436,000 were not in the labor force. Use this...