Test
5. B-Tree
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 (18)
1What are b-tree's optimized for in comparison to binary search trees?
- ABinary search tree's have a very long height and they aren't made for massive blocks of data
whereas b-tree's are optimized for systems reading and writing large blocks of data and is best
utilized when it is written to external memory sources or disk. - Bnone of the above
- ABinary search tree's have a very long height and they aren't made for massive blocks of data
2You hired to create a database for a large corporation. Your
employeers want you to organize their data in a tree data structure.
Which is an appropriate tree data structure?- AA) AVL Tree
- BB) 2-3 Tree
- CC) B-Tree
- DD) Red/Black Tree
3What makes a b-tree seperate from a binary tree?
- AEach node can have multiple elements of (n) with children of (n+1)
- Bnone of the above
4Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations?
- AA.Database relations have a large number of records
- BB.Database relations are sorted on the primary key
- CC.B-trees require less memory than binary search trees
- DD.Data transfer form disks is in blocks
5What are B-tree's optimized to do?
- AReadn and write large blocks of data
- Bnone of the above
6B-Tree is a self-balancing search tree.
- AVerdadero
- BFalso
7in a binary search tree, a node can have up to ______ children, while in a 2-3 tree it can have up to ________ children,
and in a 2-3-4 tree a node can have up to _____ chidlren?- AA.2, 2, 2
- BB.2, 1, 3
- CC.2, 3, 4
- DD.2, 4, 1
8Which of the following is true of B-trees?
- Aa. The data items are stored at leaves.
- Bb. The nonleaf nodes store up to M-1 keys to guide the searching.
- Cc. The root is either a leaf or has between two and M children.
- Dd. All of these are true!
9What is the worst case search time for a B-Tree?
- AA) O(n^2)
- BB) O(n log n)
- CC) O(log n)
- DD) O(n)
10The B-tree:
- Aa. Keeps values balanced with a sorting algorithm
- Bb. uses partially full blocks to speed insertions and deletions
- Cc. keys are in sorted order for reverse sequential traversing
- Dd. None of the above
11Which of the following are B-Trees?
- AA. 2-3 Tree
- BB. 2-3-4 Tree
- CC. Red-Black Tree
- DD. A and B
12What is a B-Tree?
- AA) A tree with only right children
- BB) A tree with only left children
- CC) A tree in which a node can have more than two children
- DD) None
13Which of the following is TRUE about B-Trees?
- AA. B-trees aim to have the largest tree height possible
- BB. if a B-tree has M children, each node will hold (M + 1) keys
- CC. the max number of children is not user-defined
- DD. if a B-tree has M children, each node will hold (M - 1) keys
14Which of the following is correct about B-trees?
- AA. A B-tree is a tree data structure that does not sort data or allow searches, insertions, and deletions in logarithmic amortized time.
- BB. A B-tree is a tree data structure that cannot keep data sorted or allow searches, insertions, and deletions in logarithmic amortized time.
- CC. A B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time.
- DD. A B-tree is a tree data structure that rewrites data and fails to sort or allow searches, insertions, and deletions in logarithmic amortized time.
15When talking about a B tree the number of children does NOT need to be greater than the number of the branching factor.
- AVerdadero
- BFalso
16The B-tree is a generalization of a binary search tree in that a node can have more than two children
According to Knuth's definition, Which is not correct the following properties of B-tree of order m?- Aa. Every node has at most m children. All leaves appear in the same level
- Bb. Every non-leaf node (except root) has at least ?m/2? children.
- Cc. The root has at least two children if it is not a leaf node.
- Dd. All leaves don't need to appear in the same level
17which one is not right about the B tree?
- AA. one node in a B tree can has a variable number of child nodes.
- BB. Red_black trees B-trees of order 2.
- CC. 2–3 trees are B-trees of order 3.
- DD. 2–3–4 trees are B-trees of order 4.
18In a B-tree how many children will each nonleaf node have (excluding root) ?
- AA) M/2 rounded down
- BB) M-1
- CC) M/2 rounded up
- DD) M+1
Información
- Descripción
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Autor
- Mena Sargios
- Idioma
- English
- Visitas
- 693
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test