.... ........ .... ••· \ .......

,• \
...
/ ./ ... ...... ..• ,•··

........... ,..,·
I
:'

Code No: 156CW &..l'TO"f./'.\c!St>S- ~

JAW AHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
. B. Tech III Year II Semester Examinations, August/September _ 2024
·•••• •• ·. -····-·-· • ..···::) -·······.7 SOFTW~ TEST~G·.:METHODOLOGIES .• ·"') ·······:.:7 .·
··-·· -·· ,. ... ,. (y~~~. on to CSE, E~\. l'~.E, CSE(DS~···CSE;(IOT))
Time: J'Hou·fs 1 ,. • •••••••• / / • • MJ~. Marks: 15 . . _./

Note: ·i) Question paper consists of Part A, Part B.

,·!~~:art A is compulsory, which carries 25 marks. In Part A, Answer aJI questions.
• ' .'' 111) In Part B, Answer any one question from each unit. Each question carries IO marks
• . . ~.n~l...m.~y have a,. .~ ~.~. .~.µb questio1Js ............. .··· ................ ··• ,·· ·· .
...• >···· .i ..,/ • •..•·) ,/ .··~..) .,/ •••
,•

J:
/

.,/ ········· ./ PA~T-A ::................

(25 Marks)

What are the goals of software testing?

Explain about path sensitization.
Write the applications of data flow testing.
W~:af'ate the predif~tes· ·~ff domain te·s.tirig.? Explain ·wi.th. e·~amples. ..·······.:: .... ·:.-·
. ..-··
Definf.syntax bas.e.d...te~ting. ,<:.-:: . .-'/ t::·:.·... //
What'is logic based testing? Explain. , •
What is state transition?
What is impossible state? Give example.
What are the benefits of automated testing?
What are the too)s required for test planning?
.. ·•"''•·.. ..········.: •••••••• ~~.:.::
..•··
{ .......... //'
/..:::.... _....,/ t\, ,·..... ../..... (50 Marksf /
~v.1-~~.\<. •
Qa) What are control and sequence bugs? How they can be caught? Explain.
b) What is path testing? Give a note on path selection and predicates. [5+5]
OR
_................, 3.a) W..hat.a.re the conse.que..n..c..~s of bugs; . pxpJa,i~ about t.h~ t.a.x.9nomy of 9vgs.............. ....... .......... .
• ) ,. b) Wh:~t i.l control fl.ow graph? Exp.la:in ~·ow to ge·nerate/'control tt9-w g~ph with ··~: :'.
.·•• .. example. L........ /.. L........ ../ /.......... /.. - i. ......... ./ [5+sy-)~

4.a) Write about the components of transaction flow testing.

Compare domain testing and interface testing with suitable examples. [5+5]
b)
OR
Discuss about Nice and ugly domains with examples to each domain.
WhaffsA:iata flow·'fri9del_?' Explain th¢. vifrJbus comp'6~erifa)bf data flo~)rrio.~'el. [5+?,J.;--~f '?, !f ~v--·.·.:
> / >~
.•·
'-- . ·-·
.

~ f;~1:::~~;;iiia~ L~:r:~~~~:if~~~tb~:~:-~~fi:::c:i:~:~~\~ctf~::~::
OR
0
(5+~]. :/. ·•· •

7.a) Wh~t is the, procedure used to count minimum number of paths in a graph? Explain
with example. • • . [5+51
Ho~ ·to--jnterpret decjs·iory· table for..te~t ·ca~e destgn?• H~.,ustrlte.
. ; ,t // • ••• ...

. .. . / ...... , ....
 ,,•···· \ ....... :.:- .. •··· .. '': ...... ···:.:: ........ ) .......... /. ..······•.... .. ...... ~_::
:
.:
.:'
:
,• .· I .....•· .• ...·• ,,•·
.' ,••· ...
/ ... ............ ,..:- ............ // ::o,.,... ... ·'
..1
............ _..,·
.... .........

.r
8.a) What are some situations in which state testing may prove useful? Explain.
b) How to identify equivalent states and how to merge them in representing state graphs?
. · · · ·-:: ·········7 ...................•..::/' [ 5+Sl .........7
ExpJaini· .........': · · · ·.~.:,/· ........ ') .........:./:

