8th Semester (June; July-2015) Computer Science and Information Science Engineering Question Papers

1. USN
Time: 3 hrs.
Eighth Semester B.E. Degree Examination, June/July 20LS
System Modeling and Simulation
Max. Marks:100
10cs82
it is not.
(10 Marks)
(10 Marks)
(04 Marks)
(06 Marks)
(06 Marks)
(08.Marks)
(06 Marks)
c.)
o
L)
6tr
o.
v,
o
c.)
l.i
?c)
;il
d6J-
.= 6l
6$
Eo
cB
-n:
Ud
aotr
vo
>q.G
Jo
6|'
lq
o;
aiE
ii 0)
5.e> (H
b!otrao
=9=
c-l
5Lr
U<
< C'.1
c,)
z
F
o
O.
E
a.
b.
Note: Answer any FIVE full questions, selecting
atleast TWO questions from each part.
PART - A
a. List any five circumstances, when the simulation is the appropriate tool and when
b. Explain the steps in a simulation study, with the flow chart.
Explain the following:
i) System ii) Event list iii) Entity iv) Event.
Write the flow chart with respect to single channel queue:
i) Execution of the arrival event
ii) Execution of the departure event.
PART - B
a. Explain combined linear congruential generator.
b. Explain inverse-transform technique.of producing random variates for
i) Exponential distribution ii) Weibull distriburion.
c. Generate three Poisson variates with mean u = 0.2.
[Random number : 0.4357, 0.4146,0.8353, 0.9952,0.8004].
I of 2
c. One company uses 6 trucks of haul manganese ore from kolar to its industry. There are two
loaders, to load each truck. After loading, a truck moves to the weighing scale to be
weighed. The queue discipline is FIFO. When it is weighed, a truck travels to the industry
and returns to the loader queue. The distribution of loading time, weighing time and travel
time are as follows:
Loading time: 10 5 5 10 15 10 10
Weigh time: T2 t2 L2 t6 L2 t6
Travel time: 60 100 40 40 80
Depict the simulation table and estimate the loader and scale utilization. Assume 5 trucks are
at the loaders and one is at the scale, at time '0'. Stopping time Tp = 76 min. (10 Marks)
a. Explain discrete random variable and continuous random variable with example. (08 Marks)
b. Explain the following discrete distribution:
i) Binomial distribution ii) Poisson distribution. (06 Marks)
c. Explain the following continuous distribution:
i) Uniform distribution ii) Exponential distribution. (06 Marks)
Explain queue behavior and queue discipline and list queuing notation for parallel server
systems. (12 Marks)
What is network of queue? Mention the general assumption for a stable system with infinite
calling population. (08 Marks)
b.

2. a.
10cs82
The sequence of numbers 0.44, 0.81 , 0.14, 0.05, 0.93 has been generated. Use the
Kolmogonov-Smirnov test with cr = 0.05 to determine if the hypothesis that the numbers are
uniformly distributed in the interval [0, 1] can be rejected. Compare F(x) and SN(x) on a
graph. [N = 5, Do.os = 0.565]. (10 Marks)
Explain chi-square goodness of fit test. Apply it to Poisson assumption with cr = 3 .64. Dxa
size = 100 and observed frequency oi = 12,10, 19, 17,10, 8, 7,5,5,3,3, ll h3.ur., - 11.1].
(10 Marks)
a. What are pseudo random numbers? What are the problems that occur while generating
pseudo random number? (06 Marks)
Enlist the steps involved in development of a useful model of input data and number of ways
to select input models without data. (08 Marks)
List any 6 suggested estimators for distributions often used in sirnulation. (06 Marks)
Explain with a neat diagram, model building, verification and validation. (10 Marks)
Explain the iterative process of calibrating a model. (10 Marks)
b.
b.
c.
8a.
b.
88***
2of2

