4. 6. S. 4 1.

3. tquivalence
LD 10
1.
to The
total. thequantity PAge
lunctional You

Iimit Quantih item

Dueordered.
be
system that
testing
are
price,to accepts tests
to be
accepts
is limits
that
calculatesordered, an
Total
Item Price
Item Quantity ItemID using
Shopping
Continue the
e-commerce
is less is on item a
atesJhbeeen
e classes credit five-digit
from
is
boundary-value
orders.
acled.he the
removed
card item 1 A
to
numeric screen system
gaeotes orderstotal 99.
from
amd Checkout
If analysis that
prototype
than than00000 (quantity
that the the item
(Twiakid) item shopping
can
user
ID and
sells

butok itemis thsa (Tninkd) be enters

times number
Total
Cart
foproducts
r
equivalence
the
(Ivadid)
99979 to processed,
item cart.a
Ar

previously from Item order-entry like

(Tyunlid)
q9 99991 price),Based
the 00000
ving
Shopping d
contents
thumbnail
class
caps

manUm not (Invalid) maximum and

on
ordered to
these goes cart goes partitioning
web
jacketS.
and

adds 99999. graphic here

(Vatd) (Vaid) inputs,
cart the item
here
page

eanlies.
dered oh is The
item The shown
techniques
total the ID
(hedet
Cand Ohdered system system
total and problem
is below.
$999.99 a
to 0 Pagei 2
(Tnvaid)(Vadid) befere the accepts
retrieves
quantity for is
tceate
he
to
cart
a weh
 202|0|402
(oolo!,3o)(oo004,(00004,
)5 150)(o0003,-1) (oooot,o)(ooo0%1o) , (eoot,5)
(-!, s)(o0o1s,o) Input

Expeutedootunte
Val! Inyaid Valid Valid
Invalid Inyid Invi'd Invalid

2, 2,5
25 1 2,5 overe
Class
6 Page
3
of
16
 b 2.
muchhiw
adegute Seft As b a hrst
c
ShouldCalculate
Is test
A

As eqwiraleut
mutantsthe the iteration
engineer
Mutatia
thene the test
the
test suite of
generates
mutatthe engineer
adequate
mutation
mutation

nee but Mutatim

ae4
scoretesting, 98
develop for mutants
Scohe
tatiom it programn for
this the
muttion additional
test
tester of
a
quvaletats
fotal e P? program
suite finds
SCee
4
devebf rets
Seone
he
Toted
test
cases? 78 P
dead and
on Justify mutants l50
Soohe in test
=.(witht
emaing
ivekt
ad 14 mtats your cases
and
mtadead Mutauts
Ttal
dhtimed theshou answer. 4 to
equivalent test

the
0.78
program
killed mutants.

caseg
fest P.
dest that
b
After
it mtat the

Gsidey tst (2) (1) (2)

mutaty,
tayes
 (g) () (e) (d) (c) Cyclomatic
Caleulate(b)
Enunerate
ohen Thene
Theseidaf not. Are
If 2,3, t
here
Which
1,2 3
W}hich
pOssible,
IfCyel
padlsomehe
dated dependat i presentthe in

any nodes nodes

all any
exist, list
of have have
du-paths test at fragment.
the show uses defs
and
potths. d du-paths patl1s
paths at witlh
one. lor for
that enplexity= Complexity
.s,9),(,
4+)
4), (s,), ,2) lor
du-paths respect
variablc variable
over nchieve
variables w? w? of
there theNbut is to be Node the
9
,(G,?)
(03)(0,), w
varinble
Covcerage
progrann
and
is a. w
atltomatically
Gvered
as
there F
Îrom
node
mode but -N+2 fragment,
du-poths not anditiors
there
34,c,9 ) 2) (- '1'
Here
Edge and

palhsdu- node
to =8-t+2 3= find
Coverage
too
(2,), ,
various
Soop. 7?
hopren not,
If on
the
stagyes independent
(2,?), du-prias ( explain graph. Page
9
paths of
(>,),6,) (3) (2)
why
(2) (2) (2)
at
(3)
16

wde
 D.
Use
(a)
Draw the
following
a
control
program
flow
graph fragment
Z else if // else if
for =
Wtt;
3*y+5; =
W+
x 5*y; =
x nodew=2*w;
(y (m
this > for
<=
4 0)questions
program X;
10) (no

executable
fragment. node// 7 node// 6 node //5 node//3 Dode// 1
8
node 2/ (a)-(g)

statement) below.
Use
the
node

numbers

given

above.
Page

8
of
16
(4)
 t.
Crk: - eech more Fill tablecovers Fill label
eachDraw

Lest than in in
mav
column, a
the the control
case be table edge
with a
l
table int
iteration left return u; if while int t:
covers. -1 5 list V u t blammo flow
below blank. below (u = V;= u;=
t Input Input the <0) t (v
diagram
Some of § (int
lowercase
letter.
V!0 the with
relevant with V;
!=

V==0 cellsloop. a return

0)
u,
a test | { int for
test Recall
labeled this
in In suite
V=0 intt; the
the
suite -u;
that
V)
{ function.
A,B,c,cDF -> covers>ac,f
table items that }
that AB,C %
mayprovides provides
in
6
column,
be
BD,E your
computes
Label
,C,D,F each
left CFG
statement
path
blank. list
remainder
Covers
the
Covers
that node
coverage
relevant each
coverage in
(Nodes of the
of test t/v
d
labeled the graph
V!0 "blammo" ov'e
case
the
of
with
covers.

hetun Vatzv,
items "blammo"
) a
in Some
capital
yourcode.
A code.
cells letter,
CFGCover
in In
that.
intt, no the the and

hetn u (5) (5) (5)

 6.
mtat. b a 9.) 8. 7. 5.//
6. 5. 4. 3.public
2.{ 1. //Ef Answer
3.
Ifc If If
fo possible. possible,
0. possible, (findVal);
return for for int
val
fects:
else
If l0|402202
Numbes if questions
Nam Secondmutot. findVal i;=
(nunbers
(int (int findint return
find static not If

Numbei
(,2,s - ast fînd find find i-(0+1) i=0; Val nunbers
in
LAST
bens a a a i<nunbers.length;
test test test (i]
;
-1;
nuabers
Occurrence null
through
(a)
i<numbers. Val
- ode input input iuput
val) (intreturn
)
throv

[, that that that length; numbers -1val

of
Nul1 (c)
for
westronglysatisfies does i++) Po
2,3
ontput rixto,3t)sceyhien also
Can reachability
kills reach
not
i++) (],
int
val)
interEx
in
num
bers copt
Oion
mutant
the

Val hull mutant

the the
in
9. 8. 7. 6 6 5. 4. 3 2.{ 1.
//Effects:
4,otitNad- Qa
inputs
give mutant
mbut } public else
two

pointen
return s;
not 7s for ints=
0;
methods,
and s
(int static return If

ouctput fass infection s

-
=s
t i-0; x
x[i]; x[i]: int the null

ditferend thHeeye jl mtutboth mttboh dues

tnep for //AOR x.length;
i
< sum sumthrow
find
Val()
- mull (int of

2
hion as
mutant
the
PointerExcepti
x)values
[]
sum()
the Nul1 and

both-1
in not it+)

ithot(null,val)
} in

bot,in x Page
on 5
of
aive mutt 16
metnt (2,2) (2,2) (2,2)
 (c) (b) Which
(a) VI. Answer: (d) (c) (b) (a) Documentation
Answer: Function 6.
) Module
(c) (b) (a) IV.
(dComponent Answer: Acceptance
(d) (c) (b) (a) III. Answer: testing(d) testing
Integration
testing
System (b) Unit(a) I . Answer:
(c) testing Code(d) (c) (b) (a) I.answers.Select
Inspectors
SelectSelect V. Which
Select Regression
AfterAfterAfterAfter Which Selection
Replication
Fix
Understanding Which Which Syntax
Complexity
Coverage
the answers
modification test all
regression the the theevery of type is
bug is and
cases test b release
completion changes testing the of not analysis
not
month and the covered of of semantic analysis covered for
cases following the testing
re-test bug of
randomly the
test of should
traversing the in of the bug tools following
the
of release tracking analysis toolsunder
cases bug in is
software
development software
terms the the done
be the
selection performed:
of program tool debugging
test is by tools category questions.
software not the
cases
of used customers?
tech1nique
software process? of Note
for static
10 a
unit? that
is testing
more multiple
useful? tools?
answers

may
be
corTect.

|ite Page
all 10
vour of
l6

(l0)
 VII. Answer: (d)
Answer: (a)erage VIII.
(c) (b) correct? is Answer: (d) Regression
Integration
Acceptance
testing
System
testing (c) testing
(b) (a)
testing
Answer: ) The(b) (a) IX.
(d) (cJUnit (d) Select
Answer: (d) (c) (b) (a) X.
The The Each What 90% 90% 100% 100% Which
Displays OnlyTestsTests The Which
Test test statement
decision 50%
displays that thatJUnit test calls a
statement
decision of
fixture method of the of
a Suite
message the the Test framework the the available
a
Objectvalue Case calls calls JUnit
bcoverage
coverage
coverage following
coverage
following
message
on
explicitly
assertEqualsof the the
texpected calls Test means is test
he expected meansmeans
on setUp
setUp() statements
means most cases
JUnit the setUp) calls Case 90%
JUnit equals is setUp() 90% 100% benefited
console method setUp(). 100%
the (String method. prior statement
decis10n
statement about
console same the decision
when espected, once method?
to
the
when
11 Objectvalue each coverage.
coverage.
thewhen for coverage.
coverage.
relationship a
assert the actual.
of each test tool
asString
assert
the Testmethod. is
passes actual actual) used
Case. of
passes. statement with
or
Object.method:
fails.
test
coverage capture

