The average search time of hashing, with linear probing will be less if the load factor
| A. | Is far less than one |
| B. | equals one |
| C. | is far greater than one |
| D. | none of these |
Answer : A Explanation : Load factor is the ratio of number of records that are currently present and the total number of records that can be present. If the load factor is less, free space will be more. This means probability of collision is less. So, search time will be less. |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
