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.
Answer Posted / 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 |
Post New Answer View All Answers
i need some objective type papers for my certification
What are the cases why parameterization is necessary when load testing the Web server and the database server?
what type of quetion may be asked for experienced person in manual tester of 1 year?
What is pesticide paradox? How to overcome it?
any one please send me any test case examples with tabular columns in manual testing
what are the tests u did in entire project? when it did in the project? (means at the release build to end of project) plz explain clearly
How do you go about testing a project?
If anyone have attended interview with deloitte for the post of senior manual test engineer. Please share the interview process and the questions asked. How to prepare for the interview. Thanks in advance
What are the qualities needed by a software tester?
wht is Manual Testing Frame work
List out test deliverables?
How would u test and automate an Antivirus application ?
Which test cases are written first: white boxes or black boxes?
What are the basic forms of variations?
What is Stability and Performance Testing in Testing the TV