Computer Sciences > GATE 2026 SET-2 > Algorithms
Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity Θ(n)?
Correct : a,b
Similar Questions
Match the following
(P) Prim’s algorithm for minimum spanning tree
(i) Backtracking
(Q) Floyd-Warshall algorithm fo...
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Consider functions Function 1 and Function 2 expressed in pseudocode as follows:
Let f1(n) and f2(n) denote the number of times the statement "x = x + 1" is...
Total Unique Visitors
Loading......