Top MCQs on Greedy Algorithms with Answers

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: 

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

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?

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?

What is the other name of Dijkstra algorithm?

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?

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:

Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency