AURORA DEEMED TO BE UNIVERSITY

Department of Computer Science and Engineering

Course Title: DATA STRUCTURES
TOPIC NAME: HASH TABLES

What is a Hash Table?

A data structure that
maps keys to values for Operations
efficient data retrieval. Performance Insertion
Time Complexity Compute the hash of the
Average case: key and place the value
at the computed index.
O(1) for
Types of Hash Tables insertion, search, Search
Chaining and deletion. Compute the hash of the
key and check the
Worst case: O(n) corresponding index for
Uses linked lists to store multiple values if many collisions the value.
at the same index. occur, but this is Deletion
Open Addressing rare with a good Locate the key using the
hash function. hash function and
Finds another open slot within the table remove the value from
using methods like linear probing, the table.
Hash Function
quadratic probing, or double hashing.
Converts keys into indices in an
array.
A good hash function distributes
keys uniformly to minimize
collisions.
Collisions
Databases Efficient
Occur when two keys hash to the
indexing and Quick access to
Applications frequently used same index.
retrieval of
data. Handled using techniques like
data.
Caching Symbol Tables
chaining or open addressing.

Course Instructor: Presented By :

Mr K. ABINASH ,ID .AUU23EGCSE118,
Dr .K .Chandra Shekar, HOD - CSE B.Tech-_1ST YEAR_., Dept. of CSE
AURORA Deemed to be University AURORA Deemed to be University