Would apprecaite any help with either three of these problems. Suppose a documen

Question

Would apprecaite any help with either three of these problems.

Suppose a document contains 22 A, 12 B, 24 C, 6 D, 27 E, 9 F. Determine the best manner to encode each character with the least number of bits by a greedy approach. Describe a Greedy approach for constructing a minimum spanning tree and apply it to the following graph. Backtracking algorithms resemble what type of traversal of a graph. For the above graph, what is the order that the nodes would be processed by a backtracking algorithm?

Explanation / Answer

Please rate with 5 stars :)

Here is what you want:

http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/mst.htm

This algo basically chooses the edges with the smallest weights and continues to do this until all the vertices have been covered.

CHeers!

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---