- Execute the "calc_hash" function shown in the "hash search example" below with multiple inputs on a PC and display the results (hash values). - It can also be executed by simply adding the main function: int main() { printf("%d\n", calc_hash ("computer")); printf("%d\n", calc_hash ("California")); return 0; } - TAB_SIZE must be defined appropriately. "hash search example" Table tab [TAB SIZE]; int calc_hash (char* name) { int i, hash_val; hash_val = 0; while (*name!= 0) hash_val += *name++; } return hash_val % TAB_SIZE; Table* lookup tab(char* name) { Table* pe; for (pe = tab[calc_hash (name)]; pe!= NULL; pe = pe->next){ if (strcmp(pe->name, name) = = 0) return pe; } return NULL; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Don't use ai to answer
- Execute the "calc_hash" function shown in the "hash search example" below with multiple inputs on a PC and display the results (hash values).
- It can also be executed by simply adding the main function:
int main()
{
printf("%d\n", calc_hash ("computer"));
printf("%d\n", calc_hash ("California"));
return 0;
}
- TAB_SIZE must be defined appropriately.
"hash search example"
Table tab [TAB SIZE];
int calc_hash (char* name)
{
int i, hash_val;
hash_val = 0;
while (*name!= 0)
hash_val += *name++;
}
return hash_val % TAB_SIZE;
Table* lookup tab(char* name)
{
Table* pe;
for (pe = tab[calc_hash (name)]; pe!= NULL; pe = pe->next){
if (strcmp(pe->name, name) = = 0)
return pe;
}
return NULL;
}
Transcribed Image Text:- Execute the "calc_hash" function shown in the "hash search example" below with multiple inputs on a PC and display the results (hash values). - It can also be executed by simply adding the main function: int main() { printf("%d\n", calc_hash ("computer")); printf("%d\n", calc_hash ("California")); return 0; } - TAB_SIZE must be defined appropriately. "hash search example" Table tab [TAB SIZE]; int calc_hash (char* name) { int i, hash_val; hash_val = 0; while (*name!= 0) hash_val += *name++; } return hash_val % TAB_SIZE; Table* lookup tab(char* name) { Table* pe; for (pe = tab[calc_hash (name)]; pe!= NULL; pe = pe->next){ if (strcmp(pe->name, name) = = 0) return pe; } return NULL; }
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education