Create Java Book objects using the following data and place them in a List. (Fields: Author, Title, Year, Price) Java Programming,Deitel,2016,68.75 Python Programming,Gaddis,2018,78.56 Data Analytics,Norman,2017,89.56 Block Chain Development,Wilson,2019,87.45 Web Development,Brown,2018,98.98 Create TWO List Comparators to sort the Book objects in ascending order: One by Book Title and the second by Book Year. Using each Comparator, SORT the List once by Title and again by Year. NOTE: You MUST use the Comparator to SORT. Cannot use any other built in sort methods. Output each SORTED List on Console in a format same as the data shown above (One Book per line, comma separated).

Create Java Book objects using the following data and place them in a List. (Fields: Author, Title, Year, Price) Java Programming,Deitel,2016,68.75 Python Programming,Gaddis,2018,78.56 Data Analytics,Norman,2017,89.56 Block Chain Development,Wilson,2019,87.45 Web Development,Brown,2018,98.98 Create TWO List Comparators to sort the Book objects in ascending order: One by Book Title and the second by Book Year. Using each Comparator, SORT the List once by Title and again by Year. NOTE: You MUST use the Comparator to SORT. Cannot use any other built in sort methods. Output each SORTED List on Console in a format same as the data shown above (One Book per line, comma separated).

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

Answer the given question with a proper explanation and step-by-step solution. Write in Java: Write a menu-driven program to illustrate the use of a linked list. The entries will only consist of integer number keys (values). The program should implement the following options in order: • Insert- insert a key into a list- not allowing duplicate integers. • Delete- delete a key from the list. • Search- finds or does not find a particular key in the list. • Print- prints the list graphically in horizontal form. If the list is empty output- "Nothing to print". • Size- count of all the keys in the list. • Sort- sorts the keys in the list in ascending order. • Reverse- reverses the order of the keys in the list • Rotate- moves the key at the front of the list to the end of the list. If the list has 0 or 1 elements it should have no effect on the list. • Shift- rearranges the keys of a list by moving to the end of the list all values that are in odd number positions (indexes) and otherwise…
Implement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.
java program: University of Bahrain College of Information Technology Department of Computer Science Second Semester, 2020-2021 ITCS214 / ITCS215 / ITCS216 (Data Structures) Assignment 3 Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search…
Answer the given question with a proper explanation and step-by-step solution. Java N people are arranged in a circle.(Each assigned a number in sequence). Starting from the first, countdown , removing each k-th person from the list, while closing the circle. Determine the number of the last one remaining in the circle (k<=N) Hint: to solve this problem, use a list in which the reference field of the last element contains a link to the first element
How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
Practical:1. Write a Java code to illustrate the concept of Set, List and deque. Generate the correct output.2. Give a suitable example of Generic Classes and generate correct output.3. Write a Java code to implement the concept of vector and stack. Generate the correct output.
Data Structure and algorithms ( in Java ) Please solve it urgent basis: Make a programe in Java and show output picture: Question 5: Write a program who take two link lists as parameter and merge them in 3rd list. L1: 2->4->6->8->10 L2: 1->3->5->7->9 List Merge(List L1, List L2); L3: 1->2->3->4->5->6->7->8->9->10
No handwritten answers please, computerized only please please do not code this in java, only help me do a diagram merge sort: 21, 4, 25, 16, 12, 17, 3, 30
This is a java data structures question -> Answer YES or NO to the following: Would it make sense to call a queue? - a FILO structure? - a LILO structure? -> What is the main advantage of implementing a queue using a linked list rather than an array ?
JAVA PROGRAMMING Q4.1: You have two sequences of mutually-comparable items to sort: The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items. One sequence is in an array and the other is in a linked list. For the array and the link list, make an argument for why the quick sort would be best for one and the merge sort for the other. In the identified situation, give a quantitative answer based on big-O and other technical factors, not just a qualitative answer. Address the specifics of the two algorithms -- their operations, time efficiency, money use, etc. Assume no optimization Q4.2: Explain and/or illustrate the specific changes made in each pass of an Insertion Sort on the following data: 47 4 22 13 9 12
Computer ScienceA restaurant requires WAIT ADT to help waiter to wait tables. Theapplication is required to provide functions to add a food item to the WAITlist, remove an item from the Wait list, size of the list i.e., the food itemsordered, and know if item is already in the list. The WAIT ADT access timeshould be O [1]. Provide implementation details with your choice of datastructure and the operations with justification of the constant access time.Implement search food in the added Wait list in C.
In Java: -Using a BST Interface (Binary Search Tree) -Create a class Disk. Disk contains four fields: model (String), size (int), measure (String, for GB or TB), and performance index (int). -Disk needs a constructor to initialize all fields, a toString method, and an equals. Make the class Comparable and write a compareTo method that compares Disks based on the size of the disk. Make sure your comparison accounts for the fact that some numbers are in GB and some are in TB. Write a method that will return true if the disk is the same size as the parms; parms are the size and measure("GB" or "TB"). Also write a method to create a Comparator which compares Disks based on the performance rating. -The client code should do the following: Write a function called build, which will open the disks.txt file, read in each disk and add it to the BST. For each disk the model is on the first line, and the second line contains the size, measure, and performance index. The BST is passed to build as…