Question 51 : Which of the following algorithms is the best approach for solving Huffman codes?
1. exhaustive search
2. greedy algorithm
3. brute force algorithm
4. divide and conquer algorithm
View Answer   Discuss with Members

Question 52 : An optimal code will always be present in a full tree.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 53 : The type of encoding where no character code is the prefix of another character code is called?
1. optimal encoding
2. prefix encoding
3. frequency encoding
4. trie encoding
View Answer   Discuss with Members

Question 54 : The main time taking step in fractional knapsack problem is ___________
1. Breaking items into fraction
2. Adding items into knapsack
3. Sorting
4. Looping through sorted items
View Answer   Discuss with Members

Question 55 : Which bit is reserved as a parity bit in an ASCII set?
1. first
2. seventh
3. eighth
4. tenth
View Answer   Discuss with Members