7127729
Beschreibung
Quiz von Mena Sargios, aktualisiert more than 1 year ago
|
Erstellt von Mena Sargios
vor etwa 8 Jahre
|
|
Frage 1
Frage
Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.
Antworten
- True
- False
Frage 2
Frage
What is a splay tree and what is the act of splaying?
Antworten
-
A splay tree is a self-adjusting binary search tree. The act of splaying is that after a node is accessed, it is moved up in the tree toward the root with AVL rotations.
-
none of the above
Frage 3
Frage
What is the Big O for average case of Reterieval for Splay trees?
Antworten
-
log(N)
-
O(N^2)
Frage 4
Frage
What is the benefit of using splay trees?
Antworten
-
it allows easier access to recently added values.
-
none of the above
Frage 5
Frage
Splaying is used for balancing binary search trees.
Antworten
- True
- False
Frage 6
Frage
What is the worst case to search a Splay tree?
Antworten
-
A.n
-
B.amortized O(log n)
-
C.n^2
-
D.none of these
Frage 7
Frage
How are splay trees different from AVL trees?
Antworten
-
Splay trees splay the node visited all the way to the root to make them more easily accessed.
-
none of the above
Frage 8
Frage
A splay tree is a type of balanced binary search tree.
Antworten
- True
- False
Frage 9
Frage
what do you trying to splay a node with the root(zig)?
Antworten
-
A) Avl single rotation
-
B) Avl double rotation
Frage 10
Frage
Which of the following is a disadvantage of a splay tree?
Antworten
-
a) Recently accessed items are at the bottom of the tree
-
b) Implementation is very complex
-
c) Splay trees are not very efficient
-
d) The tree height can potentially be n
Frage 11
Frage
What is a binary search tree with the additional property that recently
accessed elements are quick to access again called?
Antworten
-
A) B-Tree
-
B) Spray Tree
-
C) AVL Tree
-
D) Splay Tree
Frage 12
Frage
What algorithm do you need to use to create a minimum spanning tree?
Antworten
-
Prim’s Algorithm
-
none of the above
Frage 13
Frage
What is a splay tree?
Antworten
-
A. A tree with no leaves
-
B. A tree with two root nodes
-
C. A self-adjusting binary search tree
-
D. An empty tree
Frage 14
Frage
What is a splay tree?
Antworten
-
A) A self-adjusting binary search tree.
-
B) A tree that spreads out
-
C) there is no such thing
Frage 15
Frage
What is a condition for a zig-zag step?
Antworten
-
A. X is the right child of P and P is the right child of G
-
B. X is the left child of P and P is the left child of G
-
C. X is the left child of P and P is the right child of G
-
D. zig-zag is done when P is the root (therefore there is no G)
Frage 16
Frage
What are splay trees?
Antworten
-
A. self-adjusting binary sort trees
-
B. self-adjusting binary search trees
-
C. self-adjusting binary splay trees
-
D. non self-adjusting binary sort trees
Frage 17
Frage
When dealing with splay trees the condition for the Zig-Zag step is when X is the left child of P, and P is the right child of G, or When X si the right child of P and P is the left child of G.
Antworten
- True
- False
Frage 18
Frage
In average case, what is the efficiency of Deletion of an AVL tree?
Antworten
-
A. logn
-
B. nlogn
-
C. n
-
D. n2
Frage 19
Frage
Splay trees are NOT self adjusting Binary Search Trees.
Antworten
- True
- False
Frage 20
Frage
What is splaying?
Antworten
-
Moving the last accessed node in a tree to the root with AVL rotations.
-
none of the above
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.