1... ~33. Given the following numbers ...3562132... and given the following hashing function ...hashvalue = (i*i) mod 97... and using Linear Probing, where are the locations where the numberswill end up?Oa. 35 will be at 61 62 will be at 61 132 will be at 61b. 35 will be at 61 62 will be at 62 132 will be at 63c. 35 will be at 35 62 will be at 62 132 will be at 35d. 35 will be at 61 62 will be at 60 132 will be at 59.e. None of the above-

The question is to select the correct option for the given problem.

~33. Given the following numbers 35 62 132 ... ... and given the following hashing function... hashvalue = (i*i) mod 97 ... and using Linear Probing, where are the locations where the numbers will end up? a. 35 will be at 61 62 will be at 61 132 will be at 61 b. 35 will be at 61 62 will be at 62 132 will be at 63 c. 35 will be at 35 62 will be at 62 132 will be at 35 d. 35 will be at 61 62 will be at 60 132 will be at 59 e. None of the above

~33. Given the following numbers 35 62 132 ... ... and given the following hashing function... hashvalue = (i*i) mod 97 ... and using Linear Probing, where are the locations where the numbers will end up? a. 35 will be at 61 62 will be at 61 132 will be at 61 b. 35 will be at 61 62 will be at 62 132 will be at 63 c. 35 will be at 35 62 will be at 62 132 will be at 35 d. 35 will be at 61 62 will be at 60 132 will be at 59 e. None of the above

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

Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hashfunction h(x) = x mod 10, show the resulting:a. Separate chaining hash table.b. Hash table using linear probing.c. Hash table using quadratic probing.d. Hash table with second hash function h2(x) = 7 − (x mod 7).
Suppose you are given the following set of keys to insert into a hash table that holds exactly 11 values: 113, 117, 97, 100, 114, 108, 116, 105, 99. Using the hash function= value %table_size. Which of the following best demonstrates the contents of the hash table after all the keys have been inserted using linear probing? 100,__,__,113,114,105,116,117,97,108,99 99,100,__,113,114,__,116,117,105,97,108 100,113,117,97,14,108,116,105,99,__,__ 117,114,108,116,105,99,__,__,97,100,113
Given a hash table of size M=10 and a linear probing method, following are the contents of the hash table: [-1, 41, 71, -1, 64, 75, 84, -1, 88, 9]. -1 indicates slot is empty. Use the standard hash function: h(x)=x%M Match the index on the left with the value on the right for the hash table after the following operations are carried out in the given order: delete(88) delete(41) delete(44) insert(108) insert(71)
A well designed hash function normally has multiple properties, including collision resistance, which means it is very hard for one to find a pair of inputs x≠y, such that h(x) = h(y). Could we just use a collision resistant function to do encryption? i.e., Enc(k,m)=f(k,m), where f is a collision resistant function.
Hey, Explain why using the following functions f1 and f2 as hash functions for a hash table of size m of integers is problematic. Here m is a prime number.1. f1(x)= xHere x denotes the cross sum of x. 2. f2(x)=⌊x/m⌋ mod m Thank you in advance!
Consider a hash function h(x) = x mod 2256, that is, the hash function returnsthe last 256 bits of x.Does this function havea. collision resistanceb. irreversibilityc. puzzle friendlinessWhy or why not?
Using quadratic probing, create a hash table HT[0..8, 0..2] for the collection of keys 17, 9, 34, 56, 11, 4, 71, 86, 55, 10, 39, 49, 52, 82, 31, 13, 22, 35, 44, 20, 60, and 28.Use the hashing formula H(X) = X mod 9. What conclusions have you drawn?
Computing Values of a Hash FunctionInstead of 10,000 students, suppose there are only 6. Define a functionH, from the set of student ID numbers to the set {0, 1, 2, 3, 4, 5, 6,7, 8, 9, 10} as follows:H(n) = n mod 11 for each ID number n.To compute values of H either use a calculator or a computer with abuilt-in mod function or use the formula n mod 11 = n - (n div 11). Inother words, divide n by 11, multiply the integer part of the resultby 11, and subtract that number from n.As an example, since 328343419/11 = 29849401.73.H(328343419) = 328343419 - (11 * 29849401) = 8. To store the link tothe record for the student with ID number n, start by computing H(n).For instance, if the ID numbers are 328343419, 356633102, 223799061,607275830 and 513408716, calculate the hash values and comment in detailwith mathematical justification on the hash function.
Given is the hash function h(k) = k mod 10. How many different insertion sequences of keys are there to generate the following hash table if closed hashing with linear probing is used? B0 = ∅ B1 = ∅ B2 = {32} B3 = {43} B4 = {54} B5 = {12} B6 = {76} B7 = {23} B8 = ∅ B9 = ∅
Suppose we have a hash table of size 11 and use the hash function h(key) = (key + i2) % 11, where i = 0, 12, 22, ..., 102. After inserting entries with keys 35, 29, 54, 43, 121, 33, 44, and 187. What is the index of key 187? index = {0, 1, 2, ..., 10}
Write a program to find values of a and M, with M as small as possible, such that the hash function (a * k) % M for transforming the kth letter of the alphabet into a table index produces distinct values (no collisions) for the keys S E A R C H X M P L. The result is known as a perfect hash function
This question relates to hash functions for block ciphers Block size = 4 bits Hash size = 4 bits Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into two halves: LT and RT; Then ciphertext= LC||RC where LC=LK XOR RT; and RC = RK XOR LT; where LC, RC, LT, and RT are each 2 bits; Plaintext and ciphertext are each 4 bits. g(H) = a 4-bit string that is equal to the complement of bits in H; For example, if H=A (Hexa) = 1010 (binary); then g(H)= 0101 H0 = Initial hash = C (in Hexa) Given message M: D9 (in Hexa); a. Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function b. Determine the hash (in hexadecimal) of the message M using Davis-Meyer hash function c. Determine the hash (in hexadecimal) of the message M using Migayuchi-Preneel hash function