i.·.-:::::::.. . . .- : -.-: : : :.. ~.R <::::::... ./ =-.-.·::::::... _.. :::::: ..::~. .,.../
i
{.:·....: ·. /. . . . :'
Discuss about good state and bad state graphs with exarripl es.
~ [5+5] 5
b) Describe the software implementation of state graphs.
,D

~
Elaborate node reduction algorithm with an example.
[5+5] 'v<>
How to record test and set check points in win runner? Explain.
..•···...... ........... ,. ............ .......... . .- .•· -···•. ··:
............ ............:, ............ .. ..........:. ............ 08::..
I I .a) W.h-at ~re the matri.:x-•·bp~rations use9...ih tq61 building.?.. Giv.¢· their sign_j.fican.~·e. [s+S] /
b) Discus·s in detail ahout..-JMeter testing-to-bl. : '............./ ::.......... . ./

---0000 0---
•hoOo oo, ••,::
0 0 0 0 0 0 000000

..
... -··
.·•

.-·
,....
··-.
............ ..·······........ , .... ,,• ·······._ •••••.•• ···;: ..- .. '•: ......... ·_:.-
.. .... _:·
.•··
.-·· -···

.··""•, .. ..........).. .·• ......•. ············: ... ·····:

·······• .. -- ............

..··•••·· ...•••• •••• ..-

. .... .. ..··. ·· .............._::
 .·· ··• ......... ··:,· .. . . ....... / ............ .. ........·.:: ... . . ·••·· .......
.••• _..l
.'
: .......... , ....·. . ... .. .... ,!

Code No: l 56AH R18

JAW AHARLAL NEHRU TECHNOLQ(;JCAL UNIVERSITY HYDERABAD
B. Tech III Year II Semester Examinations, August/September - 2024
.·· . . ........ ......... ) ........... .· ....... ..........;- COMPILE·R·DESIGN.••"••. . ...........:; ..··"") ......._:::-.:: ... .. .... .

i
:.:
,······...' (Common tq.·C.SE/ECM, CS~(DS))-·/
:. .. .. .. ...... :..............:· :. .. ...... ...
Time: 3.Hours '......Ma:~. Marks: 15 . ..

Note: 1) Question paper consists of Part i\, Part E:.

ii) Part A is compulsory, which carries 25 rnarks. In Part A, Answer all questions.
iii) In Part B, Answer ariy one question from each unit. Each question carries 10 marks
.·
..
\
-· ... -··· and may have a b as sub questions.
! i ))
•
?
.····· .................:.
'· · · · ·.•·
.. ·••• ····: ..........>:: ·..
•' ...•• .. ..
.•·

.......... :f~AR.f-A ............ // ..-::::...... _.../f

(25 Marks)

I.a) What is input buffering? [2]

b) Why lexical and syntax analyzers are sepl¼rated? [3]
c) Re1nove left recursion s ➔ Aalb, A ➔ AclSdle. [2]
d) o•eijrie..~langqng elsit pro.blem.__ . · •• • > ........:,: .;. f3l··• .. ) ...... /
~) .~o
what yoti meatfb,y 9ependency~r.apJ1? [2 ].(.··~··. . /
t) Define· type checking. • , • [3]
g) What do you mean by nesting depth of procedure? [2]
h) How can you identify the leader in a Basic block? [3]
i) What. is meant register .~11o<.'.ation and assjgnment? [2]
j) Define register descriptor. •• (31
. ......... . , ..........: . · · •. . ........? B ;i~;)~
.· .. · . . ............ .: .
1

/ E~~lain the various phases of a c~~pikr in detaiI:;dalso write d~~n th:s::::~r

the following expression after each phasy [ 1O]
position=initial + rate *60
. ......... . ..·. .. .... ........ ........ ...........,. . ........... OR::, ... ....... ............:, .......... ..........:. ..... ·.. ............
./ 3.a) Co.rtstrµct the optil)l.ized/-t)FA for t~.e..foll.owing reg~Jar e)q,ression (a_l.b)*a~·b. .· .·'
• b) • Write_./a regular expre.s'sion for identifif!fS and reservel words. Design/the transitlon·
diagrams for them. [5+5]

