GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2015 · Set-1
AlgorithmsAlgorithm Analysis and Asymptotic NotationsmediumMCQ2 marks
Consider the following C function:
c
int fun1 (int n) {
    int i, j, k, p, q = 0;
    for (i = 1; i < n; ++i) {
        p = 0;
        for (j = n; j > 1; j = j / 2)
            ++p;
        for (k = 1; k < p; k = k * 2)
            ++q;
    }
    return q;
}
Which one of the following most closely approximates the return value of the function fun1?
Save your progress

Related Algorithms PYQs

GATE 2015 · Set-1

Given below are some algorithms, and some algorithm design paradigms. List - I P. Dijkstra’s Shortest Path Q. Floyd-Warshall algor…

GATE 2015 · Set-1

Match each algorithm in List I with the algorithm-design technique it primarily uses in List II. | List I: Algorithm | List II: D…

GATE 2015 · Set-2

An algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 delete operations, and (logN)1/2 decrease-key oper…

GATE 2015 · Set-3

Let f(n) = n and g(n) = n^(1 + sin n) where n is a positive integer. Which of the following statements is/are correct? I. f(n) = O…

GATE 2015 · Set-2

Consider a complete binary tree where the left and the right subtrees of the root are max heaps. The lower bound for the number of…

GATE 2015 · Set-3

Consider the equality X = Σ_{i=0}^n i^3 and the following choices for X: I. Θ(n^4) II. Θ(n^5) III. O(n^5) IV. Ω(n^3) The equality …