nextupprevious
Next:6. Priority QueuesUp:5.7 Programming AssignmentsPrevious:5.7.2 Skip Lists and Binary search Trees

5.7.3 Multiway Search Trees and B-Trees

The objective of this assignment is to implement insertions and deletions in multi-way search trees and B-trees, and evaluate their performance. Three scenarios are considered: insertions alone; deletions alone; and insertions and deletions interleaved randomly. The performance measures are the following: Repeat the above experiment for several random sequences to obtain better and more credible performance estimates. You will get bonus marks if you implement B*-trees also.


nextupprevious
Next:6. Priority QueuesUp:5.7 Programming AssignmentsPrevious:5.7.2 Skip Lists and Binary search Trees
eEL,CSA_Dept,IISc,Bangalore