4. Construct a Predictive parsing (LL) tabh! for the Grammar:

E~E+T/T
T-.T*F/F
.. .... : ...... / . • .. :· ... -··· ·.:: •-.
J •
·F~1:¢)/id ........... >
1

An.d p,t'~se the fo1Lo.1~inl input string>.~.i~_-/id*id". ./ [HJ].

· I
, OR
Construct LALR parsing table for the fellowing gran11nar: [ I OJ
5.
s-:· cc
c ~ aC Id
-
. .. . . . ...... ···. :: . .. . ...........
.. ... . ...... ···: • • u ··••· . . . . .... ....... :- . ... ·•... .. ····- ·.:.::
·: ,•
\ . .•·· ,:'
, .. .....
: . ,·
_/

6.a) Construct an annotated parse tree for 9-5+2 using expression grammar.
b) Give syntax directed translation scheme ·for simple desk calculator. [5+5]
.~ . -. . ·······.. · ····· · :. · · ..... ............ ........ OR.. ........... ...........'/ · ............ . ........._;: · • •• \
7.a) <:;oristr.u~t a Quad~uJ;Je,,triple and ·i•ndirJt Triple fq.r·the ~~tement a/=·b ~./~ c + b * dr::::.·:::·:.
b) bifferentiate betwee'i1 Synthesized \ii-id I~;.herited attri.hut~s with suitable examples.
[5+5]

8.a) What is a leader of basic block? Write and explain the algorithm used to find leaders.
b) Draw flow graph for quicksort algorithm. [5+5]
. ••" · ·. . •··········.:: . ······•.. ···········.:: ........... 01~. ........... ...........,. ..···· · . . ........ .: .......
. . . .- 9.a) E.~.plai~:i-.-·in detail a.bout peephole optirhiz~tion techntques ../.. _.· / .· .
b) What .-·is meant by··activation of pfoced.ure? How it. ·can/be represented with activation--
tree and record? [5+5]
1O.a) Justify the statement "Copy propagation Leads to Dead code".
b) Write detailed note on data flow analysis; [5+5]
01{
E~plaTtj>various ptirj:cip~f sources 0(¢0.<le;_:,bptimizatfoQ te~hniques.
•' , ..•
<·........ ........... ..•• •• ,/ ,.-_·::::... .. •..._./ .:-::·:~:.... ,/

---00000---
\..... ,. .. , .. I
~ ...... -:

..•• ·· .. .. .. . . .. . .. : . ............
,•
,• ·.. •' ·.
:

.. . . •··· ....... .
..•···•··.............
! . ··•. ........ . .. •.. ..... , ....

.·· .. , ·......... .
 -··-,.
...... •··...
.............. /
/
-·~ ••'!
..
•n••-... - ...........,
,•·······
..•·•' .!
.'
.••
__ ., .
.!
:-'
... .... ·•••
•.. ----··- i
/
/
c__
...•···· ....•·
·........... ..1 ·......... ..
/
/

~, 1""0 ~Ao'5,0 S- R18

Code No: 156BN UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL b 2024
B. Tech ID Year II Semester Examinations, AuguSf/Septem e~ - ........-...
•........ . . . . . . . MACHINE··LEARNING···.: ........./ ...... .
....--···... ..······•...
···••··•···:;: ........) .,./ ..
. :~~-~~~OD to CSl!rt~s~,:t, CSE(CS~.~S~fi>S))
/..... : •'

!'.~ / T i m
e : 3 ; ~ ~
u ~
. -
(~~J~ . Marks: 15

i) Question paper consists of Part A, Part B.

t.
N o t e
:

ii) Part A is compulsory, which carries 25 marks. In P~rt A, Answe

~ all que~ ions.
iii) In Part B, Answer any one question frqm each unit. Each questi
on carnes 10 marks
a!)~,m.l!Y;,have a, b_;i,~; ~!!!\questions:
1 ...... / :) / /:) ; :~; / /
........• ,.../· <:::::~.. // =P~t - A ............ _.., t::....... //
..

