...
Digital-Logic-Design
October 14, 2023
NTA UGC NET DEC-2022 Paper-2
October 14, 2023
Digital-Logic-Design
October 14, 2023
NTA UGC NET DEC-2022 Paper-2
October 14, 2023

Software-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 __________.

A
5
B
6
C
7
D
8
Question 33 Explanation: 
Note: Out of syllabus.
Correct Answer: A
Question 33 Explanation: 
Note: Out of syllabus.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!