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 application server, Database server and test server
What is Automation Test frame work ?
what types of bugs will we find out in banking projects
Is testing is different in linux platform.please reply me how testing will be implemented on linux platform?
what are the parameters u apply for doing functional testing?
is Business requirment doc is configurations item or not how you control configurations control
In an application where there is no need of regession testing and retesting?
Once a bug is found how do u report it?wat is the process?
Where do you get your expected results?
What is the difference between QA (Quality Assurance) & QA (Quality Analyst)?
what is traceability matrix ?what is use of that matix ?
Explain The test development life cycle?