Question 1

A multi-way search tree can have more than two children per node and can store more than one element in each node.

Accepted Answer

A) True 
 B)False  True

Question 2

How do insertions and deletions in a 2-4 tree compare to insertions and deletions in a 2-3 tree?

Accepted Answer

Insertions and deletions in a 2-4 tree are exactly like those of a 2-3 tree except that splits occur when there are four elements instead of three as in a 2-3 tree.

Question 3

Linked lists 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.

Accepted Answer

A) True 
 B)False  False

Question 4

___________ 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.

Accepted Answer

A)  Linked lists 
B)  Stacks 
C)  Queues 
D)  Arrays 
A)  Linked lists 
B)  Stacks 
C)  Queues 
D)  Arrays

Question 5

A ______ extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Accepted Answer

The answer of A ______ extends the concept of 2-3...

Question 6

When does a node in a 2-3 tree split?

Accepted Answer

A 2-3 tree node splits when it

Question 7

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

Accepted Answer

A) True 
 B)False

Question 8

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as ______.

Accepted Answer

The answer of Access to secondary storage is very slow...

Question 9

A 2-4 tree expands on the concept a 2-3 tree to include the use of _________.

Accepted Answer

A)  2-nodes 
B)  3-nodes 
C)  4-nodes 
D)  None of the above 
A)  2-nodes 
B)  3-nodes 
C)  4-nodes 
D)  None of the above

Question 10

Describe the process of deleting an element from a 2-3 tree.

Accepted Answer

Deletion from a 2-3 tree falls into one

Question 11

If the propagation effect of a 2-3 tree insertion causes the root to _________, the tree increases in height.

Accepted Answer

A)  Split 
B)  Be deleted 
C)  Rotate 
D)  None of the above 
A)  Split 
B)  Be deleted 
C)  Rotate 
D)  None of the above

Question 12

Access to ____________ storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

Accepted Answer

A)  recent 
B)  cache 
C)  secondary 
D)  cloud 
A)  recent 
B)  cache 
C)  secondary 
D)  cloud

Question 13

A __________ tree extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Accepted Answer

A)  2-4 
B)  B 
C)  2-3 
D)  B* 
A)  2-4 
B)  B 
C)  2-3 
D)  B*

Question 14

When is rotation no longer an option for rebalancing a 2-3 tree after a deletion?

Accepted Answer

If all of the nodes

Question 15

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.

Accepted Answer

The answer of Arrays may provide a better solution both...

Question 16

How can splitting a node in a 2-3 tree affect the rest of the tree?

Accepted Answer

If the split and resulting pro

Question 17

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree decreases in height.

Accepted Answer

A) True 
 B)False

Question 18

A 2-3 tree extends the concept of 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Accepted Answer

A) True 
 B)False

Question 19

Describe the nodes in a 2-4 tree.

Accepted Answer

Nodes in a 2-4 tree are exactl

Question 20

Inserting an element into a 2-3 tree can have a ripple effect up the tree causing the _______ of the tree to increase.

Accepted Answer

A)  order 
B)  height 
C)  type 
D)  None of the above 
A)  order 
B)  height 
C)  type 
D)  None of the above

A multi-way search tree can have more than two children per node and can store more than one element in each node.

How do insertions and deletions in a 2-4 tree compare to insertions and deletions in a 2-3 tree?

Linked lists 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.

___________ 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.

A ______ extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

When does a node in a 2-3 tree split?

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as ______.

A 2-4 tree expands on the concept a 2-3 tree to include the use of _________.

Describe the process of deleting an element from a 2-3 tree.

If the propagation effect of a 2-3 tree insertion causes the root to _________, the tree increases in height.

Access to ____________ storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

A __________ tree extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

When is rotation no longer an option for rebalancing a 2-3 tree after a deletion?

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.

How can splitting a node in a 2-3 tree affect the rest of the tree?

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree decreases in height.

A 2-3 tree extends the concept of 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Describe the nodes in a 2-4 tree.

Inserting an element into a 2-3 tree can have a ripple effect up the tree causing the _______ of the tree to increase.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Exam 12: Heaps and Priority Queues

A multi-way search tree can have more than two children per node and can store more than one element in each node.

How do insertions and deletions in a 2-4 tree compare to insertions and deletions in a 2-3 tree?

Linked lists 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.

___________ 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.

A ______ extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

When does a node in a 2-3 tree split?

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as ______.

A 2-4 tree expands on the concept a 2-3 tree to include the use of _________.

Describe the process of deleting an element from a 2-3 tree.

If the propagation effect of a 2-3 tree insertion causes the root to _________, the tree increases in height.

Access to ____________ storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

A __________ tree extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

When is rotation no longer an option for rebalancing a 2-3 tree after a deletion?

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.

How can splitting a node in a 2-3 tree affect the rest of the tree?

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree decreases in height.

A 2-3 tree extends the concept of 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Describe the nodes in a 2-4 tree.

Inserting an element into a 2-3 tree can have a ripple effect up the tree causing the _______ of the tree to increase.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters