1. Describe pseudocode algorithms for insertion into and removal from a dictionary implemented externally with a hashed index fi le. 2. Given a B-tree of degree 5 and a height of 3, a. What is the...

1. Describe pseudocode algorithms for insertion into and removal from a dictionary implemented externally with a hashed index fi le.

2. Given a B-tree of degree 5 and a height of 3,

a. What is the maximum number of nodes (including the root)?

b. What is the maximum number of records that can be stored?

3. Given the B-tree of degree 7 in Figure 21-17 , draw the B-tree that results after the insertion of m , o , y , r , c , i , k , w , and h .