USN

2a.b.

c.

3a.b.

c.

06cs81

(05 Marks)(07 Marks)(08 Marks)

(08 Marks)(05 Marks)(07 Marks)

(06 Marks)(08 Marks)

Eighth Semester B.E. Degree Examination, Dec.2013 lJan.20l4Advanced Gomputer Architectures

Time: 3 hrs. Max. Marks:100Note: Answer FIVE full questions, selecting

at least TWO questions from each part.

PART _ At a. Define Instruction Set Architecture (ISA). Explain seven dimensions of an ISA, (08 Marks)

b. Find the number of dies per 500 mm wafer for a die that is 2.0 cm on a side. , (04 Marks)

c. Explain main measures of dependability. (04 Marks)

d. Derive CPU time in term of instruction cycle and cycles per instruction. (04 Marks)

(,)ooLa

o(.)

E9

t.(de

3ooltroo.=N(g$i cl)HC)oiFO

a2

aXoc)

50tr

.Y-d

5ro- 6.

oj

6=6i,:s6 .:r>' (ts

oovi ol).-c6=qo

=oo-

U<:ooz

a

Explain basics of a RISC instruction set.

Show with diagram, how datahazard stalls are minimized by f.orwarding method.

:"l::1H:;ffI[,ffi #;:i.ffi T,l.;,",::;.'#"'With finite state processor, explain2-bit prediction scheme.Explain hardware-based speculation with steps involved in instruction execution.

computer be if all instruction were cache hits?b. Explain following cache optimizations:

i) Higher associativity to reduce miss rateii) Read misses over writes to reduce miss penalty.

c. Explain techniques for fast address translation.

4 a. What are the three major uo*r of multiple issue processor? Summarize the basicapproaches to multiple issue and their distinguishing characteristics. (08 Marks)

b. Explain branch target buffer with neat diagrams. (06 Marks)c. What are the issues involved in implementation of speculation? Explain register renaming

' (06 Marks)aPProach' PART * q

5 a. Explain taxonomy of parallel,architecture according to Flynn. (06 Marks)b. To achieve a speedup of 80 with 100 processors, what fraction of the original computation

can be sequential?c. Explain the basic of directory based cache coherence protocol.

6 a. Assume a computer where the clocks per instruction is 1.0 when.all memory accesses hit inthe cache. Only data accesses are loads and stores, and these talal 50o/o of the instructions.If the miss penalty is 25 clock cycles and the miss rate is2o/o, how much faster would the

'' ,,1,, .(0g Marks)(06 Marks)

7 a. Explain "compiler optimizations to reduce miss rate" in advanced cache optimizatiorr. *_ ,(08 Marks)b. Explain DRAM memory technology with its basic organization.c. Write a note on protection via virtual machines.

8a. Explain loop level dependencies by considering following "o0., f;for (i: 1; i <:100; i: i + i) {

Alil:A[d+B[i];B[i] : cfil + Dlil; ]

!- t 5i ?q ii lirt

b. Explain software pipelining with symbolic loop unrolling. \-,w;A11--'' (09 Marks)c. List and explain five execution unit slots in the 14.-64 architecture with example instructions.

(05 Marks)lk*rr**

i 't,'

{.,'ftoo mu.tsy

USN 06I581

(10 Marks)

,:,,,, (05 Marks)

(06 Marks)

(10 Marks)

Eighth Semester B.E. Degree Examination, Dec.2013 lJan.20l4Software Testing

Time: 3 hrs. Max. Marks:100Note: Answer FIVEfull questions, selecting

atleast Tl4/O questions from euch part.

PART _ A

a. List all the human errors in testing. (95 Marks)

$. Fxplain with a figure, errors, faults and failures in the process of programming and testing.d(J(.)

La.

oC)!

ox

;n-oo I

troo.= ..1

hboYo(Jt:-O

a2

o=

oO

boi

26-o ad

-?o'EaOE

aX

o''oFj

6:eE:9>,Hbo-< orJ

(J=sotr>o

rJ<-,,i c.i

0)

oZ

a

b. Explain the following methods of testing :

i) Walkthroughs ii) Inspections iii) Use of static code analys,is tools. (06 Marks)c. Write a'C'program to search the element in a list Or,.r*r*E binary search method and

