Which of the following are true statements about collisions in hashing? Linear probing can cause secondary collisions. Higher space utilization tends to cause more collisions.

hello the options to your question is incomplete below are the options

A.   Linear probing causes secondary collisions.

B.   Higher space utilization tends to cause more collisions.

C.    Chained entries will be ordered by key.

D.   (a) and (b).

E.    All of the above.

answer : (a) and (b) --- D

Explanation:

The true statements about collisions in hashing are ;Linear probing causes secondary collisions and Higher space utilization tends to cause more collisions.

collisions in hashing is when two data sets whom are distinctively different have the same hash value or checksum. the collision in hashing can be resolved by checking  the hash table for an open slot to keep the data set that caused the collision.

answerthe reference of the object;

a) click on any cells in the range of data

b) click the data

c) click sort& filter group, click sort

d) select the column to sort by and then select a sort order

e) select the next column to sort by and select the sort order

f) click ok