Discuss Forum
1. In Mainframe environment, the ___ terminal does not process data.
- A. Intelligent
- B. Intelligent
- C. Intelligent
- D. Intelligent
Answer: Option C
Explanation:
The time complexity of the Huffman algorithm is O(nlogn). Using a heap to store the weight of each tree, each iteration requires O(logn) time to determine the cheapest weight and insert the new weight. There are O(n) iterations, one for each item.
Post your comments here: