Top MCQs on Greedy Algorithms with Answers

What is the time complexity of Huffman Coding?

Which of the following does not use Greedy approach?

What is the time complexity of the greedy algorithm for the coin change problem?

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

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 weights and values of items listed below. Note that there is only one unit of each item.

The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by V_opt. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by V_greedy. The value of V_opt − V_greedy is ______ . 

Consider a job scheduling problem with 4 jobs J₁, J₂, J₃, J₄ and with corresponding deadlines: ( d₁, d₂, d₃, d₄) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?

Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1≤ i < j ≤ 100} and weight of the edge (vi, vj)  is ∣i–j∣. The weight of minimum spanning tree of G is ________.
 

Consider the string abbccddeee. Each letter in the string must be assigned a binary code satisfying the following properties:

• For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter.
• For any two letters of the same frequency, the letter which occurs earlier in the dictionary order is assigned a code whose length is at most the length of the code assigned to the other letter.

Among the set of all binary code assignments which satisfy the above two properties, what is the minimum length of the encoded string?