Create a Book class; where: Each book contains the following information: book title, book Author name, barcode (as long integers), and book topic. o Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: o 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. Iterate through the LinkedList and print out the books' details Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order.

Create a Book class; where: Each book contains the following information: book title, book Author name, barcode (as long integers), and book topic. o Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: o 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. Iterate through the LinkedList and print out the books' details Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order.

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

JAVA Create a new class HashMapManipulation with a main method. Import the necessary classes from the java.util package, including the HashMap class. Create a HashMap object, named mapand use the put() method to add key-value pairs to the map. The keys are strings "A", "B", and "C", and the values are integers 1, 2, and 3 respectively. Use the size() method to print the size of the map. Use a for loop to print the key-value pairs in the map. The loop should iterate over the entries in the map using the entrySet() method, which will return a set of Map.Entry objects representing the key-value pairs in the map. The key and value of each entry are printed using the getKey() and getValue() methods, respectively. Use theget() method to get the value of key "A", and assigns it to a variable value. The value is then printed. Use the put() method to add a new key-value pair to the map. The key is "D" and the value is 4. The map is then printed again, to show the added key-value…
create a class called Dwarf that has a name (String) and a height (int). In addition, when Dwarfs are placed in a LinkedList and sorted, they will be sorted from tallest to shortest. import java.util.*; public class Main{ public static void main(String[] args) { ArrayList<Dwarf> l = new ArrayList<Dwarf>(); l.add(new Dwarf("Sleepy", 14)); l.add(new Dwarf("Dopey", 17)); l.add(new Dwarf("Doc", 9)); l.add(new Dwarf("Happy", 22)); l.add(new Dwarf("Sneezy", 29)); l.add(new Dwarf("Bashful", 11)); l.add(new Dwarf("Grumpy", 4)); Collections.sort(l); for (Dwarf d : l) System.out.println(d.getName()); }} output Sneezy Happy Dopey Sleepy Bashful Doc Grumpy
Write a class called Pokemon that has a name (e.g. “Pikachu”) and a number (e.g. 25). Implement a constructor that takes both values as parameters. Implement accessors for both values. Implement a toString() that returns a string in the format “Name(number)”, e.g. “Pikachu(25)”. Implement an equals(Object) method (two Pokémon are considered equal if they have the same number). Implement a hashCode() method that returns the number.(remember the equals and hashCode contract).
Import the ArrayList and List classes from the java.util package to create a list of phone numbers and also import the HashSet and Set classes from the java.util package to create a set of unique prefixes. Create a class called PhoneNumberPrefix with a main method that will contain the code to find the unique prefixes. Create a List called phoneNumbers and use the add method to add several phone numbers to the list. List<String> phoneNumbers = new ArrayList<>(); phoneNumbers.add("555-555-1234"); phoneNumbers.add("555-555-2345"); phoneNumbers.add("555-555-3456"); phoneNumbers.add("444-444-1234"); phoneNumbers.add("333-333-1234"); Create a Set called prefixes and use a for-each loop to iterate over the phoneNumbers list. For each phone number, we use the substring method to extract the first 7 characters, which represent the prefix, and add it to the prefixes set using the add method. Finally, use the println method to print the prefixes set, which will contain all of…
(Implement MyLinkedList) The implementations of the methods contains(E e), get(int index), indexOf(E e), lastIndexOf(E e), and set(int index, E e) are omitted in the MyLinkedList class. Implement these methods. Define a new class named MyLinkedListExtra that extends MyLinkedListto override these methods. Test your new MyList class using the code at import java.util.*; public class Exercise24_02 { public static void main(String[] args) { new Exercise24_02(); } public Exercise24_02() { String[] names = {"Tom", "Susan", "Kim", "George", "Peter", "Jean", "George", "Jane", "Denise", "Jenny", "Susan", "Kathy", "Jane"}; MyList<String> list = new MyLinkedListExtra<>(names); System.out.println(list); Scanner input = new Scanner(System.in); System.out.print("Enter a name: "); String name = input.next(); System.out.print("Enter an index: "); int index = input.nextInt(); System.out.println(name + " is in the list? " +…
Create a class MapTester (either in your current project or in a new project). In it, use a HashMap to implement a contacts list similar to the one in the example above. (Remember that you must import java.util.HashMap.) In this class, implement two methods: public void enterNumber(String name, String number) and public String lookupNumber(String name) The methods should use the put and get methods of the HashMap class to implement their functionality.
Write a code in Java Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one. This is a Recursive method. If Recursive is not used you will get no mark for this question Do not reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5 your function should print: 5-> 4 -> 3->2->1 but if I check myList the order should still be 1->2->3->4->5 you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse Hint: use recursion does this for you really easy
Can someone help me with this code, I not really understanding how to do this? import java.util.ArrayList;import java.util.HashMap;import java.util.Map;/*** @version Spring 2019* @author Kyle*/public class MapProblems {/*** Modify and return the given map as follows: if the key "a" has a value, set the key "b" to* have that value, and set the key "a" to have the value "". Basically "b" is confiscating the* value and replacing it with the empty string.** @param map to be edited* @return map*/public Map<String, String> confiscate(Map<String, String> map) {if (map.containsKey("a") && map.containsValue("a")) {}}/*** Modify and return the given map as follows: if the key "duck" has a value, set the key* "goose" to have that same value. In all cases remove the key "swan", the rest of the map* should not change.** @param map to be edited* @return map*/public Map<String, String> mapBird1(Map<String, String> map) {throw new UnsupportedOperationException("Not…
Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one. This is a Recursive method. If Recursive is not used you will get no mark for this question Do not reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5 your function should print: 5-> 4 -> 3->2->1 but if I check myList the order should still be 1->2->3->4->5 you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse Hint: use recursion does this for you really easy
Explain code and complete. //the third and final class which implements Hashmapspublic class OurMapUse { public static void main(String[] args) { Map<String, Integer> map = new Map<>(); for(int i=0;i<20;i++) { map.insert("abc"+i+1+i); System.out.print("i = "+i+"lf = "+map.loadFactor()); } } }.
JAVA Create a new class HashSetManipulation with a main method. Create a new HashSet set and populate it with initial values "A", "B", and "C" using the add method. Print the size of the set using set.size(). Use a for loop to print the values in the set. Use the add method to add a new value "D" to the set and print the result of the set to show that the value has been added. Use the remove method to remove value "A" from the set and print the result of the set to show that the value has been removed. Use the contains method to check if the value "C" exists in the set and print the result.
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 =…