7137452
Beschreibung
Quiz von Mena Sargios, aktualisiert more than 1 year ago
|
Erstellt von Mena Sargios
vor etwa 8 Jahre
|
|
Frage 1
Frage
What is the greedy algorithm(the 3 steps) to create an encoding tree to compress files?
Antworten
-
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
Frage 2
Frage
What is the purpose of a greedy algorithm?
Antworten
-
A.To find the shortage path
-
B.To find a cycle in a graph
-
C.All of the above
-
D.none of the above
Frage 3
Frage
Sometimes, a greedy algorithm dose not arrive at the optimal solution.
Antworten
- True
- False
Frage 4
Frage
Dijkstra's Algorithim and Primm's Algorithim are both examples of
which of the following?
Antworten
-
A) Materialistic Algorithim
-
B) Simple Algorithim
-
C) Generous Algorithim
-
D) Greedy Algorithim
Frage 5
Frage
When you choose a path or route that minimizes the cost of the result.
Antworten
-
Greedy algorithms
-
none
Frage 6
Frage
Huffman codes are primarily used to:
Antworten
-
A. compress
-
B. encrpypt
-
C. find the shortest path between nodes
-
D. find a path touching all vertices once
Frage 7
Frage
What are the two major parts of Huffman Coding?
Antworten
-
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
Frage 8
Frage
When creating a Huffman tree. Which of the following are the three steps needed to remember?
Antworten
-
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
Frage 9
Frage
Create a Huffman tree from the given frequency list:
a b c d
20 15 40 23
Antworten
-
Answer: 98 / \ c 35 / / \ d b a
-
none
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.