Algorithms

What is the worst case time complexity of Quick sort?

Which of the following is not an alogrithm design technique?

• Greedy

• Integer Programming

• Dynamic Programming

• Divide and Conquer

Merge Sort follows which algorithm design technique?

• Divide and Conquer

• Backtracking

• Dynamic Programming

• Brute force

Performance of which of the following sorting algorithms does not depend on input data pattern?

• Insertion Sort

• Quick Sort

• Bubble Sort

• Heap Sort

Which of the following is not a shortest path finding algorithm?

• Dijkstra's Algorithm

• Bellman-Ford Algorithm

• Floyd-Warshall Algorithm

• Kruskal's Algorithm

What is the time complexity of this code

int a = 0, i = N;

while (i > 0)

{

a += i;

i /= 2;

}

• O(N)

• O(Sqrt(N))

• O(N / 2)

• O(log N)

Find the slowest algorithm:

• O (n)

• O (n^2)

• O (n!)

• O (2^n)

Consider the following two sequences :

The length of longest common subsequence of X and Y is :Consider the following two sequences :

X = < B, C, D, C, A, B, C >, and Y = < C, A, D, B, C, B >

The length of longest common subsequence of X and Y is :

• 5

• 3

• 4

• 2