Question

in c++ please

Write a program in c+ to do the following: 1.Save the data shown below (in the same format) to make a text file called "InputData. txt"; use the file as input to enter data into a hash table. Fname Lname 2019-01-31 First Last 2018-02-01 Jonh Doe 2017-03-28 Jane Doe 2016-04-01 as the data items in the file 2. Your hash table should have as many entries 3. The birthday should be used as the hash key by adding the digits repeatedly until it ends up being a number between 0 and 9, which will be the index of the data in the hash table. So, a date of 2017-12 - 04 will reduce as 2+0+1+7+1+2+0+4 17 which will further reduce as 1+7 8 and its associated data record (name birthday) will be added to index 8 in the hash table 4. For collision resolution, use quadratic probing in the same direction always. 5. Your main will first load the data file into the hash table and print the number of data items loaded, load factor and number of collisions. 6.Then it will ask the user in a loop to enter a birthdate any date. If the birthdate is found in the hash table, it will print the name associated with that date, otherwise it will print Invalid Data 7. Then it will ask the user if they want to check again or end the program.

Answer 1

C++ CODE:

#include<iostream>
#include<fstream>
using namespace std;
class Node
{
public:
string fname,lname,birthdate;
bool occupied;
Node(string f,string l,string b)
{
fname=f;
lname=l;
birthdate=b;
occupied=true;
}
Node()
{
fname=lname=birthdate="";
occupied=false;
}
};
int main()
{
ifstream fin;
fin.open("InputData.txt");
int count=0;
string data;
while(fin)
{
fin>>data;
fin>>data;
fin>>data;
count++;
}
fin.close();
count-=1;
Node table[count+1];
fin.open("InputData.txt");
string fname,lname,birthdate;
int collisions=0;
for(int i=0;i<count;i++)
{
fin>>fname;
fin>>lname;
fin>>birthdate;
int hash_value=0;
for(int j=0;j<birthdate.size();j++)
{
if(birthdate[j]!='-')
hash_value+=(birthdate[j]-'0');
}
hash_value=hash_value%10+hash_value/10;
int k=0;
while(table[(hash_value+k*k)%count+1].occupied!=false)
{
k++;
collisions++;
}
table[(hash_value+k*k)%count+1].fname=fname;
table[(hash_value+k*k)%count+1].lname=lname;
table[(hash_value+k*k)%count+1].birthdate=birthdate;
table[(hash_value+k*k)%count+1].occupied=true;
}
cout<<"Data items loaded: "<<count<<endl;
cout<<"Load factor: "<<(float)count/(float)(count+1)<<endl; //Because no. of data items +1 = no. of slots in hash table
cout<<"Total collisions: "<<collisions<<endl;
while(true)
{
cout<<"Enter 1 to search by birthdate and 0 to exit: ";
int i;
cin>>i;
if(i==1)
{
cout<<"Enter birthdate: ";
string bdate;
cin>>bdate;
int hash_value=0;
for(int j=0;j<bdate.size();j++)
{
if(bdate[j]!='-')
hash_value+=(bdate[j]-'0');
}
hash_value=hash_value%10+hash_value/10;
int k=0;
int found=0;
while(table[(hash_value+k*k)%count+1].occupied==true)
{
if(table[(hash_value+k*k)%count+1].birthdate==bdate)
{
cout<<table[(hash_value+k*k)%count+1].fname<<" "<<table[(hash_value+k*k)%count+1].lname<<" corresponds to birthdate "<<bdate<<endl;
found=1;
break;
}
k++;
}
if(found==0)
cout<<"Not found"<<endl;
}
else if(i==0)
break;
else
{
cout<<"Invalid input...Try again"<<endl;
}
}
fin.close();
return 0;
}

Input file: InputData.txt

InputData Notepad File Edit Format View Help Dohn Wick 2019-01-31 David Watson 2018-02-01 Jane Pattinson 2017-03-28 Ros Buttler 2016-04-01 Alex Rogers 2017-04-11 Jimmy Neesham 2016-07-19 Andrew Scott 2018-01-02 Albert Einstien 2019-06-12 James Bond 2018-01-10 Tony Stark 2019-04-27

Output

"CAUsers Ashish Shrivastav\Desktop C,C Programs\hashtable.exe" Data items loaded: 10 Load factor: 0.909091 Total collisions: 14 Enter 1 to sear ch by birthdate and 0 to exit: 1 Enter birthdate: 2019-06-12 Albert Einstien corresponds to birthdate 2019-06-12 Enter 1 to sear ch by birthdate and 0 to exit: 1 Enter birthdate: 2019-06-13 Not found Enter 1 to sear ch by birthdate and 0 to exit: 0 Process returned 0 (0x0) Press any key to continue. execution time 15.980