Hash Map Implementation in Java a university project

Project:    Complete exercise C-10.40 on p. 454 in the textbook.  Read the problem statement carefully.  The authors initially describe the behavior of the java.util.Hashmap class.  As they describe it, the Java implementation of a Hash Map consists of a table (bucket array) of entries.  Each entry consists of a K, V pair with the addition of a next reference that refers to a next entry in the bucket.  In that way, if collisions have occurred and multiple entries/keys hash to the same bucket, they will be arranged in a singly linked list.   Data Structure Classes: Your job is to modify the ChainHashMap class, p. 425 of  the textbook to exhibit the same behavior.  You will be modifying the source code of the author’s classes – so the first step will be to copy those files to your eclipse package.  At a minimum I would recommend these:   1. Map.java 2. AbstractMap.java 3. UnsortedTableMap.java 4. AbstractHashMap.java 5. ChainHashMap.java 6. Entry.java   You can approach your solution in one of several different ways.  As a requirement of the project, consider the following:    

  • as collisions occur, you will be creating and maintaining your own ‘ad hoc’ list linked together by the ‘next’ references in each Entry.

  • as a starting point, modify class MapEntry in class AbstractMap.java to include the extra field for the next reference. 

  • The bucket array (the table instance variable in class ChainHashMap.java)  can be changed to an ArrayList that will contain MapEntry references – i.e. the first object in the ad hoc list hashing to that bucket

  • methods bucketGet and bucketPut in class ChainHashMap.java will need to walk through the ad hoc list starting at the bucket identified by ‘h’ the hash value looking for a match.  Consider using the ArrayList methods get and put.  You will know the search is done when ‘next’ equals null.

      Test Driver:   You will need to create a test driver.  Create an implementation of Code Fragment 10.2, p. 405 in the textbook.  Rather than reading from System.in, do file I/O with Java.     File Data and Name:  In order to generate test data, you must use my file named ‘test.txt’ that is in the Blackboard Information content area.  You can ‘hard code’ this name into your program – or better yet, pass the file name as a command line argument and read that within the test driver.  And you might have to play around with ‘where’ to put the file.  Eclipse and Java don’t necessarily look in the directory containing the code, but the directory above.  (Try the CSIS-294 project folder.)     Deliverables:  Submit online all source code that you have created and/or changed and at least one 'screen shot' output demonstrating program execution.  “Capture” a screen shot by running the application, pressing ALT-PRTSCR, starting Word, copying clipboard contents to an empty document, and saving the document.  (You will submit this online along with your source code.)  Make sure your name is in the comments section of all applications, and on the document page generated by Word.
Powered by