(Time: 3 Hours) Total Marks:80 2) Solve Any Three Out of Remaining Five Questions. 3) Assume Suitable Data Wherever Necessary
(Time: 3 Hours) Total Marks:80 2) Solve Any Three Out of Remaining Five Questions. 3) Assume Suitable Data Wherever Necessary
5B 6 0 0 66 7C C F 3 F B
5B A6 102 210DD66 37C EC 2F4 493C CF4 47B5 52D
1 3
BAA61 021 10D 663 7CE EC2 2F49 93C F47 7B52 2D6 665B
6 02 0D 66 7C C F4 3C F4 B5 D 65 A
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61
1 D 3 4 C 5 5 0
61 021 10D 663 7CE EC2 2F49 93C F47 7B5 2D6 665B BA6 6102 210
02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10 D6
02 10D 66 37C EC 2F4 93C F4 7B5 2D 665 BA 610 210 D6 637
1 3 2 7
21 0D6 663 7CE EC2 F49 93C F47 B52 2D6 665B BA6 6102 210DD66 637C CEC
0D 63 7C C F4 3C F4 B5 D 65 A 10 10 6 37 E 2F
10 66 7 EC 2F 93 F 7B 2D 66 BA 61 21 D 63 C C2 4
67980
D 3 C 2 4 C 47 5 6 5 0 0 6 7 EC F 93
D6 6637 7CE EC2 F49 93CF F47 B52 2D6 65B BA6 6102 210DD66 637C CEC 2F4 493 CF4
6 C F 3 B D 6 1 1 3 2 C 7
66 37C CEC 2F4 493C CF4 47B 52D 665 5BAA610 021 0D6 6637 7CE EC2 F49 93CF F47 B52
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
{
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2F 493 CF 7B 52D 66 5BA
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
}
{
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 49 3C 47 5 D6 5B A6 102
CF 7B 52 6 5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10
47 52 D6 65B A6 102 10D 66 37C EC 2F4 93 F4 7B 2D 66 BA 61 21 D6
main()
else
B5 D 65 A 10 10 6 37 E 2F 93 CF 7B 52 66 5B 6 02 0D 63
2D 665 BA 61 21 D6 637 CE C2 49 CF 47 52 D6 5B A6 102 10D 66 7C
66 BA 61 021 0D 63 CE C2 F49 3C 47 B5 D6 65B A6 10 10 66 37 EC
int index;
clrscr();
5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 21 D6 37 CE 2
partitioning method.
int fact();
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61 21 0D 63 CE C2 F49
10 10 D6 37 EC 2F 493 CF 7B 52 66 5B 61 021 0D 663 7C C2 F4 3C
int number;
21 D6 63 CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC F 93 F4
int product=1;
0D 63 7C C F4 3C F4 B5 D 65 A 10 10 6 37 E 2F 49 CF 7B
66 7C EC 2F4 93C F4 7B 2D 665 BA 610 21 D6 637 CE C2 49 3CF 47 52
if (number < 0)
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 49 3C 47 5 D6 5B A6 102
Note: 1) Question no. 1 is compulsory.
CF 7B 52 6 5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10
47 52 D6 65B A6 102 10D 66 37C EC 2F4 93 F4 7B 2D 66 BA 61 21 D6
Page 1 of 2
66 7C EC 2F4 93C F4 7B 2D 665 BA 610 21 D6 637 CE C2 49 3CF 47 52
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
52D665BA610210D6637CEC2F493CF47B
66 BA 61 021 0D 63 CE C2 F49 3C 47 B5 D6 65B A6 10 10 66 37 EC
5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 21 D6 37 CE 2
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61 21 0D 63 CE C2 F49
10 10 D6 37 EC 2F 493 CF 7B 52 66 5B 61 021 0D 663 7C C2 F4 3C
21 D6 63 CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC F 93 F4
0D 63 7C C F4 3C F4 B5 D 65 A 10 10 6 37 E 2F 49 CF 7B
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
which quadrant the angle lies. Design test cases using equivalence class
cyclomatic complexity number for main( ) and fact( ) and then the cyclomatic
Q.3. a) Consider the following program for calculating the factorial of a number. It
complexity for the whole program. Draw DD graph. List all independent
consists of main( ) program and the module fact( ). Calculate the individual
A program takes an angle as input within the range [0,360] and determines in
(10)
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C
(05)
(10)
(05)
(05)
(05)
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 4
CF 7B 52 6 5B 6 02 0D 66 7C C F4
47 52 D6 65B A6 102 10D 66 37C EC 2F4 9
B5 D 65 A 10 10 6 37 E 2F 93
2D 665 BA 61 21 D6 637 CE C2 49
66 BA 61 021 0D 63 CE C2 F49 3C
5B 6 02 0D 66 7C C F 3 F
66 5BAA61 021 0D 663 7CE EC2 F49 3C F47
5B 6 0 0 66 7C C F 3 F B
5B A6 102 210DD66 37C EC 2F4 493C CF4 47B5 52D
1 3
BAA61 021 10D 663 7CE EC2 2F49 93C F47 7B52 2D6 665B
6 02 0D 66 7C C F4 3C F4 B5 D 65 A
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61
1 D 3 4 C 5 5 0
61 021 10D 663 7CE EC2 2F49 93C F47 7B5 2D6 665B BA6 6102 210
02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10 D6
02 10D 66 37C EC 2F4 93C F4 7B5 2D 665 BA 610 210 D6 637
1 3 2 7
21 0D6 663 7CE EC2 F49 93C F47 B52 2D6 665B BA6 6102 210DD66 637C CEC
0D 63 7C C F4 3C F4 B5 D 65 A 10 10 6 37 E 2F
10 66 7 EC 2F 93 F 7B 2D 66 BA 61 21 D 63 C C2 4
67980
D 3 C 2 4 C 47 5 6 5 0 0 6 7 EC F 93
D6 6637 7CE EC2 F49 93CF F47 B52 2D6 65B BA6 6102 210DD66 637C CEC 2F4 493 CF4
c)
a)
b)
6 C F 3 B D 6 1 1 3 2 C 7
66 37C CEC 2F4 493C CF4 47B 52D 665 5BAA610 021 0D6 6637 7CE EC2 F49 93CF F47 B52
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
}
a neat diagram.
B5 D 65 A 10 10 6 37 E 2F 93 CF 7B 52 66 5B 6 02 0D 63
2D 665 BA 61 21 D6 637 CE C2 49 CF 47 52 D6 5B A6 102 10D 66 7C
66 BA 61 021 0D 63 CE C2 F49 3C 47 B5 D6 65B A6 10 10 66 37 EC
5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 21 D6 37 CE 2
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61 21 0D 63 CE C2 F49
10 10 D6 37 EC 2F 493 CF 7B 52 66 5B 61 021 0D 663 7C C2 F4 3C
7
return(product);
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2F 493 CF 7B 52D 66 5BA
6
2
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 49 3C 47 5 D6 5B A6 102
B5 D 65 A 10 10 6 37 E 2F 93 CF 7B 52 66 5B 6 02 0D 63
product=product*index;
8
2D 665 BA 61 21 D6 637 CE C2 49 CF 47 52 D6 5B A6 102 10D 66 7C
1
4
10 10 D6 37 EC 2F 493 CF 7B 52 66 5B 61 021 0D 663 7C C2 F4 3C
3
21 D6 63 CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC F 93 F4
0D 63 7C C F4 3C F4 B5 D 65 A 10 10 6 37 E 2F 49 CF 7B
Page 2 of 2
66 7C EC 2F4 93C F4 7B 2D 665 BA 610 21 D6 637 CE C2 49 3CF 47 52
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C F4 3C 4 B5 D
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC 2F 93 F4 7B 2D 66
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2F 493 CF 7B 52D 66 5BA
5
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 49 3C 47 5 D6 5B A6 102
CF 7B 52 6 5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10
47 52 D6 65B A6 102 10D 66 37C EC 2F4 93 F4 7B 2D 66 BA 61 21 D6
B5 D 65 A 10 10 6 37 E 2F 93 CF 7B 52 66 5B 6 02 0D 63
________________________
2D 665 BA 61 21 D6 637 CE C2 49 CF 47 52 D6 5B A6 102 10D 66 7C
52D665BA610210D6637CEC2F493CF47B
66 BA 61 021 0D 63 CE C2 F49 3C 47 B5 D6 65B A6 10 10 66 37 EC
5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 21 D6 37 CE 2
A6 102 10 66 37C EC 2F 93 F4 7B 2D 66 BA 61 21 0D 63 CE C2 F49
Perform top-down and bottom-up integration procedure from the
Q.5.a) What are the components of a test plan. Illustrate test plan hierarchy with
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2F 493 CF 7B 52D 66 5BA
b) Describe the procedure for Test Point Analysis (TPA) with a neat diagram.
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F 49 CF 47B 52 66 5B 6
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 49 3C 47 5 D6 5B A6 102
CF 7B 52 6 5B 6 02 0D 66 7C C F4 3C F4 B5 2D 65 A 10 10
47 52 D6 65B A6 102 10D 66 37C EC 2F4 93 F4 7B 2D 66 BA 61 21 D6
B5 D 65 A 10 10 6 37 E 2F 93 CF 7B 52 66 5B 6 02 0D
Paper / Subject Code: 53106 / 6) Software Testing & Quality Assrance
37 EC 2F 93 F 7B 52 66 B 61 21 0D 63 C C
(10)
CE 2 49 C 47 52 D6 5B A6 02 0D 66 7C EC
C2 F49 3C F47 B5 D6 65B A6 10 10 66 37 EC 2
F4 3C F4 B5 2D 65 A 10 210 D6 37 CE 2F
93 F4 7B 2D 66 BA 61 21 D 63 CE C2 4
CF 7B 52 6 5B 6 02 0D 66 7C C F4
47 52 D6 65B A6 102 10D 66 37C EC 2F4 9
B5 D 65 A 10 10 6 37 E 2F 93
2D 665 BA 61 21 D6 637 CE C2 49
66 BA 61 021 0D 63 CE C2 F49 3C
5B 6 02 0D 66 7C C F 3 F