12
IISN 2 +52+6 O6MAT41 (06 Msrks) in the region (07 Marks) CS Fourth Semester B,E. Degree Examination, Junelldy 20ll Engineering Mathematics - lV ? E g ?:e E: 5d =.9 i-E ;9 ;6 59 q= +u li oa z E c. Using Cauchy's Residuc theorem .rutuut [=43=. dZ, where 'C' is circle with | (z+r)'(z 2l lz)=3. Using Frobenius series solution method, solr. .Q * r., = 6 . (06 Marks) - dx' Reduce rhc differentiat "o*1ion "'4 +*d). , (k't'-rr'l v-0 into Bcssel's lbrm and ' dx' dx wite the complete solutions for n is not integral or zero. (07 Marks) Express the polynomialzx3 - x2 - 3x + 2 tr.terns of Legendre's polynomial' (07 Marks) Time: 3 hrs. b. Obtain the power senes whioh rcpresents the 2< lzl<3. b. a. 2a. b. plane respectively. Also fmd irvariant points. 3 a. Lvaluate I t" - dZ. uherc C isacircle l (Z+ l)(Z + 2) Max. Marks:100 Notet Ansaer FIYE full qaeslions, seleclihg a east TWO questiorrs edch from Part - A and Pdrt - B. PART - A (07 Mark) (06 Marks) Urder the traDsformation W = ez , prove that fanily of lines paxallel to y - axis inZ - plane ha.nsfoxms into family of concentric circles in W - plane. (07 Maiks) 1,i,-1,inw- (07 Marks) c. Find Bilinear transformation, that transforrns Z = -1, i Using Taylor's series method, find y at x = 0.1 and x = 0.2 coosidering upto 46 degree tems. Gven that 9 = *'v -t and y(O): 1. (06 Marks) dx Solve !I = L ! with y(0) = l, find y at )<:0.2 using Rurge - Kutta method of4ft order dx vj +xr taking step - length h = 0.2 accurate uplo 46 decimal place. c. Given rhat !l= x'(1+y: andy(l):1;y(l.1)=1.233 ; y(l.2):1.54s : y(1.3)= 1.979, 'dx firrri y at x: 1.4 using Adams - BasMorth predictor and corleclor formula. (07 Mark) FindAnalyicfirnctionwhoserealpafl isu=I-l - - x . x'+v' (07 Marlrs) 4a. b. c. ,KY.- <7 vl9 /,y, CE}IARAL LreRAnv 1of2

Computer Science and Information Science 3rd semester (2011-July) Question Papers

Embed Size (px)

DESCRIPTION

 

Citation preview

Page 1: Computer Science and Information Science 3rd semester (2011-July) Question Papers

IISN

2 +52+6

O6MAT41

(06 Msrks)

in the region

(07 Marks)

CSFourth Semester B,E. Degree Examination, Junelldy 20ll

Engineering Mathematics - lV

?E

g

?:eE:

5d

=.9i-E

;9

;6

59

q=+uli

oa

z

E

c. Using Cauchy's Residuc theorem .rutuut [=43=. dZ, where 'C' is circle with| (z+r)'(z 2l

lz)=3.

Using Frobenius series solution method, solr. .Q * r., = 6 . (06 Marks)- dx'

Reduce rhc differentiat "o*1ion "'4 +*d). , (k't'-rr'l v-0 into Bcssel's lbrm and' dx' dx

wite the complete solutions for n is not integral or zero. (07 Marks)Express the polynomialzx3 - x2 - 3x + 2 tr.terns of Legendre's polynomial' (07 Marks)

Time: 3 hrs.

b. Obtain the power senes whioh rcpresents the

2< lzl<3.

b.

a.

2a.b.

plane respectively. Also fmd irvariant points.

3 a. Lvaluate I t" - dZ. uherc C isacircle

l (Z+ l)(Z + 2)

Max. Marks:100

Notet Ansaer FIYE full qaeslions, seleclihg a east TWOquestiorrs edch from Part - A and Pdrt - B.

PART - A

(07 Mark)

(06 Marks)

Urder the traDsformation W = ez , prove that fanily of lines paxallel to y - axis inZ - planeha.nsfoxms into family of concentric circles in W - plane. (07 Maiks)

1,i,-1,inw-(07 Marks)

c. Find Bilinear transformation, that transforrns Z = -1, i

Using Taylor's series method, find y at x = 0.1 and x = 0.2 coosidering upto 46 degree

tems. Gven that 9 = *'v -t and y(O): 1. (06 Marks)dx

Solve !I = L ! with y(0) = l, find y at )<:0.2 using Rurge - Kutta method of4ft orderdx vj +xr

