Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 36

• edited by
1,968 views

2 Answers

2 votes
2 votes

 The average search time of hashing is O(1).

Load factor is the ratio of number of records that are currently present and 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, the search time will be less.

the load factor of hashing Is strictly far less than 1

https://gateoverflow.in/185239/nielit-set-c-106

https://gateoverflow.in/337209/nielit-2016-mar-scientist-c-section-c-56

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
admin asked Mar 31, 2020
4,403 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 22
Which type of algorithm is used to solve the "$8$ Queens" problem ? Greedy Dynamic Divide and conquer Backtracking
Which type of algorithm is used to solve the "$8$ Queens" problem ?GreedyDynamicDivide and conquerBacktracking
User Avatar
6 votes
6 votes
5 answers
2
admin asked Mar 31, 2020
1,617 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 39
Merge sort uses : Divide-and-conquer Backtracking Heuristic approach Greedy approach
Merge sort uses :Divide-and-conquerBacktrackingHeuristic approachGreedy approach
User Avatar
5 votes
5 votes
5 answers
3
admin asked Mar 31, 2020
1,868 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
User Avatar
2 votes
2 votes
2 answers
4
admin asked Apr 1, 2020
873 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 36
The average search time for hashing with linear probing will be less if the load factor Is far less than one Equals one Is far greater than one None of the above
The average search time for hashing with linear probing will be less if the load factorIs far less than oneEquals oneIs far greater than oneNone of the above
User Avatar
Link Copied!