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 |
What is Bug leak or Defect leak ?
Tell me about CMM LEVEL -4 …what are steps that to be followed to achieve the CMM -IV standards?
What is Orphan links ?
HOW TO WRITE THE SCENARIO FOR ATM MACHINE AND COFFEE MACHINE ? URGENT
17 Answers IBM, Nihilent, Wipro,
What is deployment testing ? How it is performed ?
What is a model?
What are the main key components in web applications and client and server applications?
What does the verification process include: a. Reviews b. testing c. Both D. none of these
Where we save the bugs?
If we found a bug but that bug is not accepted by developer then what u do.
What are the Major Functionality for a ATM machine ??
what are the QA docments?