3. Eighth Sernester B"E" Degree Examination, June/July
Softw a re Ara hitectures
s81
Max. Marks:100
(Architecture
in creating a
(12 Marks)
(08 Nlarks)
(i0 Marks)
(10 Marks)
Time: 3 hrs.
b.
a.
b.
a.
b:
C)
a
(-)
(3
t<
G
s1
C)
cn
C)
tr
3eoo#
Ec
=[.)oo ll
cco.;i I
.= c'l
tr.t}:c0 2
oc
-cu
fr2
ad
3 a aliY-,
us)
o!bo=
)-J
-6,
*! q
bs
5;1iaX
tro.
O J
()j
.:a(J
tl e
5 u oiEr
Lr tl)
6.v;-t k
CO - *:,.. *"
C o0 .. .*,. -au
-,.i,
"!li
Qr 5 ...,..'q
Ei' ii..',;.,-, Q .tr
i) !::-
r 'i
- cl s
I
C)
o
A
cs
P
o
g8
Note: Amswer any FIVE full questions, selecting .','r,,,;
ati'east TWO questions from each part.
..**.,
..,*,... "
i:',,.
PAR?-A ,*ffi
-
Dr,fine scftriia.r'e e.rchit'lc'!rro, 'i+.h the he ip of neat hlock diagrarnmf ABC
Business C:vcle). Explain in detail the diiferent activities whieh'ffe involved
software architecture?
-"''u"''"""''''Write short notes on: .' "',
i) Architectural patterns
iii) Referencearchite(,tdi'es.
a. What are the quaiities of system? Explain mociifiability general scenario?
b. V/hat do you mearl by tactics? Explain the availability tactics with a neat diagram.
a. Wilai are lile sle;s ii:, c- r e rl u. inpiemer:ti"rg riicrokemel system?
b. Wira: are tirt: Lenelits and liabilities of reflection architectural patterns?
a. Discuss 5 steps in impiemenring klaster-Slave pattern.
b. Discuss briefly implementation of wholu -part-slructure.
c. I![ention i:enefits of pi'ox1, iosign pattern.
Explain in detail a.bc'-rt cipes and filters architectural style with types (in'variants),
advantages and disadvantages. (1{} Marks)
Er.plaiir rii Lrnei sbc;l r(o/I3 (-(eylrCr..,,.;r C',ntexl) problem with abstract data types arrd
irnpiicit invocatiolr st ies tc :rnplement st-rrutiotis. (10 ivlariis)
a. Briefly explain pipes and tilters architectural pattern benefits. (ott Vrarlrs)
b. Defirte Brackbc in d a;c:riieciural patter]1. tsriei'ly explain the steps used to impleiliei,L ihe
blackboaiti patier'n. (tuu Marrs)
c. Writc & Irtlie c,ur ,-ii:.qFlSA!'-Ii sysierr. ({i4. l/rart<s)
PAR.T _ B
Define Broker arciritectural pattern. Explain types of participating componenrs which
,, comprlses rt. (10 Marks)
i Explain with neat diagram, the dynamic scenarios of model view controller (MVC)?
(10 Marks)
a. Exc].ain vr;Li
b. What are the
nea; c;agra:r e''rolutionary delivery life cycle model.
s uggested standard organ tzatron points for interface documentation?
(12 Btarrs)
(,.:J i/--l"is)
(r0 Vlarks)
(08 Marks)
(02Iliarxs)
(08 Marks)
(i2 Marks)

4. * €rr* Cs
USN
Time: 3 hrs.
lOCS/IS834
2015
Max. Marks:100
(10 Marks)
(06 Marks)
(04 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(08 Marks)
(06 Marks)
(06 Marks)
(10 Marks)
techniques used to
(10 Marks)
Eighth Semester B.E. Degree Exa
Network Management Systems
Note: Answer FIVE full questions, selecting
at least TWO questions from each part.C)
o
o
Lr
a
4)
O
()X
w
J'
dJ
;n
!o tl
.=N
c3 t+
ic)
o.)=i0)
oB'*, a
.tX
O()
50c
)e
.Ctr
J
-q)
OE
ad
c-X
o;
?.=
6:
ArE
'- d)
5.Y> (ts
coo
=50
=9rXd)
(-)
rr<
-cn
d)
Z
H
PART - A
a. Define Network Management? Explain Network management goals and functions as defined
by ISO. : (10 Marks)
b. Explain IBM system network architecture model. (06 Marks)
c. What are the limitations of current network management syrstem? (04 Marks)
a. Explain the different perspectives of managed objects with examples. (10 Marks)
b. What is basic encoding rule (BER)? Explain. Using BER encode the data in TLV format
defined as OBJECT IDENTIFIER (UNIVERSAL 6) of a value {43 6 l). (05 Marks)
c. Discuss the salient features of various network management standards. (05 Marks)
a. With a neat diagram, explain SNMP network management architecture.
b. What are the different defined datafypes in SNMP? Briefly explain their usage.
c. Explain SNMP proxy server organization model.
a. Discuss any three MIB - Groups in detail.
b. Define and explain SNMP access policies in SNMP management.
a.withaneatsketctr,explain,n.*,ffiandfunctions.
b. Explain clearly the RMON token ring groups and its Tables.
a. Explain the virtual path - virtual circuit with an example.
b. Describe M+ interface.
c. Discuss the generic troubles in ATM network elements.
a. Describe ADSL encoding and ADSL channeling schemes.
b. Explain the rule based reasoning and model based reasoning correlation
isolate and localize faults in network.
Write short notes on
a. Fault management
b. Policy management
c. Security management
d. Performance management.
c&" t]
"-d;fl#
It7
iK"e/July
****rk
(20 Marks)

5. USN
o)
.9
C)
GI
E1U'
Cd
o
d
d:t
ERb&-
o.li
v,
Es 2
! ,,'
s;.=N
c€s
otr
€g
O>.
R; J
BS
bd
GIO
8; 4
b0tr.q a(l
€5
}Htq5
'O Gl
-z^.ts
H9
=cgic)r]6
EE 5
o-f
ur^ O
bE
to
EE 6
|r0)
3=
ntsrl bI).HF
6E "*
Eg *mE Fd&*c+"4.&,*JS
^
'iFi 4r. -
l -ir
.Vritr* *"-'
-Sr.l
U8o
z
cd
L
o
F
Eighth Semester B.E. Degree Examination, June/July 2Ol5
AD-HOC Networks
Time: 3 hrs. Max. Marks:lb0
Note: Answer FIVE full qaestions, selecting -{ #
at least TWO questions from each parl i" l-
*
_ ,,+, -
PART - A '';',,.'"'.,,
a. List and explain different applications of Ad-hoc wireless network. . "', (05 Marks)
b. Explain the issues that makes wireless sensor network a distinct categ-ory of ad-hoc wireless
networks. +:',,;:#
v (05 Marks)
c. Discuss the major issues, one need to consider while designin$"S AC protocol for Adhoc
wireless network. (10 Marks)
a. What are the design goals to be met while designing Sry,$C protocol for Adhoc networks?
ui.,;.;,,.{ (06 Marks)
b. Explain the classification ofMAC protocols. dB* q (04 Marks)
c. Explain with example, a working principle of F'ive4hase-Reservation Protocol (FPRP).
(10 Marks)
(04 Marks)
(08 Marks)
(08 Marks)
a.
b.
c.
,,,iF
Mention the factors to be considered,,,.."f-Ii*e making scheduling decisions.
Explain the operation of Distribuffilpibrity Scheduling (DPS) protocol.
Explain the working principleoffii-channel MAC (MMAC) protocol.
dtn^*n"
a. What are the characteristicffiiin ideal routing protocol for adhoc wireless network?
,{ry (04 Marks)
b. Explain the classificaflSbf routing protocols. (08 Marks)
c. Explain ttre wotffiffinciple of wireless routing protocol. (08 Marks)
(04 Marks)
-y"ffi PART-B
a. Explain %ffidpbsed hierarchical link state routing protocol with example (10 Marks)
b. Explaffier-bperation of Fisheye State Routing Protocol (FSRP). (10 Marks)
-Mffi*
a. Wffin the issues in designing transport layer protocois ior acihoc wireless networks.
&.
{ * (10 Marks)
-Uffiitt a neat diagram, explain the operation of adhoc-TcP (ATCP) protocol. 1ro uart<s;
'& .s.!&,p'
a. Discuss the requirements and challenges in security provisioning for adhoc wireless
networks. (10 Marks)
b. What is key management? Explain symmetric key algorithm with example. (10 Marks)
a. Explain the issues in providing QoS in adhoc wireless network. (10 Marks)
b. Discuss the working principle of Ticket-based QoS routing protocol. (10 Marks)