3- Given the following information for Romania Problem, apply bothgreedy and A* algorithm to show how move from Arad toCraiova. Show the advantages and disadvantages of eachalgorithm.O Romania with step costs in kmStraight-line distanceto BucharestO Oradea71NeamtArad366BucharestCraiovaĐobretaEforieFagarasGiurgiuHirsova87PZerind75/151160O lasi242|Arad14016192178Sibiu99Fagaras77118O Vaslui15122680lasiLugojMehadiaRimnicu VilceaTimisoara244241234142111211Neamt97PitestiO Lugoj70OradeaPitestiRimnicu Vilcea3809898101O Hirsova14685Ó Mehadia75Urziceni193SibiuTimisoara8625332980199138Bucharest120Dobreta O06d GiurgiuUrziceniVasluiZerindCraiovaEforie374las TWETaal

Answered: Image /qna-images/answer/8fac6fc4-bf86-4d78-ab37-957cf79e8b8f.jpg

3- Given the following information for Romania Problem, apply both greedy and A* algorithm to show how move from Arad to Craiova. Show the advantages and disadvantages of each algorithm. O Romania with step costs in km A Oradea Straight-line distance to Bucharest 71 Arad Bucharest Craiova Dobreta Eforie Neamt 366 PZerind 75 87 151 160 O lasi 242 Arad 161 178 140 92 Fagaras Giurgiu Hirsova lasi Sibiu 99 Fagaras 77 118 O Vaslui 151 226 80 Rimnicu Vilcea Lugoj Mehadia Timisoara 244 /142 241 211 Neamt

3- Given the following information for Romania Problem, apply both greedy and A* algorithm to show how move from Arad to Craiova. Show the advantages and disadvantages of each algorithm. O Romania with step costs in km A Oradea Straight-line distance to Bucharest 71 Arad Bucharest Craiova Dobreta Eforie Neamt 366 PZerind 75 87 151 160 O lasi 242 Arad 161 178 140 92 Fagaras Giurgiu Hirsova lasi Sibiu 99 Fagaras 77 118 O Vaslui 151 226 80 Rimnicu Vilcea Lugoj Mehadia Timisoara 244 /142 241 211 Neamt

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

Similar questions

A* Algorithm For the given start-state and goal-state Muscat and Salalah, respectively, the heuristic values are given as below City Heuristic Muscat 200 Sur 150 Seeb 131 Nizwa 125 Bawshar 165
Using given matrix P produced by Floyd2 Algorithm restore the path from v9 to V2 that has the minimum cost (shortest path). Hint: use path(r, q) function. P v1 "2 V3 v4 V5 V6 V7 8 90 19 v1 0 6 5 0 0 9 22 0 0 5 0 1 0 6 6 9 5 0 6 V3 6 9 0 6 9 9 9 9 0 v4 0 0 5 0 0 15 0 9 0 9 0 9 0 6 6 9 7 5 4. 3 0. 9 8 9 8 V6 17 18 19 8 8 0 0 2 7 8 5 0 1 0 0 9 0 8 0 8 8 0 9 8 0 0 8 9 0 3 0 6 7 0
Exercise 2. Here is a classic geometric problem, in the same application domain as the Center Selection problem: Given n points with Cartesian coordinates (₁, 3) in the plane, and positive weights w, find one(!) point (x, y) that minimizes the weighted sum of the Euclidean distances to the given points. For formal clarity: We want to minimize n Σwi i-1 n •√(x- i-1 (x − x)² + (y - y₁)². This problem is at least not very easy to solve exactly. In the following we therefore propose a rough but rather quick and simple approximation algorithm: Instead of the Euclidean distance, take the Manhattan distance and minimize 1 w₁(x − x₂|+|y-yil). 2.1. Explain how the point that minimizes the weigthed sum of Manhattan distances can be found in polynonial time. That is: Sketch an algorithm, argue why it is correct, and explain your time bound. Try to keep the time bound as low as possible. 2.2. Show that this algorithm has an approximation ratio √2. More specifi- cally: The point found by the…
Show that we can solve the telescope scheduling problem in O(n) time even if the list of n observation requests is not given to us in sorted order, provided that start and finish times are given as integer indices in the range from 1 to n2.
10. Apply Djikstra's Algorithm to find a shortest path from A to Z. Be sure to show each step of the algoriothm on a separate picture as discussed in class. Work carefully and pay attention to details. You need to clearly show how you are applying the algorithm. Also be sure to clearly name the verticies of a final shortest path B
Question 1: Apply A* method for finding the shortest route from S0 to We consider the problem described by the Graph below. The initial state is S0 and the goal state is S6. The heuristic of the states are presented in the table below SO 3 4 State (Si) Heuristic h(Si) si S3 SO 3 S2 3 S2 2 S3 7 S4 1 S5 4 S5 S6 S4 S6
By using python , Implement each of the following algorithms and use them to find a solution for the 8-queen problem. What the quality of solution (optimal or suboptimal) and execution time. If an algorithm did not produce a solution discuss then you need to include an analysis explaining why. Iterative Depth First Search (Hint :You should focus in coding in : How to represent the states , How to do Transition model , how to test the state whether it is the goal or not ,What is the best Initial state )
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
EXM.1.AHL.TZ0.37 IB [Maximum mark: 8] In this part, marks will only be awarded if you show the correct application of the required algorithms, and show all your working. In an offshore drilling site for a large oil company, the distances between the planned wells are given below in metres. 1 2 3 4 5 6 7 8 9 10 2 30 3 40 60 4 90 190 130 5 80 200 10 160 6 70 40 20 40 40 130 7 60 120 50 90 30 60 8 50 140 90 70 70 140 70 40 9 40 170 140 60 50 90 50 70 10 200 200 80 150 110 90 30 190 90 100 11 150 30 200 120 190 120 60 190 150 200 + It is intended to construct a network of paths to connect the different wells in a way that minimises the sum of the distances between them. Use Prim's algorithm, starting at vertex 3, to find a network of paths of minimum total length that can span the whole site. [8]
Provide a bottom-up DP solution to the Levenshtein Distance problem. State the timecomplexity of the algorithm and explain why that is so.
Please show the steps on how to accomplish this task 2. For equation X^2=X among infinite from left numbers there are 3 known solution: 0= ...00000, 1= ...00001 and 5^2^infinity = ...12890625. Give last 8 digits of one more solution whose last digit is 6: ...??????????6
(b) Suppose we have public key encryption system with E the encryption function and Dr the decryption function, where Er is publicly known for a key k and Dx is secret. Suppose further that the composition of the operations E and Dµ is com- mutative: Er o Dr = Dx o Ex. Propose a simple way to implement authenticating messages using components of this encryption system. Answer: to send a signed message x we compute and send: