Menu

Trees Questions

MCQ

131.

What is the advantage of using a dynamic set in direct addressing?

A

It saves time

B

It saves space

C

It saves both time and space

D

None of the mentioned

Discussion

MCQ

132.

What is the time complexity to delete an element from the direct address table?

A

O(n)

B

O(logn)

C

O(nlogn)

D

O(1)

Discussion

MCQ

133.

How is a bit vector better compared to a normal array for implementing the hash table?

A

It saves time

B

It saves space

C

It saves both time and space

D

None of the mentioned

Discussion

BackPage 14 of 14