DAA CA-1

Which of the following are applications of Topological Sort of a graph?

The running time of quick sort depends on the selection of.

A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called________.

Time complexities of three algorithms are given. Which should execute the slowest for large values of N?

What is the time complexity of the following code snippet in C++?

void solve()

{ string s = "scaler";

int n = s.size();

for(int i = 0; i < n; i++)

{ s = s + s[i];

}

cout << s << endl;

}

Identify the slowest sorting technique among the following?

Breadth first search __________

Identify the sorting technique which compares adjacent elements in a list and switches whenever necessary?

Among the following options which is the best sorting algorithm when the list is already sorted?

PERMUTE-BY-SHORTING(A)n=A.lengthLet P[1…n] be a new array For i=1 to n P[i]=RANDOM(1,n3) Sort A,using P as sort keys The time complexity of above algorithm is

Consider the following code:

#include<stdio.h>

int recursive_sum(int n)

{

if(n == 0)

return 0;

return ________;

}

int main()

{

int n = 5;

int ans = recursive_sum(n);

printf("%d",ans);

return 0;

}

Which of the following lines is the recurrence relation for the abovecode?

Prim’s algorithm starts constructing a minimum spanning tree from ___.

___ is a concept wherein larger solutions for problems are found based upon the solution of a number of smaller problems.

Which Data Structure is used to perform Recursion?

Fractional knapsack problem is solved most efficiently by which of the following algorithm?