GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2015 · Session-1
Programming & Data StructuresProgrammingmediumNAT2 marks
Consider the following C program segment.
c
while (first <= last) {
    if (array[middle] < search)
        first = middle + 1;
    else if (array[middle] == search)
        found = TRUE;
    else
        last = middle - 1;

    middle = (first + last) / 2;
}

if (first > last)
    notPresent = TRUE;
The cyclomatic complexity of the program segment is __________.
Save your progress

Related Programming & Data Structures PYQs

GATE 2015 · Set-1

Consider the following New-order strategy for traversing a binary tree: • Visit the root; • Visit the right subtree using New-orde…

GATE 2015 · Set-3

Consider the following array of elements. 〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉. The minimum number of interchanges nee…

GATE 2015 · Set-1

What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes o…

GATE 2015 · Set-3

Consider the following C program segment. ```c #include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p…

GATE 2015 · Set-3

Consider the following C program. ```c #include <stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *…

GATE 2015 · Set-2

A Young tableau is a 2D array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked wi…