Campus Recruitment Tech Quiz-4

The best case running times of Insertion sort, Bubble sort and Quick sort, respectively are:

Consider a relation R (A, B, C, D, E) with the following functional dependencies:

ABC →  DE

D →  AB

The number of super keys of R is:

In the Worst case, in Selection Sort, the total number of moves represented in order of______?

What is the output of the following C-code?
#include

If we apply DFS algorithm, on the following graph, then what is the maximum depth of recursive call?