adplus-dvertising
frame-decoration

Question

In simple uniform hashing, what is the search complexity?

a.

O(n)

b.

O(logn)

c.

O(nlogn)

d.

O(1)

Answer: (d).O(1)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In simple uniform hashing, what is the search complexity?

Similar Questions

Discover Related MCQs

Q. In simple chaining, what data structure is appropriate?

Q. When is it appropriate to use direct addressing?

Q. What is the time complexity to insert an element into the direct address table?

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

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

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

Q. A ________ is a special Tree-based data structure in which the tree is a complete binary tree.

Q. How many type of heap are there?

Q. In which heap the root node must be greatest among the keys present at all of its children?

Q. What is the complexity of adding an element to the heap?

Q. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

Q. Min heap can be used to implement selection sort.

Q. Which one of the following array elements represents a binary min heap?

Q. Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct sequences of elements after inserting all the elements in a min-heap?

Q. What is the amortized cost per operation of a skew heap?

Q. How do you allocate a matrix using a single pointer in C? (M and N are the number of rows and columns respectively)

Q. Which of the following don't use matrices?

Q. What is the relation between Sparsity and Density of a matrix?

Q. Who coined the term Matrix?

Q. Who coined the term Sparse Matrix?