taking step - length h = 0.2 accurate uplo 46 decimal place.

c. Given rhat !l= x'(1+y: andy(l):1;y(l.1)=1.233 ; y(l.2):1.54s : y(1.3)= 1.979,'dx

firrri y at x: 1.4 using Adams - BasMorth predictor and corleclor formula. (07 Mark)

FindAnalyicfirnctionwhoserealpafl isu=I-l - - x .x'+v'

(07 Marlrs)

4a.

b.

c.

,KY.-<7

vl9

/,y,

CE}IARALLreRAnv

1of2

Page 2: Computer Science and Information Science 3rd semester (2011-July) Question Papers

O6MAT41

PART - BFit the best possible curve ofthe form y: a + bx, using method of Least square for the data:

(06 Marks)X: I 3 4 6 8 9 ll 14

Yt I 2 4 4 5 1 I 9b. The lines of regressions are x * 2y = 5 and 2x + 3y:8. Find i) means of the variables x

and y ii) conelation coefEcient between x and y. (07 Marks)

Thrce t,?ists A, B, C g?ed 50%, 30o/" and 20% of pages of a book. The percentage ofdefectively gped pages by them is 3, 4, 5 respectively. Ifa page is selected from the book at

mndom, what is the probability that it is defectively q?ed and it is twed by 'A'? (07 Marks)

The random variable X has the following probability mass function

x: 0 1 2 3 4 5

P(X): K 3K sK 7K 9K 1lKi) find K ii) find P(X < 3) iii) find P(3 < X ! 5). (06 MErks)

b, Alpha - particles are emitted by a mdio active source at an average of 5 emissioos in 20

minutes. What is the probability that therc will be i) exactly two emissions ii) at least twoemissions in 20 minutes? (07 Ma*s)A sample of 100 dry battery cells tested to find the length of life produced by a companyand following results arc recorded : mgan life = 12 hou$, standard deviation = 3 hours.

Assuming data to be normally distributed, frnd the expected life of a dry cell :

i) have more than 15 hours ii) between l0 and 14 hou$. (07 Marks)

Exalain the following terms : i) Nult hypothesissignificance.

ii) Standard error iii) Test of(06 Marks)

b. Find the range of number of heads out of 64 tosses of a coin which will enswe faimess ofcoin at 57o level of significance using binomial distribution. (07 Marks)

c. A suvey conducted on 64 families with 3 children each and recorded as follows :

No. of Male children : 0 I 2 3

No. of families 6 t9 29 10

Apply Chi - Square test io test whether male and female children are equiprobable at 5%level ofsignificance. (07 Mrrks)

a. The Joinl probability dishibution oftwo Random variable X and Y are given as :

i) find Marginal distribution ofx and Y iD find COV(X,Y).b. Find the unique fixed probability vector of the regular stochastic matrix.

A_[o , oll0 0 rl

ly v,,l

(06 Mark)

(07 Mark)

A player's luck follows a pattem. Ifhe wins a game the probability of winning next game is0,6. However ifhe loses the game the probability oflosing the next game is 0.7, There is aneven chance of winning the first gu-i. If "o i) what is the Fobability of winning 2'dgame ii) What is the Fobability of winning 3'd game? (07 Marks)

x I 3 9

2 1,//s 1//24

1//12

4 t/./a

1,//a

0

6 t//a

t//2a

t//t)

Page 3: Computer Science and Information Science 3rd semester (2011-July) Question Papers

USN

Time: 3 hrc-

MATDIP4Ol

b.c.

E

EY

E'!

=.9

5i3

,;6

aEi9

z

E

Noter Arrswer an), FIYE fu qaeslions.

t a. Find dle angle between any two diagonals ofa cube. (06 Mrrks)b. Show that the angle betweer the lines whose direction mtios arcZ1, 1and 4, "J,-I,

