GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2007
AlgorithmsAlgorithm Analysis and Asymptotic NotationseasyMCQ1 mark
Consider the following C code segment:
c
int IsPrime(int n) {
    int i;
    for (i = 2; i <= sqrt(n); i++)
        if (n % i == 0) {
            printf("Not Prime\n");
            return 0;
        }
    return 1;
}
Let T(n) denote the number of times the for loop is executed by the program on input n. Which of the following is TRUE?
Save your progress

Related Algorithms PYQs

GATE 2007

Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound …

GATE 2007

In the following C function, let n >= m. ```c int gcd(int n, int m) { if (n % m == 0) return m; n = n % m; return gcd(…

GATE 2007

What is the Asymptotic Notation of the following recursive function: ```c int DoSomething (int n) { if (n <= 2) return 1; …

GATE 2007

Consider the following C-program fragment in which i, j, and n are integer variables. for (i = n, j = 0; i > 0; i /= 2, j += i); L…

GATE 2007

Consider the following recurrence: T(n) = 2T(⌊sqrt(n)⌋) + 1, T(1) = 1 Which one of the following is true?

GATE 2007

Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which o…