DAA - CSE A

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

• Greedy Algorithm

• Dynamic Programming

• Backtacking

• Sorting

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

• Merge Sort

• Quick Sort

• Bubble Sort

• Selection Sort

Which of the following is a Divide and Conquer algorithm?

• Bubble Sort

• Selection Sort

• Heap Sort

• Merge Sort

Which of the following data structure is used to perform recursion?

• Stack

• Queue

• Array

• Linked List

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; }

• O(n)

• O(n^2)

• O(1)

• O(log n)

What is the time complexity of the binary search algorithm?

• O(n)

• O(1)

• O(log₂n)

• O(n^2)

The worst-case time complexity of Quicksort is?

• O(n)

• O(n^2)

• O(nlogn)

• O(1)

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

• Stable

• Unstable

• In-place

• In-partition

Identify the slowest sorting technique among the following?

• Merge Sort

• Quick Sort

• Bubble Sort

• Selection Sort

Select the correct recurrence relation for Tower of Hanoi?

• T(N)=2T(N-1)+1

• T(N)=2T(N-2)+2

• T(N)=2T(N-1)+N

• T(N)=2T(N/2)+1