Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 18.1, Problem 18.4CP
Program Plan Intro
Map:
- Map is an interface that contains values based on a key and a value pair and represents a mapping between them.
- Each key and a value pair in the map are unique.
- It is a general interface of the basic map features, implemented by two main classes:
- HashMap
- TreeMap
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You need to take a trip by car to another town that you have never visited before. Therefore, you
are studying a map to determine the shortest route to your destination. Depending on which route
you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on
the way. The map shows the mileage along each road that directly connects two towns without
any intervening towns. These numbers are summarized in the following table, where a dash
indicates that there is no road directly connecting these two towns without going through any
other towns.
Miles between Adjacent Towns
Town
A B C DE
Destination
Origin
A
40
60
50
10
70
B
20
55
40
50
10
D
60
E
80
(a) Formulate this problem as a shortest-path problem by drawing a network where nodes
represent towns, links represent roads, and numbers indicate the length of each link in
miles.
(b) Use the Dijkstra's algorithm to solve this shortest path problem.
You need to take a trip by car to another town that you have never visited before. Therefore,
you are studying a map to determine the shortest route to your destination. Depending on
which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass
through on the way. The map shows the mileage along each road that directly connects two
towns without any intervening towns. These numbers are summarized in the following table,
where a dash indicates that there is no road directly connecting these two towns without going
through any other towns.
Town
Origin
A
B
C
D
E
A
40
Miles between Adjacent Towns
C D E
B
60
10
50
20
- 70 55 -
88811
40
50
10
Destination
| | || 88
60
80
(a) Formulate this problem as a shortest-path problem by drawing a network where nodes
represent towns, links represent roads, and numbers indicate the length of each link in
miles.
(b) Use the Dijkstra's algorithm to solve this shortest path problem. Illustrate your work by
using a table.…
Building Arena models:
A few years ago, I was in a group involved with building industrial facilities. A team of consultants visited us to make a presentation about improving the building process. They had a demonstration in the form of a game.
We were divided into two teams of four and sat four in a row at a table. Person 1 was given 100 poker chips. The game process was Person 1 would roll a single die. Whatever the number was, he or she would pass that number of chips to Person 2. Person 2 would roll the die, and
• If the number of the roll is less than or equal to the chips in front of Person 2, the number of the die roll is passed to the next person. Any remaining chips stay in place, to be passed on another turn when possible.• If the roll on the die is greater than the number of the chips in front of Person 2, all the chips are passed, but the difference in what could be passed is lost on that turn.
For example, if Person 2 has 3 chips and rolls a “1,” then one chip is passed.…
Chapter 18 Solutions
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Ch. 18.1 - Prob. 18.1CPCh. 18.1 - What are the three general types of collections?Ch. 18.1 - Prob. 18.3CPCh. 18.1 - Prob. 18.4CPCh. 18.1 - Prob. 18.5CPCh. 18.1 - Prob. 18.6CPCh. 18.1 - Prob. 18.7CPCh. 18.2 - Prob. 18.8CPCh. 18.2 - Prob. 18.9CPCh. 18.2 - Prob. 18.10CP
Ch. 18.2 - Prob. 18.11CPCh. 18.2 - Prob. 18.12CPCh. 18.2 - Prob. 18.13CPCh. 18.2 - Prob. 18.14CPCh. 18.2 - Prob. 18.16CPCh. 18.2 - Prob. 18.17CPCh. 18.2 - Prob. 18.18CPCh. 18.2 - Prob. 18.20CPCh. 18.3 - Prob. 18.21CPCh. 18.3 - Prob. 18.22CPCh. 18.3 - Prob. 18.23CPCh. 18.3 - Prob. 18.24CPCh. 18.3 - Any time you override the Object classs equals...Ch. 18.3 - Prob. 18.26CPCh. 18.3 - Prob. 18.27CPCh. 18.3 - Prob. 18.28CPCh. 18.4 - Prob. 18.29CPCh. 18.4 - Prob. 18.31CPCh. 18.4 - Prob. 18.32CPCh. 18.6 - How do you define a stream of elements?Ch. 18.6 - How does a stream intermediate operation differ...Ch. 18.6 - Prob. 18.35CPCh. 18.6 - Prob. 18.36CPCh. 18.6 - Prob. 18.37CPCh. 18.6 - Prob. 18.38CPCh. 18.6 - Prob. 18.39CPCh. 18 - Prob. 1MCCh. 18 - Prob. 2MCCh. 18 - This type of collection is optimized for...Ch. 18 - Prob. 4MCCh. 18 - A terminal operation in a stream pipeline is also...Ch. 18 - Prob. 6MCCh. 18 - Prob. 7MCCh. 18 - This List Iterator method replaces an existing...Ch. 18 - Prob. 9MCCh. 18 - Prob. 10MCCh. 18 - This is an object that can compare two other...Ch. 18 - This class provides numerous static methods that...Ch. 18 - Prob. 13MCCh. 18 - Prob. 14MCCh. 18 - Prob. 15TFCh. 18 - Prob. 16TFCh. 18 - Prob. 17TFCh. 18 - Prob. 18TFCh. 18 - Prob. 19TFCh. 18 - Prob. 20TFCh. 18 - Prob. 21TFCh. 18 - Prob. 22TFCh. 18 - Prob. 1FTECh. 18 - Prob. 2FTECh. 18 - Prob. 3FTECh. 18 - Prob. 4FTECh. 18 - Write a statement that declares a List reference...Ch. 18 - Prob. 2AWCh. 18 - Assume that it references a newly created iterator...Ch. 18 - Prob. 4AWCh. 18 - Prob. 2SACh. 18 - Prob. 4SACh. 18 - Prob. 5SACh. 18 - Prob. 6SACh. 18 - How does the Java compiler process an enhanced for...Ch. 18 - Prob. 8SACh. 18 - Prob. 9SACh. 18 - Prob. 10SACh. 18 - Prob. 11SACh. 18 - Prob. 12SACh. 18 - Prob. 13SACh. 18 - Prob. 14SACh. 18 - Word Set Write an application that reads a line of...Ch. 18 - Prob. 3PCCh. 18 - Prob. 5PCCh. 18 - Prob. 8PC
Knowledge Booster
Similar questions
- Models are used for a variety of purposes. Sort the models into groups.arrow_forwardMake a 3x3 user-based sudoku grid in C language where the user can insert 3 numbers based on the rows and columns from 1-9. Let 0 be the starting number that can be changed to any number that the user wants. After the user inputs the 3 numbers, reveal the rest of the 6 numbers in the grid.arrow_forwardLanguage is c++ Assignment 6 C: Minesweeper - Simplified. For many years, computers sold with the Windows operating system would contain a game called M inesweeper. The player would be presented with a grid, where they would have to click an empty part of the map. If they clicked on a hidden mine, the game would be instantly over. However, if they clicked a safe spot, a hint about nearby mines would be displayed and the player would click another spot. The goal would be to flag all the hidden mines without hitting one. (As an aside, many people did not know these rules and just clicked around randomly until they hit a mine)We will be developing a simplified version of this game. You will prompt the user for a grid size and then created a 2D array with equal width and height (C++ students: Check the Appendix for more information on how to do this). You will initialize the 2D char array with each element equallying a ‘?’ symbol. You will then randomly generate one “mine” value per…arrow_forward
- Floor(2.4) + Ceil(2.9) is equal toarrow_forwardChiralitydef is_left_handed(pips): Even though this has no effect on fairness, pips from one to six are not painted on dice any which way, but so that the pips on the opposite faces always add up to seven. (This convention makes it easier to tell when someone tries to use gaffed dice that leave out some spot values.) In each corner of the cube, one value from each pair of opposites 1-6, 2-5 and 3-4 meets two values from the other two pairs of opposites. The math works out correctly in for the 23 = 8 corners of the cube. This still leaves two possibilities how to paint these pips. Look at the corner shared by the faces 1, 2, and 3, and read these numbers clockwise around that corner starting from 1. If these three numbers read out as 1-2-3, that die is left-handed, and if they read out as 1-3-2, that die is right-handed. Analogous to a pair of shoes made separately for the left and right foot, left- and right-handed dice are in one sense identical, yet no matter how you twist and turn,…arrow_forwardPython Turtle Graphics Draw a spiral diagram using Python turtle package program follows 3 steps: Import the turtle module Create a turtle to control. Draw around using the turtle methods. You should consider the following points in your solution: The shapes should be drawn with the shown colors Yellow and white for the square-like shapes. Blue for the background. The prompt should have a turtle shape. The number of iterations should be 300 You should use only one loop. The number of the yellow color lines should be 200. The final shape of the output should be as shown in the picture attached. Make sure to set properly the starting position (x & y) of your drawing, to maintain the required diagram. video on youtube: https://www.youtube.com/watch?v=ZqoJD2RMu1Iarrow_forward
- java program or code not algorithmarrow_forwardComputer Science Divide a given map of any size (the smallest size is 5 * 5) into 4 equal areas then locate the center point (or square) as shown in the charts, super karel in java programmingarrow_forwardSubject / Operation Research You need to visit a city you have never been to before and you want to reach that city by the shortest route. That's why you work on the map to determine the shortest path. Depending on the route you choose, you have to pass through different cities (cities that can be passed: A, B, C, D, E). Table 3 shows the distance (kilometers) between adjacent cities. Answer the following questions regarding this shortest path problem. a)Create the network representation b) Write the mathematical model. c) Solve with Dijkstra's algorithm.arrow_forward
- Blue-Eyed Island: A group of individuals live on an island until a visitor arrives with an unusual order: all blue-eyed people must leave the island as quickly as possible. Every evening at 8:00 p.m., a flight will depart. Everyone can see everyone else's eye colour, but no one knows their own (nor is anyone allowed to tell them). Furthermore, they have no idea how many people have blue eyes, but they do know that at least one person does. How long will it take for the blue-eyed individuals to leave?arrow_forwardA senior one learner has reported in her class and has settled on a desk . support: the classroom is arranged in rows and columns its big a class with each learner having his or her own desk.resource: knowledge of horizontal and vertical lines is rows and columns coordinates. Knowledge: counting numbers task:the mathematics teacher has asked her to explain how she can access her seat, starting from the entrance of the class. Discuss whether there are other ways of reaching her seat.arrow_forwardIN C PROGRAMMING LANGUAGE A resistor is a circuit device designed to have a specific resistance value between its ends. Resistance values are expressed in ohms (Ω) or kilo-ohms (kΩ). Resistors are frequently marked with colored bands that encode their resistance values, as shown in the Figure. The first two bands are digits, and the third is a power-of-ten multiplier. The Table below shows the meanings of each band color. For example, if the first band is green, the second is black, and the third is orange, the resistor has a value of 50 × 103 Ω or 50 k Ω. The information in the Table can be stored in a C program as an array of strings. char COLOR_CODES[10][7] = {"black", "brown", "red", "orange", "yellow", "green", "blue", "violet", "gray", "white"}; Notice that “red” is COLOR_CODES[2] and has a digit value of 2 and a multiplier value of 102. In general, COLOR_CODES[n] has digit value n and multiplier value 10n. Write a program that prompts for the colors…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScriptComputer ScienceISBN:9781305503922Author:Patrick M. CareyPublisher:Cengage Learning
Np Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:CengageCOMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L