Chapter-3:

1.  A software engineering group is developing a mission-critical software system that will launch laser-guided missiles to its destinations. This is a new kind of product that was never built by the company. As a quality assurance manager, which code review methodology—walkthrough or inspection—would you recommend? Justify your answer.

2. Draw a control flow graph for the following sample code. Determine the cyclomatic complexity of the graph.

(a) sum_of_all_positive_numbers (a, num_of_entries, sum)

(b) sum = 0

(c) init = 1

(d) while (init <= num_of_entries)

(e) if a[init] > 0

(f) sum = sum + a[init]

         endif

(g) init = init + 1

              endwhile

(h) end sum_of_all_positive_numbers

Chapter-4:

You are given the binary search routine in C shown in Figure 4.17. The input array V is assumed to be sorted in ascending order, n is the array size, and you want to find the index of an element X in the array. If X is not found in the array, the routine is supposed to return ? 1.

The questions refer to the binary search () function.

1. Draw a CFG for binsearch ().

2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion.

3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion.

4. Solve the path predicate expressions to generate test input and compute the corresponding expected outcomes.