Question 1

What is the maximum and the minimum number of children that an internal node can have in a 2-3 tree?

Accepted Answer

An internal node can have a maximum of 3 children and a minimum of 2 children in a 2-3 tree.

Question 2

What is a collision?

Accepted Answer

A collision is a condition that occurs when a hash function maps two or more distinct search keys into the same location.

Question 3

In a 2-3 tree,______.

Accepted Answer

A) all internal nodes have 2 children 
B) all internal nodes have 3 children 
C) all leaves are at the same level 
D) all nodes have 2 data items 
A) all internal nodes have 2 children 
B) all internal nodes have 3 children 
C) all leaves are at the same level 
D) all nodes have 2 data items C

Question 4

In designing a hash table,why do we want the size of the table to be significantly larger than the maximum number of entries that we will insert into it?

Accepted Answer

To reduce

Question 5

A(n)______ is a balanced binary search tree.

Accepted Answer

A) 2-3 tree 
B) 2-3-4 tree 
C) red-black 
D) AVL 
A) 2-3 tree 
B) 2-3-4 tree 
C) red-black 
D) AVL

Question 6

A hash table is a(n)______.

Accepted Answer

A) stack 
B) queue 
C) array 
D) list 
A) stack 
B) queue 
C) array 
D) list

Question 7

A balanced binary search tree would have the maximum height possible for the tree.

Accepted Answer

A) True 
 B)False

Question 8

______ is a collision-resolution scheme that uses an array of linked lists as a hash table.

Accepted Answer

A) Linear probing 
B) Double hashing 
C) Quadratic probing 
D) Separate chaining 
A) Linear probing 
B) Double hashing 
C) Quadratic probing 
D) Separate chaining

Question 9

If a particular 2-3 tree does NOT contain 3-nodes,it is like a ______.

Accepted Answer

A) general tree 
B) binary search tree 
C) full binary tree 
D) complete binary tree 
A) general tree 
B) binary search tree 
C) full binary tree 
D) complete binary tree

Question 10

What is a 3-node?

Accepted Answer

A 3-node is a tree n

Question 11

In a 3-node,______.

Accepted Answer

A) the left child has the largest search key 
B) the middle child has smallest search key 
C) the middle child has the largest search key 
D) the right child has the largest search key 
A) the left child has the largest search key 
B) the middle child has smallest search key 
C) the middle child has the largest search key 
D) the right child has the largest search key

Question 12

The height of a binary tree is sensitive to the order in which items are inserted into the tree.

Accepted Answer

A) True 
 B)False

Question 13

A node that contains one data item and has two children is called a ______.

Accepted Answer

A) 1-node 
B) 2-node 
C) single node 
D) double node 
A) 1-node 
B) 2-node 
C) single node 
D) double node

Question 14

The load factor of a hash table is calculated as ______.

Accepted Answer

A) table size + current number of table items 
B) table size - current number of table items 
C) current number of table items * table size 
D) current number of table items / table size 
A) table size + current number of table items 
B) table size - current number of table items 
C) current number of table items * table size 
D) current number of table items / table size

Question 15

What is a 4-node?

Accepted Answer

A 4-node is a tree n

Question 16

Operations which are used to maintain the balance of AVL trees are known as ______.

Accepted Answer

A) revolutions 
B) rotations 
C) hash functions 
D) refractions 
A) revolutions 
B) rotations 
C) hash functions 
D) refractions

Question 17

What is a 2-node?

Accepted Answer

A 2-node is a tree n

Question 18

A 3-node contains three data items.

Accepted Answer

A) True 
 B)False

Question 19

In a 4-node,the smallest search key is found in the ______ subtree.

Accepted Answer

A) left 
B) middle-left 
C) middle-right 
D) right 
A) left 
B) middle-left 
C) middle-right 
D) right

Question 20

All the nodes in a binary tree are ______.

Accepted Answer

A) single nodes 
B) 1-nodes 
C) 2-nodes 
D) double nodes 
A) single nodes 
B) 1-nodes 
C) 2-nodes 
D) double nodes

What is the maximum and the minimum number of children that an internal node can have in a 2-3 tree?

What is a collision?

In a 2-3 tree,______.

In designing a hash table,why do we want the size of the table to be significantly larger than the maximum number of entries that we will insert into it?

A(n)______ is a balanced binary search tree.

A hash table is a(n)______.

A balanced binary search tree would have the maximum height possible for the tree.

______ is a collision-resolution scheme that uses an array of linked lists as a hash table.

If a particular 2-3 tree does NOT contain 3-nodes,it is like a ______.

What is a 3-node?

In a 3-node,______.

The height of a binary tree is sensitive to the order in which items are inserted into the tree.

A node that contains one data item and has two children is called a ______.

The load factor of a hash table is calculated as ______.

What is a 4-node?

Operations which are used to maintain the balance of AVL trees are known as ______.

What is a 2-node?

A 3-node contains three data items.

In a 4-node,the smallest search key is found in the ______ subtree.

All the nodes in a binary tree are ______.

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

Graphs

External Methods

Filters

Exam 13: Advanced Implementations of Tables

What is the maximum and the minimum number of children that an internal node can have in a 2-3 tree?

What is a collision?

In a 2-3 tree,______.

In designing a hash table,why do we want the size of the table to be significantly larger than the maximum number of entries that we will insert into it?

A(n)______ is a balanced binary search tree.

A hash table is a(n)______.

A balanced binary search tree would have the maximum height possible for the tree.

______ is a collision-resolution scheme that uses an array of linked lists as a hash table.

If a particular 2-3 tree does NOT contain 3-nodes,it is like a ______.

What is a 3-node?

In a 3-node,______.

The height of a binary tree is sensitive to the order in which items are inserted into the tree.

A node that contains one data item and has two children is called a ______.

The load factor of a hash table is calculated as ______.

What is a 4-node?

Operations which are used to maintain the balance of AVL trees are known as ______.

What is a 2-node?

A 3-node contains three data items.

In a 4-node,the smallest search key is found in the ______ subtree.

All the nodes in a binary tree are ______.

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

Graphs

External Methods

Filters