GATE CSE: Algorithms

Question 1 of 10

Solve T(n) = 2T(n/2) + n.

Question 2 of 10

Solve T(n) = T(n/2) + 1.

Question 3 of 10

Quicksort that always picks the first element as pivot, on an already sorted array, takes:

Question 4 of 10

Which of these sorting algorithms is stable as normally implemented?

Question 5 of 10

Dijkstra's algorithm can give wrong answers when the graph has:

Question 6 of 10

Floyd-Warshall on a graph with V vertices runs in:

Question 7 of 10

The lower bound on worst-case comparisons for any comparison-based sort is:

Question 8 of 10

0/1 knapsack by dynamic programming with n items and capacity W takes:

Question 9 of 10

Kruskal's algorithm with union-find on a graph with E edges runs in:

Question 10 of 10

A minimum spanning tree of a connected graph with V vertices has how many edges?