If the ______________ effect of a 2-3 tree insertion causes the root to split, t
ID: 666699 • Letter: I
Question
If the ______________ effect of a 2-3 tree insertion causes the root to split, the tree increases in height.
A __________ tree expands on the concept a 2-3 tree to include the use of 4-nodes.
A ___________ extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.
Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as __________
Arrays may provide a better solution both within a B-tree ______ and for collecting B-tree nodes because they are effective in both primary memory and secondary storage.
An _____________ graph is a graph where the pairings representing the edges are unordered.
Two vertices in a graph are adjacent if there is an edge _____________ them.
An undirected graph is considered complete if it has the _________ number of edges connecting vertices.
A _____ is a sequence of edges that connects two vertices in a graph.
A cycle is a path in which the first and last vertices are ______________ and none of the edges are repeated.
An undirected tree is a connected, ___________ undirected graph with one element designated as the root.
A ___________ sometimes referred as a digraph, is a graph where the edges are ordered pairs of vertices.
A path in a directed graph is a sequence of ___________ edges that connects two vertices in a graph.
A _____________ or a weighted graph, is a graph with weights or costs associated with each edge.
The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a stack instead of a ______________ to manage the traversal.
A graph is ___________ if and only if the number of vertices in the breadth-first traversal is the same as the number of vertices in the graph regardless of the starting vertex.
A spanning tree is a tree that includes all of the _____ of a graph and some, but possibly not all, of the ____
A ______ is a spanning tree where the sum of the weights of the edges is less than or equal to the sum of the weights for any other spanning tree for the same graph.
In hashing, elements are stored in a hash table, with their location in the table determined by a ______
The situation where two elements or keys map to the same location in the table is called a ____A hashing function that maps each element to a ______ in the table is said to be a perfect hashing function.
_____ involves using only a part of the element’s value or key to compute the location at which to store the element.
The division method is very effective when dealing with an ____set of key values.
In the _____ method, the parts of the key are added together to create the index.
The ____method for handling collisions simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.
The _____method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.
The load factor is the ____percentage occupancy allowed in the hash table before it is resized.
A set is a nonlinear collection in which there is essentially no inherent ____to the elements in the collection.
The ____ of the collection operations should not affect the way users interact with the collection.
In the Java Collections API and throughout this text, ___indicate both the underlying data structure and the collection.
The difference between a __and __is that a __stores the key and the data together while a __separates the key from the data and only stores the key and a reference to the data.
In the Java Collections API, sets and maps are __ with a wide variety of implementations
Explanation / Answer
1.
If the propagation effect of a 2-3 tree insertion causes the root to split, the tree increases in height.
2.
A 2-4 tree expands on the concept a 2-3 tree to include the use of 4-nodes.
3.
A B-Tree extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.
4.
Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as B-Trees
5.
Arrays may provide a better solution both within a B-tree node and for collecting B-tree nodes because they are effective in both primary memory and secondary storage.
6.
An undirected graph is a graph where the pairings representing the edges are unordered.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.