Julia is a freelance hakers, She receives a few cake orders, for this Saturday. Since she got quite a number of orders on the same day, so she needs to deliver the cakes in an optimal way. She has studied the distance (in kilametec) to each location, as shown in Table 1. The data shown in upper triangular matrix only. This means that the distance between two locations is same from location a to location b and the other way round. While oo means there is no direct route between two locations. Table 1: Distance of the locations 1 2 3 4 5 6 7 8 9 10 1 5.1 12.5 13.0 7.5 13.5 00 c0 24.1 o0 2 7.2 9.2 00 00 00 00 00 00 3 8.0 0o 00 00 21.5 00 33.2 4 8.5 c0 15.5 14.1 00 00 11.5 10.5 17.3 00 00 6. 11.2 00 11.1 00 7 8.9 13.8 12.7 00 8.5 12.1 10 (a) In your opinion, what is the objective of this problem? () Propose an algorithm to solve the problem. (c) Solve the problem using the proposed algorithm. (d) Report the output of the problem

Julia is a freelance hakers, She receives a few cake orders, for this Saturday. Since she got quite a number of orders on the same day, so she needs to deliver the cakes in an optimal way. She has studied the distance (in kilametec) to each location, as shown in Table 1. The data shown in upper triangular matrix only. This means that the distance between two locations is same from location a to location b and the other way round. While oo means there is no direct route between two locations. Table 1: Distance of the locations 1 2 3 4 5 6 7 8 9 10 1 5.1 12.5 13.0 7.5 13.5 00 c0 24.1 o0 2 7.2 9.2 00 00 00 00 00 00 3 8.0 0o 00 00 21.5 00 33.2 4 8.5 c0 15.5 14.1 00 00 11.5 10.5 17.3 00 00 6. 11.2 00 11.1 00 7 8.9 13.8 12.7 00 8.5 12.1 10 (a) In your opinion, what is the objective of this problem? () Propose an algorithm to solve the problem. (c) Solve the problem using the proposed algorithm. (d) Report the output of the problem

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Write a program that randomly generates a number between 1-200, then asks the user to guess the…

A: Program: from random import randintrandom_number = randint(1, 200)count = 0userinput =…

Q: Solve this in python

A: The code calculates the total baggage fee a passenger owes based on their cabin, number of bags, and…

Q: Write a python scipy program using dijkstra method Find the shortest path from element 1 to 2

A: NOTE: Since you have not provided the graph, I am assuming that i can assume the graph on my own. I…

Q: Given the following weighted graph and using modified Disiktra's find. Ost (4), ost (5), Ost (6),…

Q: d. Make a class called 'BankAccount' that has 2 properties, accountnumber and balance. When a…

A: In this question, you need to write one python class called 'BankAccount' which has 2 properties.(…

Q: Write code that randomly generates a number, then loops that many times while asking the user to…

A: Program: import random#genrates a random number between the…

Q: Explain how the Bellman-Ford algorithm is better and worse than Dijkstra's algorithm.

A: Introduction: Algorithm is a specific procedure for solving a well-defined computational problem.…

Q: Write a program for computing intermediate quaternions between two given, and for a given value of…

Q: finding root of y=sqrt(1-x) using newton rapshon method on fortran 90/95

A: The Newton Raphson method determines the square root of a number n by assuming its root is k and…

Q: Q2. Write a program in C to print the prime factors of a positive integer in descending order using…

A: Solution:-- 1)The given question in the portal is expecting for the solution which is to be…

Q: In your opinion, What is the best algorithm and data structure used to solve Dijkstra's Shortest-…

A: The algorithms which are used to transfer data packets from a particular source to the destination…

Q: Using Dijkstra’s Algorithm, determine the shortest path from A to E, and the shortest path from A to…

A: Using Dijkstra’s Algorithm determine the shortest path from A to E and the shortest path from A to…

Q: now the psuedocode for Dijkstra's shortest-path algorithm

A: Dijkstra's algorithm is a popular graph traversal algorithm used to find the shortest path between…

