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
Explain test metric and the information it provides.
What is the test case?
what are the 3 test tool categories and describe what each can do.
What is the difference between coupling and cohesion?
According to RBI rule how much money can be transferred through online banking at one time...?
Can you explain the elementary process?
Please Tell me About Fish-Bone Model. Thanks in Adv.
Can some one help me writing a manual test case for email applications like yahoo i need for www.everonn.com
What is black box testing, and what are the various techniques?
What is a code walk through?
How we test the bulk of contents in web page using manual testing? Is any open source tool available for that ? Thanks in advance..
What is reverse engineering?
Do write a separate test case for regression testing? If it is yes, explain how to write the test case?
Can you explain steps in function points?
What is a top-down and bottom-up approach in testing?