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

i need some objective type papers for my certification

2177

---

Why did you choose the Software Testing Field?

2199

---

hai friends i did my bcom (distance with out inter)and iam pursuing mca(distance alagappa university)iam learning testing cource in ameerpet can i elgibel for testing jobs pls guide me … …and send details to rangavijetha@gmail.com..thanks

1929

---

Can you explain v model in manual testing?

1183

---

what are the prerequisite conditins to test clientserver and web applications

2137

---

how mapp the defect id in quality center?

2252

---

Do you know anything about Set Top Boxes?

8332

---

List the considerations in developing testing methodology

6718

---

What is data flow diagram?

1143

---

Hi I am searching job please send some details abuot ERP project and real time test plan,traceability report,test case if any relate to erp project Please help me out to get a job in testing.my email address is chiku_69@yahoo.in Thank u

2815

---

What is test plan and contents available in a test plan?

1250

---

Risk Analysis a) 2 step, b)3 step, c) 4 step, d) 6 step

2072

---

Hi ALl, Can you please list out Q & A for Test Lead,which Interviewer may ask in interview for Test Lead position

1977

---

What is application programming interface (api)?

1171

---

What is Difference between Test Strategy and Test Methodology?

2324

---