Digital-Logic-Design
October 14, 2023Software-testing
October 14, 2023Software-Engineering
|
Question 37
|
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 __________.
|
5
|
|
|
6
|
|
|
7
|
|
|
8
|
Question 37 Explanation:
Note: Out of syllabus.
Correct Answer: A
Question 37 Explanation:
Note: Out of syllabus.
