Dark Mode

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$

Ramayya asked in IS&Software Engineering Jan 7

256 views

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$

admin asked in IS&Software Engineering Jul 21, 2022

by admin

497 views

0 votes

1 answer

3

What will be the Cyclomatic Complexity of the following garph?

Aaditya Pundir asked in IS&Software Engineering Jul 2, 2022

by Aaditya Pundir

668 views

1 vote

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$

soujanyareddy13 asked in Others Apr 12, 2022

by soujanyareddy13

669 views

1 vote

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$

gatecse asked in IS&Software Engineering Dec 9, 2020

726 views

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$

Satbir asked in IS&Software Engineering Jan 13, 2020

by Satbir

2.6k views

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)

go_editor asked in IS&Software Engineering Aug 16, 2016

2.4k views

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$.

makhdoom ghaya asked in IS&Software Engineering Jul 23, 2016

by makhdoom ghaya

3.2k views

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

neha singh asked in IS&Software Engineering Jun 26, 2016

7.9k views

2 votes

2 answers

10

Cyclomatic complexity of compound conditional statements
What is the cyclomatic complexity of given code fragment?

sh!va asked in IS&Software Engineering Jun 24, 2016

by sh!va

1.4k views

5 votes

2 answers

11

ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6

jaiganeshcse94 asked in IS&Software Engineering May 30, 2016

by jaiganeshcse94

4.3k views

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$

makhdoom ghaya asked in IS&Software Engineering May 12, 2016

by makhdoom ghaya

4.8k views

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

go_editor asked in IS&Software Engineering Feb 16, 2015

5.6k views

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_______________.

makhdoom ghaya asked in IS&Software Engineering Feb 13, 2015

by makhdoom ghaya

13.1k views

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$

Ishrat Jahan asked in IS&Software Engineering Nov 3, 2014

by Ishrat Jahan

2.8k views

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

Ishrat Jahan asked in IS&Software Engineering Nov 2, 2014

by Ishrat Jahan

3.8k views

1 vote

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

Ishrat Jahan asked in IS&Software Engineering Oct 31, 2014

by Ishrat Jahan

2.0k views

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

Ishrat Jahan asked in IS&Software Engineering Oct 31, 2014

by Ishrat Jahan

2.8k views

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

Ishrat Jahan asked in IS&Software Engineering Oct 30, 2014

by Ishrat Jahan

6.1k views

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$

go_editor asked in IS&Software Engineering Sep 29, 2014

12.1k views

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

Kathleen asked in IS&Software Engineering Sep 22, 2014

4.7k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged cyclomatic-complexity