Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged cyclomatic-complexity
0
votes
1
answer
1
ISRO 2024
McCabe’s cyclomatic complexity number of a program control graph ‘$G$’ with $e$edges, $n$ nodes and $p$ disconnected paths is defined as $n – e + 2p$ $e – n + 2 + p$ $e – n +2p$ $n – e + p$
McCabe’s cyclomatic complexity number of a program control graph ‘$G$’ with $e$edges, $n$ nodes and $p$ disconnected paths is defined as$n – e + 2p$$e – n + 2 +...
Ramayya
289
views
Ramayya
asked
Jan 7
IS&Software Engineering
isro-2024
is&software-engineering
non-gate
cyclomatic-complexity
+
–
0
votes
2
answers
2
NIELIT 2021 Dec Scientist B - Section B: 39
A particular control flow graph has $15$ nodes out of which $7$ are decision nodes. The cyclomatic complexity and number of edges respectively can be given by the following : $7, 21$ $15, 24$ $8, 21$ $16,16$
A particular control flow graph has $15$ nodes out of which $7$ are decision nodes. The cyclomatic complexity and number of edges respectively can be given by the followi...
admin
522
views
admin
asked
Jul 21, 2022
IS&Software Engineering
nielit-2021-it-dec-scientistb
is&software-engineering
cyclomatic-complexity
+
–
0
votes
1
answer
3
What will be the Cyclomatic Complexity of the following garph?
Aaditya Pundir
912
views
Aaditya Pundir
asked
Jul 2, 2022
IS&Software Engineering
is&software-engineering
cyclomatic-complexity
+
–
1
votes
1
answer
4
NIELIT 2022 April Scientist B | Section B | Question: 84
To carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below: For basis path based testing of this program, its cyclomatic complexity is $5$ $4$ $3$ $2$
To carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below:For basis path based testing of this program, its cycl...
soujanyareddy13
681
views
soujanyareddy13
asked
Apr 12, 2022
Others
nielit2022apr-scientistb
is&software-engineering
cyclomatic-complexity
normal
+
–
1
votes
1
answer
5
NIELIT Scientific Assistant A 2020 November: 113
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 _____________. $3$ $4$ $5$ $6$
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; mid...
gatecse
755
views
gatecse
asked
Dec 9, 2020
IS&Software Engineering
nielit-sta-2020
is&software-engineering
cyclomatic-complexity
+
–
2
votes
1
answer
6
ISRO2020-69
Consider the following pseudo-code I=0; J=0; K=8; while(I<K-1) //while-1 { J=J+1; while(J<K) //while-2 { if(x[I]<x[J]) { temp = x[I]; x[I]=x[J]; x[J]=temp; } }// end of while-2 I=I+1; }// end of while-1 The cyclomatic complexity of the above is $3$ $2$ $4$ $1$
Consider the following pseudo-codeI=0; J=0; K=8; while(I<K-1) //while-1 { J=J+1; while(J<K) //while-2 { if(x[I]<x[J]) { temp = x[I]; x[I]=x[J]; x[J]=temp; } }// end of wh...
Satbir
2.6k
views
Satbir
asked
Jan 13, 2020
IS&Software Engineering
isro-2020
is&software-engineering
cyclomatic-complexity
normal
+
–
4
votes
1
answer
7
UGC NET CSE | June 2016 | Part 2 | Question: 44
The cyclomatic complexity of a flow graph V(G), in terms of predicate notes is P+1 P-1 P-2 P+2 Where P is the number of predicate nodes in flow graph V(G)
The cyclomatic complexity of a flow graph V(G), in terms of predicate notes isP+1P-1P-2P+2Where P is the number of predicate nodes in flow graph V(G)
go_editor
2.4k
views
go_editor
asked
Aug 16, 2016
IS&Software Engineering
ugcnetcse-june2016-paper2
cyclomatic-complexity
+
–
2
votes
1
answer
8
UGC NET CSE | December 2014 | Part 2 | Question: 45
Which one of the following is used to compute cyclomatic complexity ? The number of regions $-1$ $E – N + 1$, where $E$ is the number of flow graph edges and $N$ is the number of flow graph nodes. $P – 1$, where $P$ is the number of predicate nodes in the flow graph $G$. $P + 1$, where $P$ is the number of predicate nodes in the flow graph $G$.
Which one of the following is used to compute cyclomatic complexity ?The number of regions $-1$ $E – N + 1$, where $E$ is the number of flow graph edges and $N$ is the ...
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Jul 23, 2016
IS&Software Engineering
ugcnetcse-dec2014-paper2
is&software-engineering
cyclomatic-complexity
+
–
6
votes
3
answers
9
ISRO2014-4
Consider the following pseudo- code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo -code? 2 3 4 5
Consider the following pseudo- codewhile (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end whileWhat is cyclomatic complexity of the above pseudo -code?2345
neha singh
8.0k
views
neha singh
asked
Jun 26, 2016
IS&Software Engineering
isro2014
is&software-engineering
cyclomatic-complexity
non-gate
+
–
2
votes
2
answers
10
Cyclomatic complexity of compound conditional statements
What is the cyclomatic complexity of given code fragment?
What is the cyclomatic complexity of given code fragment?
sh!va
1.4k
views
sh!va
asked
Jun 24, 2016
IS&Software Engineering
cyclomatic-complexity
is&software-engineering
+
–
5
votes
2
answers
11
ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6
The Cyclomatic Complexity metric V(G) of the following control flow graph3456
jaiganeshcse94
4.4k
views
jaiganeshcse94
asked
May 30, 2016
IS&Software Engineering
isro2011
is&software-engineering
cyclomatic-complexity
+
–
6
votes
1
answer
12
ISRO-2013-66
What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes? $4$ $5$ $6$ $7$
What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes?$4$$5$$6$$7$
makhdoom ghaya
4.8k
views
makhdoom ghaya
asked
May 12, 2016
IS&Software Engineering
isro2013
is&software-engineering
cyclomatic-complexity
non-gate
+
–
7
votes
4
answers
13
GATE CSE 2015 Set 3 | Question: 55
Consider the following software items: Program-$X$, Control Flow Diagram of Program-$Y$ and Control Flow Diagram of Program-$Z$ as shown below The values of McCabe's Cyclomatic complexity of program-$X$, program-$Y$, and program-$Z$ respectively are 4, 4, 7 3, 4, 7 4, 4, 8 4, 3, 8
Consider the following software items: Program-$X$, Control Flow Diagram of Program-$Y$ and Control Flow Diagram of Program-$Z$ as shown belowThe values of McCabe's Cyclo...
go_editor
5.7k
views
go_editor
asked
Feb 16, 2015
IS&Software Engineering
gatecse-2015-set3
is&software-engineering
cyclomatic-complexity
normal
non-gate
+
–
11
votes
2
answers
14
GATE CSE 2015 Set 1 | Question: 42
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) notpresent = TRUE; The cyclomatic complexity of the program segment is_______________.
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...
makhdoom ghaya
14.0k
views
makhdoom ghaya
asked
Feb 13, 2015
IS&Software Engineering
gatecse-2015-set1
is&software-engineering
cyclomatic-complexity
normal
out-of-syllabus-now
numerical-answers
+
–
4
votes
2
answers
15
GATE IT 2005 | Question: 65
Tb carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below: For basis path based testing of this program, its cyclomatic complexity is $5$ $4$ $3$ $2$
Tb carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below:For basis path based testing of this program, its cycl...
Ishrat Jahan
2.9k
views
Ishrat Jahan
asked
Nov 3, 2014
IS&Software Engineering
gateit-2005
is&software-engineering
cyclomatic-complexity
normal
+
–
3
votes
1
answer
16
GATE IT 2004 | Question: 69
Consider the following program module: int module1 (int x, int y) { while (x! = y) { if (x > y) x = x - y, else y = y - x; } return x; } What is Cyclomatic complexity of the above module? 1 2 3 4
Consider the following program module:int module1 (int x, int y) { while (x! = y) { if (x y) x = x - y, else y = y - x; } return x; }What is Cyclomatic complexity of the...
Ishrat Jahan
4.0k
views
Ishrat Jahan
asked
Nov 2, 2014
IS&Software Engineering
gateit-2004
is&software-engineering
cyclomatic-complexity
normal
+
–
1
votes
1
answer
17
GATE IT 2006 | Question: 17
With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of predicate nodes of G. Consider the following four expressions: E - N + P E - N + 2 P + 2 P + 1 The cyclomatic complexity of G is given by I or III II or III II or IV I or IV
With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of pre...
Ishrat Jahan
2.1k
views
Ishrat Jahan
asked
Oct 31, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
cyclomatic-complexity
normal
+
–
4
votes
2
answers
18
GATE IT 2006 | Question: 16
The cyclomatic complexity of the flow graph of a program provides an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once a lower bound for the number of tests that must be ... a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
The cyclomatic complexity of the flow graph of a program providesan upper bound for the number of tests that must be conducted to ensure that all statements have been exe...
Ishrat Jahan
2.9k
views
Ishrat Jahan
asked
Oct 31, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
cyclomatic-complexity
easy
+
–
5
votes
3
answers
19
GATE IT 2007 | Question: 55, UGCNET-June2012-III: 40
Consider the following pseudo-code: IF ((A > B) AND (C > D)) THEN A = A + 1 B = B + 1 ENDIF The cyclomatic complexity of the pseudo-code is 2 3 4 5
Consider the following pseudo-code:IF ((A B) AND (C D)) THEN A = A + 1 B = B + 1 ENDIFThe cyclomatic complexity of the pseudo-code is2345
Ishrat Jahan
6.2k
views
Ishrat Jahan
asked
Oct 30, 2014
IS&Software Engineering
gateit-2007
is&software-engineering
cyclomatic-complexity
normal
ugcnetcse-june2012-paper3
+
–
14
votes
4
answers
20
GATE CSE 2010 | Question: 21,ISRO2017-60
The cyclomatic complexity of each of the modules $\text{A}$ and $\text{B}$ shown below is $10.$ What is the cyclomatic complexity of the sequential integration shown on the right hand side? $19$ $21$ $20$ $10$
The cyclomatic complexity of each of the modules $\text{A}$ and $\text{B}$ shown below is $10.$ What is the cyclomatic complexity of the sequential integration shown on t...
go_editor
12.6k
views
go_editor
asked
Sep 29, 2014
IS&Software Engineering
gatecse-2010
is&software-engineering
cyclomatic-complexity
easy
isro2017
+
–
5
votes
1
answer
21
GATE CSE 2009 | Question: 50
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. The cyclomatic ... that should be tested during path coverage testing. I and II II and III I and III I, II and III
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a m...
Kathleen
4.8k
views
Kathleen
asked
Sep 22, 2014
IS&Software Engineering
gatecse-2009
is&software-engineering
cyclomatic-complexity
easy
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register