Which of the following reduces the chances of collision in a hash table? a. A hash function with uniform distribution b.

[answerhappygod]

Which of the following reduces the chances of collision in ahash table?
a. A hash function with uniform distribution
b. A hash function with a non- uniform distribution
c. A hash table of size smaller than the number of elements tobe stored
d. A hash table of size larger than the number of elements to bestored
Assuming that a hash table uses separate chaining to addresscollisions, which of the following data structures would not besuitable for storing values at every hashed index?
a. ArrayList
b. LinkedList
c. Fixed Length Arrays
Which of the following is true about a search using a B+Tree?
a. Supports range searches but not equality searches
b. Not good for equality searches or range searches
c. Support both range searches and equality searches
d. Good for sliding window searches, not for equality orrange.
e. Supports equality searches but not range searches.