Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure. Example: Before method call: front rear q1: 14 25 50 70 35 45 19 10 21 q2: empty   After method call: front rear q1: 14 25 50 70 35 45 19 10 21 q2: 50 70 45 25 35 19 21   It will return 7 as 7 elements are added from q1 to q2.   Method heading: public class VaccinationQueue { public static int prioritizeQueue(ArrayQueue q1, ArrayQueue q2) {

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2.

Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure.

Example:

Before method call:

front rear

q1: 14 25 50 70 35 45 19 10 21

q2: empty

 

After method call:

front rear

q1: 14 25 50 70 35 45 19 10 21

q2: 50 70 45 25 35 19 21

 

It will return 7 as 7 elements are added from q1 to q2.

 

Method heading:

public class VaccinationQueue

{

public static int prioritizeQueue(ArrayQueue<Integer> q1,

ArrayQueue<Integer> q2)

{

Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called
VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that
initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front)
q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to
18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements
added to q2.
Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not
allowed to use arrays or any other data structure.
Example:
Before method call:
front
rear
q1: 14 25 50 70 35 45 19 10 21
q2: empty
After method call:
front
rear
q1: 14 25 50 70 35 45 19 10 21
q2: 50 70 45 25 35 19 21
It will return 7 as 7 elements are added from q1 to q2.
Method heading
public class VaccinationQueue
public static int prioritizeQueue (ArrayQueue<Integer> q1,
ArrayQueue<Integer> q2)
{
Use the editor to formot your answer
Transcribed Image Text:Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure. Example: Before method call: front rear q1: 14 25 50 70 35 45 19 10 21 q2: empty After method call: front rear q1: 14 25 50 70 35 45 19 10 21 q2: 50 70 45 25 35 19 21 It will return 7 as 7 elements are added from q1 to q2. Method heading public class VaccinationQueue public static int prioritizeQueue (ArrayQueue<Integer> q1, ArrayQueue<Integer> q2) { Use the editor to formot your answer
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY