Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
6th Edition
ISBN: 9780134477367
Author: David J. Barnes, Michael Kolling
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem 59E
Program Plan Intro
Implement a
Program Plan:
Open the project “Products�.
Open the class “Stock Manager� and write the method “delivery� in it.
Compile the class and add 2 objects of the class “Products�.
Compile the class “Stock Manager� and add the products created above to it.
Run the function or method “Delivery� of the class “Stock Manager�.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Implement keys() for SeparateChainingHashST and LinearProbingHashST.
0 Add a method to LinearProbingHashST that computes the average cost of a search hit in the table, assuming that each key in the table is equally likely to be sought.
Write a client programs that use your edge-weighted digraph to produce edge-weighted digraphs that have a large percentage of negative weights but have at most a few negative cycles, for as large a range of values of V and E as possible.
You are to implement removeHead, and removeTail and you also have to create the following functions (for visual purposes of the detail explanation, header and trailer sentinels are described as h and t respectively): IMPORTANT NOTE: For all the methods that has the pos parameter i.e. addAt, removeAt, move, make sure to access that specified position from whichever is nearer - the head or the tail - similar to what we have done in the get method.
Example DoublyLinkedList: h <-> 10 <-> 30 <-> 40 <-> 50 <-> t
int add(int num)
This will add the element num into the last element of the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list.
int remove(int num)
This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list…
Chapter 4 Solutions
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Ch. 4 - Prob. 1ECh. 4 - What happens if you create a new MusicOrganizer...Ch. 4 - Prob. 3ECh. 4 - Prob. 4ECh. 4 - Write a declaration of a local variable called...Ch. 4 - Prob. 6ECh. 4 - Write assignments to the library, cs101. and track...Ch. 4 - If a collection stores 10 objects, what value...Ch. 4 - Write a method call using get to return the fifth...Ch. 4 - Prob. 10E
Ch. 4 - Write a method call to add the object held in the...Ch. 4 - Write a method call to remove the third object...Ch. 4 - Suppose that an object is stored at index 6 in a...Ch. 4 - Add a method called checklndex to the...Ch. 4 - Write an alternative version of checkIndex called...Ch. 4 - Rewrite both the 1istFi1e and removeFi1e methods...Ch. 4 - Prob. 17ECh. 4 - Prob. 18ECh. 4 - We know that the first file name is stored at...Ch. 4 - Prob. 20ECh. 4 - Create a MusicOrganizer and store a few file names...Ch. 4 - Create an ArrayList<String> in the Code Pad by...Ch. 4 - If you wish, you could use the debugger to help...Ch. 4 - Challenge exercise The for-each loop does not use...Ch. 4 - Prob. 25ECh. 4 - Prob. 26ECh. 4 - Prob. 27ECh. 4 - Write out the header of a for-each loop to process...Ch. 4 - Suppose we express the first version of the key...Ch. 4 - Write a while loop (for example, in a method...Ch. 4 - Write a while loop to add up the values 1 to 10...Ch. 4 - Write a method called sum with a while loop that...Ch. 4 - Challenge exercise Write a method isPrime (int n)...Ch. 4 - In the findFirst method, the loop's condition...Ch. 4 - Prob. 35ECh. 4 - Have the MusicOrganizer increment the play count...Ch. 4 - Prob. 37ECh. 4 - Prob. 38ECh. 4 - Prob. 39ECh. 4 - Prob. 40ECh. 4 - Complete the numberOfMembers method to return the...Ch. 4 - Prob. 42ECh. 4 - Prob. 43ECh. 4 - Prob. 44ECh. 4 - Challenge exercise Write a method to play every...Ch. 4 - Prob. 46ECh. 4 - Prob. 47ECh. 4 - Add a close method to the Auction class. This...Ch. 4 - Add a getUnsold method to the Auction class with...Ch. 4 - Suppose the Auction class includes a method that...Ch. 4 - Rewrite getLot so that it does not rely on a lot...Ch. 4 - Prob. 52ECh. 4 - Prob. 53ECh. 4 - Prob. 54ECh. 4 - Prob. 55ECh. 4 - Open the products project and complete the...Ch. 4 - Implement the findProduct method. This should look...Ch. 4 - Implement the numberInStock method. This should...Ch. 4 - Prob. 59ECh. 4 - Challenge exercise Implement a method in...Ch. 4 - Java provides another type of loop: the do-while...Ch. 4 - Prob. 85ECh. 4 - Prob. 86ECh. 4 - Find out about Java's switch-case statement. What...
Knowledge Booster
Similar questions
- Thank you, it has the correct output now! Last thing, can this be done without using a Hashmap, but instead with the original method of using just the LinkedList in the original question? If so, please provide another solution without using hashmap to see the difference in structure of the code!arrow_forwardUsing the Get-Help cmdlet will show us the help file of a cmdlet or topic. In this case, the Get-EventLog cmdlet. However, it is not showing the information on the parameters. How can we make it show the information on parametersarrow_forwardAdd a method to the Parking Office to return the collection of permit ids for a specific customer (getPermitIds(Customer)) I have already coded the permit id class, but I attached the class diagram for you to see. Current Java Code: package parkingsystem4;import java.util.LinkedList;import java.util.List; public class ParkingOffice { String name; String address; List<Car> cars = new LinkedList<Car>(); List<Customer> customers = new LinkedList<Customer>(); List<ParkingLot> lots = new LinkedList<ParkingLot>(); List<ParkingCharge> charges = new LinkedList<ParkingCharge>(); // Default constructor ParkingOffice(){ } // Parameterized constructor ParkingOffice(String name, String address, List<Car> parkedCars, List<ParkingLot> lots, List<ParkingCharge> charges){ this.name = name; this.address = address; this.cars = parkedCars; this.lots = lots;…arrow_forward
- Using the output from the previous activity. Discuss in at least 100 words yourfindings in the previous activity.arrow_forwardModify the GeometricObject class to implement the Comparable interface and define a static max method in the GeometricObject class for finding the larger of two GeometricObject objects. Draw the UML diagram and implement the new GeometricObject class. Write a test program that uses the max method to find the larger of two circles, the larger of two rectangles.using java programmingarrow_forwardExamine the getBalance method's header and body, and then evaluate how they stack up against those of the getPrice method. I'm confused as to the differences between the two.arrow_forward
- For CloseFile, write down what it can do.arrow_forwardImplement weighted quick-find, where you always change the id[] entries o the smaller component to the identifier of the larger component. How does this changeaffect performance?arrow_forwardIf we want to filter out the results and shows only the values of certain properties, such as Name, Status of Get-Service cmdlet, we can use this cmdlet: Group of answer choices Remove-Item Select-String Select-Object Sort-Objectarrow_forward
- The acclaimed _NumPy_ library, that `Simpy` is inspired by, allows you to use the subscription operator not just to select individual items, but also to filter with a mask. It adds a second usage to the operator, just like you have had two uses of many of the operators above, such as adding two `Simpy`s or a `Simpy` and a `float`. The big idea of the second usage of subscription notation is that if instead of giving an `int` inside the subscription brackets you give a `list[bool]`, the expression will return a new `Simpy` object containing only the _masked_, or filtered, `values`. For example: ~~~python a = Simpy([1.0, 2.0, 3.0, 4.0, 2.0, 1.0]) mask = a > 2.0 print(mask) # Output: [False, False, True, True, False, False] b = a[mask] print(b) # Output: Simpy([3.0, 4.0]) ~~~ The above example did not need to establish a separate variable named `mask`, it only did so to make it obvious what the `mask` values were. More conventionally, the above example would be written in a…arrow_forwardDevelop a client that takes an int value N from the command line and does an amortized plot of the cost of all operations in the style of the plots in the text for the process of generating random pairs of integers between 0 and N-1, calling connected() to determine if they are connected and then union() if not (as in our development client), looping until all sites are connected.Create a weighted quick union implementation that does not require the number of items in advance using linked lists or a resizing array. Add the newSite() method, which returns an int identification, to the API.arrow_forwardUse a computer programming language of your choice to implement the dynamic programming that allows the change of edge weights and compute the shortest path from 1 to 14, and also shows the shortest route. For example, what is the shortest path and its route from node 1 to node 14 if the distance from node 4 to node 7 is 9?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education