Q: h. Pretend you have a file called 'file.txt'. Check to see if the file exists, if so print out the…

A: 1. We use the 'os.path' module to check whether a file exists. 2. We use the mode function to check…

Q: your own function to realize a 7*7 Gaussian filter

A: The Gaussian function is used in numerous research areas:1. It defines a probability distribution…

Q: Explain about working of k-means Algorithm.

A: The working of k-means algorithm

Q: Algortihm of Prim: is the following path the correct one(starting from A)…

A: Prim's algorithm is used to find the Minimum Spanning Tree of a graph. The first step is to select…

Q: b. Write a function that has 2 parameters, x and y, and returns a list of all of the numbers…

A: Here, you need to write python function which has 2 parameters. In this function, you need to find…

Q: Maximum path sum II Problem 67 By starting at the top of the triangle below and moving to adjacent…

A: Given, Find the maximum total from top to bottom in triangle.txt text file containing a triangle…

Q: Know the difference between A* and Dijkstra's algorithm (pp. 241-243)

A: Dijkstra's algorithm is a greedy algorithm that works on graphs with non-negative edge weights. It…

Q: ODİNG THEORY C = { 00000 , 11111 } show that C is a perfect code

A: The minimum distance between codewords is 5. so 25/(C(5,0)+(C(5,1)+(C(5,2)) 32/16 =2

Q: make one easy question and answer about the Knuth-Morris-Pratt algorithm with complete analysis

A: Knuth Morris Pratt (KMP) is an algorithm, which checks the characters from left to right. When a…

Q: with c#

A: Class A { Public Static void Main() { int [] arr= new int[5] {1,2,3,4,5}; // initialize array //…

Q: hat problem is solved by Dijkstra's banker's algorithm?

A: Resource allocation and deadlock avoidance are combined in the banker's algorithm, which first…

Q: с В D E

A: Answer - As the given graph has a cycle so we cannot use the backtracking approach. We need to use…

Q: What issue does Dijkstra's banker's algorithm solve?

A: DIJKSTRA'S BANKER'S ALGORITHM: The Banker's algorithm is a resource allocation and deadlock…

Q: Use the Monte Carlo Method in c++ to estimate the area enclosed by the ellipse: 16x^2 + 25y^2 = 81.

A: Area of ellipse using Monte Carlos Method in C++

Q: Give a comparative study between Prim's, Kruskal's, and Dijkstra's algorithms for their applications…

A: Give answer below explaination

Q: a. Write a function called Jumble that takes a list as a parameter. The function should ask the user…

A: 1. We need to switch 2 random elements from the list. For that, we can make use of the 'random'…

Q: What problem does Dijkstra's banker's algorithm address?

A: Dijkstra's banker's algorithm: Banker algorithm helps in allocation of maximum possible resources in…

Q: Implement Newton coding using C ++

A: In this question we have to implement Newton coding using C++ Let's code

Question

use C++ program for Dijkstra's single source shortest path algorithm

Julia is a fireelance hakers. She receives a few cake orders, for this Saturday. Since she got
quite a number of orders on the same day, so she needs to deliver the cakes in an optimal
way.
She has studied the distance (in kilameter) to each location, as shown in Table 1. The
data shown in upper triangular matrix only. This means that the distance between two
locations is same from location a to location b and the other way round. While oo means
there is no direct route between two locations.
Table 1: Distance of the locations
2 3 4 5 6
8 9
7
10
5.1
12.5 13.0
7.5
13.5 co co 24.1 co
7.2
9.2
00 00 00 00 00 00
3
8.0
00 00 00
21.5 co 33.2
4
8.5 00 15.5
14.1
11.5
10.5 17.3
00 00
11.2 0
6
11.1 00
7
8.9
13.8
12.7
00 8.5
12.1
10
(a) In your opinion, what is the objective of this problem?
(b) Propose an algorithm to solve the problem.
(c) Solve the problem using the proposed algorithm.
(d) Report the output of the problem

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution