mprashanthi

 Profile Answers by mprashanthi 

• Oct 5th, 2006

 

1.Draw the flowgraph corresponding to the procedural design or code

2.Determine the cyclomatic complexity of the flow graph.

V(G) = E-N+2

where, E=No. of edges,N=No. of nodes

3.Determine the basis set of independent paths.(The cyclomatic complexity indicates the no. of paths required.)

4.Prepare test cases tha will force execution of each path.

aparnay

 Profile Answers by aparnay Questions by aparnay

• Oct 5th, 2006

 

Hi,

  thanks for answering..could you tell me how to draw flow graph please..i am new to testing.

mprashanthi

 Profile Answers by mprashanthi 

• Oct 7th, 2006

 

Hi Aparna,

Give me ur mail id,so that I can mail it to u bcoz the anwer to ur question"How to draw flow graphs?" i can send it thru word document and i don't have the option to attach files here.

Regards,

Prashanthi

aparnay

 Profile Answers by aparnay Questions by aparnay

• Oct 9th, 2006

 

Hi Prasanthi,

   Thanks for giving reply.my email id is kandula_aparna@yahoo.com

aparnay

• Oct 10th, 2006

 

Hi Prashanthi,

  Thanks for sending the flowgraph document.But in order to work with loop testing ,path testing strategies do you have to write test cases to test those strategies or do you use any tool..Dont mind..i am new to testing thats why i am asking these questions

Sujatars

 Profile Answers by Sujatars 

• Feb 27th, 2007

 

In path testing, data is selected to ensure that all paths of the program have been

executed.Often, paths through the
program are grouped into a finite set of classes and one path
from each class is tested.