0
6.9kviews
Define DFD and also draw the data flow graph of following code.

This question appears in Mumbai University > Software Testing & Quality Assurance Subject

Marks: 10 M

Year: May 2014

1 Answer
0
277views

intbinarysearch (int x, int V[ ], int n) {

int low, high, mid ;

low= 0;

high = n-1 ;

while (low< = high)

{ mid = ( low <= high) / 2 ;

if( x < V[mid] )

high = mid – 1;

else if (x > V[mid])

low …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.