[(2A)] The given table below (in the first photo) shows the 5 different places that you would like to visit on a particular day. The table below shows the estimated distance (in kilometers per hour) it takes you to travel from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Greedy Algorithm. Example (second photo) already provided in the photos below.. HomeHospitalMallEsplanadePet ShopHome43.53---Hospital23.5332.40Mall43.53302.40Esplanade3.533302.22---Pet Shop2.402.402.22 GrоceryVideo rentalHomePost officestorestoreBankRequired answer:12Home14122023Post office148122114Grocery1217112320storeVideo rental201217188.storeBank2321I11817211112NOTE: THIS IS ONLY ASAMPLE18BRequired answer:Applying the Greedy Algorithm, we find the following Hamiltonian circuit with theminimum weight (in minutes): HG – GP – PV – VB – BH, or HGPVBHThe obtained minimum time is: 12 + 8 + 12 + 18 + 23 = 73 minutes.|

We need to find the minimum distance for given table.

Answered: The given table below (in the first…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

[(2A)] The given table below (in the first photo) shows the 5 different places that you would like to visit on a particular day. The table below shows the estimated distance (in kilometers per hour) it takes you to travel from one place to another. If you will visit each of these places exactly once, determine the shortest time possible it would take you to do using the Greedy Algorithm. Example (second photo) already provided in the photos below..

Home
Hospital
Mall
Esplanade
Pet Shop
Home
4
3.53
---
Hospital
2
3.53
3
2.40
Mall
4
3.53
30
2.40
Esplanade
3.53
3
30
2.22
---
Pet Shop
2.40
2.40
2.22

Grоcery
Video rental
Home
Post office
store
store
Bank
Required answer:
12
Home
14
12
20
23
Post office
14
8
12
21
14
Grocery
12
17
11
23
20
store
Video rental
20
12
17
18
8.
store
Bank
23
21
I1
18
17
21
11
12
NOTE: THIS IS ONLY A
SAMPLE
18
B
Required answer:
Applying the Greedy Algorithm, we find the following Hamiltonian circuit with the
minimum weight (in minutes): HG – GP – PV – VB – BH, or HGPVBH
The obtained minimum time is: 12 + 8 + 12 + 18 + 23 = 73 minutes.
|

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions