Chapter 25 Flashcards
1
Q
Does the binary tree constructed by huffman algorithm a full binary tree
A
Yes
2
Q
What is the first step of huffman algorithm
A
The greedy step
3
Q
What is activity selection
A
A resource is to be shared but in a way that it should be exclusive in each turn.
4
Q
Does solution will be optimal if we select short duration activities
A
No. It will be non-optimal
