Q:

The process of finding some other position when hash address is occupied is classified as

0

The process of finding some other position when hash address is occupied is classified as


  1. collision resolution
  2. address space resolution
  3. multiple hashing resolution
  4. chaining resolution

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

 (a).collision resolution

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

DBMS - STORAGE AND FILE STRUCTURES MCQs

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
The ordered files with primary index are called... >>
<< The hard disk drives are example of...