Click here to download your grades.



1- (Optional, bonus points you will get if you do it) Assume data records are given with the following format:

<student ID: Integer, Name char[30]>.

Write a program to create a B+tree for this data. Your program should have a menu to

   a) add a new record to B+tree

   b) remove a record given ID value

   c) print the whole file in the order of the IDs

Assume order of the tree to be 2 (N=2)

2- For an optimum hashing the selection of a good hash function is essential. Assuming that a good hash function minimizes the collision rate in the hash table, discuss the techniques for choosing hsh functions. A report is expected. Due date is the final exam date



-Click Here To Download A Pile File Creator App

-Click Here To Download A Sample Pile File. (Do Not Forget ; Your app will be test with this file)