..

( 2 5
M a r
k s )

What is hypothesis space search process? •

What are the key components of a well-posed learning proble m?
[2] r 7-
[3] ,- ~.
"? '5
Define artificial neµral network.
Sta\e ..sqm.e real-w6r~p ..ap.p lications ··o{fai~~f recogn iti6~} ........:./ ..········! ..........;.::
fiJ, ..; ) ; ~ '
W.h.at ~te maximuoi.:lik,e'lihood hyp6.tbe~is7 ;:::::::.... _.:/ /_.../
Differentiate between lazy and eager learning approache's.
,..-·_·:::::.
[2f~.;·~·-->· 5
[3] --~.
What is specific optimization problem?
Define temporal difference in reinforcement learning algorititms.
[2]
[3] t- >
Define PROLOG-EBG system.
Define operators in analytical learning. • •• - [2] .. i.-~ ~ -
[3] c- "> /
::::::::::= .......>/ .··••·.
!........... /.l·
~::) 7(50 Mari; : 17

How does inductive bias affect the performance of a learning algorit

hm?
Explain the hypothesis space search process in decision tree learnin
g and how it differs
from other algorithm?
[5+5] ",._ '~ t&
...... ............. ...... .............. ........ OR:.. ...................
~istus~ lthe basic ~.teps 9f the decisJort tr~e learning ·:~.gor~tfun with aq::~x
;~ple. ..•·:::) .......: ,:7
Describe the Find-S--algorithm for=·findjng ~he mosf--·spe~tific hypoth
esis o·6nsistent with-- . / .
an example.
[5+5] •
Explain the basics of sampling theory and how it relates to estima
accuracy. ting hypoth esis

,;•-·

. . ,.J
.-.____ /
•. ---··,
I
5.a)
~i~~~~;e~o~~ ;:ry
the bac::: ?o;ati on alg:r t:/used for ::>i~( ? mult~ ~~i)
What 1s the mot1vat1on behind evalua ting tlfe i. ,..,........ ,/
~;~~ ~ ···••••··.
. ?
Iearning . accura cy or learned hypo.il ,........... ../ ······
· leses in machin e •
b) Describe a genera] approach for deriving
hypotheses. confid ence interva ls when
evalua ting
[5+5]
..-·-····.: ----~,.- ......... . - - .• i
_.,····
:
_;·
I
! I
.;·•"''• ·. .. ....-·.:/
,•
L...... / I .. .....···~ ....
/ I .-:·._._____ // .. ·······.::
_,..
:'
•••··
....
 .... ' ..............
; /
,...,,•· { ........') _...../
·~ ... ... .... ' ,•·'
l •• ·............ .:'·
/

'

6.a) Explain Jocal Iy weighted regression and ·how it differs .from standard 'regression.
b) Explain the Naive Bayes classifier and its use in learning to classify text. [5+5]
..•··-·•..= ········•.., ·········7 ········•.., .........l ...........; O~,;- ...........: .......7 ·········\ ........./ .· ">
,,
t::~_.. /. ...---(ta) ~xplai,;'"
............ ..
Bayes' thyofe111-..--and
............ ..
how il•-is-'
.......... ,.
us,a
•'
for calcµlating/the
:......... - ...
pro.baQ.ilify
a.. :...-·•··-
of
/
hypothes~s:··
.......... ..
.. .- b) Describe the k-nearest neighbor algorith1n and how it classifies·n·ew instances.
1
[5+5]

8.a) Explain how the hypothesis space search process works in genetic algorithms.
b) Describe the role of rewards and actions in reinforcement learning and how they are used
to guide the learning process. [5+5]
... •·····.. ...........:, ..•·····.. ···········:-- . •····•. o.a.:.. .•······. ...........,. ..•····•.. ..........7 .,~ .. •··.. .. •••••••• /
Pesbril;>e the idea .q.f-indii'ction and how it/1s related ~o. -lear,ning first-6,rder lpgic rules? . .•·· _. : /
Explai'h the Q-learning/ algorithm ,:and J{ow it is used·· tel learn optirnal attions in non;:-- _:'/
deterministic environments. [5+5]

