DAA-SLA

Which of the following is used for solving the N Queens Problem?

• Greedy algorithm

• Dynamic programming

• Backtracking

• sorting

Which of the following is a Divide and Conquer algorithm?

• bubble sort

• merge sort

• selection sort

• radix sort

Identify the approach followed in Floyd Warshall’s algorithm?

• linear programming

• dynamic programming

• greedy

• backtracking

What is the time complexity of the following code snippet

void solve()

{

string s = "scaler";

int n = s.size();

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

{

s = s + s[i];

}

cout << s << endl; }

• O(N)

• O(N^2)

• O(1)

• O(LOGN)

What is the technique called in which it does not require extra memory for carrying out the sorting procedure?

• stable

• unstable

• in-place

• out-place