Which of the following standard algorithms is not a Greedy algorithm?

Suppose we run Dijkstraâs single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized? (GATE CS 2004)

A networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains the following characters with their frequency:
**Note :** Each character in input message takes 1 byte.
If the compression technique used is Huffman Coding, how many bits will be saved in the message?

character Frequency a 5 b 9 c 12 d 13 e 16 f 45

What is the time complexity of Huffman Coding?

In question #2, which of the following represents the word *"dead"*?

Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.

Which of the following is true about Huffman Coding.

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length of Huffman codes?

Consider the undirected graph below:
Using Prim's algorithm to construct a minimum spanning tree starting with node A, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?