Test
1. Trees Splay Trees
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (20)
1Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.
- AVerdadero
- BFalso
2What is a splay tree and what is the act of splaying?
- AA 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. - Bnone of the above
- AA splay tree is a self-adjusting binary search tree. The act of splaying is
3What is the Big O for average case of Reterieval for Splay trees?
- Alog(N)
- BO(N^2)
4What is the benefit of using splay trees?
- Ait allows easier access to recently added values.
- Bnone of the above
5Splaying is used for balancing binary search trees.
- AVerdadero
- BFalso
6What is the worst case to search a Splay tree?
- AA.n
- BB.amortized O(log n)
- CC.n^2
- DD.none of these
7How are splay trees different from AVL trees?
- ASplay trees splay the node visited all the way to the root to make them more easily accessed.
- Bnone of the above
8A splay tree is a type of balanced binary search tree.
- AVerdadero
- BFalso
9what do you trying to splay a node with the root(zig)?
- AA) Avl single rotation
- BB) Avl double rotation
10Which of the following is a disadvantage of a splay tree?
- Aa) Recently accessed items are at the bottom of the tree
- Bb) Implementation is very complex
- Cc) Splay trees are not very efficient
- Dd) The tree height can potentially be n
11What is a binary search tree with the additional property that recently
accessed elements are quick to access again called?- AA) B-Tree
- BB) Spray Tree
- CC) AVL Tree
- DD) Splay Tree
12What algorithm do you need to use to create a minimum spanning tree?
- APrim’s Algorithm
- Bnone of the above
13What is a splay tree?
- AA. A tree with no leaves
- BB. A tree with two root nodes
- CC. A self-adjusting binary search tree
- DD. An empty tree
14What is a splay tree?
- AA) A self-adjusting binary search tree.
- BB) A tree that spreads out
- CC) there is no such thing
15What is a condition for a zig-zag step?
- AA. X is the right child of P and P is the right child of G
- BB. X is the left child of P and P is the left child of G
- CC. X is the left child of P and P is the right child of G
- DD. zig-zag is done when P is the root (therefore there is no G)
16What are splay trees?
- AA. self-adjusting binary sort trees
- BB. self-adjusting binary search trees
- CC. self-adjusting binary splay trees
- DD. non self-adjusting binary sort trees
17When 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.
- AVerdadero
- BFalso
18In average case, what is the efficiency of Deletion of an AVL tree?
- AA. logn
- BB. nlogn
- CC. n
- DD. n2
19Splay trees are NOT self adjusting Binary Search Trees.
- AVerdadero
- BFalso
20What is splaying?
- AMoving the last accessed node in a tree to the root with AVL rotations.
- Bnone of the above
Información
- Descripción
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Idioma
- English
- Visitas
- 251
- Historial
- Creado el 27 nov 2016 · actualizado el 7 dic 2016
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test