Which of the following hashing functions is used for separate chaining? hash(i) = abs(i) mod table size hash(i) = abs(i) + i^2 mod table size hash(i)= abs(i) mod table size, a second function d(k) = 7 - k mod 7 for collusion Separate chaining doesn't use a hash function 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
icon
Related questions
Question
I need the answer as soon as possible
Which of the following hashing functions is used for separate chaining?
O hash(i) = abs(i) mod table size
O hash(i)- abs(i) + i^2 mod table size
O hash(i)= abs(i) mod table size, a second function d(k) = 7- k mod 7 for collusion
O Separate chaining doesn't use a hash function
O None of the above
Suppose you have the following hash table, implemented using linear probing. The hash function we
are using is h(x) = x mod (table size).
1
3
4
6
47
55
93
10
40
76
In which order could the elements have been added to the hash table? Assume that the hash table
has never been resized, and no elements have been deleted yet.
O 76, 93, 40, 1O, 55, 47
O 76, 93, 40, 47, 10, 55
O 55, 76, 93, 40, 10, 47
O Multiple correct answer
O None of the above
What is the height of the tree shown below:
14
4
8.
(12
17
(13
O 2
O 3
0 4
O 5
O None of the above
Transcribed Image Text:Which of the following hashing functions is used for separate chaining? O hash(i) = abs(i) mod table size O hash(i)- abs(i) + i^2 mod table size O hash(i)= abs(i) mod table size, a second function d(k) = 7- k mod 7 for collusion O Separate chaining doesn't use a hash function O None of the above Suppose you have the following hash table, implemented using linear probing. The hash function we are using is h(x) = x mod (table size). 1 3 4 6 47 55 93 10 40 76 In which order could the elements have been added to the hash table? Assume that the hash table has never been resized, and no elements have been deleted yet. O 76, 93, 40, 1O, 55, 47 O 76, 93, 40, 47, 10, 55 O 55, 76, 93, 40, 10, 47 O Multiple correct answer O None of the above What is the height of the tree shown below: 14 4 8. (12 17 (13 O 2 O 3 0 4 O 5 O None of the above
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fundamentals of Blockchaining
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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