1O.a) Discuss the challenges of analytical learning techniques.

b) Explain how prior knowledge be used to alter the search objective in analytical learning?
[5+5]
••··:::::::: ....... >? ••··::::> ....... o~:, :>,
••··::·~:::, ........;.? . · ·.: : : :
. · :·.·.·.> ........:/' . ···~·.·.> ·-··..·.:/'
What _..is Explanation-l}ased Leaming (iBL) and how if differs from ...p4rely inductive.. / .
learning? • • • • •
~ Explain how explanation-based learning is used to learn search control knowledge for · _ ~
problem solving. [5+5]

..······•... .. ...•······.:
,.....···' ...•·
:'.•···......
:••l••••~u•• ....

'

. . •··. ✓·-- ······: ...........~;: ...................... :.. ..· ............. ••:_..:.-

..... •· ..
.. •···
..
···••••
. ·•••••··. --·· ·.:.:.:.:? ,.·•" ···... ...............
.... ..
! L ...... _ ./
/ .. ··•········· / ...
..··

\
..... _. ..............
.. ··•·"•·.. .. •••• ·-::, •••• ·.:.~·./ ,••····
,' ... .. .........~;: .. ····•, ·........._;:: ,•· .
/
.,•·· .. ..• ..
/ ............ •••••··..
I : .......... . :
 .···• ••. ··.. .~.... ·····.:: ..··•••· ..\ ..... ...·
........ ) ......... ), .,...... \ ••••• · ·;.
; i
.... ·' l
./.... ...•··· . ........••
• .
:'°
./
............ / ......
•••••••••••• ... ............ ...... . . .... ... ...
... /

Code No: 156DV ~ ' l)"l AtJSbS- R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech III Year II Semester Examinations, August/September - 2024

.:.·:_ · ,:,/ . . >?Hours ?ommo n t~:~s~

.-
)~c~:;:
~~~s~~............ / ............ / ........Max.
• • ··;
:~~~ ~S), csEOJT;/ Marks: '~/'5 .. /
Time. 3

Note: i) Question paper consists of Part A Part B.

~~~ Part A is compulsory, which carries 25 marks. In Part A, Answer alJ questions.
111 ) In Part B, Answer any one question from each unit. Each question carries 10 marks
. .J~!\Q. ffi}lY have a~...P. ~$.J~µb questions.
.;~~l~A :) ::?
.. ,•·••"••·

.•·

•. ) // >< _/ ............ ..,..../

/

(25 Marks)

11 lustrate the functions of management.

Describe the systems approach to managfment.
Describe the cell structure organization.
WfJte..a:.:.brief note . 6~} dere·gation offujlcfignal authority ...........),
Differ.¢ntiate between ~tch and mass. pr6duction. t:::::::. . _.. /
Describe the value analysis and its objectives. .,
Illustr at~ an OC curve'l
How do you calculate standard time?
What is simple routing objective system?
What is activity chain's total float? ..•··· ····:.
.•·······..: ............~;:
..•··· ·····~

