Register

Which of the following is not collision Resolution Technique

4,617 views
0 0 votes

Which of the following is not collision Resolution Technique

  1. Hash addressing
  2. Chaining
  3. Indexing
  4. None of these

1 Answer

3 3 votes

Answer : Indexing

Indexing is a data structure technique to efficiently retrieve records from the database files based on some attributes on which the indexing has been done. 

Voting & Accepting an answer helps improve the community
← Previous · which of the followi...Next → · what is the throughp...
← Previous in category · C programming\ basic...Next in category → · dangling pointer
Position:
Show:

Related questions

60 60 votes
4 answers 4 answers
24.9k
24.9k views
Arjun asked Feb 12, 2020
24,929 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
0 0 votes
0 0 answers
1.4k
1.4k views
Soumya29 asked Oct 5, 2018
1,380 views
Self-doubt - Case of Deletion when Open Addressing is used for collision resolution
In case of Open Addressing, when a key is deleted, a tombstone marker(delete marker) is inserted at its place.So if the hash table contains a lot of markers then it degra...
3 3 votes
1 1 answer
143
143 views
GO Classes asked Jul 17
143 views
GO Classes DPP | GATE CS, DA | Data Structure | Collision Resolution
Which of the following are open addressing approaches for resolving collisions in a hash table?Linear probing Quadratic probing Exponential hashing Separate chaining
13 13 votes
6 answers 6 answers
11.4k
11.4k views
radha gogia asked Jul 20, 2015
11,414 views
Consider a hash table with ‘m’ slots that uses chaining for collision resolution.
Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted tha...