- ,,I: - t is oo.. ro7 Marls)c. Find the value ofK such that the set offour points (0, -1, -l) C4,4 4)(k,5, 1)ard(3,9,4)axe co-planat. (07 Mark)

2 a. Derive the equation ofthe plane in the intercelt fomr 1+f,+!=t_b. Find rhe equation of the plane which passes thrcugh the point (3, -3. l) aod is perpendicular

to the plarcs 7x + y + 2z= 6 aod3x+ 5y - 6z= B, (07 Mrrk)c. Show thal the lhes. I13=E! -z-i ^-, xrl v+l z+l

2 3 = I -O + =?=, are coplanar and

herce fird the equation of the plane in which they lie. (07 Marks)

3 a. Find a unit vector perpendicular to both tie vectors f ard

b. If e,6,d are any three vectors, prove that :

i) [n+6,6+d,e+6):27,b,clii) [6x d,i x e, e x 6] = [e,6,d], (07 Marks)

and i=j+2,i are

(07 Mark)

c. Find Lhe value of). so rhat the vectors d=2i-3jcoplanar.

Fourth Semester B.E. Degree Examination, Junc/July 201IAdvanced Mathematics - ll

A,fax. Marks:100

(06 Mrrk)

B=i-j+2k.(06 Mark)

4 a" A particle moves along acurvex =13 . 41,y=t2 + 4t,z= gt -3f where t is the timevadable. Determine its velocity and acgeleration vecto$ and also tJE rnagnitudes of velocityand acceleration at t = 2.

b. rina the angle betweJhe surfaces x2 + f +*=9,odx=;+f-r"*r","rtlj,Tilfic. Find the directional deriative of 0 : *l * yz3 at e, -t,l) i" s" dir*d"" tlT.:I"),i+zj+2i.

({,7 Marks)

5 u. Find th" diu".gerrce and cul ofthe vector F=(3xry-zI+(xz, + yn)-{zx.rr)i.

tf i=xi+yj+a[ show that i) V.i=3 ; ii) Vxi=0.Find the consta[ts a, b, c, such that the vector fieldi=1x+y+az)i+(bx +2y -)j+(x+cy +22)[ is irotationat.

(06 Marks)

(07 Marks)

(07 Marks)

iO:?

$

I of2

Page 4: Computer Science and Information Science 3rd semester (2011-July) Question Papers

r$..

Find :

a L (4 sinh5r - 5 cos4r)b. L (cos at cos br)c. L (e'' cos1;d. L (re't sint)

Find :

,-,[ I 3 sl" " L.*3*2";-lr-" I

b r,l- ru-li(s - 2)1s -3) |

c. r'l . --!- |Ls. +6s+l3l

" "f,"-(-i)]

MATDIP4Ol

(05 Mrrks)(0s Marks)(05 Merks)(05 Msrks)

(05 Marks)

(05 MarlG)

(o5 M&rks)

(05 Ma*s)

under the conditiom

(10 Marks)

x:1, y=0att=0.

(t0 MartG)

8 a. Using Laplace transform method solve,

y(0) - l. y10) = 0.

b. Solve by ushg Laplace transformsdx- +y=sint

qt

dzy 3dv-- + r+2y =0

dv, -i+x=cost -

dt

I

I

2 of 2

Page 5: Computer Science and Information Science 3rd semester (2011-July) Question Papers

+

06cs42USN

Time: 3 hrs.

Fourth Semester B.E, Degree Examination, Jun elJuly 21llGraph Theory and Combinatorics

Noter Answer FrvE full questions selectit g Max' Marks:100

dl least TWO qaestionslfrom edch part

PART - A6e

'E

I

89

;,

99

:ii

:P

\d

z

1a.b.

c.

Deline complete bipartite graph. How many vertices and how maI1y edges are there Ka,7 andKr,r r? (0s Markr)lfa graph.,ith_n vertices and m edges is k-regular, show that m = Icd2. D"". th;;; ;;ir;cubic gaph with i 5 vefiices.Verig."*ut ttr"t*o gr"iir, .fro*, f"f o* i" f ig.e I (c)(i) and Fig.elt"tti+_qeso*J[#"*)

Fie.Ql(cXii)d.

2a.b.

d.

3a,b.

If G is a simple graph with no cycles, prove Oat C ias- utteuj orr" p€ndant vertex.(05 Mrrks)(05 Mark)

c,

Pmve that Pst€lseq gaph is ao!-plana!"

I-y^"_jlit i d"o"*i^ et** oiiit ** ,, *rtices and m edges h". "*"dy

f1'If,f;g:Tj..-l:.v *: "f

its diagrams. (00 i4rrk)Jnow lhat every srmple connected plaoar graph G with less than 12 vertices must have avertex of degree < 4.f.or" ft ut

"i".y "o*"cted simple planar graph G is 6 colourable. [::#::B

4a.b.

c.

Prove that a tree with n ve4ices has n - I edges. (07 Mrrks)

9^Tl"^:-1.-q code for the message ,ROI,D rS cOOD,, using lebelled btr.;";;;;;heqce encode the message. (07ltrrk)l"*!ij":ly-* o.e of a graph. Find alt rhe spanning trees of rhe fotlowing erd;t;in Fig.Q3(c).

(06 Mrrks)

C

Fig.QaG)

4 Fig.Q3(c)

64"4Define :i) Cul set, ii) Edge connectivity, iii) Ve*ex connectivity. Give one example foreach.

Using Kruskal's algorithm, find a minimal spaming tree fo" th" *"ighJ"d gruph(:lIfrT]Fig.Qa@). --- -'- "e'-* a* ,sz Markr)State and prove max-flow and min-cut theorem. (07 Mark)

Fig.Q1(c)(i)

1of2

Page 6: Computer Science and Information Science 3rd semester (2011-July) Question Papers

06cs42

54.

b.

6a.

b.

8a.b.

c.

PART - Bh how many ways one can distribute teo identical utdte marbles amongcontainers?Pmve the following identities :

i) C(n +1. r)= C(n,r-l)+C(tr,r)ii) qm+n.2)-C(m.2) - C(n.2) = mn.Determine the coefficient of:i) xyl in rhe expa.nsion of12x - y - z){ii) a2b3c2d5 in fte expansion of (a+2b-3c -2d+5)t6

