Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. Java
  4. Hash Table implementation

Hash Table implementation

Scheduled Pinned Locked Moved Java
databasedata-structurescryptographyhelp
3 Posts 3 Posters 6 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • M Offline
    M Offline
    Member_15628959
    wrote on last edited by
    #1

    Hash tables provide a mechanism by which you can create indexed tables in which the index is a value other than a string. Implement and test an integer key Open Address Hash table. Implement the following interface. • String get(int k); • void put(int k, String v); • bool contains(int k); • void delete(int k); • void printHash(); You must provide an interactive or command-line test application for the hash table. Make the hash table 31 entries, and make sure at least one collision occurs in your data input. You must delete some data from your table to demonstrate deletion. (100 points) Notable to get output. Could you please anyone help me on this

    Richard DeemingR L 2 Replies Last reply
    0
    • M Member_15628959

      Hash tables provide a mechanism by which you can create indexed tables in which the index is a value other than a string. Implement and test an integer key Open Address Hash table. Implement the following interface. • String get(int k); • void put(int k, String v); • bool contains(int k); • void delete(int k); • void printHash(); You must provide an interactive or command-line test application for the hash table. Make the hash table 31 entries, and make sure at least one collision occurs in your data input. You must delete some data from your table to demonstrate deletion. (100 points) Notable to get output. Could you please anyone help me on this

      Richard DeemingR Offline
      Richard DeemingR Offline
      Richard Deeming
      wrote on last edited by
      #2

      Nobody is going to do your homework for you. If you don't know where to start, talk to your teacher.


      "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

      "These people looked deep within my soul and assigned me a number based on the order in which I joined" - Homer

      1 Reply Last reply
      0
      • M Member_15628959

        Hash tables provide a mechanism by which you can create indexed tables in which the index is a value other than a string. Implement and test an integer key Open Address Hash table. Implement the following interface. • String get(int k); • void put(int k, String v); • bool contains(int k); • void delete(int k); • void printHash(); You must provide an interactive or command-line test application for the hash table. Make the hash table 31 entries, and make sure at least one collision occurs in your data input. You must delete some data from your table to demonstrate deletion. (100 points) Notable to get output. Could you please anyone help me on this

        L Offline
        L Offline
        Lost User
        wrote on last edited by
        #3

        See Java Tutorials Learning Paths[^]

        1 Reply Last reply
        0
        Reply
        • Reply as topic
        Log in to reply
        • Oldest to Newest
        • Newest to Oldest
        • Most Votes


        • Login

        • Don't have an account? Register

        • Login or register to search.
        • First post
          Last post
        0
        • Categories
        • Recent
        • Tags
        • Popular
        • World
        • Users
        • Groups