TODO: Create a hash function and compute the index of a user using both the first and last names. #include #include #include typedef struct {char *fname;char *lname;} user_t;int hash_user (user_t u) {// TODO: Create a hash function and compute the index of a user// using both the first and last names.return 0;}int main() {user_t user = {"Hilary", "Hahn"};int index = hash_user(user);printf("User hashed to %d\n", index);return 0;}

In the hash_user() we need to use the fname and lname and generate the hash code. I simply used the…

Answered: index of a user using both the first…

Engineering

Computer Science

index of a user using both the first and last names.

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

See similar textbooks

Similar questions

What is a hash function?a) A function has allocated memory to keysb) A function that computes the location of the key in the arrayc) A function that creates an arrayd) A function that computes the location of the values in the array
Bitcoin script: Alice is on a kayaking trip and is worried that her phone (which contains her private key) might fall overboard. She would like to store her bitcoins in such a way that they can be spent with knowledge of a password. Accordingly, she stores them in the following ScriptPubKey address: OP_SHA1 <0x13818a5684a7ed4dce8433c3f57e13b589b88852> OP_EQUALVERIFY Write a ScriptSig script that will successfully redeem this transaction. [Hint: it should only be one line long.] Explain why this is not a secure way to protect bitcoins using a password. c. Would implementing this using pay-to-script-hash (P2SH) fix the security issue(s) you identified? Why or why not?
la) Declare and instantiate a HashMap object named hMap whose values are Integers and keys are Strings. 1b) Write a for-each loop to find the total of the values in this HashMap.
A simple hash algorithm to map a set of integers into array locations is the _______________ operator.
What is the load factor?a) Average array sizeb) Average key sizec) Average chain lengthd) Average hash table length
a. Hash the following reindeer names, in this order based on the first letter of their name into a hash table of size 8 donner blitzen cupid dancer vixen prancer comet dasher b. this list has an issue called what?
A hash is most equivalent to a __________. encryption double encryption digest two way operation
It is python language Write the code that creates a new Node class. It will store data and next attributes. You only need to create the __init__ method. data and next variables will have default values, both set to None. Assume you are using the Node class from the previous connection to create a LinkedList. You have the code below, create a method that removes the first node from the LinkedList. class LinkedList: def __init__(self): self.head = None Based on the code from the last two questions, create a new LinkedList. Add 2 values to the LinkedList (there is an add method that accepts data as an argument, called add). Then call the removeFront method created in the previous question. Based on the previous questions, create a Queue class that uses the LinkedList for its data storage. Create the __init__, isEmpty, insert, remove, and size methods. Assume that LinkedList class has the add, removeFront and size methods defined. Based on the LinkedList code already…
2. The following keys are inserted into an initially empty B-Tree of order 3. Construct the B-Tree 56, 12, 32, 6, 37, 85, 79, 99.
2) Hash Innards Homework • Unanswered Select all true statements from the below. Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation. SHOW MORE V a A hash function takes a key and produces an index into the hash table. The next step in this process is often something like 'h%SIZE' so that the hash value of the key will fit within the table b (having SIZE elements, you see). Common techniques involve exclusive or of bits within the key and folding different sections of bits within the key into each other. The best hash method for character strings is to simply add up the ASCIlI values of their individual characters. Coming up with a perfect hash for a given set of keys can be a difficult and time-consuming task.
The compareTo method. First you compare this.ticker which is a String, then if they are the same then you compare by the this.purchasePrice which is a double hashCode public int hashCode() The hashCode method using the Code-> Generate equals and hashCode with no changes Overrides: hashCode in class Object Returns: int Representing the hashCode compareTo public int compareTo(Stock another) The compareTo method not auto generated Compares first by ticker and if the tickers are the same secondarily compares by price Specified by: compareTo" in interface Comparable<stock> Parameters: another - the object to be compared. Returns: int Representing order Throws: IllegalArgumentException"- if another is null.
create a script that prompts the user for a number. then create a loop to generate that number of random hash tables. then add these hash tables to an array. powershell