1. Use Dijkstra's algorithm to find the shortest path length betweenthe vertices a and z in each of the following weighted graphs.(a)(b)12b2d3b2194453C3e78622. Use Huffman coding to encode these symbols with given frequen-cies:(a) a0.35, b: 0.4, c: 0.2, d: 0.05.(b) a 0.15, b: 0.35, c: 0.23, d: 0.22, e: 0.04, f: 0.01.

Answered: 1. Use Dijkstra's algorithm to find the…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Complete a path straight at vertex a that ends at vertex c.
4. Use the tree rooted at A to answer the following questions. A K E L B M O H P D N Q R (a) List the order of the vertices produced by using Breadth-First Search. (b) List the order of the vertices produced by using Pre-Order Depth First Search. (c) List the order of the vertices produced by using Post-Order Depth First Search.
Use the high-level version of Dijkstra's algorithm to find the shortest paths from the vertex v4 to all the other vertices of the graph below. Show the actions step by step. Assume that each undirected edge represents two directed edges with the same weight.
A B с D E F A 40 B 40 : с 9 30 DE F -- 9 30 19 5 6 35 31 50 44 8 18 42 23 T 19 35 8 5 31 18 6 50 42 44 23 29 29 The weights of edges in a graph are shown in the table above. Apply the sorted edges algorithm to the graph. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA
Use Djkstra's algorithm to find the shortest path from a to z. in order to get credit for this question you must SHOW ALL WORK. 3.
(h) Suppose that G is an unconnected graph that consists of 4 connected components. The first component is K4, the second is K2,2, the third is C4 and the fourth is a single vertex. Your job is to show how to add edges to G so that the graph has an Euler tour. Justify that your solution is the minimum number of edges added.
Given the graph A 1 Edge EF Edge BC O Edge CE B O Edge DF 2 D 3 F 2 3 5 E نیا 7 G 3 10 All the following edges have weight equal to 3 EXCEPT 6 H
9. Let G2 be depicted in the following diagram: b h a d 9(d) Give an example of a walk of length five in G2 that is not a path.
1. Use Dijkstra's algorithm to find the shortest path length between the vertices a and z in each of the following weighted graphs. (a) (b) a a 2 1 2 1 2 d 3 b d b f 2 4 4 5 3 1 с e 7 g с e 1 6 2
A 39 B á 38 62 5 F 42 G ß. В 40 20 14 a D C Fig 1 a=10*a B=10*b, where a = 1 and b = 2 Use the graph as in but now the dots (vertices) are locations inthecity of Stockholm, and the dashed lines are paths between the locations (edges). The numbers now show the length (in meters) of the paths. The goal here is to find the shortest path between location A and location D! Use the steps of Dijkstras algorithm to find the minimal distance spanning tree from A to all other locations in fig 1! Build up the minimal distance tree from vertex A by adding one edge and one vertex at a time (and report every new graph as it builds up), always picking the new edge and new vertex which attaches to the current tree and gives the minimum distance to vertex A (remember to avoid circuits!). When you have built up the total minimal distance spanning tree from vertex A, containing all vertices of the graph, answer what the minimal distance from vertex A to vertex D is and which path this corresponds to!
Using Dijkstra' s algorithm, find the minimum cost from D to every other node and hence find the shortest path from the node D to C. D 2 E 1 F 3 4 A 2 В 2 C LO 2,
4. (a) Use Dijkstra's algorithm to find the shortest path from node A to node F in the following network and give its length. A с 2 5 B 24 13 6 3 F D 14 Weight [kg] 40 50 60 40 250 200 70 190 1 E (b) A museum wants to ship 8 Roman statues for a special exhibition. They are to be transported in crates each holding a maximum weight of 300 kilograms. The numbers in the table represent the weight in kilograms of the statues: Statue Mercury Venus Tellus Mars Jupiter Saturn Caelus Neptune (i) Find the lower bound for the number of crates required to fit all statues. (ii) Use the first fit decreasing algorithm to estimate the minimum number of crates required to ship all statues. Does the first fit decreasing algorithm give an optimal solution? (iii) Find by trial and error a solution needing only & crates.

SEE MORE QUESTIONS

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS

1. Use Dijkstra's algorithm to find the shortest path length between the vertices a and z in each of the following weighted graphs. (a) (b) a a 2 b 2 di 3 2 4 4 5 b 3 C e 7 1 2