NIELIT Scientific Assistant A 2020 November: 113

Question

Consider the following C program segment.

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)not Present = True;

The cyclomatic complexity of the program segment is _____________.

• A. $3$
• B. $4$
• C. $5$
• D. $6$

Answer 1

Cyclomatic complexity= number of predicates+1

here 4 predicates(while,if,else-if,if) presents 1 while loop and 3 if conditions.Total=4+1=5

option $C$ is correct.

1. gate 2015
2. ISRO 2014
3. ISRO 2011