Register

Uttrakhand Asst. Professor Exam-41

• edited by
5,989 views

1 Answer

0 votes
0 votes

Probe Method is not used for hash function.

Hash function is a function which, when applied to the key, produced an integer which can be used as an address in a hash table. The intent is that elements will be relatively, randomly and uniformly distributed. 

Perfect Hah function is a function which, when applied to all the members of the set of items to be stored in a hash table, produces a unique set of integers within some suitable range. Such function produces no collisions.

Good hash function minimizes collisions by spreading the elements uniformly throughout the array.

Some common hash functions are

  • Folding Method
  • Division Method
  • Mid-square Method
  • Multiplication Method
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
gatecse asked Mar 2, 2018
2,312 views
Uttrakhand Asst. Professor Exam-64
Which of the following problem cannot be solved without recursion? Tower of Hanoi Fibonacci series Tree Traversal None of the above
Which of the following problem cannot be solved without recursion?Tower of HanoiFibonacci seriesTree TraversalNone of the above
User Avatar
0 votes
0 votes
1 answer
2
gatecse asked Mar 2, 2018
339 views
Uttrakhand Asst. Professor Exam-63
If there is a graph such that there is a unique path between any pair of vertices. The graph is a ________ Mesh Grid Tree Bipartite graph
If there is a graph such that there is a unique path between any pair of vertices. The graph is a ________MeshGridTreeBipartite graph
User Avatar
0 votes
0 votes
2 answers
3
gatecse asked Mar 2, 2018
447 views
Uttrakhand Asst. Professor Exam-39
If the post order traversal of tree gives $ab - cd * +$, then the label of the nodes A, B, C, ......, G will be a, -, b, +, c, *, d +, -, *, a, b, c, d -, a, +, b, c, d, * a, b, c, d, -, *, +
If the post order traversal of treegives $ab - cd * +$, then the label of the nodes A, B, C, ......, G will bea, -, b, +, c, *, d+, -, *, a, b, c, d-, a, +, b, c, d, *a, ...
User Avatar
0 votes
0 votes
1 answer
4
gatecse asked Mar 2, 2018
1,324 views
Uttrakhand Asst. Professor Exam-19
Which of the following search method takes less memory ? Depth-first search Breadth-first search Linear search None of the above
Which of the following search method takes less memory ? Depth-first search Breadth-first search Linear search None of the above
User Avatar
Link Copied!