Question 41 : Fractional knapsack problem can be solved in time O(n).
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 42 : Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of knapsack=20. Find the maximum value output assuming items to be divisible.
1. 60
2. 80
3. 100
4. 40
View Answer   Discuss with Members

Question 43 : Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
1. In 0/1 knapsack problem items are divisible and in fractional knapsack items are indivisible
2. Both are the same
3. 0/1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic programming
4. In 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible
View Answer   Discuss with Members

Question 44 : What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
1. O(C)
2. O(log C)
3. O(C log C)
4. O(C²)
View Answer   Discuss with Members

Question 45 : How many bits are needed for standard encoding if the size of the character set is X?
1. log X
2. X+1
3. 2X
4. X²
View Answer   Discuss with Members

Question 46 : The result of the fractional knapsack is greater than or equal to 0/1 knapsack.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 47 : Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack=40. Find the maximum value output assuming items to be divisible and nondivisible respectively.
1. 100, 80
2. 110, 70
3. 130, 110
4. 110, 80
View Answer   Discuss with Members

Question 48 : What will be the cost of the code if character c_i is at depth d_i and occurs at frequency f_i?
1. c_if_i
2. ∫c_if_i
3. ∑f_id_i
4. f_id_i
View Answer   Discuss with Members

Question 49 : What is the objective of the knapsack problem?
1. To get maximum total value in the knapsack
2. To get minimum total value in the knapsack
3. To get maximum weight in the knapsack
4. To get minimum weight in the knapsack
View Answer   Discuss with Members

Question 50 : What is the running time of the Huffman encoding algorithm?
1. O(C)
2. O(log C)
3. O(C log C)
4. O( N log C)
View Answer   Discuss with Members