5. Implement all the functions of a dictionary (ADT) using hashing.Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable, Keys must be uniqueStandard Operations: Insert(key, value), Find(key), Delete(key) 

#include<iostream>
using namespace std;
#define size 10

class Record
{
 string word;
 string  meaning;
 int  flag;
 
public:

 Record()
 {
  word = "-";
  meaning = "-";
  flag  = 0;
 }
 
 friend class Dictionary;

};

class Dictionary
{
 int capacity;
 int key;

public: 

 Dictionary() : capacity(0) {}
 
 void input( Record table[] )
 {
  if( capacity == size )
  {
   cout<<"HASH TABLE FULL !!"<<endl;
   return;
  }
  else
  {
   Record r;
   cout<<"ENTER word          : ";
   getline(cin , r.word);
   cin.ignore();
   cout<<"ENTER MEANING : ";
   cin>>r.meaning; 
   int index = hash(r.word);
   while(table[index].flag == 1)
   {
    if(table[index].word == r.word)
    {
     cout<<" RECORD ALREADY EXIST !!"<<endl;
     return;
    }
    index++;
    index %= size;
   }
   table[index] = r;
   table[index].flag = 1;
   capacity++;
  }
 }
 
 int hash( string word)
 {
  int sum = 0;
  for(int i = 0 ; word[i] != '\0' ; i++)
  {
   sum += (int)word[i];
  }
  sum %= size;
  return sum;
 }  
 
 void display(Record table[])
 {
  cout<<":|:| HASH TABLE |:|:"<<endl;
  for(int i = 0 ; i < size ; i++)
  {
   if(table[i].flag == 1)
   {
    cout<<endl<<"word : "<<table[i].word<<"\nMEANING : "<<table[i].meaning<<"\nPOSITION : "<<i<<endl;
   }
  }
 }
 
 void search(Record table[],string word)
 {
  key = hash(word);
  int found = 0;
  while( table[key].flag == 1)
  {
   if( table[key].word == word )
   {
    cout<<": RECORD FOUND :"<<endl;
    cout<<"word : "<<table[key].word<<"\t MEANING : "<<table[key].meaning<<endl;
    found = 1;
    break;
   }
   else
   {
    key++;
    key %= size;
   }
  }
  if(found == 0)
  {
   cout<<".......RECORD NOT PRESENT......"<<endl;
  }
 }
 
 void deletehash(Record table[], string word)
 {
  search(table,word);
  if(table[key].flag == 1)
  {
   table[key].word = "empty";
   table[key].meaning = "empty";
   table[key].flag = 0;
   cout<<":RECORD HAS BEEN DELETED:";
  }
 }
 
};

int main()
{
 
 Record table[size];
 Dictionary ph;

 ph.input( table );
 cin.ignore();
 ph.input( table );
 cin.ignore();
 ph.input( table );
 cin.ignore();
 ph.input( table );
 
 ph.display( table );
 
 ph.search(table , "winter");
 ph.deletehash(table,"winter");
 
 ph.display(table);
 return 0;
}

Comments

Post a Comment

Popular posts from this blog

2. Beginning with an empty binary search tree, Construct binary search tree by inserting the values in the order given. After constructing a binary tree -i.Insert new nodeii.Find number of nodes in longest path iii.Minimum data value found inthe tree iv.Change a tree so that the roles of the left and right pointers are swapped at every node v.Search a value

#include<iostream> #include<math.h> using namespace std; struct Bstnode { int data; Bstnode *left = NULL; Bstnode *right = NULL; }; class Btree { int n; int x; int flag; public: Bstnode * root; Btree() { root = NULL; } Bstnode *GetNewNode(int in_data) { Bstnode * ptr = new Bstnode(); ptr->data = in_data; ptr->left = NULL; ptr->right = NULL; return ptr; } Bstnode *insert( Bstnode *temp , int in_data) { if( temp == NULL ) { temp = GetNewNode(in_data); } else if( temp->data > in_data) { temp->left = insert(temp->left , in_data); } else { temp->right = insert( temp->right , in_data); } return temp; } void input() { cout<<"ENTER NUMBER OF ELEMENTS IN THE BST : "; cin>>n; for(int i = 0 ; i < n ; i++) { cout<<"NUMBER = "; cin>>x; root = insert(root , x); } } int search(Bstnode *temp ,int in_data) { if( te...
Read more

1. A book consists of chapters, chapters consist of sections and sections consist of subsections. Construct a tree and print the nodes. Find the time and space requirements of your method.

#include<iostream> using namespace std; struct node { string name; node *B[5]; }; class book { int c,s,sub; public: node *temp = new node; void Getnewnode() { for(int i = 0 ; i<5 ; i++) { temp->B[i] = new node; temp->B[i]->name = "empty"; for(int j=0; j<5; j++) { temp->B[i]->B[j] = new node; temp->B[i]->B[j]->name = "empty"; for(int k = 0 ; k<5; k ++) { temp->B[i]->B[j]->B[k] = new node; temp->B[i]->B[j]->B[k]->name = "empty"; } } } } void add_title() { cout<<": ENTER THE TITLE OF THE BOOK = "; cin>>temp->name; Getnewnode(); } void add_chapter() { string cname; int cnum; cout<<": ENTER NUMBER OF CHAPTERS IN THE BOOK = "; cin>>cnum; c = cnum; for(int i = 0 ; i < cnum ; i++) { cout<<endl<<"Chapter "<...
Read more

6. Implement all the functions of a dictionary (ADT) using hashing.Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable, Keys must be uniqueStandard Operations: Insert(key, value), Find(key), Delete(key)

#include<iostream> using namespace std; #define size 10 class Record { string name; long ph_num; int flag; public: Record() { name = "-"; ph_num = 0; flag = 0; } friend class Phonebook; }; class Phonebook { int capacity; int key; public: Phonebook() : capacity(0) {} void input( Record table[] ) { if( capacity == size ) { cout<<"HASH TABLE FULL !!"<<endl; return; } else { Record r; cout<<"ENTER NAME : "; getline(cin , r.name); cin.ignore(); cout<<"ENTER TELEPHONE NO. : "; cin>>r.ph_num; int index = hash(r.name); while(table[index].flag == 1) { if(table[index].name == r.name) { cout<<" RECORD ALREADY EXIST !!"<<endl; return; } index++; index %= size; } table[index] = r; table[index].flag = 1; capacity++; } } int hash( string name) { int sum = 0; for(int...
Read more