The following information about a student is held in a record: Student number Name Address Phone number Course The Student number field is unique i.e. no two students can have the same student number. Implement a B-tree that can store this information. Start with an empty tree with MINIMUM set to 1. Enter information for N number of students whose Student numbers are of type int. Display the resulting B-tree after every addition/modification. Marks breakup: B-tree implementation (which includes all the methods for operating on the B-tree) ??" 20 marks Adding/modifying student information in the B-tree ??" 12 Displaying the resulting B-tree ??" 8
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. 4)Good documentation, i.e., comments within the program and adhering to the Coding Standard, javadoc comments etc. 5)Correct usage of control structures such as case statements, while, if-else, and. parameter passing mechanism via reference and value. 6)Modularly structured program, e.g. use of your own packages etc. 7)Relevant error checks performed, using your own Exceptions etc. 8) A well-presented program and results. 9) A test plan/data provided 10) The data structure used to hold the process identities together giving reasons and advantages for the choice of data structure used. 11)Explain program limitations and why they couldn’t be resolved.
redhat linux and unix platforms