Q. What is the other name of weak heap?

View solution

Q. What is the worst case time in searching minimum value in weak -heap?

View solution

Q. The total comparisons in finding both smallest and largest elements are

View solution

Q. Does there exist a heap with seven distinct elements so that the Inorder traversal gives the element in sorted order.

View solution

Q. The leaf node for a heap of height h will be at which position.

View solution

Q. The main distinguishable characterstic of a binomial heap from a binary heap is that

View solution

Q. The number of trees in a binomial heap with n nodes is

View solution

Q. In a binomial heap the root value is greater than left child and less than right child.

View solution

Q. What is order of resultant heap after merging two tree of order k?

View solution

Q. Time taken in decreasing the node value in a binomial heap is

View solution

Q. Which of these operations have same complexities?

View solution

Q. The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.

View solution

Q. Given a heap of n nodes.The maximum number of tree for building the heap is.

View solution

Q. Choose the option with function having same complexity for a fibonacci heap.

View solution

Q. What is a hash table?

View solution

Q. If several elements are competing for the same bucket in the hash table, what is it called?

View solution

Q. What is direct addressing?

View solution

Q. What is the search complexity in direct addressing?

View solution

Q. What is a hash function?

View solution

Q. What can be the techniques to avoid collision?

View solution