six distioct(06 Msrks)

(07 Msrks)

(07 Marks)

There are 30 students in a hostel, In that 15 study history, 8 study economics, and 6 studygeography. lt is known that 3 studetrts study all thes€ subjects Show thaf 7 or more studentsstudy nofle ofthese subjects. {M Mrrks)h how mauy ttys can one arrangp the lettels in CORRESPONDENTS so tbat:i) There is no pair ofconsecutive identical letters.ii) There are exactly two pai$ ofconsecutive identical letters.iii) There are atloast three pairs of consecutiv€ identical letters? (0t Marks)Define demngemetrt. In how many ways we can arange the Dumberu l, 2, 3, ...,10 so that1 is aot in the I't place, 2 is not in the 2nd place and so on, and t0 is not in the 106 place?

(06 Marls)

7 a. Deiermifie the gererating firnction for the numeric firnction :( -, .^ ,lz u rtseYe:1

' !-l' ifr is odd

b.

c.

Find the coeficient of xtr in the following ploducts :

(x+x3 +x5 +x7 +xe)(x3 +2xa +3x5 +.....)3In how many ways can we dishibute 24 pencils to 4 childrcn so that each3 pencils but nol more tha! eight?

(B{ Mlrks)

(07 Mrks)child gets at least

(07 Marks)

Solve the rpcunence relation, F"., = F"-r +F,, given F0 = 0 and Fl = l andn>0, (06 Markr)

Find the generating function for the relation a, +an-, -6a-, =0 for Il > 2, with a0 = -l andal = 8. (07 Mrrk)Find the general solution of s(k) + 3sft - 1) - 4s(k - 2) = 4k . (07 Marks)

2 of2

Page 7: Computer Science and Information Science 3rd semester (2011-July) Question Papers

USN

Time: 3 hrs.

06cs43

b.

s

I.g

EB,,

t"

td

3, ::a&

gz

la.b.c.

c.

3a.b.

4 a..

Note: Answer any FIVE full questions,selectihg at leost TWO questions foru each part

PART-A

Explain aotion of algorithm. Wdte Euctid's algorithm for computing gcd (m,n). (07 Marks)Wdte and explain the steps ofalgodthm Foblem solving using flowchart. (07 Mrrkr)Define weighted graph. Give example alld write its adjaceloy matrix. (06 Mrrks)

Explail the orders ofgro*th and basic efiicieacies classes ofalgodthms. (06 Mark!)Wdte and flnd the worst - case, best - case and avemge case efficiency of sequenlial -search algorithm, (06 Marks)Explai[ the mathematical analysis ofFibonacci sequence rccursive algorithms. (0E Marks)

Explain brutc -.force algorithm design, st ategy. Design atalyze bubble - sort aigodthm,with exampie. (08 Mark)Explain the divide and conquer technique. Design aod amllze quick sort algorithm, withexample. G2 Marks)

F eurtL Semester B.E, Degree Examination, June[uly 2011Anatysis and Design of Algorithms

Max. Marks:l00

DeflrE tlee trave$al operations and traverse the followingi) in preorderii) in-ioorderiii,; in postorder. , (06 Mar!6)

