What is the best case time complexity of the Merge Sort algorithm?

If the total weight of a graph is negative, it is called a:

Solve the following recurrence using Master's theorem:

T(m) = 16T(m/4) + m

Which of the following is not an alternate name of exponential search?

What is the time complexity for finding a Hamiltonian path in a graph with M vertices using the permutation approach?

In a B-tree, where does the insertion of a new node start?

Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is 

Match the following List-I A. Prim’s algorithm for minimum spanning tree B. Floyd-Warshall algorithm for all pairs shortest paths C. Mergesort D. Hamiltonian circuit List-II 1. Backtracking 2. Greed method 3. Dynamic programming 4. Divide and conquer Codes: A B C D (a) 3 2 4 1 (b) 1 2 4 3 (c) 2 3 4 1 (d) 2 1 3 4

Given the pseudo-code of Dijkstra's Algorithm:

1. //Initialise single source(G,s)
2. m=0
3. n=V[a]
4. While n != 0
5. Do b=extract-min(n)
6. m=m union {b}
7. For each vertex v in adj[b]
8. Do relax(b,v,w)

The difference between selection sort and bubble sort is