Find the Cyclometric complexity on the following p
seudocode
Do while records remain
read record;
if record field#1=0
then process record;store in buffer;
incremental counter;store in file.
reset counter;end if end do
please let me know the procedure too.
Answers were Sorted based on User's Feedback
Answer / roshni
The answer for this is 3
3 formula's to calculate Cyclomatic complexity. You can
choose either of them...
C.C = No of bounded regions +1
C.C = No of edges - No of nodes +1
C.C = No of predicate Nodes +1
Now let's consider the first formula to calculate as the
rest 2 diagrams require flow graphs to be drawn.
Do while loop forms 1 bounded region
and IF condition forms 1 bounded region.
So as per this formula, C.C = No of bounded regions +1
2 + 1 = 3
| Is This Answer Correct ? | 10 Yes | 6 No |
Answer / sriharsha
Listen i will tell u a basic funda:
Cylometric complexity is THE NO. OF LOOPS + 1
so in the question u have to check how many loops r present.
if its 1 then the ans is 2
if its 0 then the nas is 1
| Is This Answer Correct ? | 4 Yes | 3 No |
how will you prioritize the work?
what we do when our reported defect reject?
Can anybody explain me Statement coverage with a example. Thanks..
what are the QA process u r following in your cmmi level 5 company
Loop Testing Comes Under 1. White box Testing 2. Block Box Testing 3. Green Box Testing 4. Yellow Box Testing
What is pesticide paradox?
Explain spiral model?
what is meant by estimation and it's use?
What is meant by entry criteria and exit criteria in software testing?
Deep structure testing is not designed to Option 1 examine object behaviors Option 2 exercise communication mechanisms Option 3 exercise object dependencies Option 4 exercise structure observable
what is domain testing. explain.
Hello can anybody list out supported and unsupported browsers for Window OS,Android OS,MAC OS Ubuntu