b. Explain the srressen's matuix mutriplicati*:.t%(:)-r-0t".c. Write ard explaio DFS and BFS algorithm, with example.

a. Explain the transform and conquer;1*fie8. Design and analyze heap sort algorithm, withexample. (rz Marks)b ryllin the sorting by counting. Write algorithm comparison cowrting sort. Sort tlie list{62,31,84,96,19,17}. (osMark)

(06 Marks)(08 Marks)

binary treg

"#%q!l -"gsni+ i*;ir\ 1ts" lli

.i;

I of2

Page 8: Computer Science and Information Science 3rd semester (2011-July) Question Papers

06cs43

6a.b.

c,

Exptaia hashing and hashing techniques. (06 Mrrls)Write and €xplah Floyd's algorithm for the all _ pais shoffest * paths ploblem, withexample.

Apply the <lyna.r:rie programming following instance of the knapsa-ck p*tt., uoa ll'#'k)Item Weieht Valve

I 2 $122 I $ 103 3. $204 2 s l5

Capacity W = 5

(05 Msrks)

7 &. Write ard exptail prim,s algorithm and apply prim,s algorithm fc the fouowiag graph.

l. rrt. Vrta, @7 Msrk!)

" Write and explain Dijkstra's algorithms and apply the algorithm for the following graph.

c.

8a.b:c.

(07 Msrl$)

(06 Marks)

Explail P aud_NP problems, with examples.

::li3 if ::!::1 - rum problem,.with exampie using bsakhackins merhod. [3I ilflf]Expraln rhe travelmg salesmaD problem with exemple usiW branch-* bound method.,07 Mrrks)

*l+*t

Define decision tree. Write decision trce for find.ing minimum of3 _ trumbem.

Fig. Q7(a)

ris. Q7O)

2.of2

Page 9: Computer Science and Information Science 3rd semester (2011-July) Question Papers

USN06cs36

Max. Marks:100

(06 Msrk)

in Unix

Third Semester B'E. Degree Examination' JuleiJuly 2011

UNIX and Shell Programming

Ib.c.

e

E

-s- 3

:d

65tsq

asbE

i:

1g

be6d

-t

oa

I

e

Time: 3 hrs.

Notei Answer uny FIW lull qaestions'

1 a. With neat diagram, explain the architectue ofUnix Operating System (06 Mark)

b. With the help of a diagram, "il'fa"-ii" p*"t-"niia rehtionship Explain the Unix file

srstem. (06 M'rk)

c. Explain the following with examples :' i '[U*fr"

*a n"f u",i'" put'flnui"' ii) Inkmal ad Extemal commands' (08 Msrks)

2 a. Give the significance of seven attributes ofthe ts - 0 commaud . (07 Mark)' i. ilrt t mi-p"t lt"i.*r g*pfuii-tto* io change basic hle perrni*'on ** * "*%f';;.*,

c. Explain the rlifferent modes in which a \ri editor works'

Explaio the thee standad fi1es with respect to Unix operating

Exolain tbe mechanism of prccess creatlon

E*lta, *," fotto*iog commaods with an example :

ir Runnine iobs in Background g! and nohup)

ii) Execute later @! and bgED.

7,.

4 a. What ar€ Envirorunent vadabl€s? Explain different environment(06 Mrrks)(05 Msrk)(08 Merk)

Explain "grep" command with all options (08 Mark)

;dffi f*g tild. n"sil* e*p;"ssion) character subset used for constructing regular

exoressions. ^ lo5 tvlsrk!)

