Java data structures eclipse Solution

Java data structures eclipse Solution

<p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif; background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>As you are working on finalizing the code for your solution, you are thinking that a B-Tree might be an elegant solution for the sorting and search algorithms. In</span><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>order though to implement the solution in the most elegant fashion the use of recursion will be needed. You approach others in your department about the possibility of using recursion, and a few of them are not familiar with how it works. Describe recursion</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>and give sample code to implement the Fibonacci Series. This should go in the Design Document. Based on the feedback you received from the alpha test, now is your chance to modify your program as needed and submit it for final testing and implementation. Enhance</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>your program to incorporate the relevant feedback you have received, and add one additional sort routine for your final design. Your design should include the following: High Level Implementation Instructions: </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Sorted Linked list</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Sorted using Insertion sort</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Hash bucket of size 5 with a collision solution using a linked list (no need to order) </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•A Search Algorithm based on ID and Contributor Name. ◦The Contributor Name Algorithm needs to be implemented using the Sequential Search ◦An additional Search algorithm</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>based on a Binary Search of the Contributor’s Name (this will include an additional Sorted Array of the contributor’s name) Each contributor will have the following information: </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Name: String; //the name of the contributor </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•City: String; //the city in which</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>the contributor lives </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Country: String; //the country in which the contributor lives</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Phone: String; //the phone number for the contributor </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Contribution: Double; //the amount of the contribution given by the contributor to the zoo </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•ID: Integer; //identifier</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>key for future needs Contributor functions/methods: </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Input constructor: //to accept a string for the name and additional information for each contributor (this should call the Add constructor to implement the sorted list) •Print constructor: //to print out</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>the contributor data </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Print All constructor: //to print the entire list of contributor names </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Add constructor: //to traverse the Linked list and find the proper location for adding the instance •Search constructor: //the Search algorithm to implement is Sequential</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>Search</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •An additional Search algorithm based on a Binary Search of the Contributor’s Name (this will include an additional Sorted Array of the contributor’s name) Each hash bucket collision item will have the following information:</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •ID: Integer; //identifier</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>key for future needs</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Contributor Address: Pointer; //a pointer to the address of the contributor instance in the sorted linked list Hash bucket functions/methods:</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Input constructor: //to accept a string for the name and additional information for each contributor</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>(you will only need the ID portion of the input data) </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Hash Function constructor: //Hint: You only have 5 Hash buckets so the function can be very a simple calculation</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Pop constructor</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”> •Push constructor</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•Print constructor: //to show the information of the</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>contributor based on a given ID Deliverables:</span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•The design document that includes the recursion example. </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•A fully documented program to load the data creating a sorted linked list. </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•A test plan to show how the program runs and can be executed </span></span></p><p class=”MsoNormal”><span style=”font-size: 9pt; line-height: 115%; font-family: Verdana, sans-serif;”><span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>•A screenshot</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>showing that the program loaded the data, and after all data is loaded perform the following: ◦Print All showing the sorted list. ◦Contributor information for Georg Pipps ◦Contributor information for ID 25 ◦An analysis of the differences in performance of</span><br /> <span style=”background-image: initial; background-attachment: initial; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;”>the Sequential Search versus the Binary Search</span></span></p>

Place your order now with Reliablepapers.com
and experience the difference of letting the professionals do the work for you!
Our Process is Simple
Our Simple process

Order Now

Place Order