and
and
replay
decision
facility?
cov
 1.
-No. Test Consider
information This 1alidity
The
Details'
list form Case
form.
of of checks
sernesters about will
VC1Validity
Elective - the
10 VC9
VC VC8 VC7 VC6 VC5 VC4 VC3 VC2 checkNo.
VC14 VC13 VC12 VC11
The be problem
lalidity given
accessible
new/existing
list -
available No.Checkstatementin
of Scheme
SchemeDetails the
Total Total No. No. No. No. Semester
No. Programme School Everymodule.
No. Semester Only
Description
schools only of
following
eleciveNa. ofpapersheoryNa
Practical No.
Total papers
credits ofpapers
practicalNa af
SemesterProgramme School
of of of of of of in Add
credin credt
practicalelectiveelective theory theory
practical Administrator
scheme scheme(s)
that to of
name and
cancannot can cannot
name cannot
system University
Selected
Schooltabular
have paperspaperspaperspapers
papers papers have blank.be
wil
particular
programmes
be
be
value blank. cannot have wil for Edt
Credits
Total
value blank.
cancannot cancannot
cancannot
be
administrator.
the
12 between have have only
a
be uniqueauthorized format:
Registration
have be programme school
bevalue bevalue between to 1 blank.
value blank. blank. blank.
semester. available Delete
5
between to and
99.
to
between between access Program
It
0 O 14. programme
wil in wil Erpected System
0 to the
also that allow
to to
10. 10.
10. Maintain View Selected
particular
be
Exat
Outcome (URS).
Scheme displayed. him/her
that
were Design
Details school to Semester
-
selected
add/edit/delete/view Remarks, the
wil
- test
bethein
displayed. ifNo. cases Page
'Scheme any
of from
Theory 12
the of
(20) 16
 VCG VCS VC4 VC3 VC2 2 Vc1 VC1
VC
VCVcid A |Vcg |Vcg N
Vci3 A
DA DA DA DA
A

jT5 ICT
IcT

G42 5 42|S 54 5
5
4 |No,
21
2
2
21 2 2 2
ofWe.
13 2 2 2
1 J2 et
1 1 1
No.et
23nvedi Tvaid23Jnadi!
23 23 23 2 23 23
23
Invelid
23IYalilmesten is 23 23 Epeted
23 tu To
InvalidGeditca Jnvalid
Invlid|SemesteSaool,comot
CamInvalid
t CanmotInvalid|Semeite
Proymm Invelid Valid
Admistatod
Inveid Qutcoe
d Valid
Cdinet hive,is
|Elec
be hactical hactica
Cannot Eleetivc
Cauns
outothange hceroutis be lank be
b Amot is
osjed
Lbula
6lane blank be Admiistato
blak. Cxist`atishied Ve Loggdin. Hamks
is
aldy