f,ii" irt""ri",* "r " sed clrrunand line aud briefly explain each comnoo*t of ffffi,*")

ExDlain the use of test and [ ] to evatua& an exFession in shell (06 Marks)"w,ffii: fu ;;;ffi;giwrite a sn"u proga,, to arcate a metru which displavs the list

"i f,r"t,

",-"tiaai*, p.oce-ss status and current users of the system (08 Mark)

i.pf.fi ifr" tf,af f"i i*s of'lvhile" and 'fo1' with svntax' (06 Mrrks)

What is AWK? Explain any tb,ree buitt in fimctions in AWK (07 Mrrk)

W.i" an eWf t"i*..e to find IIRA, Da and Netpay of-an emPloyee' vhere DA is 50%

ofbasic, HRA is 1i% ofbasio and the netpay is the sum ofHRA, DA *d ou"'" PA;"r.*)

Explain the list and anays in PERL, (06 Msrks)

Exolain strine handlirc flEction in PERL and also write a prognm to firrd the oumber of

;;;;;;;;;" "t

*il as m print the reverse of a given sentence (o8 lvrark)

rirt ri io ,ir" crt X I "ta Split i ) fllnctions do? Explain (06 Marks)

s.pl"it ni" h*dilg i" pERL. , (06 Mark!)

b.c.

