Digital-Logic-Design
October 14, 2023NTA UGC NET DEC-2022 Paper-2
October 14, 2023Software-Engineering
Question 33 |
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 33 Explanation:
Note: Out of syllabus.
Correct Answer: A
Question 33 Explanation:
Note: Out of syllabus.
Subscribe
Login
0 Comments