Data Structure and Algorithms Questions and Answers Pdf - 3

Question: 11

What is a completely inverted file?

It is a file structure, which includes an inversion index for every field of the records.

Question: 12

What is meant by home address, in the context of hashing?

It is an address to which key value hashes.

Question: 13

What is a meant by level of a node in the context of a tree?

It is the length of the path from the root to that node. Root of a tree has level 0.

Question: 14

What is an equivalence class in the context of hashing?

It is a set of unequal keys that map to same home address.

Question: 15

What is a collision, in the context of hashing?

It is a situation where two unequal key values map to the same home address. These unequal keys are known as synonyms.