Computer Sciences > GATE 2023 > Algorithms
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 executed in Function 1 and Function 2, respectively. Which of the following statements is/are TRUE?
Correct : b,d
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 the following functions, where n is a positive integer.n1/3, log(n), log(n!), 2log(n)Which one of the following options lists the functions in increasi...
Total Unique Visitors
Loading......