GATE DA · 2024 · DA
Question 21: Programming, Data Structures and Algorithms
Give it a try, then reveal the answer to check your work.
Question 21
DAMCQ1 markNeeds review
Consider performing uniform hashing on an open address hash table with load factor
, where
elements are stored in the table with
slots. The expected number of probes in unsuccessful search is at most
. Inserting an element in this hash table requires at most _____ probes, on average.Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2024DA
GATE DA 2024 · Paper 1
Data Science and Artificial Intelligence · Original paper archive
- Section
- Data Science and Artificial Intelligence
- Question type
- Multiple choice (MCQ)
- Marks
- 1 mark
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
data science
GATE DA previous year questions
artificial intelligence
GATE DA previous year questions
computing
GATE DA previous year questions
Programming, Data Structures and Algorithms
GATE DA previous year questions
hash tables
GATE DA previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.