JAVA Create a class Book with the following attributes BooKname, BookPublisher, BookYearofPublished 5.1 Now create the collection of book objects using treeset and do the following operations • Sort by bookname • Reverse sort by bookyearofpublished 5.2 Now create the collection of book objects using LinkedHashSet and do the following operation • sort by bookpublisher

JAVA Create a class Book with the following attributes BooKname, BookPublisher, BookYearofPublished 5.1 Now create the collection of book objects using treeset and do the following operations • Sort by bookname • Reverse sort by bookyearofpublished 5.2 Now create the collection of book objects using LinkedHashSet and do the following operation • sort by bookpublisher

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

Computer Science Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
Design and implement a Java class named Book with two data members: title and price. The class should have suitable constructors, get/set methods, and the toString method. Design and implement another Java class named BookShelf which has an ArrayList data member named bookList to store books. The class should have suitable constructors, get/set methods, and the toString method, as well as methods for people to add a book (prototype: addBook(Book book)), remove a book (prototype: removeBook(Book book)), and search for a book (prototype: findBook(Book book)). Test the two classes by creating a Bookshelf object and five Book objects. Add the books to the bookshelf. Display the contents of the bookshelf. Test the removeBook and findBook methods as well. Take screenshots of your tests and submit them with your Java code (not the whole project)
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.
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.
java Create a Storage<T> abstract class. The class has abstract methods void print() which prints the object of the storage. The class has a non-abstract method add(T element) which adds the not-null element in the storage if the element is not already present. Create a class MyStorage which is a subclass of Storage.
MyFileReaderTest.java import static org.junit.Assert.assertEquals; import java.util.ArrayList; import org.junit.jupiter.api.BeforeEach; import org.junit.jupiter.api.Test; public class MyFileReaderTest { MyFileReader myFileReader1; MyFileReader myFileReader2; MyFileReader myFileReader3; MyFileReader myFileReader4; MyFileReader myFileReader5; @BeforeEach void setUp () { this.myFileReader1 =new MyFileReader("info.txt"); // original info.txt file this.myFileReader2 =new MyFileReader("test2.txt"); // file with multiple words per line this.myFileReader3 =new MyFileReader("test3.txt"); // similar to info.txt file but with leading and trailing whitespace this.myFileReader4 =new MyFileReader("test4.txt"); // similar to info.txt file but with different info this.myFileReader5 =new MyFileReader("test5.txt"); // similar to info.txt file but with blank lines in between lines with information } @Test publicvoid testGetCleanContent(MyFileReader myFileReader2, final MyFileReader…
Given the graph, please write a java class named Graph.java that: - Inserts a NumberFormat class - Includes an adjacency matrix to represent the graph - Has a constructor that takes a String array of city names as a parameter. - Given two endpoints and the weight of the edge, you will add the edge to the graph. - Build the MST from vertex 0. - Ensure that you utilize prims properly. - Include an overloaded addEdge method and overloaded prims method.
Java - Encapsulation Create a class Point with attributes x and y which are both integers. Create getters and setters for these attributes and implement the following methods: 1. calculateDistance() - calculates the distance from the origin to the point. Returns a double, formula is sqrt(x^2 + y^2) 2. printCoordinates() - prints "(x,y)" Ask for user inputs for x and y. Use the methods printCoordinates() and calculateDistance() respectively. Inputs 1. X 2. Y Sample Output Enter x: 20 Enter y: 15 (20,15) 25.00
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
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…
MultiPerceptron.java: Implement the MultiPerceptron constructor, MultiPerceptron(int m,int n), and the methods, int numberOfClasses() and int numberOfInputs(). a. Test: In the main() method, instantiate a few MultiPerceptron objects and print the number of classes and inputs for each object. 2. Implement the String toString() method. a. Test: In the main() method, print the various MultiPerceptron objects. What should the output be for a newly instantiated MultiPerceptron object? 3. Implement the int predictMulti(double[] x) method. 4. Implement the void trainMulti(double[] x, int label) method.
VariableReferenceNode.java, OperationNode.java, ConstantNode.java, and PatternNode.java must have their own java classes with the correct methods implemented: OperationNode: Has enum, left and Optional right members, good constructors and ToString is good VariableReferenceNode: Has name and Optional index, good constructors and ToString is good Constant & Node Pattern: Have name, good constructor and ToString is good Make sure to include the screenshot of the output of Parser.java as well.