a,b,ca,c Question 18 (17.5 points) Saved Given a graph that is a tree (connected and acyclic). (I)
Pick any vertex v. (II) Compute the shortest path from v to every other vertex. Let w be the vertex
with the largest shortest path distance. (III) Compute the shortest path from w to every other
vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x.
Which of the following are true a. p is the longest path in the graph b. p is the shortest path in the
graph c. p can be calculated in time linear in the number of edges/vertices Question 19(17.5
points) Saved I am given a file F which has all the 128 ASCII characters, all with the same
frequency. What is the number of internal nodes of the the Huffman tree? 16 127 7 10 Question 20
(17.5 points) Saved This graph has an Eulerian tour or cycle True.
History Class XII Ch. 3 Kinship, Caste and Class (1).pptx
abcac Question 18 175 points Saved Given a graph that.pdf
1. a,b,ca,c Question 18 (17.5 points) Saved Given a graph that is a tree (connected and acyclic). (I)
Pick any vertex v. (II) Compute the shortest path from v to every other vertex. Let w be the vertex
with the largest shortest path distance. (III) Compute the shortest path from w to every other
vertex. Let x be the vertex with the largest shortest path distance. Consider the path p from w to x.
Which of the following are true a. p is the longest path in the graph b. p is the shortest path in the
graph c. p can be calculated in time linear in the number of edges/vertices Question 19(17.5
points) Saved I am given a file F which has all the 128 ASCII characters, all with the same
frequency. What is the number of internal nodes of the the Huffman tree? 16 127 7 10 Question 20
(17.5 points) Saved This graph has an Eulerian tour or cycle True
