Can someone check my answers and if any of them are wrong, very briefly explain

Question

Can someone check my answers and if any of them are wrong, very briefly explain why. Thanks. I will rate as soon as possible.

Assume that the length of a path in an unweighted graph is the number of edges on the path. c The maximum possible length of a shortest path in an unweighted graph with 7 vertices is 0 1 6 7 49 c The minimum number of edges in a spanning tree for a connected undirected graph with 10 vertices is 0 1 9 10 45 E The number of bytes in a Huffman code for a message consisting of 8 distinct symbols of equal probability is 1 2 3 8 24 a The maximum possible Huffman code length (in bits) for a symbol drawn from an alphabet of 3 symbols is 2 3 4 5 undetermined E Suppose in an input file X appears. with probability 0.4, Y appears with probability 0.2, and Z appears with probability 0.4. Which of the following cannot be a Huffman code for the sequence XYYZXY: 1000001100 10111101011 00010110001 0101000010 0101011010

Explanation / Answer

1) 6 Correct

2) 9 Correct

3) 3 (8 symbols means 3 bits each i.e 24 bits total = 3bytes)

4) 2 Correct

5) COrrect

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---