Implement a priority queue capable of holding objects of an arbitrary type, T, by defining a PriorityQueue class that implements the queue with an ArrayList.A priority queue is a type of list where every item added to the queue also has an associated priority. Define priority in your application so that those items with the largest numerical value have the highest priority. Your class should support the following methods: . add (item, priority) –Adds a new item to the queue with the associated priority. remove () –Returns the item with the highest priority and removes it from the queue. If the user attempts to remove from an empty queue, return null. · tostring()-Returns a String representation of the priority queue. For example, if q is a priority queue defined to take strings q.add ("X", 10); q.add ("Y", 1); q.add ("Z", 3); System.out.println(q); // prints [ ["X",10], ["Y,1], ["Z",3] ] System.out.println(q.remove ()); // Returns X System.out.println (q.remove ()); // Returns Z System.out.println(q.remove ()) ; // Returns Y

Implement a priority queue capable of holding objects of an arbitrary type, T, by defining a PriorityQueue class that implements the queue with an ArrayList.A priority queue is a type of list where every item added to the queue also has an associated priority. Define priority in your application so that those items with the largest numerical value have the highest priority. Your class should support the following methods: . add (item, priority) –Adds a new item to the queue with the associated priority. remove () –Returns the item with the highest priority and removes it from the queue. If the user attempts to remove from an empty queue, return null. · tostring()-Returns a String representation of the priority queue. For example, if q is a priority queue defined to take strings q.add ("X", 10); q.add ("Y", 1); q.add ("Z", 3); System.out.println(q); // prints [ ["X",10], ["Y,1], ["Z",3] ] System.out.println(q.remove ()); // Returns X System.out.println (q.remove ()); // Returns Z System.out.println(q.remove ()) ; // Returns Y

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Exercise 2. Create a Book class where: Each book contains the following information: book title book Author name, barcode (as fong integers), and book topic. o Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: o Create diffcrent book objects (at least 5 hooks) and store them in a LinkedList sorted by book barcode value Generate a unique random integer value for the barcode. Iterate through the LinkedList and print out the books' details O Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order.
Exercise 2: Create a Book class; where: lo Each book contains the following information: book title, book Author name, barcode (as long integers) and book topic. 6 Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: lo Create different book objects (at least 5 books) and store them in a LinkedList sorted by book barcode value. Generate a unique random integer value for the barcode. O Iterate through the LinkedList and print out the books' details o Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order
Computer Science create a method +addToList(o:E):void that adds the object (o) to the ArrayList referenced by the instance variable list. create a method +removeFromBackOfList():E that removes the object at the back of the ArrayList and returns it.
In java A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the store keeps an ArrayList.Create a class customer having id, name, gender, and bill provide appropriate getters/setters and constructors also provide toString method.In the Store class, make an ArrayList of customers, store name, and address implement methods public void addSale(Customer c) that will add customers to the arraylist.public void RemoveCustomer(int id);public void UpdateCustomerRecord(int Id);public displayAll();public String nameOfBestCustomer() to record the sale and return the name of the customer with the largest sale. public ArrayList nameOfBestCustomers(int topN) so that it displays the top customers, that is, the topN customers with the largest sales, where topN is a value that the user of the program supplies. Write a program that prompts following menu and ============================================…
Question 11 Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run: front rear "this" queue: 10 29 2 25 10 Item1: 100 After run: front rear "this" queue: 100 29 100 100 5 100 Use the editor to format your answer
Java Program Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly
Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.
A Maze Room : In this lab, we will make a maze game. The maze is based on Linked Lists. Instead of having one possible direction (next), we will have 4 possible directions. Rooms: Use the below code as a basis to build your own room class. Implement this class in the file room.py A room will be the basic object for our maze game. A room can have 4 doors (pertaining to north, south, east, and west). Attached to each these directions we have either another room or None (we could also imagine that the None doors are just walls). We want the player to be able to tell what room they are in. Each room will have a unique description. When the player enters a room, the program will describe the room. This way the player will know if they went back to a room that have already been to. You MAY NOT change the method's arguments/names in ANY way. class Room():def __init__(self, descr):#Description of the room to print out#These should be unique so the player knows where they areself.descr =…
Java Program, Dont Copy Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly
import java.util.ArrayList; /** * This class describes a user of Twitter. A user has a user ID * (e.g. @testudo), a list of tweets, a count of the number of followers, * and a list of users that this user follows. Unlike P5, * there is no upper limit on the number of tweets or users to follow. * * You may NOT import any library class other than java.util.ArrayList. * You may NOT add any instance variables to keep a count of the number * of tweets or users being followed. You may add instance variables * for other purposes as long as they are private. */public class TwitterUser { private String userID; private int followers; private ArrayList<Tweet> listTweets; private ArrayList<TwitterUser> toFollow; /** * A constructor that takes the user's ID. If the ID is null, or * longer than 32 characters, or it does not start with "@", * throw an IllegalArgumentException. * * All other instance variables should be initialized…
Create a class “Node” which is a single node of a singly linked list. The node stores an integer datatype. The class has two data members, an integer and pointer to the same Node class.Implement the following methods:1. The default constructor: Set value of the data member to zero2. A parameterized constructor: Node(int a); takes an integer variable and assigns it to the data member of this object. Set next pointer to NULL.3. Node* GetNextPointer() const; Retun next pointer of this Node4. void SetNextPointer(Node *ptr); Set the next pointer of this node to the ptr that is passed to the function.5. void SetData(int a); Set data of this node equal to ‘a’6. int GetData() const; returns the data of this object.The data member are private whereas the methods are public. part 4 5 and 6 In c++.
Suppose that a list contains Comparable objects. Implement a method that returns a new list of items that are less than some given item. The header of the method could be as follows: public LListgetAllLess Than( Comparable anObject) Write an implementation of this method for the class LList. Make sure that your method does not affect the state of the original list.