COP 5536编程写作、辅导Java，C++

” COP 5536编程写作、辅导Java，C++COP 5536 Spring 2021Programming ProjectDue Date: Apr 6th, 2021, 11:59 pm EST1. GeneralProblem descriptionThe primary value of a B+ tree is in storing data for efficient retrieval in a block-oriented storagecontext in particular, file systems. In this project, youre asked to develop and test a small degree B+tree used for internal-memory Dictionaries (i.e. the entire tree resides in main memory). The data isgiven in the form (key, value) with no duplicates, you are required to implement an m-way B+ tree tostore the data pairs. Note that in a B+ tree only leaf nodes contain the actual values, and the leavesshould be linked into a doubly linked list. Your implementation should support the followingoperations:1. Initialize (m): create a new m-way B+ tree2. Insert (key, value)3. Delete (key)4. Search (key): returns the value associated with the key5. Search (key1, key2): returns values such that in the range key1 = key = key2Programming EnvironmentYou may use either Java or C++ for this project. Your program will be tested using the Java or g++/gcccompiler on the thunder.cise.ufl.edu server. So, you should verify that it compiles and runs as expectedon this server, which may be accessed via the Internet.Your submission must include a makefile that creates an executable file named bplustree.2. Input and Output RequirementsYour program should execute using the followingFor C/C++:$ ./ bplustree file_nameFor Java:$ java bplustree file_nameWhere file_name is the Name of the file that has the input test data.Input FormatThe first line in the input file Initialize(m) means creating a B+ tree with the order m (note: m may bedifferent depending on input file). Each of the remaining lines specifies a B+ tree operation. Thefollowing is an example of an input file:Initialize(3)Insert(21, 0.3534)Insert(108, 31.907)Insert(56089, 3.26)Insert(234, 121.56)Insert(4325, -109.23)Delete (108)Search(234)Insert(102, 39.56)Insert(65, -3.95)Delete (102)Delete (21)Insert(106, -3.91)Insert(23, 3.55)Search(23, 99)Insert(32, 0.02)Insert(220, 3.55)Search(33)Delete (234)Search(65)You can use integer as the type of the key and float/double as the type of the value.Output FormatFor Initialize, Insert and Delete query you should not produce any output.For a Search query you should output the results on a single line using commas to separate values. Theoutput for each search query should be on a new line. All output should go to a file namedoutput_file.txt. If a search query does not return anything you should output Null.The following is the output file for the above input file:121.563.55,-3.95Null-3.953. SubmissionDo not use nested Directories. All your files must be in the first directory that appears after unzipping.You must submit the following:1. Makefile: You must design your makefile such that make command compiles thesource code and produces executable file. (For java class files that can berun with java command)2. Source Program: Provide comments.3. REPORT: The report should be in PDF format. The report should contain your basic info: Name, UFID and UF Email account Present function prototypes showing the structure of your programs. Include the structure of yourprogram.To submit, please compress all your files together using a zip utility and submit to theCanvas system. You should look for Assignment Project for the submission.Your submission should be named LastName_FirstName.zip.Please make sure the name you provided is the same as the same that appears on theCanvas system. Please do not submit directly to a TA. All email submissions will beignored without further notification. Please note that the due day is a harddeadline. No late submission will be allowed. Any submission after the deadlinewill not be accepted.4. Grading PolicyGrading will be based on the correctness and efficiency of algorithms. Below are some details ofthe grading policy.Correct implementation and Execution: 60%Note: Your program will be graded based on the produced output. You must make sure to produce thecorrect output to get points. Besides the example input/output file in this project description, there aretwo extra test cases for TAs to test your code. Each one of the test case contributes 20% to the finalgrade. Your program will not be graded if it can not be compiled or executed.You will get 0 point in this part if your implementation is not B+ tree.Comments and readability: 15%Report: 25%You will get 10% points deducted if you do not follow the input/output or submission requirementsabove. In addition, we may ask you to demonstrate your projects.5. Miscellaneous Do not use complex data structures provided by programming languages. You have toimplement B+ tree data structures on your own using primitive data structures such as pointers.You must not use any B tree / B+ tree related libraries. Your implementation should be your own. You have to work by yourself for this assignment(discussion is allowed). Your Submission will be checked for plagiarism.请加QQ：99515681 或邮箱：99515681@qq.com WX：codehelp

“