represent :

i) All the basic bloClis present in the programii) Flow graph for the above program. .. (08 Marks)

figure, the differenl steps involved in the generation of tests using thecategory partition method. (10 Marks)

b. Anapplicationtakestwo inputs x and ywheie 3 <x < 7 and5 <y<9i) Partition the input domains using unidimensional and multidimensional partitioning

Explain the different dynamic quality attributes.

Explain with example, the execution history of 'C' program.

ii) Give the geometric representation of equivalence classes.

Write short notes on :

a. Integration testing strategiesb. System testingc. Regression testingd. Test case prioritization and selective execution.

a. Write a procedure for generation a decision table from a cause effect graph. (10 Marks)b. Explain with examples, the predicates and Boolean expressions. (10 Marks)

PART _ B .::::.

Explain the followjng structural testing with the help of "C' program;yffipgnlrol flograph z.r{Y,tst;,q,

I Statement testing lg{ _*,-Jiqb. Branchtesting ,',;{ ce*s";I }L ,c, Path testing \*\ rrwf.ei*' l-: id. Pro€edure call testing.ah-r4 ct

---at'rvAGAniZ6 a. Write a 'C' program to find the GCD of two positive integers and draw tfiE*ffi*-: i) Control flow graph of GCD ii) Data dependence graph of GCD. (10 Marks)b. Write the algorithm for reaching definition. (05 Marks)

,. c. Explain the data flow testing criteria, with suitable example. (05 Marks)

7 a. Explain the test specifications and cases, with suitable example. (10 Marks)b. Explain with a figure, the test harness with a comparison based test oracle. (06 Marks)c. Explain the capture and replay process. (04 Marks)

(20 Marks)

06cs82

System Modeling and Simulation

Tirne: 3 hrs. ax. Marks:100

: .-*: iif!:;!:r:#ifi:i:{iji,"l;!i

USN

la.b.

Eighth Semester B.E. Degree Examination, I)ec. 2O13/Jan.2014

: ".. PART - A

Briefly expiaiU the advantages and disadvantages of simulation.

2 a. A grocery store has one, checkout counter. Custorner arrive at this checkout counter at

random from 1 to 8 minutes apaft and each interval time has the same probability ofoccurrences. The service time vary from 1 to 6 rninutes with probabilities as given below :

3a.b.

6)oog

(.)

o!

bo-

6e

oo ll

Eoa.=N

g#OE:-o

=P

o2

a:

oO

cotrcBd'o>e

'(, c6

-?ooi=

:eo!e(-) .f

<ootEc.-!oo.i>*bo-trbOo=*oF>o

\J<.J4 an

o

z

o

what is simulatl-o$? Explain with flow-chart, the steps involved in simulation r,"ol;o Marks)

Service time 1 2aJ 4 5 6

Probabilitv 0:10 '0.20 0.30 0.25 0.10 0.05

Simulate the arrival of 10 customer and calculate.:i) Average waiting time for a customerii) Probability that a customer has to waitiii) Probability of a servef being idleiv) Average service tirnev) Average time between arrivals.

RD's for 9t3 727 015 948 309 922' .,.153 235 302RDis,for service time : 84 l0 74 53 l7 79 91 67 89 38

Assume that first customer arrives at time 0, Depict the simulation in tabr.llar form.

(10 Marks)

(06 Marks)(06 Marks)

b.., Eiplain event scheduling algorithm by generatingclock : t1.

(14 Marks)system snapshots at clock : t and

(06 Marks)

What is list processing? Explain the basic operations of list processing. (08 Marks)

What is poison process? List out the assumptions which are needed to fulfill the countingprocess, {N(t), t > 0}, is said to be Poisson process with mean rate }..

c. With example explain the properties of Poisson process.

4 a. Explain the characteristics of a queuing system. List different queuing notations. (12 Marks)

b. Explain the various steady state parameters of M/G/l queue. (08 Marks)

-*tthL

'3*"*"*

06cs82

PART _ B

Use linear congruential method to generate a sequence of 5 random members, with xsl : 27;c: 43, a: l'7, m: 100. (04 Marks)

