Question 1

External mergesort begins by merging sorted runs.

Accepted Answer

A) True 
 B)False  False

Question 2

What type of tree is best used for indexing external data?

Accepted Answer

A) B-tree 
B) binary search tree 
C) 2-3-4 tree 
D) AVL tree 
A) B-tree 
B) binary search tree 
C) 2-3-4 tree 
D) AVL tree A

Question 3

In a B-tree,the key values at each node are always in sorted order (i.e ascending or descending order).

Accepted Answer

A) True 
 B)False  True

Question 4

Let N be a node in a B-tree.If N has m subtrees S0,S1,S2,…,Sm-1,and N's key values are K1,K2,K3,…,Km-1,then which of the following statements is true?

Accepted Answer

A) All values in subtree S0 are greater than K1. 
B) All values in subtree S1 are less than K1. 
C) All values in subtree Sm-2 are greater than Km-2. 
D) All values in subtree Sm-1 are less than Km-1. 
A) All values in subtree S0 are greater than K1. 
B) All values in subtree S1 are less than K1. 
C) All values in subtree Sm-2 are greater than Km-2. 
D) All values in subtree Sm-1 are less than Km-1.

Question 5

A 2-3 tree is a type of B-tree.

Accepted Answer

A) True 
 B)False

Question 6

What is the maximum number of nodes in a B tree of height 3 and degree 10?

Accepted Answer

The answer of What is the maximum number of nodes...

Question 7

Inserting a single key value into a B-tree can result in more than one node splitting operation.

Accepted Answer

A) True 
 B)False

Question 8

Why is random access preferable over sequential access for supporting external tables?

Accepted Answer

In random access,you can directly access

Question 9

In the external version of mergesort,if we begin by performing 16 sorted runs with 1 block each,what is the next step?

Accepted Answer

A) 1 sorted run,16 blocks each 
B) 2 sorted runs,8 blocks each 
C) 4 sorted runs,4 blocks each 
D) 8 sorted runs,2 blocks each 
A) 1 sorted run,16 blocks each 
B) 2 sorted runs,8 blocks each 
C) 4 sorted runs,4 blocks each 
D) 8 sorted runs,2 blocks each

Question 10

In a binary search tree,if a node has two children,then how many key values does the node itself contain?

Accepted Answer

A) none 
B) one 
C) two 
D) the number may vary 
A) none 
B) one 
C) two 
D) the number may vary

Question 11

If a B-tree of order 5 contains the key values 20,40,50,60,80,90 and 100,and the root contains only the key value 60,then deleting the key 20 will require us to merge the two child nodes.

Accepted Answer

A) True 
 B)False

Question 12

When deleting a key value from a B-tree,what happens if this results in its node becoming empty?

Accepted Answer

A) A new root node must be created. 
B) A new child node must be created. 
C) The empty node must merge with another node. 
D) The empty node must split into two nodes. 
A) A new root node must be created. 
B) A new child node must be created. 
C) The empty node must merge with another node. 
D) The empty node must split into two nodes.

Question 13

Which statement is true about B-trees?

Accepted Answer

A) Traversals of a table can be done in sorted order more efficiently than a hash table. 
B) All nodes are children of the root. 
C) The root node contains either the largest or smallest key value. 
D) If there are n nodes in the B-tree,then the height of the tree is log2 n. 
A) Traversals of a table can be done in sorted order more efficiently than a hash table. 
B) All nodes are children of the root. 
C) The root node contains either the largest or smallest key value. 
D) If there are n nodes in the B-tree,then the height of the tree is log2 n.

Question 14

How does a search of a key value in a B-tree differ from a search in a binary search tree?

Accepted Answer

In general,each node may have several ke

Question 15

What is the advantage of using a B-tree instead of a 2-3 tree for indexing external data?

Accepted Answer

A B-tree has a shorter height because it

Question 16

Which ADT operation(s)on an external file require us to transfer information to/from internal memory?

Accepted Answer

