Concept explainers
Implement the numberInStock method. This should locate a product in the collection with a matching ID and return the current quantity of that product as a method result. If no product with a matching ID is found, return zero. This is relatively simple to implement once the findProduct method has been completed. For instance, numberInStock can call the findProduct method to do the searching and then call the getQuantity method on the result. Take care with products that cannot be found, though.
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Additional Engineering Textbook Solutions
Software Engineering (10th Edition)
Starting Out with Java: From Control Structures through Objects (6th Edition)
Starting Out with Python (3rd Edition)
Modern Database Management
Computer Systems: A Programmer's Perspective (3rd Edition)
Starting Out With Visual Basic (7th Edition)
- Which best describes this axiom: ( aList ( ) ) . replace ( i, item ) ) . getEntry ( i ) = item When an item is replaced, it always goes in the position specified in the method call When an item is replaced, space is made by moving all of the items starting at the position specified down toward the bottom of the list by one to make room When an item is replaced, it always goes in the first available unused position None of thesearrow_forwardWrite an iterator for RandomQueue from the previous exercise that returns the items in random order.arrow_forwardIt is time for you to demonstrate your skills in a project of your own choice. You must DESIGN,ANALYSE AND CODE any method for the GENERIC MyLinkedList class that will manipulate the linkedlist. You can decide yourself what it should be following the specification below:1. Purpose: The method must make logical sense – it should be of some purpose to somebody.You should describe in the text who will use the method for which purpose.2. Clearly explain the problem. Then clearly explain how your method will solve it.3. Test program: Test the method using a wrapped class like Integer however, you will get extramarks if you can test it with the new classes you created in I_Do1 and I_Do2.arrow_forward
- It is time for you to demonstrate your skills in a project of your own choice. You must DESIGN,ANALYSE AND CODE any method for the GENERIC MyLinkedList class that will manipulate the linkedlist. You can decide yourself what it should be following the specification below:1. Purpose: The method must make logical sense – it should be of some purpose to somebody.You should describe in the text who will use the method for which purpose.2. Clearly explain the problem. Then clearly explain how your method will solve it.3. Test program: Test the method using a wrapped class like Integer wrapper class. All of this must be done using generic linked lists, and coded in java.arrow_forwardImplement any one of the following methods. That will be a good exercise for you if you choose to implement both but you will be graded for only one. Implement a instance method, called equalsTo, in the IntArrayBag’s class that takes one input parameter and returns a boolean value. The input parameter is of type IntArrayBag. The method returns true if the input bag and the bag that activates the method have exactly the same elements. Otherwise the method return false. Note that the locations of the elements in the data arrays are not necessarily be the same, it is only the number of occurrences of each element that must be the same. OR Implement a static method, called equalsTo, in the IntArrayBag’s class that takes two input parameters and returns a boolean value. The input parameters are of type IntArrayBag. The method returns true if the two input bags have exactly the same elements. Otherwise the method returns false. Note that the locations of the elements in the data arrays…arrow_forwardExamine the following graph. We will be running Dijkstra's algorithm starting at the node labeled S S 5 1 2 A E F 9. 3 4 6 B C D 2 5 10 5 We're using the version of Dijkstra's algorithm described here in lecture: note that the fringe and distro data structures are always changed at the same time. Give the resulting edgeTo and distão maps after vertex B is visited (i.e. its outgoing edges to C and E have been relaxed). Also give the resulting edgeTo and distro maps after Dijkstra's algorithm has completely finished execution. Initialize the edgeTo for each vertex as - which will represent null for us. Initialize the distro for each vertex as inf which we'll use to represent ∞o, except for S where it should be 0. So, before the first iteration, the values of these variables are: edgeTo = {A, B, C:-, D:-, E:-, F:-, G:-, S:-} distTo = {A: inf, B:inf, C:inf, D:inf, E:inf, F:inf, G:inf, S:0} The maps must be in this order. If you have the same mappings but in a different order (i.e. the…arrow_forward
- For the first part of this lab, copy your working ArrayStringList code into the GenericArrayList class.(already in the code) Then, modify the class so that it can store any type someone asks for, instead of only Strings. You shouldn't have to change any of the actual logic in your class to accomplish this, only type declarations (i.e. the types of parameters, return types, etc.) Note: In doing so, you may end up needing to write something like this (where T is a generic type): T[] newData = new T[capacity]; ...and you will find this causes a compiler error. This is because Java dislikes creating new objects of a generic type. In order to get around this error, you can write the line like this instead: T[] new Data = (T[]) new Object[capacity] This creates an array of regular Objects which are then cast to the generic type. It works and it doesn't anger the Java compiler. How amazing! Once you're done, screenshot or save your code for checkin later. For the second part of the lab,…arrow_forwardWe have two classes; these classes are "Car" and "Price".The "car" class is a class that keeps the id and price of the car.If the "Price" class is, there will be get / set methods for the segment of the fee (For example Y segment Z segment), the number of cars, and the "Car" class list.In the "Price" class, there should be a print method to add / remove cars to the list and find the ids of Vehicles whose segments are equal to X.The segments are as follows. 0$ -15999$ -> Y Segment16000$-24999$ -> Z Segment25000$-50000$ -> T Segment It is necessary to use "Single Linked List".The program should be written in JAVA.arrow_forwardWrite 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 100arrow_forward
- Is there a way to simataniously get both student names' and roll numbers' to be in ascending order at the same time in one block display? What would that look like? Right now I have to call both methods seperatly in order to see both ascending methods in action and it doesn't look good...Also is it possible to separate the sorting logic from the main method and encapsulate it within a separate class or method that takes the ArrayList of students and the two comparators as arguments?... allowing the program to sort students by different criteria without duplicating the sorting logic? The attached image is what my program is displaying right now and I want it to display like: Student [roll number =1, name =Allan, address =620 pioneer st]Student [roll number =2, name =Billy, address =700 ash st]Student [roll number =3, name =Chris, address =801 cheney dr]Student [roll number =4, name =Diana, address =830 washington st]Student [roll number =5, name =Eliza, address =200 main st]Student…arrow_forwardYou are given a list of projects and a list of dependencies (which is a list of pairs ofprojects, where the second project is dependent on the first project). All of a project's dependencies must be built before the project is. Find a build order that will allow the projects to be built. If there is no valid build order, return an error.EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, carrow_forwardThe code given below represents a saveTransaction() method which is used to save data to a database from the Java program. Given the classes in the image as well as an image of the screen which will call the function, modify the given code so that it loops through the items again, this time as it loops through you are to insert the data into the salesdetails table, note that the SalesNumber from the AUTO-INCREMENT field from above is to be inserted here with each record being placed into the salesdetails table. Finally, as you loop through the items the product table must be update because as products are sold the onhand field in the products table must be updated. When multiple tables are to be updated with related data, you should wrap it into a DMBS transaction. The schema for the database is also depicted. public class PosDAO { private Connection connection; public PosDAO(Connection connection) { this.connection = connection; } public void…arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education