Quiz No. 2.2 Hash Tables
Authored by Mark Anthony Dancalan
Computers
University
Used 6+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
12 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In this method of collision resolution technique, all the elements are stored in the hash table itself.
Chaining Method
Open-Addressing Method
2.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
It is the simplest approach to resolving the problem of collision in hashing.
(a)
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is not a type of open-addressing method?
Linear Probing
Quadratic Probing
Binary Probing
Double Hashing
4.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
It is a mathematical formula that when applied to a key, produces an integer used as an index to find a key in the hash table.
(a)
5.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
It is a data structure that supports one of the efficient searching techniques, that is, hashing.
(a)
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In this method, a key 'k' is mapped into one of the 'm' slots by taking the remainder of 'k' divided by 'm'.
Mid-Square Method
Quadratic Probing
Division Method
Folding Method
7.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
In this method of collision resolution technique, a chain of elements is maintained that have the same hash address.
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
