Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
11 views

17. Data Structure and Algorithms - Hash Table

A hash table is an associative data structure that stores data in an array format with unique index values, allowing for fast insertion and search operations. Hashing converts key values into array indexes using techniques like the modulo operator, and linear probing is employed to resolve index collisions. The basic operations of a hash table include search, insert, and delete, each utilizing the computed hash code to locate elements in the array.

Uploaded by

anashemasese11
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

17. Data Structure and Algorithms - Hash Table

A hash table is an associative data structure that stores data in an array format with unique index values, allowing for fast insertion and search operations. Hashing converts key values into array indexes using techniques like the modulo operator, and linear probing is employed to resolve index collisions. The basic operations of a hash table include search, insert, and delete, each utilizing the computed hash code to locate elements in the array.

Uploaded by

anashemasese11
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Data Structure and

Algorithms - Hash
Table
Hash Table is a data structure which stores data in an associative
manner. In a hash table, data is stored in an array format, where each
data value has its own unique index value. Access of data becomes very
fast if we know the index of the desired data.
Thus, it becomes a data structure in which insertion and search
operations are very fast irrespective of the size of the data. Hash Table
uses an array as a storage medium and uses hash technique to generate
an index where an element is to be inserted or is to be located from.

Hashing
Hashing is a technique to convert a range of key values into a range of
indexes of an array. We're going to use modulo operator to get a range
of key values. Consider an example of hash table of size 20, and the
following items are to be stored. Item are in the (key,value) format.
(1,20)
(2,70)
(42,80)
(4,25)
(12,44)
(14,32)
(17,11)
(13,78)
(37,98)
Linear Probing
As we can see, it may happen that the hashing technique is used to
create an already used index of the array. In such a case, we can search
the next empty location in the array by looking into the next cell until we
find an empty cell. This technique is called linear probing.
Basic Operations
Following are the basic primary operations of a hash table.
 Search − Searches an element in a hash table.
 Insert − inserts an element in a hash table.
 delete − Deletes an element from a hash table.
DataItem
Define a data item having some data and key, based on which the
search is to be conducted in a hash table.
Hash Method
Define a hashing method to compute the hash code of the key of the
data item.

Search Operation
Whenever an element is to be searched, compute the hash code of the key
passed and locate the element using that hash code as index in the array.
Use linear probing to get the element ahead if the element is not found at
the computed hash code.
Example
Insert Operation
Whenever an element is to be inserted, compute the hash code of the key
passed and locate the index using that hash code as an index in the array.
Use linear probing for empty location, if an element is found at the
computed hash code.
Example
Delete Operation
Whenever an element is to be deleted, compute the hash code of the
key passed and locate the index using that hash code as an index in the
array. Use linear probing to get the element ahead if an element is not
found at the computed hash code. When found, store a dummy item
there to keep the performance of the hash table intact.
Example

You might also like