Foxoyo
Hey..!!
Data Structure Hash Tables
Practice
MCQs
Quizzes
About
Leaderboard
Amazon Books
9
MCQs
0
Attempts
0 %
Accuracy
share
Filter by
Type here
Apply
What is direct addressing
Fewer keys than array positions
none of the mentioned
Fewer array positions than keys
Distinct array position for every possible key
What is the time complexity to delete an element from the direct address table
O(nlogn)
O(n)
O(1)
O(logn)
When is it appropriate to use direct addressing
When the array is comparatively small
When the array is comparatively large
When the universe U of keys is reasonably small
When the universe U of keys is reasonably large
If several elements are competing for the same bucket in the hash table, what is it called
Diffusion
none of the mentioned
Collision
Replication
What is the time complexity to insert an element into the direct address table
O(logn)
O(1)
O(n)
O(nlogn)
What is the search complexity in direct addressing
O(nlogn)
O(1)
O(logn)
O(n)
What can be the techniques to avoid collision
Use the chaining method
Use uniform hashing
All of the mentioned
Make the hash function appear random
What is the advantage of using a dynamic set in direct addressing
It saves space
It saves time
none of the mentioned
It saves both time and space
What is the advantage of using a dynamic set in direct addressing
It saves time
none of the mentioned
It saves both time and space
It saves space
1
take a quick Quiz
Practice mcqs on Data Structure Hash Tables
Let's start
pick difficulty level
all
1
2
3
4
5
9
Mcqs
0
attempts
0
followers
Related Topics
Data Structure Hash Tables
Data Structure Abstract Data Types
CSS Properties Elements Functions Tables
MySQL Database Tables and Datatypes
Excel Pivot Tables
Data Structure
Data Structure Dynamic Programming
Data Structure Recursion
Data Structure Binary Trees
Data Structure Arrays Types
Suggested Books
Javascript is disabled
we serve best when javscript is enabled
Enable