Awesome q2a theme
0 votes
12 views

What is the proper definition for closed and open hashing? They seem to be used interchangeably in the following two questions

  • Consider a hash table of size seven, with starting index zero, and a hash function (3x+4)mod7(3x+4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1,3,8,101,3,8,10 is inserted into the table using closed hashing? Note that − denotes an empty location in the table.GATE2007-40
  • The keys 12,18,13,2,3,23,512,18,13,2,3,23,5 and 1515 are inserted into an initially empty hash table of length 1010 using open addressing with hash function h(k)=kmod10h(k)=kmod10 and linear probing. What is the resultant hash table GATE 2009-36

 

My understanding is that Open refers to when the keys don’t have to be confined to the Hash table only and hence “open” using a linked list for each case. Closed on the other hand using the same table and methods like probing and double hashing.

Right now I am just assuming that whenever linear probing to used closed.

in Algorithms by (5 points) | 12 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,106 questions
3,157 answers
14,595 comments
95,958 users