A) removals only 
B) insertions only 
C) insertions and removals only 
D) insertions,removals and retrievals 
A) removals only 
B) insertions only 
C) insertions and removals only 
D) insertions,removals and retrievals

Question 17

Mergesort requires us to store the entire array of key values in internal memory before we can begin the merge operation.

Accepted Answer

A) True 
 B)False

Question 18

Which of the following information is not necessary in order to perform (i.e.invoke)a readBlock operation?

Accepted Answer

A) buffer 
B) file 
C) block number 
D) the data contained in the block 
A) buffer 
B) file 
C) block number 
D) the data contained in the block

Question 19

An index file consists of index records.An index records consists of two parts: a key and a ______.

Accepted Answer

A) hash value 
B) node 
C) pointer 
D) value 
A) hash value 
B) node 
C) pointer 
D) value

Question 20

Random access file organization behaves like a linked list in the way we access its data.

Accepted Answer

A) True 
 B)False

External mergesort begins by merging sorted runs.

What type of tree is best used for indexing external data?

In a B-tree,the key values at each node are always in sorted order (i.e ascending or descending order).

Let N be a node in a B-tree.If N has m subtrees S0,S1,S2,…,Sm-1,and N's key values are K1,K2,K3,…,Km-1,then which of the following statements is true?

A 2-3 tree is a type of B-tree.

What is the maximum number of nodes in a B tree of height 3 and degree 10?

Inserting a single key value into a B-tree can result in more than one node splitting operation.

Why is random access preferable over sequential access for supporting external tables?

In the external version of mergesort,if we begin by performing 16 sorted runs with 1 block each,what is the next step?

In a binary search tree,if a node has two children,then how many key values does the node itself contain?

If a B-tree of order 5 contains the key values 20,40,50,60,80,90 and 100,and the root contains only the key value 60,then deleting the key 20 will require us to merge the two child nodes.

When deleting a key value from a B-tree,what happens if this results in its node becoming empty?

Which statement is true about B-trees?

How does a search of a key value in a B-tree differ from a search in a binary search tree?

What is the advantage of using a B-tree instead of a 2-3 tree for indexing external data?

Which ADT operation(s)on an external file require us to transfer information to/from internal memory?

Mergesort requires us to store the entire array of key values in internal memory before we can begin the merge operation.

Which of the following information is not necessary in order to perform (i.e.invoke)a readBlock operation?

An index file consists of index records.An index records consists of two parts: a key and a ______.

Random access file organization behaves like a linked list in the way we access its data.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

Filters

Exam 15: External Methods

External mergesort begins by merging sorted runs.

What type of tree is best used for indexing external data?

In a B-tree,the key values at each node are always in sorted order (i.e ascending or descending order).

Let N be a node in a B-tree.If N has m subtrees S0,S1,S2,…,Sm-1,and N's key values are K1,K2,K3,…,Km-1,then which of the following statements is true?

A 2-3 tree is a type of B-tree.

What is the maximum number of nodes in a B tree of height 3 and degree 10?

Inserting a single key value into a B-tree can result in more than one node splitting operation.

Why is random access preferable over sequential access for supporting external tables?

In the external version of mergesort,if we begin by performing 16 sorted runs with 1 block each,what is the next step?

In a binary search tree,if a node has two children,then how many key values does the node itself contain?

If a B-tree of order 5 contains the key values 20,40,50,60,80,90 and 100,and the root contains only the key value 60,then deleting the key 20 will require us to merge the two child nodes.

When deleting a key value from a B-tree,what happens if this results in its node becoming empty?

Which statement is true about B-trees?

How does a search of a key value in a B-tree differ from a search in a binary search tree?

What is the advantage of using a B-tree instead of a 2-3 tree for indexing external data?

Which ADT operation(s)on an external file require us to transfer information to/from internal memory?

Mergesort requires us to store the entire array of key values in internal memory before we can begin the merge operation.

Which of the following information is not necessary in order to perform (i.e.invoke)a readBlock operation?

An index file consists of index records.An index records consists of two parts: a key and a ______.

Random access file organization behaves like a linked list in the way we access its data.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

Filters