What is the greedy algorithm(the 3 steps) to create an encoding tree to compress files?
1. Assign each character to a node (making each a tree) and assign the frequency of the character as a weight. 2. Combine the two trees with the smallest weights as children into a new tree. Assign the weight of the new tree to the sum of the weights of it's children. 3. Repeat step 2 until all trees are combined.
none
What is the purpose of a greedy algorithm?
A.To find the shortage path
B.To find a cycle in a graph
C.All of the above
D.none of the above
Sometimes, a greedy algorithm dose not arrive at the optimal solution.
Dijkstra's Algorithim and Primm's Algorithim are both examples of which of the following?
A) Materialistic Algorithim
B) Simple Algorithim
C) Generous Algorithim
D) Greedy Algorithim
When you choose a path or route that minimizes the cost of the result.
Greedy algorithms
Huffman codes are primarily used to:
A. compress
B. encrpypt
C. find the shortest path between nodes
D. find a path touching all vertices once
What are the two major parts of Huffman Coding?
A. Deconstruct a Huffman tree from input characters and invert the Huffman Tree's codes
B. Build a Huffman tree from input characters and traverse the Huffman Tree and assign codes to characters
C. Build a Huffman tree from output characters and traverse the Huffman Tree and assign codes to specific lines
D. Deconstruct a Huffman tree from input characters and remove the Huffman Tree and assign codes
When creating a Huffman tree. Which of the following are the three steps needed to remember?
A.Characters are only stored at the leaves
B.Traversing to the left child, appends a 0
C.Traversing to the right child, appends a 1
D. Only B and C
E. A and B and C
Create a Huffman tree from the given frequency list:
a b c d 20 15 40 23
Answer:
98 / \ c 35 / / \ d b a
