What is the depth of a complete binary tree with n nodes?

What is the worst case and best case time complexity of Quick Sort?

Which of the following principles belong to combinatorial problems?

Consider the following recursive function fun(x, y). What is the value of fun(4, 3)?

int fun(int x, int y)

{

if (x == 0)

return y;

return fun(x - 1, x + y);

}

What is the main advantage of Bubble sort compared to other sorting algorithms?

Given items as {value, weight} pairs {{60, 30}, {50, 25}, {20, 5}}. The capacity of the knapsack is 50. Find the maximum value output assuming the items are divisible and non-divisible respectively.

Consider the directed graph given below. Which one of the following is TRUE?

What are the disadvantages of using arrays?

In a permutation a1, ..., an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst-case time complexity of the Insertion Sort algorithm if the inputs are restricted to permutations of 1, ..., n with at most n inversions?

The following simple undirected graph is referred to as the Peterson graph.

Which of the following statements is/are TRUE?

1.The chromatic number of the graph is 3. 

2.The graph has a Hamiltonian path.  

3.The following graph is isomorphic to the Peterson graph

4.The size of the largest independent set of the given graph is 3. (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)