Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
Question
Book Icon
Chapter 27.8, Problem 27.8.1CP
Program Plan Intro

Hash Code:

  • First, a hash function converts a search key to an integer value and then it compresses this hash code into an index in the hash table.
  • The hash code is simply a 32-bit signed int number, where the object is managed by a hash table.
  • Actually, hash code is not a unique number for an object. The two objects will return the same hash code if both the objects are equal.

Blurred answer
Students have asked these similar questions
Does a set allow you to store duplicate elements?
Can enumerators loop across array elements? Why? Why not?
A feature of our Set ADT is that it is a collection that allows duplicate elements.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
  • Text book image
    EBK JAVA PROGRAMMING
    Computer Science
    ISBN:9781337671385
    Author:FARRELL
    Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT