HND in Computing and Software

Engineering
SEC5213: Data Structures and Algorithm
Level: 5
Credit Value: 20

Lesson 15 - Hash Table

1
Lecturer: Ms. Sathananthy 06/04/2022
 Learning Outcomes 01,03,04
• Understand the fundamentals of variety of data structures
• Evaluate algorithms and data structures in terms of time complexity
• Apply algorithms and data structures to solve programming problems.

2 06/04/2022
 Outline
 Hashing

 Open addressing

 Separate chaining

 Hash functions

 Hashing Efficiency

7
 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.

4 06/04/2022
 Hash Table

5 06/04/2022
 Hashing Function

A function which employs some algorithm to computes the key K for all the data

elements in the set U, such that the key K  which is of a fixed size.  

The same key K can be used to map data to a hash table and all the operations like

insertion, deletion and searching should be possible.  

The values returned by a hash function are also referred to

as hash values, hash codes, hash sums, or hashes.

6 06/04/2022
 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.

7 06/04/2022
 Hashing
i. (1,20)

ii. (2,70)

iii. (42,80)

iv. (4,25)

v. (12,44)

vi. (14,32)

vii. (17,11)

viii. (13,78)

ix. (37,98)

8 06/04/2022
 Hashing
Sr.No. Key Hash Array Index

1 1 1 % 20 = 1 1

2 2 2 % 20 = 2 2

3 42 42 % 20 = 2 2

4 4 4 % 20 = 4 4

5 12 12 % 20 = 12 12

6 14 14 % 20 = 14 14

7 17 17 % 20 = 17 17

8 13 13 % 20 = 13 13

9 37 37 % 20 = 17 17
9 06/04/2022
 Hash Collision

A situation when the resultant hashes

for two or more data elements in the

data set U, maps to the same location in
the has table, is called a hash collision.
In such a situation two or more data
elements would qualify to be
stored/mapped to the same location in
the hash table.
10 06/04/2022
 Hash collision resolution techniques
1. Open Hashing (Separate chaining)

Open Hashing, is a technique in which the data is

not directly stored at the hash key index (k) of the

Hash table. Rather the data at the key index (k) in

the hash table is a pointer to the head of the data

structure where the data is actually stored. In the

most simple and common implementations the data

structure adopted for storing the element is a

linked-list.

11 06/04/2022
 Hash collision resolution techniques

 In this technique when a data needs to be

searched, it might become necessary

(worst case)  to traverse all the nodes in
the linked list to retrieve the data.
 Note that the order in which the data is

stored in each of these linked lists (or

other data structures) is completely based
on implementation requirements. Some of
the popular criteria are insertion order,
12 06/04/2022
frequency of access etc.
 Hash collision resolution techniques
2. Closed hashing (open Addressing)
In this technique a hash table with pre-identified size is considered. All items
are stored in the hash table itself. In addition to the  data, each hash bucket
also maintains the three states: EMPTY, OCCUPIED, DELETED. While
inserting, if a collision occurs, alternative cells are tried until an empty
bucket is found. For which one of the following technique is adopted.
i. Liner Probing
ii. Quadratic probing
iii. Double hashing

13 06/04/2022
 A COMPARATIVE ANALYSIS OF CLOSED HASHING VS OPEN HASHING
Open Addressing Closed Addressing

All elements would be stored in the Additional Data structure needs to

Hash table itself. No additional data be used to accommodate collision
structure is needed. data.

Simple and effective approach to

In cases of collisions, a unique hash
collision resolution. Key may or
key must be obtained.
may not be unique.

Determining size of the hash table, Performance deterioration of closed

adequate enough for storing all the addressing much slower as
data is difficult. compared to Open addressing.

State needs be maintained for the No state data needs to be maintained

data (additional work) (easier to maintain)
14 Uses space efficiently Expensive on space 06/04/2022
 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.

15 06/04/2022
 Complexity Measures : Hashing

Complexity Average Case Worst Case

Time Complexity
θ(1 )
Search O(n)
θ(1)
Insert O(n)
θ(1 )
Delete O(n)

Space Complexity O(n) O(n)

16 06/04/2022
 Implementation

17 06/04/2022
 END

18 06/04/2022