T(n) = 4T(n/2) + n²√n, then T(n) =?

Which is the fastest sorting algorithm to sort a list?

What is the worst-case time complexity of inserting and searching in a binary search tree?

G is undirected graph with n vertices and 25 edges such that each vertex has degree at least 3. Then the maximum possible value of n is

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the hash table shown below? 

The string "ab" is a string of length 2.

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:

Note: The height of a tree with a single node is 0.

What additional requirement is placed on an array for binary search to be used to locate an entry?

In which of the following cases would jump search be preferred over exponential search?

Let G be a connected undirected weighted graph. Consider the following two statements.

S1 : There exists a minimum weight edge in G which is present in every minimum spanning tree of G.

S2 : If every edge in G has distinct weight, then G has a unique minimum spanning tree.

Which one of the following options is correct?