Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please help me with this Java question: Java Priority Queue. We are given a code to work with and please use Java 8 to answer

Please help me with this Java question: Java Priority Queue. We are given a code to work with and please use Java 8 to answer the question.

image text in transcribed

image text in transcribed

image text in transcribed

Here is a code we are given to work with.

import java.util.ArrayList;

import java.util.List;

import java.util.Scanner;

/*

* Create the Student and Priorities classes here.

*/

public class Solution {

private final static Scanner scan = new Scanner(System.in);

private final static Priorities priorities = new Priorities();

public static void main(String[] args) {

int totalEvents = Integer.parseInt(scan.nextLine());

List events = new ArrayList();

while (totalEvents-- != 0) {

String event = scan.nextLine();

events.add(event);

}

List students = priorities.getStudents(events);

if (students.isEmpty()) {

System.out.println("EMPTY");

} else {

for (Student st: students) {

System.out.println(st.getName());

}

}

}

}

In this problem we will test your knowledge on Java Priority Queue. There are a number of students in a school who wait to be served. Two types of events, ENTER and SERVED, can take place which are described below. - ENTER: A student with some priority enters the queue to be served. - SERVED: The student with the highest priority is served (removed) from the queue. A unique id is assigned to each student entering the queue. The queue serves the students based on the following criteria (priority criteria): 1. The student having the highest Cumulative Grade Point Average (CGPA) is served first. 2. Any students having the same CGPA will be served by name in ascending case-sensitive alphabetical order. 3. Any students having the same CGPA and name will be served in ascending order of the id. Create the following two classes: - The Student class should implement: - The constructor Student(int id, String name, double cgpa). - The method int getID() to return the id of the student. - The method String getName() to return the name of the student. - The method double getCGPA () to return the CGPA of the student. - The Priorities class should implement the method List getStudents (List events) to process all the given events and return all the students yet to be served in the priority order. Input Format The first line contains an integer, n, describing the total number of events. Each of the n subsequent lines will be of the following two forms: - ENTER name CGPA id: The student to be inserted into the priority queue. - SERVED: The highest priority student in the queue was served. The locked stub code in the editor reads the input and tests the correctness of the Student and Priorities classes implementation. Constraints - 2n1000 - 0CGPA4.00 - 1id105 - 2 name 30 Output Format The locked stub code prints the names of the students yet to be served in the priority order. If there are no such student, then the code prints EMPTY. Sample Input 0 12 ENTER John 3.7550 ENTER Mark 3.824 ENTER Shafaet 3.735 SERVED SERVED ENTER Samiha 3.8536 SERVED ENTER Ashley 3.942 ENTER Maria 3.646 ENTER Anik 3.9549 ENTER Dan 3.9550 SERVED In this case, the number of events is 12. Let the name of the queue be Q. - John is added to Q. So, it contains (John, 3.75, 50). - Mark is added to Q. So, it contains (John, 3.75, 50) and (Mark, 3.8, 24). - Shafaet is added to Q. So, it contains (John, 3.75, 50), (Mark, 3.8, 24), and (Shafaet, 3.7, 35). - Mark is served as he has the highest CGPA. So, Q contains (John, 3.75, 50) and (Shafaet, 3.7, 35). - John is served next as he has the highest CGPA. So, Q contains (Shafaet, 3.7, 35). - Samiha is added to Q. So, it contains (Shafaet, 3.7, 35) and (Samiha, 3.85, 36). - Samiha is served as she has the highest CGPA. So, Q contains (Shafaet, 3.7, 35). - Now, four more students are added to Q. So, it contains (Shafaet, 3.7, 35), (Ashley, 3.9, 42), (Maria, 3.6, 46), (Anik, 3.95, 49), and (Dan, 3.95, 50). - Anik is served because though both Anil and Dan have the highest CGPA but Anik comes first when sorted in alphabetic order. So, Q contains (Dan, 3.95, 50), (Ashley, 3.9, 42), (Shafaet, 3.7, 35), and (Maria, 3.6, 46). As all events are completed, the name of each of the remaining students is printed on a new line

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

DB2 Universal Database V7.1 Application Development Certification Guide

Authors: Steve Sanyal, David Martineau, Kevin Gashyna, Michael Kyprianou

1st Edition

0130913677, 978-0130913678

More Books

Students also viewed these Databases questions