Use the K - S table with cr : 0.05 for the following set of random members. Determine if thehypothesis that the number are uniformly distributed in the interval (0, 1). Randorn'mer'nbers

5a.

b.

6a.

b.

arc : 0.54, .73,0.98,.0.11, 0.68. (08 Marks)c. , Test whether the2"d,9th, 16th, etc /so on numbers in the following sequ€nce are auto

correlated by taking cx :0.05.

0.38 0.48 0.36 0.01 0.54 0.34 0.96 0.06 0.61 0.850.48 0.86 0.t4 0.86 0.89 0.37 0.49 0.60 0.04 0.83

0.42 0.83 0.37 0.21 0.90 0.89 0.91 0.7.9, ","'0.71 0.990,95 0.27 0.41 0.81 0.96 0.31 0.09 0.06 0.23 0.770.73. 0,47 0.1 3 0.55 0.1 1 0.75 0.36i 0.2s 0.23 0.720.60 0.84 0.70 0.30 0.26 0.38 0.05 0.19 0.73 0.44

Explain acceptance - rejection :techniquO :,,for Poisson distribution. Generate 5 Poissonvariates with mean a : 0.25. Random numbers are : 0.073, 0.693, 0.945, 0.739,0.014,0.342. (10 Marks)Test whether the following data folows Poisson distribution using the chi-square test ofgoodness of fit. With mean cx :0.05 l

,', ", (loMarks)

t ,,, .'

7 a. The following data are available on the processing time at a m/e (in minutes). Develop aninput model for the processing time : 0.64, 0.59, 1.1, 3.3, 0.54, 0.04,,0A5, 0.25, 4.4,2.7,2.4,1.1, 3..5,'0.61, 0.20, 1.0, 0.27, 1.7, 0.04, 0.3 4. (08 Marks)

b. Explain types of simulations with respect to output anlaysis. Briefly explarin the confidence -inteival estimation method. (12 Marks)

8 a. Explain the components of verification and validation process. Explain with neat diagram,model building, verification and validation process. (12 Marks)

b. With neat diagram, explain the iterative process of calibrating a model. (08 Marks)