oDeratins svstem."linl"i ari,ii. aiff.t"""es between Softlir* and Hardlink? Gve examples'

Write short notes on Find and Sort coumands

5a.b.

c.

6a.b.

c.

1a.b.

c.

8a.

b.c_

Page 10: Computer Science and Information Science 3rd semester (2011-July) Question Papers

USN

Time: 3 hrs.

06cs4s

Max. Marks:1OO

(10 Msrks)

{06 Mr*s)

(0{ Msrks)

(10 \tarks)word formats. Wrire the control words to

oulput, port C upper as inpur and irod C bit 3

{10 Marks)

Fourth Semester B.E. Degree Examitration, Jun elJn y ZOllMicroprocesaors

q

E

242

..,"]

!b,i

.A

:a'

{.9f,r

td

zaaE

Nolet Answet qry FIYE lull questlonsseleciing s eosl two frorn each pdrl.

PART-AI a. Briefly disruss the tlT,es ofmicroprocessors. (06 Marks)b. Explain with neat diagram the itrtemal architectwe of g0g6 microprocessor. Clearly state the

flnctions of the follov/ing :

(10 Marls)(04 Mark)

a, Wite ard_ explain template for 8086 MOV instruction. 4160 generate the opcode for thefollowing instluctions.

. L M9.V.AI. Bx ii)MovAxlBxl. {0s Mrrks)b. Explair briefly Ediror. Assembler and debugger.

c. Plln:_try-!{tctioll of following assembler directives with example. (06 Marks)i) SEGMENT AND ENDS ii) DT ii) GLOBAT iv) INCLUDE v) pTR.

1or uarrsya. Discuss the differetrt types of 8086 unconditional jump inshuctions with an example for

eaPh tYPe. (oE Marks)h Yrit:.m ALP to sod a giveo ser of N numbers in ascending ord€I using futUt. ,ortalgaithm. (116 srk)c. W'rit-1 adelay procedue for pn:ducing a delay of I msec. for gCg6 microprocessor workingr* M& r h!)

r) E,U. ii) B. I. U iii) Segment registels.c. Explain immediate and direct addressing modes with suitable examples.

Write a Fracedue to coavert & packed BCD eumber 10 its bimry eqidlralent. Use method ofpassing paEmeters in registers. (0s Marks)

Ptrf:r.""1{:}"yTlmacros and procedures. ._. -a_-.,..;.rr i;;;;iExplain REPE CMPSB instructior with ar exaEple. r11 :l: lr:'.rir\. (06 Marks)

4a.b.c.

b.

6a.b.

c.

7a.b.

8a.

PART - BExplain the following iNtruction.s with aB €xarnpie for1) AAM ii) LOOP iii) CWD iv) IRnt v)Wrile an ALP ro generate fust .N Fibonacci numbers-Write the corect format (syntax) for th€ following instructionsi) ouT AL, 86H ii) pusH DL iiD Mov AL, F3H iv) ROL AL, 04H.

Explain minimum mode conligulatioo of8086 with a neat dia$am. (08 Mark)Explain with a neat diagram the bus activities during a memo{ read machine cycle,

B ng oul the differcrces berween 8086 and 8088 miaroprccessors. [::UilBWith any,two exarnples explain hardware in&rrupt applications, (r0 Mark)Explair the workirg of 8259 with its htenal bloik &a$&m ard all the ICWs. (r0 Marks)Erplaiu the di$ercll opemtional modes of8255 along with its ifltcmal block diagram.

b. Exptain the different tlT,es of 8255 conLrclinirialbe 8255 as follows :

Port B as mode ' I ' input, port A as mode , 0'as output.

Page 11: Computer Science and Information Science 3rd semester (2011-July) Question Papers

USN

Time: 3 hrs.

06cs46

Max. Marks:100

(r0 Mark)

Fourth Semester B,E. Degree Examination, Jun etJ y 2$llGomputer Organization

e

f9

Ed

SE

€E

d. g.

4!::

z

aE

1a.

b.

2 a. Deline an addressing mode. Explain the following addressing modes with example : indfuectindexed, relative, and auto incrcment. (05 Mrrk)

b. Registers R1 and R2 of a computer codain the decimal values 1400 a-qd 5000. What is the

c.

d. What arc condition code flags? Explain the four commonly used flags. (0s Mlrkr)

effective address of the meznory operand in each of the fo instiuctions? Assumg thalthe computer has 32 bir word lengr!.i) Load 20@i), R5ii) Move # 3000, R5iii) Store 30(R1, R2), R5iv) Add (R2)+, Rsv) Subtract-(Rl),R5.

c. Explain the operation ofstack, with an example.and queues.

Notei Answet an! FIYE full questions selectirrgalleast TWO questions fiom each p.trt.

PART_A

Write th€ basic performaace equation. Explain the roie oflhe parameteis ofl the perfonnanceo[lhe compuler. (0s Msrb)Mentiorr four rypes of operations required to be pedormed by instruction in a computer.Wlat are the basic types ofinstuction formats? Give an example for each. (06 Marks)Wlat is shaight line sequencing? Explain with an example. (04 Marks)

(0s Marks)between stacks

(10Marks)

Define memory mapped inpuroutput and inpuroutput mapped input/output, give oneadvantages ofeach. (rr5 Msrk)In a situalion where a number ofdevices capable of initiating interupts are connected 10 theprocessor.i) How can the processor recognize the device requesting on inten-upt?ii) How should r"wo or more simullaneous intemrpt requests be handled,l

Explain with a sketch the read operatio[ performed on a peripheral component interconnectbus. Show the role ofIRDY #, and TRDY#. (r0 Mark)W1lat are the design objectives of the USB? (03 Markr)Explain the following with respect to USB.

3a.b.

4a.

b.c.

c. Explain a qllchronous bus. Also give the timing diagram of an input transfer on asynchronous bus. (0s Marks)

i) USB ad&essingii) USB protocols.

I of 2

(07 Marks)

Page 12: Computer Science and Information Science 3rd semester (2011-July) Question Papers

PART - B

Draw the organization ofa 4K x 1 memory cell and explain.

06cs46

(08 Marks)5a.b.

6a.b.

b.

Explain direct mapping and associative mapping betwe€n caahe memory and main memory.

c. Diffarentiate between SRAM and DRAM.

Explain in detail, the working principle of a magnetic hard disk.Draw a block diagram and explain how a virtual addrcss form the poc€ssor is tanslated intophysical address io the main memory. (01 Marks)

c. Dmw a figule to illustrate a l6_bit carry look ahead adder using 4-bi1 addq blocks andexplain its working ginciple. (06 Msrk)

Explain Booth's algodthm, multiply-13 and + l1 using Booth's multiplication. (t0 Marks)Explaiti the iEEE standard for floating point flrmber represeatatiot. (10 M.rk)

8 a. Explain the Focess offetching a word ftom memory with the help ofa timing diagram.(10 Marl$)

b, List the actions needed to ex€cute the instruction Add R1, (R3). Write the sequence ofcontrol steps to perform the actions for a single bus stucture. Explain tlrc steps. (10 Marks)

(10 Marks)(02 Mark)

(10 Mtrks)

2 of 2