Scribd
Upload
31 views

Hash Function

This C program implements hashing to map keys to addresses using the remainder method (key mod m) and handles collisions using linear probing. It takes user input, hashes the key to an address, checks for collisions, resolves them using linear probing, and displays the final hash table. The key functions are create() to hash keys, linear_prob() to handle collisions, and display() to output the table.

Uploaded by

mumthaz
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
31 views

Hash Function

This C program implements hashing to map keys to addresses using the remainder method (key mod m) and handles collisions using linear probing. It takes user input, hashes the key to an address, checks for collisions, resolves them using linear probing, and displays the final hash table. The key functions are create() to hash keys, linear_prob() to handle collisions, and display() to output the table.

Uploaded by

mumthaz
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Module 5 program 2

Design and develop a program in C that uses Hash function H: K → L as H(K)=K mod m
(remainder method), and implement hashing technique to map a given key K to the
address space L. Resolve the collision (if any) using linear probing.

#include <stdio.h>
#include<stdlib.h>
#define MAX 100

/*FUNCTION PROTOTYPE *
int create(int);
void linear_prob(int[], int, int);
void display (int[]);

void main()
{
int a[MAX],num,key,i;
int ans=1;
printf(" collision handling by linear probing : \n");
for (i=0;i<MAX;i++)
{
a[i] = -1;
}
do
{
printf("\n Enter the data");
scanf("%4d", &num);
key=create(num);
linear_prob(a,key,num);
printf("\n Do you wish to continue ? (1/0) ");
scanf("%d",&ans);
}while(ans);
display(a);
}

int create(int num)


{
int key;
key=num%100;
return key;
}
void linear_prob(int a[MAX], int key, int num)
{
int flag, i, count=0;
flag=0;
if(a[key]== -1)
{
a[key] = num;
}
else
{
printf("\nCollision Detected...!!!\n");
i=0;
while(i<MAX)
{
if (a[i]!=-1)
count++;
i++;
}
printf("Collision avoided successfully using LINEAR PROBING\n");
if(count == MAX)
{
printf("\n Hash table is full");
display(a)
exit(1);
}
for(i=key+1; i<MAX; i++)
if(a[i] == -1)
{
a[i] = num;
flag =1;
break;
}
//for(i=0;i<key;i++)
i=0;
while((i<key) && (flag==0))
{
if(a[i] == -1)
{
a[i] = num;
flag=1;
break;
}
i++;
}
}
}
void display(int a[MAX])
{
int i, choice;
printf("1.Display ALL\n 2.Filtered Display\n");
scanf("%d",&choice);
if(choice==1)
{
printf("\n the hash table is\n");
for(i=0; i<MAX; i++)
printf("\n %d %d ", i, a[i]);
}
else
{
printf("\n the hash table is\n");
for(i=0; i<MAX; i++)
if(a[i]!=-1)
{
printf("\n %d %d ", i, a[i]);
continue;
}
}
}

You might also like