P.ART -B
T
:.......... I./
~
(,_ / (50 Mar~)

@ Discuss FW Taylor's scientific management features and principles on the management

Process. [ 1O]
OR
.,.................:. 3.a) D.~scribe, the. Masl9J.Y's. . Tpeory of Ijµ~an . l'J"eeds ang...qffer. your criti~js..m..on_..it.
P.istusf.the recen(deve\o.pments iri_..the c~frporate so9.ial n;s'ponsibilityf.....•••••) •• _../// [5~.s.f
:........... _./
:'.. .•... .... ..../
_

.......... _,// b) /.... ...... _../· :~... ... .. .. _.../ !... ········ ./...
/

Evaluate the departmentation by enterprise function.

[5+5] ~ l"
Explain the characteristics of a Lean Organization with suitable examples.
OR
5. Draw the typical matrix type of organization and state the problems with matrix.
management and suggest guidelines for making matrix ~.~.~agement •••••etfe.~~.~-~e . [ l O]
...:> ...... .,•· .:·.·.·: · I·
••• •·:·.::::, .....
.··•••••·.. ..······) ·········./ ..······:::, ········?: ..·····) ........:.:.:-:--
\'
/ 'Ifis NOT possible::.ro~1the operatio.~s. ~µfiction withfrt.t~.~. . firm to operate.}ndependently...
,./ 6.a)
of the· other main functional areas.' Comment.
b) 'There is no need for the existence of a value analysis depart1nent in a company which
employs competent product designers.' Discuss. [5+5]
OR
7.a) Evaluate the factors that influence the facility location at an international level. f5+5l •• •:.-: -
b) Di-s9uss:;pros and co·ns-of:,:-a hybrid m·ethod;.:•of layout..w-~th·a.;suitable exa'Ppl~~
( l t:::.::·_ ,. . . . . . . <:::::·.:. /.,/ (:·:·::'. /// .·: · ~:·~. / / /·.-·::::.. //
-
.·• •.
_.· ... •'
,....,..
. .. ... ··---
•

:·
~-

cedure with 5'\litable example.

8.a) Elucidate the steps in the method study pro [5+5]
y.
b) Explain the role (?f computers in work stud ........ \ ...........::: ........ \ ......... ?. , .....
'·:
..-·····. . ........ . ...........: .........~7 ........ \ ...........:.:- ...........: 0~:. - .••

ibut~s.
_

\y-hat ts" Statisticat--Qual,ity Contra l7··Exp,lilin the contrb l c.harts for. aw,:........... / [sJi] J~
//, Ev'a'iuate the princ'fpfe 6f work measiireinen
tt :........... /

es with their time estim~tes (in days):

10. A project consists of the following activitf '\
.

like ly(m) Pessimistic(b)

Activity Predecessor Optim istic(a) Most .....
.. 2.·• ..... .•3
. ·-. .......~ .·•l.. ·..
··:
...... · ·-:.
.·• ...
4····· 6 ..··• j •'
.. .•·A z······ .. /
:
:'
.·• ./B ; fl
.. .,
1
;
3 5
C A
2 3 4
D B, C
(1 1 3
E D
iance (V) for each activity.
a) Calculate Expected Time (TE) and Var .........') ........./ . ····--)
b}-:Qete~mine the crit}eal-·:.Path. ........\ ,:. . ·. :7
t:::::::!J~· . : . (::~:::.. _../ . . <:....... 1/
(.'.·:.·::::·. _./. . . [:.-.-::::·. _// h the ir dur ations 1n days:
es wit
11. A project consists of the following activiti
Activity Predec'essor Duration(days)
A - 4,
B A . ' ,.,. --3 '
A "'·
'
2
C .•
.
D ..-······.. ...... B ' .....~--.... . .........r. 4 ..•······.. ... ." ' " / \ ' .···•.. •· ... ···········::.·
.
........\ ........~:? :
..... _/ Ti -·:.-...... •• ....... .... •··
.. •• ...
.. E .-···
..
C ' •¼-•····-'---,-..... -
.•v . 1
.'
_..

.. ..-··· ?. ,-1
_.....• L......... ..-·/
:
f ';.......:... - -B; E ::J ·:. .,. .- ~./ ,. _3,,_ •
=·-········
- C ,,.. - 2 "(,
G
1-I F, G 2

m to represent the project.

a) Construct the activity network diagra . . -·----::
-~rliest Finis9 (Ef ) times for··~ach.~:activity.
..-····· ··.. ····-· •• -~.;-- b)--Detennine the EarHest,-·Start (ES)--apd- /:::::::.. ,_. ./ [5t.?.:l.
'
<::::::·:. _.. ./ !.·:::::::::. _.// <::::~·.. . . . . . .
/ /°........ ....... ..·• • /
,•

...•

---0 000 0-- -

••

..... ........
..........:.. .·· ••..
'..... ..
... .. . .. ··~·· ·····. .· ,.... '··: _. .........~.:: ,•

•• \ _./· ..· ;·
..•·· ... ••• ...
;,..........
..·
.-·
,· ;