Civil Engineering Question Papers

1. USN
Time: 3 hrs.
' ,
a!: .1111'i1,
.-&'""'
t"-. s..
06138I
Max. Marks:100'''=
(08 Marks)
classes based on their
(04 Marks)
explain discard
(08 Marks)
(06 Marks)
(04 Marks)
(10 Marks)
Eighth Semester B.E. Degree Examina
Software Testing
Note: Answer FIVEfull questions, selecting
at least Tll/O questionsfrom each port.
PART _ A
oi
o
o
sn
o
c)
c)
!4(]
dU
=r)!
oo il
troo
.=N
d$
H OJ)
uooE
E(l)
o3
8n
3a.
b.
c.
..:.:.: .::::
t a. ffi11*," terms error, fault and failure. Explain with a block diagram, the, separation of
ob$d,ffip-le behaviour from observed behaviour. iiq . I (06 Marks)
b. Defirie't'est metrics. Explain three types of test metrics. Define test plan With example.
vu*r Ygurv wrrgvrvw
Defirie'test metrics. Explain three types of test metrics. Define test plan Witts. bxp ith example.
c. Explain software quality attributes. Give block diagram for test and debug cycle. (06 Marks)
.
::::: :: !:r1
(06 Marks)
(06 Marks)
(08 Marks)
2 a. Explain: i) Defect.,qlanagement, ii) Software and hardware teiting.
b. Explain static testirryrpnd its integral parts.
c. What are different tX;'6ryQesting? Explain test r.ffiU model in detail.
Explain with neat block diagram steps in category partition method.
Give suitable guidelines for p#ttiqrring vaqmles into equivalence
6A-::
U-
: 3 4 a. Explain cause-effect graphing ancl give atrie'f dpscription of constrairts with CEG.
ei (06 Marks)
€ E b. GenerateBOR-constraffi$algorithm.Givepredieatg.;,forexpressiona<bnc>d.
f E '* " (06 Marks)
! E c. Compute BOR-coru*fa{irt set forpredicatep: (a+b<c) 4ryp v (r> s). (08Marks)
->6'5 e -L",g
fEroblem*nn..ffi"...(06Marks)9. O.
t $ 5 a. Explain infegpibility problem with respect to structural testing.
; S b. Explain: i) Statement coverage ii) Branch adequacy criterion
g E iii) MC/DC iv) Path adequacy criterion. ,,,,: :,,,,, (08 Marks)
H E c' Explain the following'
,,, t1--^t^.^^^t:^ +^^+2--
=
€ D LCSAJ testing ii) Cyclomatic testing ,, (06 Marks)
5.t ','
epY^ n')
'E g 6_ - a.. Give control dependence and data dependence graph for Euclid's algorithm for GCd,,'.:1"
' (06.Marks)go I :
tr>
E 3, ,.'l: b. Give an work-list algorithm to compute reaching definitions. (08 M4r{q),.
5 5' c. Define: i) DU pair ii) Forward analysis iii) Power set lattice (06 Marks)'
ulrv4Jrurv wYgr v qrvuwv vrsJDvJ. a
,t
Explain cause-effect graphinganil give al
a. Explain term scaffolding with respect to test execution. Explain types of scaffolding.
(10 Marks)
b. Explain: i) Capture and replay ii) Test Oracles iii) Adequacy criterion
iv) Test suite v) Test execution. (10 Marks)
type.type.
Give systematic procedure for equivalence tr
partitioning and with example
infeasible equivalence classes. - ;' ',
Give differences between system, acceptance and regression testing.
Explain difference between alpha and beta testing.
Explain integration testing strategies.
****r<
-i 6i
it ,
o
'7
(t
F
g
8 a.
b.
c.

2. USN
10ts81
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
Eighth Semester B.E. Degree Examin ily 2Ol4
:lrr | '4;
Max. Marks:100
.a: I
Time: 3 hrs.
Software Architecture
Note: Answer FIVEfull questions, selecting
atleast TWO questionfrom each purt.
()
.9
o(6
g(!
(l
t
d
G)
,i I a.
ox
(n=
J'3 b.
=r)on ll
.E?
.=N t ^6+ L A.
e^
Es b.
ols(u
a.t
5; 5 a.
eg b.
4d
gct a ^o(,)tA.
do
-
p= b.
-66r
E(n
-3o'Es
2=
d. 8.
5;' 5 A.
?1 -Y
6:
a€ b
Ld)
=E
:^a
-^o
.HE 6 a.
9= b.*o
ET
5 L ,..".4
A a -:# #a.
J < ,t''s
-.: .,iq* hhd$ u.
o.
2 " 8 a.
oh
E
categorized into, with the help of appropriate pictorial dmf{iOtion.
Explain in brief about KWtrC (keyword in context) with shared data solution.
Explain in brief about pipes a:rd filters style, with diagram.
Explain what is availabilityZ p@f.,genedts&nario for availability? (10 Marks)
What do you mean by tactics? Exftray,availability tactics with neat diagram. (10 Marks)
What do you mean by architectural paftern? How it is categorized? Explain the structure part
of the solution for ISO layered architecture. (10 Marks)
Define blackboard architectural pattern? Briefl4.epllain steps used to implement the black
board pattern. "' ,i
','' (10 Marks)
"-.,.{:F PART - B
":" ',
1{
{*r*
What do yffir6an by broker architecture? What are the steps in:,zolved in implementing
distribute*lirtiker architecture patterns? (10 Marks)
Explain with neat diagram, the dynamic scenarios of model view controller (MVC).
(10 Marks)
(12 Marks)
(08 Marks)
Discuss the five steps implementation of Master - slave - pattern. 1t0ffi46-q)
Explain in brief about variants of whole - part - design puit.*, in brief. (10 Mmrt&
-
&ffif'
Briefly explain the different steps performed while designing an architecture using the ADD
What are the steps involved in implementing the microkernel system?
What are the benefits and liabilities of "Reflection architecture". Patterns?
method.
Write short notes any two of following :
i) Forming team structures
ii) Documenting across views
iii) Documenting interfaces.
{.****
(10 Marks)

3. 06cs81USN
Eighth Semester B.E. Degree Examina / July 2014
Advanced Gomputer Architecture
i E target buffer urrir-ing the penaliy cycles for individual mispreaicmn from below' table.
gE Make the following assumptions about the prediction accuracy and hit ratp.
? g o Prediction accuracy is90Yo (for instruction in the buffer).
e
'€ Time: 3 hrs. Max. Mark*100
L
o-
:
Noteurl.p:wer any FIVEfull questions, selecting atleast TWO questionsfrarm.,eoch part.
E ,,,4ry.* PART - A ,, ','i
--
g 1 ;' Name"frtu implementation of trends in technologies' Explain withr'leaining curve how the
$ i cost of propqs$or varies with time along with factors influencing thBpttst. (10 Marks)
gE b. What are tlielh:vq types of desktop bench mark? ,,,,
E B Given the foilowing measurements : Frequency of Fp oper4tions: 25oh ; Average CPI of
C.: FP operations:4.0 ; Average CPI of other instructions ="1.33 ; Frequency of FPSQR
:= & : 2Yo ; CPI of FPSQR : 20. Assume that the two dA5ign alternatives are to decrease the
E ; cpr lr'rpsaRl; t&In J"*"r.. ,h" ;;;dL Cpr ""iii Er op"rutions to 2.5. compare
t g these two designs alternatiffiusing the proceT:a;,llerformance equation. (10l{arks)
o B
*1,,#r;
I
2 * 2 a. What are the major hazards in a bJpfiline?r-Efplain with a block diagram how to minimize
; E the data hazard stall, with an examp[e,''. - * (10 Marks)
$ * b. With a neat block diagram, explaiC:ffihmentation of the MIPS data path which allows
E i every instruction to be executed in a 4 or 5 clock cycles. (10 Marks)
ootr
: n 3 a. Name any two types of nam-g.defbndency. Ery'hin.with examples data dependency and data
€ * hazards. (lo Marks)
a d b. Explain dynamic schqduling using Tomasulo's 'approcch. With a neat block diagram,
E * .*ptuin basic structuuepf MIFs floaiing point unit uring To*usulo's algorithm. (10 Marks)
e g. .n"
trd
H I 4 a. Explain about eAloiting ILP using multiple issue and static scheduling with basic VLIW
.;5 ^---^^^L ^ trntrr^-r,^- ,roach. *hB 'E ap ."m (lo Marks)
A € b. Explain with diagram, branch target buffer. Determine the total bra@ penalty for a branch
E 'E .^-'*^* L--ff^- ^^--,*:-- +L^ -^-^l+., ^-,^l^^ C-- ;-I:.,:1,,^l *i-^*^li;+f^*rl'€.^* L-l^.', tolrla
eE o Hot rate in the buffer is 90% (for branch prediction taken). (10 Marks)
Fi
in the buffer is 90o/o for branch orediction taken
Instruction in buffer Prediction Actual branch Penaltv cvcle
Yes Taken Taken 0
Yes Taken Not taken 2
No Taken 2
No Not taken 0
d
o
3 PART. B
i 5 a. Explain the block diagram of basic structure of centralized shared memory architecture and
taxonomy of parallel architecture. (10 Marks)
What is multiprocessor cache coherence? Explain the same. Discuss how a directory is
added to cache node to implement cache coherence in a distributed memory multiprocessor.
r of 2
(10 Marks)
8 E I IIISLTUCUOII Ur Ourlgf I rr.suruuuu I Auruilr uraflsfl | rcilalr.v u-Yurtr |
;>t^
=
16.'4
I Yes I Taken I Not taken I Z I-.: oi .:,'.:'..
'=
,.:(..i I Yes I laken I Nottal(en I Z I " .,/$
eu.-.. I No I I raken I z I "*Z I Nn I I NnffeLen I O I

4. 06cs81
a. Explain about multilevel cache to reduce miss penalty of.cache optimization. Suppose that
in 1000 memory references there are 40 misses in the first lbvbl cache and20 misses in the
second level cache. What are the various miss rates? Assume the miss penalty from the I,2
cache to memory is 200 clock cycles and there are 1.5 memory references per r
t qrd;.n What is the average memory access time and average stall cycles per instruction? I
impact ofwrites.
,...i b. Given the data below, what is impact of second level cache associativity on its nalty.
.........::
'. ,r Hit timer-z for direct mapped: l0 clock cycles.
-i.;;,Two way set associativity increases hit time by 0.1 clock cycles to
o . eal miss rater-z for direct mapped :25oh.
. Locrtmiss raterz for two way set associative :20Yo. &
. lvllss F$nptty1, - zvv sIUL,ll uyurtrs.
d@* f 3 1+
{*}4 i€ f ,n
a. Explain compilerrr%ffimization to reduce miss rate of d-drifoptimization scheme. Assume
that the hit time of a tW"o.; way set associative first
four wav set associativ$,sre,he of the same size. Tl
10.1tbtk cycles.
an 8KB data cache. Assurne a hit is I clock cy'elg.and that the cache is the critical path for
the clock. Assume the miss pedty is 10 clodk olcles to the L2 cache for the two way set -
associative cache and that theL2 Wh_"_does
not miss. Which has the faster average memory
access time? ' ,^,- ..... ,_ (10 Marks)
b. Explain in detail protection via virtuAd' eiirory and protection via virtual machines.
o lr4iss p$hltyr-:200 clock cycles.
cache is 1.1 times faster than a
four way set associatirl$,&rehe of the same size. t6&&riss rate falls from 0.049 to 0.044 for
* 1 ,. (10 Marks)l' "Li
*#'4
t 4-.d
Explain in detail hardware ."pport for exposihdiflr*tt"tirm. Explain the architecture of Intel
Mlh.., mention theIA - 64. With necessary-ffiches, mention the@nificance of prediction and speculation
units. .,'.,,' -
ffi (10 Marks)
b. Explain scheduling'ah& structuring code for paralffifsrrk With a neat sketch, explain
^^L^l!rl,*'::.
,: ,,,
tt'a
" /tA [[--r-^
:l:l:l:t:t
2 of2

5. I581USN
,.1"'i,,,,,, Time: 3 hfS.
Eighth Semester B.E. Degree Examination, Ju
Software Test-ng
Max. Marks:100
Note: Answer FIVEfull questions, selecting *"'''';"
at least TWO questions from eoch parl ,r1
,.,
, ,,, ,,r
{'::::::""":'.: i'''
Marks)
Marks)
Marks)
{.)
o
o
dL
a
d
I
o
()
L
Eg
(o=
69
=r)I
oo ll
coo
.=N(!+
gil
oldo
o>
8s
a=
oO
16O
OE
00tr(ErB
Eb
}H6-
-?o.r
5.y
o. 5:
o.'oj
9Et (.)
a: q=
EELOI
x.Y
xroo-eo0
o=
EO
=oEL
e<
:ai
0)
o
z
P
i@F+
la,{qffi*p"termserror,faultandfuil*-..r*phi',withablockdiagrarrr,theseparationof
ob$#{hb]e behaviour from observed behaviour. ,,,,
"""';....-,.i (06 Marks)
b. Defirfo'test metrics. Explain three types of test metrics. Define test plan{rtith example.
:1 . .,,,,,...:,,-- (o8Marks)
c. Explain softwrtequality attributes. Give block diagram for testffidebug cycle. (06 Marks)
2 a. Explain: i) Defect management, ii) Software and hardwareleSting. (06 Marks)
b. Explain static testirig'hrd its integral parts. (06 Marks)
c. What are different tXliffi,*testing? Explain test procCss model in detail. (08 Marks)
:' .::.::' ..,'
-{,*r., . Fa!
3 a. Explain with neat block dia$,ffiu-steps in categ6{ryPartition method. (08 Marks)
b. Give suitable guidelines for p ip..l-ung yqidblbs into equivalence classes based on their
type. ' (04 Marks)
c. Give systematic procedure for equiy4ltioc.e partitioning and with example explain discard
infeasible equivalence classes. ; (08 Marks)
5 a. Explain infehsiUitity problem with respect to structural testing.
4 a. Explain cause-effect graphing,4nd''give a brief,.des,cnption of constraints with CEG.
(06
b. Generate. BOR-constrain*-.*# afuorithm. Give predibates for expression a < b n c > d.
....-_-i (06
c. ComputeBOR-cffi$Mnt set forpredicatep: (a+b< c) (r> s). (08
-tt,.r,,,,..
b. Explainrr},'' Statement coverage ii) Branch adequacy criterfb*{ ,,.
,r l1r 'iii) MC/DC iv) Path adequacy criterion. t'"'.,,.,,,,,,,,
c. E#ffl n the following:
*_4|)*atAJ
testing ii) Cyclomatic testing r'* -
-6'.=. W Give control dependence and data dependence graph for Euclid's algorithm for
-: -
,.,,:.{;- b. Give an work-list algorithm to compute reaching defuritions.
''"r:;"i' c. Define: i) DU pair ii) Forward analysis iii) Power set lattice
7 a. Explain term scaffolding with respect to test execution. Explain types of scaflolding.
(06 Marks)
(08 Marks)
ff6 Marks)
GC.P*.
(Ofl#ark9
(08 Mqp,!r$ .
(06 Marli$f ,,,
8 a. Give differences between system, acceptance and regression testing.
b. Explain difflerence between alpha and beta testing.
c. Explain integration testing strategies.
d<r<r<**
b. Explain: i) Capture and replay
iv) Test suite
(10 Marks)
ii) Test Oracles ii} Adequacy criterion
v) Test execution. (10 Marks)
(06 Marks)
(04 Marks)
(10 Marks)

6. USN
Eighth
,{p.ne:
3 hrs.
',_,"il.
'rr i
,i.
Semester B.E. Degree Examination,
S/IS834
(10 Marks)
(06 Marks)
(04 Marks)
(10 Marks)
(04 Marks)
(06 Marks)
(12 Marks)
(08 Marks)
{10 Marks)
(I0LMart<s)
(06 Marks)''
(10 Marks)-"
(04 Marks)
(10 Marks)
(07 Marks)
(03 Marks)
()
o
c)
cd
!
0.
I
(J
C)
!
EP
=h3
oo ll
doo
.=N
d+
0) ::J
otreO
o>
E*
a=
do
c6O
o0trd.d
rb>eu6
FI
td
2"f
5 .13
ic. A
tro
oj
9E
A,E
EE90
= .sz
>' (H
boo
c ot)
'6)=
H. $)
=oo:
J<
-iN
o
z
cd
o.
3a.
b.
c.
4a.
b.
5a.
b.
6 &:,,
b.
in ATM technology.
Explain ATM switch and ATM virtual LAN, with a diagram of each.
a. Explain different broad band access technologies.
b. What is HFC network? Explain with a diagram.
c. Explain broad band LAN architecture.
b. Explain a coflrmunicating finite state machine model.
c. Explain basic concept of cryptography.
$eRAt{Y/':l
Ssti-,
'96u
Network Management Sys
Note: Answer FIVEfull questions, selecting
stleast TWO questionfrom each part.
PART _ A
I a. Explain the characteristics of telephone network management model with diagram.
-" ';t
"
(05 Marks)
b. What are ftg,.qgq challenges of information technology manageiliii managing the network?
"'1 .,,,,';i'
"_ d.q. (05 Marks)
c. What is networld'ffinagement system? Explain network'::drariagement goals, functions of
network operation ds denned by ISO. 10 Marks)
""
i. ,, 1,,i,'"',,,r1,r
2 a. Explain about organrzat@ and information models of network management with an
diagram of each. ........
,:,., :: -.,, ,",,',
b. Explain the communication modet with an @iffiam.
c. Write a note on encoding stricture used in ASN.l.
With neat diagram, explain SNMP netwbrk management architecture.
With neat sketch, explain proxy,eettar orgaiization model.
Explain two - tier and three-IiptSNMP organil model.
Explain SNMP commur{blprofile and access policy in"$NMP management.
Explain the various SNMP operations.
-'"i PART-B
l
What js,,iemote monitoring? Explain network configuration with RMONT:._
Uxp,,@nUONI groups and its functions. .:,:,
8 a. What is event correlation technique? Explain basic rule-based reasoning with a diagram.
(08 Marks)
(12 Marks)
,,,.Elrylain four functions are performed across LAN emulation user network inter ce (LIIND
***{.*

7. USN
* s,^Cs
O6CS/IS841
2014
Ei.
I lme: J hrs.
Eighth Semester B.E. Degree Exam
Adhoc Networks
Note: Answer FIVEfull questions, selecting
atleast TWO questionfrom each part.
Differentiate between Adhoc TCP and split TCP.
c)
o
o
6L
o
Cd
a0
()
()
L
E9
;;
=
tt']
oo ll
coa
.=N
d$
xboga)
o<tO
o3
Es
3E
bd
do
OEhoc
.erq
E5>€
a6
6-
'(, (d
'Ee
!=
48"tro.
oj
9E
A,i
EE!o
=+.=
>"r
bov
trho
()=
siB
=o9-
e<
:tr
0)
E
z
cg
o
a
PART _ A
I a. List th,,issues of Adhoc networks. Brietly discuss any tbur issues. ii}q (10 Marks)
b. Discuss tliE"maior facts to be considered for a successful Adhoc wkglcss network. (10 Marks)
2 a. Define sot .etdrug4ign. Explain soft reservation multiple rgd;t with priority assignment
(SRMA/PA) using &ame structure. (10 Marks)
b. Briefly explain the fiV se reservation protocol wffQfame structure. (10 Marks)
6
,,, ,. t
3 a. With the scheduling table updates, explain the disftibuted priority scheduling. (t0 Marks)
b. Describe the working princifle of MAC protocol using directional antennas. With a neat
sketch, explain directional busy t6ne#" ,,based tritAC protocol. (10 Marks)
't',,,,,::jt'
t
4 a. What are the classifications of rqrrting prgtocol for Adhoc wireless networks? Explain them
;l'.-
in brief, &.(,'' ., ,,,,,,* (lo Marks)
b. ;;;l;t; the route establishm@furocess in DSDV rguting protocol, with an example.
*; *, (10 Marks)
PART _ B
protocol with'a neat does it5a.
b.
D.
7 a. List the different network layer attacks in wireless Adhoc networks.
b. List the diflerent key management techniques in Adhoc wireless networks.
symmetric and asymmetric key management algorithms.
8 a. Explain the issues and challenges in providing QoS in Adhoc wireless networks. (10 Marks)
b. Discuss cluster TDMA and IEEE 802.1Ie, in brief (10 Marks)
***rf{.

8. 10cs82USN
Eighth Semester B.E. Degree Examina
System Modeling and Simulation {u
.Time:3
hrs'
, n,rn r ,, ,.-,-- --t^^t:---
Max' Marks:1'00
' ' ,', ' otez Answer any FIWfall qaestions, selecting r .:.:::::: :::
..,i.''' atleast TWO questions from each part.
€ PART-AO ./'^i{ '
fn"
[ 1 a. De"fiiiesystem. Explain the components of a system with an example. q,,,* '" (10 Marks)
E b. With a n€at flow diagram, explain the steps in simulation study. (10 Marks)
q,{ii
(n -4
E 2 a. Describe queuing system with respect to arrival and service$#*it-s, system capacity,
..
g queue disciplinel flow diagrams of arrival and departure events. (10 Marks)
$ 3 b. A small shop hii one check out counter. Customers arr{rre at this checkout counter at
g
=
random from I to I& minutes apart. Each possible value of inter-arrival time has the same
E A probability of occurrence equal to 0.10. Service iimes vary from I to 6 minutes with
pJ probability shown below:
.=N(€$
H bI)
tso
oqdO
EE
Service timel ..,1,. 2."',,,.,' J 4 5 6
Probabilitv 'b,0t" 0.10 0.20 0.030 0.25 0.10
U':::
9 e Develop simulation table for l0'Custdmers. Find: i) Average waiting time; ii) Average
; E service time; iii) Average time, customer spends in system.
! * Take the random digits for arrivals as 91, 72, 15? 94x30,92,75,23,30 and for service times
E ! are 84, 10,74,53,17,79,91,,67,89,38 sequentially. (l0Marks)
AE(!-G
€ f e - E-^l^:- +L^ ^',--t.^L^4"'ili-^lti^o oA,,on o ol-^.i+L-.r.i4h o- a*omnlo /lta ]llorlzo
(!-G
: E 3 a. Explain the event scheduling/time advance algorithm with an example.
€ € b. A company uses 6 tnrcks to haul manganese are from oK0,tu, to inr
(08 Marks)
b. A company usQs,"$.'=tr11cks to haul manganese are from K0,tu, to industry. There are two
9(E
f B loaders, to lod-rchch truck. After loading, a truck moveqto...the weighing scale to beg' 6 loaders, to [od"rehch truck. After loading, a truck moveq'tp..the wetghmg scale to be
} : weighed. Tfuqueue discipline is FIFO. Wh., it is weighed, #'#ilck travets to the industry
E i and-retqfiq$-m tfre loader q.r.,r.. The distribution of loading time;%$/pighing time and travel
E 3 -,*^ ^-^ ^" f^tt^,,,^.time arBaS follows:8 ]" tlme areas lollows:O
-f
lrrrrv wr,Y"*e ,ii:
A9u9
H'5
t"g
cgE lrrr^:^L+:*^ lrolrn ltolrrlt'tll<l I
=g
I YYstslltttrrs lIZl I.4 lI.4 lIrlrrlrtrl I
i; lrravettime looltool+ol+olsol | |
Loadins time 10 5 5 10 t5 10 10
Weish time t2 t2 T2 t6 t2 t6
Travel time 60 100 40 40 80
;.=
E E Calculate the total busy time of both loaders, the scale, average loader and scale utilizhtiofru
e F Assume 5 trucks are at the loader and one is at the scale, at time "0". Stopping event tirq.
5 € TE:64min. (12 Marks)
--.: c.i
3i 4 a. Explain the following continuous distributions:
o.-
Z i) Uniform distribution
E ii) Exponential distributions. (10 Marks)
i b. Explain the characteristics of queuing system. List the different queuing notations.
.E (lo Marks)
I of2

9. :1-
I
10cs82
PART _ B
5 a. Explain linear congruential method. Write three ways of achieving maximal period.
(05 Marks)
b. The sequence of random numbers 0.54,0.73,0.98, 0.11 and 0.68 has been generated. Use
. Kolmogorov-Smirnov test with cr : 0.05 to determine if the hypothesis that the numbers atre
uniformly distributed on the interval [0, 1] can be rejected. Take Do: 0.565. (05
Yfk )
-"{;* .. What is acceptance-rejection technique? Generate three Poisson variates yrt-h_T:u1Cq02.
'*"'';ii The randomnurnbers are0.4357,0.4146,0.8353, 0.9952,0.8004, 0.7945,0.1530Hi'"
n,w '* '* ('H Marks)
',,,..,1tt,,i h..
-,,,, .,,
6 a. h$mlain different steps in the development of a useful model of inptrt 6ata,,' -.
,'* {10 Marks)
b. E@jn-Chi-square goodness of fit test. Apply it to Poisson assumption
ryltatnla
: 3.64,
Data"si#; 100. Observed frequency Oi: 12 10 19 17 10 8 J1'1'5.5 3 3 1. Take
level of @frpance cr : 0.05. , ;1-=,
" (10 Marks)
4l
7 a. Explain ttre tffipf simulation with respect to output analffiive examples. (07 Marks)
b. Briefly explain t fiaence-interval estimation meth.* ffi (07 Marks)
c. Explainoutputanaffiprterminationsimulatiot.- *"
''J' (06Marks)
w -' n;LEi
I a. Explain with neat diagpnrfudel building verificatiffi and validation. (10 Marks)
b. Explain three step approach fiir'vqlidation n1ffi6s formulated by Nayler and Finger.
i::' *drr ,. ',,i (10 Marks)," (l
.,. - -...:.
r{?. ,,t.,togy-',-€-
-'***** ,/-ffi)f-,.n***_.- tGtd'u,.'
"d*"
)
. 'Y %it (.*fl -* r
lOl 't& '1 .F I '- aj
*l q'*s r&N i,
,)?rr___-1,
2 of2

10. USN
06cs82
(06 Marks)
(08 Marks)
Eighth Semester B.E. Degree Examination,
a.
b.
()
o
o
)v
o.
(o
6)
I
E9
_y-
-h-.o
oo ll
Eoo
.= C.l
ds
gL"
o<
-E(l)
oB
8s
d=
()(l)
.€O
othotrcg (s
2d
-=r ()
5 .!3
a8_
tro.
o.vo.i
9JE
,ioo lr=
sC
!o5n
>(*
boog ot)
=d90
tr>Xo
5"
U<
-c{
c)
o
z
o
o.
,,, Time: 3 hrs.
.,",,,,. ,;,,
,
c.
a.
b.
c.
3a.
System Modeling and Simula
Max. Marks:100
Note: Answer FIVEfull questions, selecting ["i.*',.'
otleast TWO questions from eoch part.
Defiag simulation, simulation model, entities, event, activities and delay.
,',,. ,. " (06 Marks)
List,, y.three situations when simulation is the appropriate tool and no{,the app-p,1?,"""L:l
Explain'witfuflow chart, the steps involved in simulation study. ,*..
i
,u ! ,,,-,,-:
"q1";::
DT.XYZ is a'dentist who schedules all patients for 30 m
patients take morc or-less than 30 minutes depending on th
The following table,..Shows the various categories of w
30 minuag appointments. Some of the
on-thefi/pe of dental work to be done.
The following table,,, Sh of rk, their probabilities and time
actually needed to comp,lSte the work. (10 Marks)
Filline Cro.vint Cleanins Extraction Checkup
Time required (min) ,,,,: 45 6S'-' l5 45 15
Probabilitv of catesory 0.40 ,0,15 0.1s 0.10 0.20
Simulate the dentist's clinic for 3 ho$is and determine the average waiting time for patientsSrmulate the dentrst's clrruc lor 3 hoilr and determme the average waltmg tlme ror patlents
and total idle time for doctor. Assumd'thal patients show up at the clinic at exactly their
scheduled arrival time starting at 8': 00 a.m. Upe the following random digi
+L^ ^L^-,^ --^Ll^* n, " 'i',-.Pl;*
igits for handling
the above problem
Random digits 40 82 ! tI( 34 25 66
Explain the three differ# types of world views. (08 Marks)
Define the term;,flstern'state and Future Event List (FEt)*^1.4 discrete event tffir#il?:;
Six dump"t s are used to haul coal from the entrance of a miris,rc,p railroad. Each truck is
loaded by.ffi of the two loaders. After loading, a truck immediately rnoves to the scale, to
be wej$&id as soon as possible. Both the loader and the scale haw f-rst - come - first -
r"*6,,,waiting line for trucks. Travel time from a loader to scale is corqpidered negligible.
Aftdi"being weighed, a truck begins travel time (during which time truck tut&ad$ and then
,afterwards return to loader queue. The activities of loading, weighings and trayel time are
given in the following table :
Loadins time 10 5 5 t0 l5 10 10
Weishins time t2 12 t2 t6 t2 t6
Travel time 60 100 40 40 80
It has been assumed that'ofive" of the trucks are at loader side and "one" at scale at time "0".
By using event scheduling algorithrn, find out average loader utilization and scale
utilization. End of simulation is completion of "two'? weighing from the scale. Depict the
simulation table. (10 Marks)
A computer repair person is "beeped" each time there is a call for service. The number of
beeps per hour is known to occur in accordance with a Poisson distribution with a mean of
a : 2 per hour. Find the probability of i) exactly three beeps ii) two or more beeps.106 Marks)
c. Define discrete random variable. Explain the binomial distribution.
I of2
(04 Marks)

11. S:t 06cs82A
ri
onv
4 a,. Explain with an example the characteristics of qu{iQsylfems./$;flt does the format
AlBlClNlK represent? a).-5r94u (10 Marks)
b. What do you mean by "Long nrn measures of performancBe@ffing system? List steady- . ].
,,: .' - state parameters of the Mlcll queue. (to nna&*)
:: ,:
5 a. 'h4
",:
llft€ruion the important considerations for the selection of routines tp.,,.gellbrate random
numbhffi ." (05 Marks),Lrrrlusrib
-;a
b. Use hffilicative congruential method to generate sequence of ffiur 3 digit random
numberd'ttfthXo : ll7,a:43 and m: 1000. ,.-] (05 Marks)
Explain KciHiqgprov - Smirnov test for uniformity of ran$o'ni numbers. Hence test for
uniformity of #&Iowing random numbers at 5o/o level of,sigthftficance.
0.72,0.82,0.12,0.1&
.9.73,0.79,0.95,0.57,
0.63.0.39.,Given D1o.os. ror
:0.410. (10 Marks)
/ Ji
, " ,
6 a. List the steps involr.d i4d"r"lopment of a useful *oOtf of input data. (04 Marks)
b. Suggest a step by step Pr.ooedure to generato random variates using inverse transform
technique for exponential diffi&{ion. t,-i.,l (06 Marks)
c. The number of vehicles arrivingl'at.+junctioat a five minute period was observed for 100
days. The resulting data is as follolils^: .
It is assumed that the arrivak-fotLw a poisson-t*fstribution with parameter cr :3.64. Using
chi - square goodness .o.g$h iest, determine whe{her the assumption that arrivals follow
Poisson distribution caffiilaccepted at 0.05 level oTsigfficance, given
1." "
resultulg rs as
Number of arrivals 0 u,s 2 J 4 5 6 7 8 9 10 lt
Frequencv ,n ,r0 t9 t7 t0 8 7 5 5
a
J J I
***r<*
!l
(Note : Expect@.res used should be > 5 for calculati"#'1,* .,i (10 Marks)
".a. Explain t$"e #e of simulation with respect to output analysis, give,,arr.example. (10 Marks)
b. Briefl.y - lain the measure of performance of a simulation system. ':i",,,"
;;p' (10 Marks)
"(;
a. .!{efis verification of simulation models? List the suggestions given fqry.,,, erification of
model. (jo Marks)
rp;""Describe the tlree steps approach to validation by Naylor and Finger. (to Marks)
.::. ::
2 of2