Hash Ex8
Hash Ex8
10.02.21
AIM:
PROGRAM:
#include <stdio.h>
#include<stdlib.h>
#define TABLE_SIZE 10
int h[TABLE_SIZE]={NULL};
void insert()
int key,index,i,flag=0,hkey;
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE;i++)
index=(hkey+i)%TABLE_SIZE;
if(h[index] == NULL)
h[index]=key;
T.PRABAVATHI(MTECH)
20MA32
break;
if(i == TABLE_SIZE)
void search()
int key,index,i,flag=0,hkey;
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE; i++)
index=(hkey+i)%TABLE_SIZE;
if(h[index]==key)
break;
if(i == TABLE_SIZE)
T.PRABAVATHI(MTECH)
20MA32
}
void display()
int i;
main()
int opt,i;
while(1)
scanf("%d",&opt);
switch(opt)
case 1:
insert();
break;
case 2:
display();
T.PRABAVATHI(MTECH)
20MA32
break;
case 3:
search();
break;
case 4:exit(0);
OUTPUT:
#include <stdio.h>
#include<stdlib.h>
#define TABLE_SIZE 10
T.PRABAVATHI(MTECH)
20MA32
int h[TABLE_SIZE]={NULL};
void insert()
int key,index,i,flag=0,hkey;
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE;i++)
index=(hkey+i)%TABLE_SIZE;
if(h[index] == NULL)
h[index]=key;
break;
if(i == TABLE_SIZE)
void search()
T.PRABAVATHI(MTECH)
20MA32
{
int key,index,i,flag=0,hkey;
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE; i++)
index=(hkey+i)%TABLE_SIZE;
if(h[index]==key)
break;
if(i == TABLE_SIZE)
void display()
int i;
T.PRABAVATHI(MTECH)
20MA32
printf("\nat index %d \t value = %d",i,h[i]);
main()
int opt,i;
while(1)
scanf("%d",&opt);
switch(opt)
case 1:
insert();
break;
case 2:
display();
break;
case 3:
search();
break;
case 4:exit(0);
T.PRABAVATHI(MTECH)
20MA32
OUTPUT:
PROGRAM:
#include <stdio.h>
#include<stdlib.h>
#define TABLE_SIZE 10
int h[TABLE_SIZE]={NULL};
void insert()
int key,index,i,flag=0,hkey,hash2;
T.PRABAVATHI(MTECH)
20MA32
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE;i++)
index=(hkey+i*hash2)%TABLE_SIZE;
if(h[index] == NULL)
h[index]=key;
break;
if(i == TABLE_SIZE)
void search()
int key,index,i,flag=0,hash2,hkey;
scanf("%d",&key);
hkey=key%TABLE_SIZE;
for(i=0;i<TABLE_SIZE; i++)
index=(hkey+i*hash2)%TABLE_SIZE;
if(h[index]==key)
T.PRABAVATHI(MTECH)
20MA32
{
break;
if(i == TABLE_SIZE)
void display()
int i;
main()
int opt,i;
while(1)
scanf("%d",&opt);
switch(opt)
case 1:
T.PRABAVATHI(MTECH)
20MA32
insert();
break;
case 2:
display();
break;
case 3:
search();
break;
case 4:exit(0);
OUTPUT:
PROGRAM:
#include<stdio.h>
#include<stdlib.h>
T.PRABAVATHI(MTECH)
20MA32
#define size 7
struct node
int data;
};
void init()
int i;
chain[i] = NULL;
newNode->data = value;
newNode->next = NULL;
T.PRABAVATHI(MTECH)
20MA32
//check if chain[key] is empty
if(chain[key] == NULL)
chain[key] = newNode;
//collision
else
while(temp->next)
temp = temp->next;
temp->next = newNode;
void print()
int i;
printf("chain[%d]-->",i);
while(temp)
T.PRABAVATHI(MTECH)
20MA32
printf("%d -->",temp->data);
temp = temp->next;
printf("NULL\n");
int main()
init();
insert(7);
insert(8);
insert(3);
insert(10);
insert(4);
insert(5);
print();
return 0;
T.PRABAVATHI(MTECH)
20MA32
OUTPUT:
T.PRABAVATHI(MTECH)
20MA32