ave more data)         private int iData; // data item (key)         //--------------------------------------------------------------         public DataItem(int ii) // constructor         { iData = ii; }         //--------------------------------------------------------------         public int getKey()         { return iData; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Modify the hash.java program to use quadratic probing instead of linear probing.

 

// hash.java
// demonstrates hash table with linear probing
import java.io.*;
    ////////////////////////////////////////////////////////////////
    class DataItem
    { // (could have more data)
        private int iData; // data item (key)
        //--------------------------------------------------------------
        public DataItem(int ii) // constructor
        { iData = ii; }
        //--------------------------------------------------------------
        public int getKey()
        { return iData; }
//--------------------------------------------------------------
    } // end class DataItem
    ////////////////////////////////////////////////////////////////
    class HashTable
    {
        private DataItem[] hashArray; // array holds hash table
        private int arraySize;

        private DataItem nonItem; // for deleted items
        // -------------------------------------------------------------
        public HashTable(int size) // constructor
        {
            arraySize = size;
            hashArray = new DataItem[arraySize];
            nonItem = new DataItem(-1); // deleted item key is -1
        }
        // -------------------------------------------------------------
        public void displayTable()
        {
            System.out.print("Table: ");
            for(int j=0; j<arraySize; j++)
            {
                if(hashArray[j] != null)
                    System.out.print(hashArray[j].getKey() +" ");

                else
                    System.out.print("**  ");

            }
            System.out.println("");
        }
        // -------------------------------------------------------------
        public int hashFunc(int key)
        {
            return key % arraySize; // hash function
        }
        // -------------------------------------------------------------
        public void insert(DataItem item) // insert a DataItem
// (assumes table not full)
        {
            int key = item.getKey(); // extract key
            int hashVal = hashFunc(key); // hash the key
// until empty cell or -1,
            while(hashArray[hashVal] != null &&
                    hashArray[hashVal].getKey() != -1)
            {
                ++hashVal; // go to next cell
                hashVal %= arraySize; // wraparound if necessary
            }
            hashArray[hashVal] = item; // insert item
        } // end insert()
        // -------------------------------------------------------------
        public DataItem delete(int key) // delete a DataItem
        {
            int hashVal = hashFunc(key); // hash the key
            while(hashArray[hashVal] != null) // until empty cell,
            { // found the key?
                if(hashArray[hashVal].getKey() == key)
                {
                    DataItem temp = hashArray[hashVal]; // save item
                    hashArray[hashVal] = nonItem; // delete item
                    return temp; // return item
                }
                ++hashVal; // go to next cell
                hashVal %= arraySize; // wraparound if necessary
            }
            return null; // can’t find item
        } // end delete()
        // -------------------------------------------------------------
        public DataItem find(int key) // find item with key
        {
            int hashVal = hashFunc(key); // hash the key
            while(hashArray[hashVal] != null) // until empty cell,
            { // found the key?
                if(hashArray[hashVal].getKey() == key)
                    return hashArray[hashVal]; // yes, return item
                ++hashVal; // go to next cell
                hashVal %= arraySize; // wraparound if necessary
            }
            return null; // can’t find item
        }
// -------------------------------------------------------------
    } // end class HashTable
    ////////////////////////////////////////////////////////////////

 

Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Introduction to Interface
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education