Problem on hash table

Question

A program that checks spelling works in the following way.

• A hash table has been defined in which each entry is a Boolean variable initialized to false.
• A hash function has been applied to each word in the dictionary, and the appropriate entry in the hash table has been set to true.
• To check the spelling in a document, the hash function is applied to every word in the document, and the appropriate entry in the hash table is examined.

Which of the following is (are) correct?

I. true means the word was in the dictionary.

II. false means the word was not in the dictionary.

III. Hash table size should increase with document size.

(A) I only

(B) II only

(C) I and II only

(D) II and III only

Comments

Key says B is the answer.

Can anyone please explain why I is not correct.

Answer 1

answer is (C) with assumption...that every appropriate word of document is always present in hash table..

for every word in the dictionary....is placed in one slot of hash table

let boolean var = X

a	X=T
aa	X=F
ab	X= F
...
an	X= T
...
ang	X = F
...
....
anger	X = T

so the words  that are true are available in dictionary..

false surely means the word is not there in dictionary..

increase in the document size doesn't effect the hash table size...as it already has  entry for every word arrangement possible...

Comments

ok wait i will recheck it..

---

the answer(c) is correct with assumption....if all the words that are present in document are also present in hash table.../////we must ask arjun sir..he will verify it..

---

Ok sir. I also thought C is the answer. Key says B. That's why I posted here. Key can also be wrong, na!!