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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. How many type of heap are there?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Who coined the term Matrix?

View solution

Q. Who coined the term Sparse Matrix?

View solution

Q. Which of the following is not the method to represent Sparse Matrix?

View solution

Q. Which one of the following is a Special Sparse Matrix?

View solution