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 A Origin 40 ABCDE Miles between Adjacent Towns B C D E 60 10 50 20 70 55 - ०४५।। 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. (c) If each number in the table represented your cost (in dollars) for driving your car from one town to the next, would the answer in part (b) now give your minimum cost route? (d) If each number in the table represented your time (in minutes) for driving your car from one town to the next, would the answer in part (b) now give your minimum time route?

JAVA based program need help

In PYTHON   Print values from the Goal column only Print values only for columns: Team, Yellow Cards and Red Cards Find and print rows for teams that scored more than 6 goals Select the teams whose name start with a G Print values only for columns Team and Shooting Accuracy , and only for rows in which the team is either of the following: England, Italy and Spain Find and print rows for teams that scored more than 6 goals and at least 4000 passes     Team Goals Shots on target Shots off target Shooting Accuracy Goals-to-shots (perc) Total shots (inc. Blocked) Hit Woodwork Penalty goals Penalties not scored Headed goals Passes Passes completed Passing Accuracy Touches Crosses Dribbles Corners Taken Tackles Clearances Interceptions Clearances off line Clean Sheets Blocks Goals conceded Saves made Saves-to-shots ratio Fouls Won Fouls Conceded Offsides Yellow Cards Red Cards Subs on Subs off Players Used Croatia 4 13 12 0.5 0.16 32 0 0 0 2 1076 828 0.769 1706 60…

8. Lo Shu Magic Square The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown in Figure 7-19 Q. The Lo Shu Magic Square has the following properties: Figure 7-19 Lo Shu Magic Square 9 2 4 3 5 7 8 1 • The grid contains the numbers 1 through 9 exactly. • The sum of each row, each column, and each diagonal all add up to the same number. This is shown in Figure 7-20 D. Figure 7-20 Sums of the rows, columns, and diagonals 15 4 +15 7 +15 8 1 6 +15 15 15 15 15 In a program, you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is a Lo Shu Magic Square. Test the function in a program.

A robot sits in a 30 foot square room. It be directed to travel a randomly generated distance between 8 and 20 feet. The user will input a value that will serve as the seed for the random number generator. Every foot it travels it indicates that it has traveled 'x feet'. Upon arrival at the user specified distance, it announces." made it!"(This will happen even if the robot moves 0 feet). The program should also indicate how many more feet the robot could travel before running into a wall assuming it always starts at one wall of the room. Note that grammar used to indicate singular versus plural distances. i.e. for an random generation of 5, the resulting output should be: How far should the robot travel? 5 feet 1 foot I made it! I can only travel 25 mor 2 feet 3 feet 4 feet 5 feet e feet. tabs are used to space the output of traveled feet 330492.1753326.qx3zay7 LAB АCTIVITY main.cpp 1 #include 2 using namespace std; 3 4 int main() int roomsize - 30; 6 int distance = 0; 7 8 cout <«…

A large company pays its salespeople on a commission basis. The salespeople receive $200 per week plus 9% their gross sales for that week. For example, a salesperson who sells $5,000 worth of merchandise in a week receives $200 plus 9% of $5,000, or a total of $650. You’ve been supplied with a list of the items sold by each salesperson. The values of these items are shown in the table below. Develop a Java application that inputs one salesperson's items sold for last week and calculates and displays that salesperson's earnings. There is no limit to the number of items that can be sold. Item Value 239.99 2 129.75 3 99.95 4 350.89 Objectives This assignment was designed to reinforce programming concepts from Chapter 4. In this assignment you will practice: • Using if-else statements Sample Runs Run: Run: Enter number sold of product #1: 20 Enter number sold of product #2: 30 Enter number sold of product #3: 0 Enter number sold of product #4: 45 Earnings this week: $2403.41 Enter number…

Create C# (Sharp) code using visual studio: Use Delegate methodology to do the following project: Have a Add method, Subtract method, Multiply method, Divide method. Each method will loop 100 times. With each iteration, generate two random numbers (between 1 - 50), then perform the math operation (add for the Add method, subtract for the Subtract method, etc.). Make sure to display the numbers and the answer! One validation check - for subtraction and division, make sure the higher number generated comes first in the calculation. For example, if 12 and 40 are the numbers generated, the math should be 40 -12 for the subtraction (not 12 - 40) and 40/12 for the division (not 12/40). Again, make sure to use Delegates!

Primary U.S. interstate highways are numbered 1-99. Odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. Auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. Thus, I- 405 services 1-5, and I-290 services 1-90. Note: 200 is not a valid auxiliary highway because 00 is not a valid primary highway number. Given a highway number, indicate whether it is a primary or auxiliary highway. If auxiliary, indicate what primary highway it serves. Also indicate if the (primary) highway runs north/south or east/west. Ex: If the input is: 90 the output is: I-90 is primary, going east/west. Ex: If the input is: 290 the output is: I-290 is auxiliary, serving I-90, going east/west. Ex: If the input is: 0 the output is: 0 is not a valid interstate highway number. Ex: If the input is: 200 the output is: 200 is not a valid interstate highway number. See Wikipedia for more info on highway numbering

Please add comments! thanks!

Please complete the exercise! Thank you, i am trying to check my work