{< {. {< {< {<

Arrivals/ period ',0 I 2 J 4 5 6 7 8 9 10 11

Frequencv t2 l0 t9 17 10 8, 7 5 5 J aJ I

(10

2 of2

USN

-',,,,'t*"' 3 hrs'

-,,'ii'

"' .ttl;,',,,''

::"1 a';"

b.

c.

3a.

8a.b.

c.

O6CSiIS834

(10 Marks)

(10 Marks)(03 Marks)

Eighth Semester B.E. Degree Examination, Dec.20L3 lJan-2014Network Management Systems

Note: Answer FIVEfull questions, selectingat leust TWO questions from each part.

b.

c.

4a.b.

5a.b.

c.

6a.

,;b,'-i'' ''""1""

""t'

,,::" r.-.'r1" i

'','.';'. 7 a.

b.c.

()ooLa

(.)

dI39bo-

53e-.ooo ll

trco.:N(!+

Yo)otrFO

o>8sa=

o{J

o!o0tr(!(n-oa66r

r3d

-?o6rY

a.Ao'!oio=

AE!(J

5.Y>':co0o=o. ;iXoo-u<,:oo'7

foa

. BI,.J' F,xplain the telephone network model with neat diagram.

groupfirgs.

:, ' ,,.. ';'r

c. Explain TLV encodin$ slructure with values of class bits.

LisJ,fte challenges faced by network managers for managing the network.; - , (05 Marks)

What"is'network management? With neat diagram, explain network nranagement functional

2 a. List and briefly explain the salient features of different network rr,ranagement models.(07 Marks)

b. With a block diagraut, explain ASN.1 data type structure and tags. Give example for each.

,,', " ",

From a remote managed LAN with 1 router an{,2 hubs, illustrate the system information andaddress informalion acquired by a NMS. (04 Marks)

With diagram explain two-tier, three-ligr *nd'proxy server SNMP organizatron model.

'ir' lir ' (06 Marks)With neat diagram explain SNMP,network management architecture. Show the messages

exchanged b/w manager process and agent process. (10 Marks)

Explain the first-thr.. SNVfP,,,,Mib n grorpr. (08 Marks)What is SNMP communiry?,Explain SNMP community profile and access policy. (12 Marks)

PART _ BWhat is remote molitoring? With a figure explain use of RMON probe. (05 Marks)List and explainrRMoNl MIB groups and their functions With tablres used by.u.n,roffi.u,

What a1e ,fu different possible locations to place an ATM RMON probe? Explain withdiagram." (06 Marks)

Ex,plbin virtual path-virtual circuit concept on an ATM network with an"exalnple routing"table. ' .. .(07 Marks). With a diagram explain briefly ATM management interface reference architecture.(07 Marks)Explain M1 and M2 interface in detail. (06 Marks;

Briefly explain HFC network technology with diagram. 1oz MarfslExplain ADSL system reference model for management with diagram. (08 Marks)Illustrate ADSL MODE 1 configuration profile schema with diagram. (05 Marks)

What is event correlation? Explain case-based reasoning in detail with necessary diagrams.(08 Marks)

Write a note on different authentication systems in client-server environment. (07 Marks)Write short notes on :

(i) Privacy enhanced mail (PEM) (ii) Pretty good priva "y

(PGn 6F*&* {< {' {< .

{F{ -*-dqe11

Marks)

USN

la.

b.

2a.

b.

3a.

b.

4a.b.

O6CS/IS841

20l3lJan.2Ol4

Max. Marks:1,00

in wireless Adhoc(10 Marks)(10 Marks)

(06 Marks)(06 Marks)

,,,",.Time:

...:::..:.

Eighth Semester B.E. Degree Examination, Dec.AD-HOG Networks

3 hrs.Note: Answer FIVEfull questions, selecting

atleast TWO questions from each part,

i,..,,,, ,,. PART - A

,, t"'

sues in Adhoc networks to be considered during theirdesign phase.Exptain the major issues in Adhoc networks to be considerer

Bring out the'differences between cellular networks and Adhoc y,i s networks.'1'r ll'',,

t '''" (08 Marks)

Discuss on QoS pafameters" QoS aware routing and QoS frame work in Adhoc networks for

(.)oo

o

C)

()

ox

Jh-o-^tlEc6

.=N

69!oElFO

4E

o()6O

50c

a6

-?o'iaOj5

q6.tra.o."ojOE3o6Li

!oA.=>'atro0o=o. titr>^-oVLo-

U<-,,,,,-()oZ

!o

quality of service provisioning. (08 Marks)Explain in detail, the hidden and exposed terminal problems with suitable diagram, andsolution to over come the same. ' :" (12 Marks)

Explain with packet exchange diagram of UaCRW protocol. usednetworks and its advantages with respect to MACA.

(08 Marks)along with

its pros and cons. lp Marks)

\How does hybrrid iouting protocol differ from other protoCok. Eridisadvantages ofzone based hybrid routing protocol. ,, \--What is the',significance of power aware routing protocols? Explain the [5,pes of power -aware routing metrics used in such protocols. rl' ,r' ..,, (08 Marks)

DiSeiss the issues in designing a transport layer protocol for Adhoc networks. : (10 Marks), Dbscribe the split - TCP with suitable diagram and example. (10 Marks)

Briefly explain the various requirements of a secure routing protocol for Adhoc netW,orks.(08 Marks)

Which are the three infrastructure that lacks in Adhocin key management? Explain.

networks that poses major challenge

c. Discuss on any one secure routing protocol for Adhoc wireless networks.

Discuss any one of the contention based lirotocols with reservation mechanisms.

Explain the use of directional nnas in MAe protocols for Adhoc netDescribe the temporally ordered iouting algoiithm {TORA) for Adffi

, ,, ::,r

,...' ":....:::.

PART _ B

5a.

b.

and

6a.b.

a.

b.

7,:

8 a. Discuss on some of the design choices for providing QoS support in Adhoc networks.(08 Marks)

b. Explain the cluster - TDMA protocol used for providing MAC layer QoS solution in Adhocnetworks. (06 Marks)

c. Describe briefly the Ticket based QoS routing protocol used in Adhoc wireless network.(06 Marks)