7127729
Descripción
Test por Mena Sargios, actualizado hace más de 1 año
|
Creado por Mena Sargios
hace más de 7 años
|
|
Pregunta 1
Pregunta
Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.
Respuesta
- True
- False
Pregunta 2
Pregunta
What is a splay tree and what is the act of splaying?
Respuesta
-
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
Pregunta 3
Pregunta
What is the Big O for average case of Reterieval for Splay trees?
Respuesta
-
log(N)
-
O(N^2)
Pregunta 4
Pregunta
What is the benefit of using splay trees?
Respuesta
-
it allows easier access to recently added values.
-
none of the above
Pregunta 5
Pregunta
Splaying is used for balancing binary search trees.
Respuesta
- True
- False
Pregunta 6
Pregunta
What is the worst case to search a Splay tree?
Respuesta
-
A.n
-
B.amortized O(log n)
-
C.n^2
-
D.none of these
Pregunta 7
Pregunta
How are splay trees different from AVL trees?
Respuesta
-
Splay trees splay the node visited all the way to the root to make them more easily accessed.
-
none of the above
Pregunta 8
Pregunta
A splay tree is a type of balanced binary search tree.
Respuesta
- True
- False
Pregunta 9
Pregunta
what do you trying to splay a node with the root(zig)?
Respuesta
-
A) Avl single rotation
-
B) Avl double rotation
Pregunta 10
Pregunta
Which of the following is a disadvantage of a splay tree?
Respuesta
-
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
Pregunta 11
Pregunta
What is a binary search tree with the additional property that recently
accessed elements are quick to access again called?
Respuesta
-
A) B-Tree
-
B) Spray Tree
-
C) AVL Tree
-
D) Splay Tree
Pregunta 12
Pregunta
What algorithm do you need to use to create a minimum spanning tree?
Respuesta
-
Prim’s Algorithm
-
none of the above
Pregunta 13
Pregunta
What is a splay tree?
Respuesta
-
A. A tree with no leaves
-
B. A tree with two root nodes
-
C. A self-adjusting binary search tree
-
D. An empty tree
Pregunta 14
Pregunta
What is a splay tree?
Respuesta
-
A) A self-adjusting binary search tree.
-
B) A tree that spreads out
-
C) there is no such thing
Pregunta 15
Pregunta
What is a condition for a zig-zag step?
Respuesta
-
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)
Pregunta 16
Pregunta
What are splay trees?
Respuesta
-
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
Pregunta 17
Pregunta
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.
Respuesta
- True
- False
Pregunta 18
Pregunta
In average case, what is the efficiency of Deletion of an AVL tree?
Respuesta
-
A. logn
-
B. nlogn
-
C. n
-
D. n2
Pregunta 19
Pregunta
Splay trees are NOT self adjusting Binary Search Trees.
Respuesta
- True
- False
Pregunta 20
Pregunta
What is splaying?
Respuesta
-
Moving the last accessed node in a tree to the root with AVL rotations.
-
none of the above
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.