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

1. USN
4 .': a.
'b.
c.
o()
oGI
O.
cn
c^
d
C)
(B
I
3eao-
(d r-,
E!
oo ll
coo
.= c(c$
HAO
tso
otr
-catj t5
LiL
o=
*,a
-'EaC3
A-
UU
($O
o!b0tr(EGI
vo
}HGt Ft
EC(I
5r
8s
d. 8.
tro.
()j
ar=
t()rn',E
EE$< o)
3=>(+
boo
trb0
o=
E$E di)
U:
o<
-: c.i
c.)
o
z
(n
t<
o
O.
a.
b.
C.
Fourth Semester B.E. Degree Examination, Jl
Engineering Mathematics
Time: 3 hrs. Max. Marks:100
Note: Answer any FIVE full questions, selecting atleast TWO questionsfrom eachpart.
PART. A 'J.iI ''Ii.
a. Obtain y(0.2) using Picards method upto second iteration forthe initial value problem
+= x'-2y Y(o) = 1.
dx
b. SolvebyEulersmodifiedmethodtoobtairy(I.2)given y'- y+," ylo)=2. (07Marks)
;-""* t * X
c. Using Adam Bash forth method obtain y at x = 0.8 given+,r"' 'I (07 Marks)
dy ) .^.
]:x-yz , y(0)=0 , y(0.2)=0.02 , y(0.4)+uiliozgsano y(0.6)=0.1762.
dxJJ"'/
,i''i*,1 t,
a. Solve by 4'n order Runge Kutta method simultaneour equations given by
dx dv
-= y-t - x+t with x = I =,{ &t't = 0, obtain y(0.t) and x(0.1).
dt
J
dt t..-
b. Solve#-^(:l)'*r'=0,yi#l , y'(0)=0.Evaluatey(0.2)correcttofourdecimal
places, using Runge Kutta p,Ehd of fourth order. (07 Marks)
c. Solve for x = 0.4 usingffilnes predictor corrector formula for the differential equation
y" +xy'+y=0withy(0)= l, y(O.t)=0.995 ,, y(0.2) =0.9802andy(0.3)=0.956.Also
z(0)=Q, z(0.1)=-0.0995 , z(0.2)--0.196,2(0.3)=-0.2863. (07Marks)
a. Verify whether f(z) = sin2z is analytic, hence obtain the derivative. (06 Marks)
b. Determine the analytic function f(z) whose imaginary part is ;Y ; (07 Marks)
x-+y-
c. Detino'a harmonic function. Prove that real and imaginary parts of an analytic function are
hiimonic. (07 Marks)
Under the mapping w = e', find the image of i) I <xS2 ii) % .y .
;.
(06Marks)
Find the bilinear transformation which maps the points 1, i, -l from zplaneto2, i, -2 into w
plane. Also find the fixed points. (07 Marks)
State and prove Cauchy's integral formula. (07 Marks)
PART - B
Prove J,(x) =
* [J,-r(x) * Jn+r (x)]:
Prove (n+l) P"(x) - (2n+1) x Pn(x) - n Pn-r(x).
Explain the following in terms of Legendres polynomials.
*o+3x3-^2+5x-2
1,_,r)
(06 Marks)
(06 Marks)
(06 Marks)
(07 Marks)
(07 Marks)

2. c.
1OMAT41
a. A class has 10 boys and 6 girls. Three students are selected at random one after another.
Find the probability that i) first and third are boys , second a girl ii) first and second
are of same sex and third is of opposite sex. (06 Marks)
b. IfP(A) =0.4,P(B/A)=0.9,P(Bl[l=0.6. FindP(A/B),P(A/B). (07Marks)
c. In a bolt factory machines A, B and C manufacture 207o,35o/o and 457o of the total of their
outputs 5Vo, 47o and 2Vo are defective. A bolt is drawn at random found to be defbitive.
What is the probability that it is from machine B? (t)7 Marks)
a. A random variable x has the foll distributi
Find k, mean and S.D of the distribution. (06 Marks)
b. The probability that a bomb dropped hits the target is 0.2. Find the probability that out of 6
bombs dropped i) exactly 2 will hit the target ii) atleast 3 will hit the target.
' ,,, (07 Marks)
Find the mean and variance of the exponential distripution. (07 Marks)
''il:;''
A die is tossed 960 times and 5 appear 184 times:r,fs the die biased? (06 Marks)
Nine items have values 45, 47, 50, 52, 48{fl,r 49, 53,51. Does the mean of these differ
significantly from assumed of mean of 47.5'. ( y = 8 , to.os - 2.31). (07 Marks)
c. A set of 5 similar coins tossed 320 ti ives following tablS TOSSEO JZU TIM€S es loilowlns taDle.
No. of head*..:* -O I 2 3 4 5
Freq. 6 27 72 rt2 11 32
Test the hypothesis that data fO-llows binomial distribution (Given y = 5. Xuus = I 1.07)
(07 Marks)
{.***{.
8a.
b.
ow lon
x: -2 -1 0 1 2 3 4
P(x) : 0.1 0.1 k 0.1 2k k k
2of2

3. Lf $,*e S 7ffi
TDIP4OlUSN
Fourth
Time: 3 hrs.
_.j_.!_1.!V
Semester B.E. Degree Examination, June/July 2015
XVZ
-+:+-abc
a.
b.
oc)
o(t
L
0)
cg
(,)
C)
dsao-
6v
3,
bo"ci OO
.=N
d$
tl 00
Y0)
a)trdc)
o>
8s
ge
toij c)
60
boc('ias
dgr
-E(i-t
ECg
ad
Bga-
i=d
6 cr3
()j
.ri oSr '!-r
9i65aU)tE
|. cl)
3B> (ri
bov
troo
0)=
EE
ET9!
()-
U<
-
c.l
G)
z
$
ti
E
Advanced Mathematics - II
Max. Marks:100
Note: Answer any FIVE full questions.
a. Find the angle between 2 dragonals of a cube. (06 Marks)
b. If A(0 9 6), B(l 2 3) , C(7 - 25) are vertices of a triangle. Find the coordinates of the foot of
the perpendicular drawn from A to BC.
c. Find the equation of the plane in the lntercept form = 1,.
(07 Marks)
(07 Marks)
(07 Marks)
(07 Marks)
(05 Marks)
(15 Marks)
(05 Marks)
(15 Marks)
a. Find the equation of the plane passing through the three points (2,3,4) , (-3, 5, rr,[1,*l;?],
b. Find the equation of the plane through the points (1, 2, -l) and perpendicular to the planes
x + y -22: 5 and 3x- y + 4z:12. (07 Marks)
c. Find the equation of the plane through the points (-1, 2,0) and containing the plane
2x+3y+52-l:0and3x+y-z*2:0. ,, (07Marks)
a. Findtheunitvectorparalleltothesumofthevector A :2i+4j-5kand 6 :i+ 2j+3k.
(06 Marks)
b. Determinel"suchthat A :i+j +fi;"fl :2i_ 4k. d -i+),j + 3karecoplanar.
c. Provethat(dx6; " d :(6.d) 6 -fU.e)a.
Provethat 1lF.GI: F.
dG*dt. G.
dtL
r
dt dt
Find the velocity and acceleration for the curve i
and also find their magnitude.
(06 Marks)
: 11-t3) i + (1+t2) + (2t - 5)k at t -- L
(07 Marks)
(07 Marks)
a.. Find the directional derivative of $ -*'yr* 4xz2 at (1 , -2, -1) along 2i- j_ 2k. (06 Marks)
,.
b.' {f F:(*+y+ 1)i+j-(*+y)k.Find F.curlF. (o7Marks)
;. Show that V.(V * A )
: 0. (07 Marks)
c.,t
*=fr,,id
and
#=
ri,,.6 then show that -g-[d x6 ] :',fr,x(ax6).
a. Find L (t) given that (t):
{; ; ' ;:;^
b. Find i) L[e3'sin5t sin3t] ii) L[t5 cosh3t] iii) L[t' .-"].
a Find t[:.q]
Lt.l
4s+5
b. Find t) t '[ (s-l)r(s+2)
1 nf)

4. MATDIP4Ol
8 a. Using Laplace transform solve :
dzY
+ 4++ 3y - e' ; y(0) : 0 y'(0) : t. (10 Marks)
dt2 dt
-J J",t " J "./ r
b. Solve using Laplace transformation method
y" + 2y' - 3y : sin t, y(0) : y'(0) : 0. (l0,Marrg
2 of 2

5. USN
tft.,;HI rf lrEF! I laAL ?r-'r ll
,'$ uBRAfi,Y i, i'
10cs42
(06 Marks)
I I I it,:."L__4,r'
B.E. Degree Examination,)ffi4?t' fi, zots
e. ili
b.
c.
2a.
"+1r::Ai'"
:ryr,',r.,.-,r. a .D.
ffie
c.
(.)
a
a
=
U)
d
C)
(!
C)
(, .r
0;)x
oo-
EB
EO
s ,,-
bo"
c- ao
.=N
d$
b9p
C)tr
€gtr'troB
Ez
BS
bU
(!o
OE
b0s.tr((l
!x
}Etq3
13(d
its
6E
ic)
HB
oj
aE
C)=
toi, t=
EE
LC)
3=> qH
boo
trb0
o=
=(gH" g)
= c.)
Q-l
tr ,.&.
o&
-i'''r'{.r
()
z
(l
t<
Fourth Semester
Graph Theory and Gombinatorics
Time: 3 hrs'
Ly , , n,td . ,, , .. Max' Marks:tg#:;
Note: Answer any FIVE fall questions, selecting
* f
-
atleast TWo questions from each part
.r,r,l_,:l;l.i-,;
-
PART - A
1 a. For the following graph determine,
i) A walk from b to d that is not a trail
ii) A b-d trail that is not a path
iii) A path from b to d
iv) A closed walk from b to b that is not a circuit
v) A circuit from b to b that is not a cycle
vi) A cycle from b to b.
,,,**fuffiig.Q1(a)
Define subgraph, spanning subgnaj$*rinduced subgraph and complete graph with example.
.-
t'u,t, (07 Marks)
Prove that the undirected grap$.-G : (V, E) has an Euler circuit if and only if G is connected
and every vertex in G hasffi degree. (07 Marks)
.,,i".-
Define planar grap#,-#d prove that the following Petersen graph is nonplanar using
Kuratowski's ttg"q5tr. n (06 Marks)
.f; '.rL q-
;-
Prove that in a complete graph with n-vertices, where n is an odd number ) 3, there are
(n -l )12 edge - disjoint Hamiltonian cycles. (07 Marks)
Find the chromatic polynomial for the following graph. (07 Marks)
Fig.2Q(c)
1 2
Fig.Q2(a)

6. 10cs42
3 a. Prove that in every tree T - (V, E) lvl : lEl + 1. (06 Marks)
b. i) If Tr: (Vr, E1) and Tz: (Vz, Ez) be two trees where lErl: 17 and IVzl
: 2lYrl, then find
lVr l, lV2l and lE2l $n:;..,.,
ii) Let Fz : (Yz,Ez) is a forest with lVzl
: 62 and lEzl
: 5I, how many trees determine Fffi-,.i
iii) Let Fr : (Vr, Er) be a forest of 7 trees where lErl
: 40 what is lVll? (opnd )
Construct an optimal prefix code for the symbols &, o, e, u, y, z that occur with fi$qiiehciesc.
4a.
20, 28, 4, 17 , L2, 7 respectively.
Using the Kruskal's algorithm, find a minimal spanning tree of the
graphs. .dr*
,dr'
t irlvnii
'it:L ,#'
'ii ti;:r, a+P
Fi$:'q4ta)
Using ttre Dijkstra's algorithm obtain the sliidrtest path from vertex
vertices in the following graph.
L
{'* (07 Marks)
l,, ir.r'.rr'"
weighted
(06 Marks)
1 to each of the other
(07 Marks)
(07 Marks)
k
b.
5I
Fig.Qa@)
c. Prove*fffuin a bipartite graph G(V,, Vz, e; if in.r. is a positive integer M such that the;tu'iL
degre,ffif every vertex in Vr > M > the degree of every vertex in Vz, then there exists a
,ry*ffite matching from Vr to Vz.
*;$-ir'
a. i) How many arrangements all there for all letters in the word SOCIOLOGICAL?
ii) In how many of these arangements, A and G are adjacent?
iiD In how many of these alrangements, all the vowels are adjacent? (06 Marks)
b. Determine the co-efficient of :
i) *'y' in the expansion of (2x - 3y)"
ii) x.y.zz in the expansion of (2* - y - z)4
111) x2'y2.23 inthe expansion of (3r, - 2y - 4r)' . (07 Marks)
c. Determine the number of integer solutions for I x1 * Xz * x: + x4 + x5 < 40,
Where :
i) xi>0, l<i<5
ii) x1 > -3, l< i < 5. (07 Marks)
2 of 3
PART _ B
.-r!,,.q t" r

7. b.
c.
Find the number of integers between 1 to 10,000 inclusive, which are divisible
5,6or8.
Determine in how many ways can the letters in the word ARRANGEMENT be
that there are exactly two pairs of consecutive identical letters.
i) Find the rook polynomial for the shaded chessboard
10cs42
by none of
(06 Marks)
arranged*qg"
(07 Mdh#gr
S *]?ir,
Fig. Q6(cXD
satis$, none of ths following conditiorr
'
*%""*
C1 :(1):uorv; Cz:f(2):w; C3:(3):wor#;ft, io:(4):X,y orz. (07Marks)
7 a. Find the coefficient of xrs in
(l + x)a ,,*
,% *
(rry .H
b. A ship carries 48 flags, 12 each of the, celors red, white, blue and black. Twelve of these
flags are placed on a vertical pole r11a&g# to communicate a signal to other ships. Determine,
how many of these signals have -atea# three white flags or no white flags at all. (07 Marks)
c' Find the formula to .ipr.s : t'fuffi 22 + - - fo'as a function ofn using zummation
on operator. ri;-:r. (07 Marks)
1r""fi:,!:Yt'
8 a. Solvetherecurrencere,Ht#hFn+2:Fn+l *Fnwheren> 0 andF6:0 andFt:1. (06Marks)
b' i) A bank pays 6'pffirest compounded quarterly. If Laura invests $ 100 then how many
months muqt, gtptvait for her money to double?
ii) The nurytdlilffi bacteria in a culture is 1000 and this number increases 250% every
2 howqffie a recuffence relation to determine the number of bacteria present after one
daY-',ffi* (07 Marks)
c' Soly"g'Ui"b ?ecurrence relation i dla2 - 5an*1 + 6an :2,fr ) 0, ao :3, &t: T using method of
g_ ing functions. (07 Marks)
(06 Marks)
{<rf*:frf
$$
$$'
3 of3

8. USN
Fourth Semester B.E.
Design and
Time: 3 hrs.
Degree Examinationr'
Analysis of Algori
j 10cs43
15
Max. Marks:100
d1()
q
L{
€
an
Cg
o
d
C)
.ir
BRboP
vl
J tar
-^ll
E'oo
,= C.l
Cg$
H bI)
ts()
otr5c)'Pi:i
tr'tro>
En
aaP^ tl
arl2
bU
a€O
o€u0 I6d
€l
}H(tr<
E-= rt
!6 J
-bB
5u?ha
d_R
i:E5.soj
6a)
EEt(J
aa t=
H"E
lr()
3P>' qr
boo
cb0.i-l ai
!qs
' : lv 'Ii ' i&ti
!+ o ,. "ii, "rr:
H>'"1*I+i.+
X |.r r"i+*"1..vrii q'
c rr
^
4..'"-.."..-.i
ti,
ai ",'1'':. ,j
V,,{e*" '' --'
-$tri
q)
=
z
(E
o
E
Note: Answer any FIVE full questions, selecting
atleast TWO questions from each part
PART - A
a. Discuss the various stages of algorithm design and analysis process using u flo#
b. Prove that : If tr(n)e O(gr(n)) and t2(n) e O(gz(n)),
then tr(n) + b(n) e O(max{gr(n), gz(n)}).
c. Consider the following algorithm :
Algorithm Mystery (n)
llinput: A non negative integer n
S<-0
fori<-ltondo
C, Cri.r,.iD-J | [a'I
refurn S
6hart.
- (10 Marks)
(06 Marks)
,*"$ fl *
i) What does this algorithm compute? **ryp.
iD What is its basic operation? ,if**,ut e
iii) How many times is the basic operatiosdMcuted?
iv) What is the efficiency class of thiff,-eBorithm? (04 Marks)
i: "ti
a. Write merge sort algorithm anO#i$ss its efficiency. Sort the list E, X, A, M, P, L, E in
alphabetical order using the mro6gB-'-iort. (10 Marks)
b. Design an algorithm for biqqff.'#earch, give an example. Show that the worst case efficiency'
ofbinary search is 0(log-ffi (10 Marks)
-*F
a. Solve the followingffiance of knapsack problem using $eedy algorithm. Knapsack weighl.
M : 20. j*-*# (04 Marks)
Item 1 2
a
J
Weieht 18 15 10
Profit 25 24 15
b.u,'re-.rffi-aprim,sa1gorithm,despanningtreeforthegraphofFig.
*W . (oSMarks)
Fig.Q3(b)
I ?*,.rt"'
'h- F
"?g..
..,fis, "+
"t*"h &*o-
"-r"'"''" .to
u 'al
Design the Dijkstra's algorithm and apply the same to find the
problem for the graph taking vertex 'a' as source in Fig. Q3(c).
single source shortest paths
(08 Marks)
c.
Fig.Q3 (c)

9. 4a.
8a.
b"
b.
Define transitive closure of a graph. Write Warshall algorithm to compute transitive closure
of a directed graph. Apply the same on the graph defined by the following adjacency matrix.
l-o r ool
lo o 1 ol
l^ .1. (loMarks)
lo o o 1l -it:
L0 0 0 ol d,r*l ;,Using Floyd's algorithm, find all pair shortest path for the graph of Fig. Q4(b). @ Markg
., . .1i,
a.
10cs43
(04 Marks)
C ,f
Fig.Qa@)
c. Write a note on travelling sales person problem. a{w
affie
5 a. Write insertion sort algorithm. Apply it to arraffi#Ift foflowing numbers in increasing order
89,45,68, 90, 29,34,17 . ,{-.*,g*" (08 Marks)
b. Design a BFS algorithm to check the connpcfrtity of a given graph. (08 Marks)
c. What is time-space trade offof an
ffir"t (04 Marks)
{+; B
6 a. Write short notes on : {ry
i) Tight lower bound *fu
*'
ii) Trivial lower bound mfu*
iii) Information-theoretiffier bounds. (12 Marks)
b. Define decision tree?ffi'fv the decision tree to sort the elements using insertion sort.
rhfl (oE Marks)
7 a. write the pqegffi for backtracking aigorithm. Appiy backtracking to soive the instance
ofthe trry-,ffirbsetproblem: S: {3, 5,6,7} and d: 15. (10Marks)
PART _ B
oI tne SUU.&ilJDUDSeI proDlem : S : tJ, ), 0, lj and, d : 15. (10 Marks)
b. With tp-ffilp of a state space fee, solve the travelling salesman problem of Fig. Q7O),Yr, a
usirgffich-and-bound algorithm (10 Marks){';if*'te*gs
ai*"-{'# M
it+r. q.
"r. ii
+
*. .(
% Fie.Q7(b)
What is prefix computing problem? Write the algorithms for prefix computation which uses:
i) n processors ii) n/log n processors. (10 Marks)
Let the input to the prefix computation problem be 5,12,8, 6, 3,9,11, 12, 1,5,6,7, 10,4,
3 , 5, and Let O stand for addition. Solve the problem using work optimal algorithm.
(10 Marks)
{. * :1. {€ ,f
2 of2

10. USN 10cs44
UNIX and Shell Programming
Max. Marks:1O0rime:3hrs-
**.,ffX;#;;nmr;?:"#;:H,r *
.j.$g -r.-
g PARr-A -
}. I a. ExplainthearchitectureofLJNlXoperatingsystemwittraneoU"*OfF (08Marks)
5 b. Illustrate wittr a diagranr, tle tlpical IINIX file system and expbQffierent tlpes of files
E .rrpported in UNIX. ^(6,
- 108 M""kry
-g*
c. Explain internal and external commands with examp*
,-69
(04 M*ks)
f,l 2 a. Whichrcommand is used for listing file attributes?
d|**.r* the sienificance of each
:E i field of the output. r,o (08 Marks)
E }, b. A file's curreni permissions are rw - r - x r - f,I5)eciry *re chmod expression required to
I H cbange ttrem for the following
' Q,a
:.E i) rwxrwxrwx .
sE iil;l--:----- ^OE
-P Using both the relative and absol@ethods of assigning permissions. (06 Marks)
E{
c' what are the different.la{*ao ror? Explain with a diagram. (06 Morks)
E E 3 a. Explain the three .tq$$ir". *lth respect ro UMX operating system- (06 Marks)
3 E b. Explain the meclap{dr of process creation using system calls in UNIX. (05 Marks)
'E S c. bxplain the foll@g environment variables with examples :
B-B li it"J,$kN-
EE [S- (osMarkg
c l: ai'
e# nt
$ E I , QYistinguish between hard links and soft links with suitable examples. (06 Marks)
EE. ;SNY iyf,'"
* rorrowing nlters with optiors :
S= .. ,ll ,fl* command to locate from your home directory ,
to8 Marks)
sJlr.sur !u!
c. Explain the fo
All files with the extension .html
A11 flies having inode number 9076
All directories having permissions 666
All files not accessed for more than a year
All but the C program files
All files named a'out and all "C" source files and remove them interactively. (06 Marks)
o
o
z
GI
P
o
a
1)
il)
iii)
iv)
v)
vi)
1 nf )

11. 5a.
b.
c.
d.
6a.
10cs44
PART - B
Explain grep command with all options. (08 Marks)
Briefly explain the different ways of addressing used in sed with example. (06 U#h)
Explain BRE (Basic Regular Expression) character subset used for constructing rffilar
expressions. #64Mart<O
Write the commands for the following r
^*"
i) Use sed to delete all blank lines from a file named sample d ffi.
ii) Use sed to replace all occrurences of the word "I-II{IX" with "LINIAffi irf a file named
sample. d{# (02 Marks)
g$.I
**W
What is shell programming? Write a menu - driven shell s.rippffirform the following :
i) List of users who are logged in ,,**-&#
iD List of files in the current directory
iir) Today's date
iv) Quit to UNIX. (08 Marks)
(06 Marks)
parameters with
(06 Marks)
(07 Marks)
(06 Marks)
(07 Marks)
write a PERL script to
(12 Marks)
(08 Marks)
b. Explain with an example 'khile" and "for" loofh{rell programming.
c. Briefly explain set and shift commands in
W"ro
manipulate positional
example
I
7 a. What is AWK? Explain ury tr,rffii, tunctions in AWK.
b. Explain associativ. urruy, i" Ailfr(/-
c. Explain built - in variables fuWs/K.
8a.ExplainthestringffictionssupportedbyPERLandalso
b !ff[ ?r?W]HTTif*T,ilquivarent
ill ,'ffi'-#
h&*
cluk.F
#W* {. 'r {c !r *
e 1*"
*W-
*#q"q't "q&
a r&"8" *
t& "'tr
*.*ffi
kffi"*
2 of2

12. USN 06cs4s
Fourth Semester B.E. Degree Examination, June/July 2015
Microprocessors
Time: 3 hrs.
rS{1-i't
Max. Mark:100
atleast TWO qaestions from each part. _.. :
.iit
.. tl
a. What do 8 bit, 16 bit, 32 bit microprocessors mean? (02 Marks)
b. Explain with a neat block diagram, the internal architecture of 4086 microprocessor.
Describe the memory structure/organization. (12 Marks)
c. Suppose that DS : 0200H, BX : 0300H and DI : 0400H, Determine the physical memory
address accessed by each of the following instructions:
i) Mov AL, [1234H]
ii) ADD AX, [BX]
iiD xcHG [Dr], AL :i
iv) MOV CX, [DI1 + [BX] (04 Marks)
d. Differentiate between MOV BX, DATA and MOV BX, OFFSET DATA instructions.
(02 Marks)
2 a. What are addressing modes? Mention all the modes with one example each of an 8086 pp.
(08 Marks)
What is an instruction tempfai.Z Explain the MOV instruction coding template for 8086 pp
instruction. Also, explain wilit is segment overside prefix, with an example. (06 Marks)
Write the HEXCODE/BINARY CODE for the following 8086 instruction:
i) ADD BX, 59H [DI]
ii) AND AL, OFH
iii) ROR AX, 1 IREG for this instruction is 001]
OPCODE FOR
ADD"ii OOOOOO BINARY
AND ir OO1OO1OO BINARY
ROR is 11010001 BINARY
a. Differentiate the following:
i) Emulator and LOCATOR
ii) Assembler and LINKER.
b. Write different instruction templates for JUMP instructions and explain.
c. What happens to the contents of the prefetch queue when a jump instruction
Explain.
d. Using REPEAT TINTILL programrying construct, write a program in 8086
computation of delays.
b.
c.
C)
()
Q
(€
!
d
a(o
C)
(g
C)
8eoo-
X=
J'
cl (J
=n-oo ll
ioo
.= c(€!+
ETotr
€g
8z
a=
1-;C)
(€O
OE
ooc(dcd
-v
-s!s5
-O cd
-2" f
Es0a
o" b'-
tri].
5ed(.) ;
o:
3q)atE
EEr-0)
tE>too-tru0
()=
o- :i:
X o.)
a.
U<
:oi
(.)
z
o
A.
(06 Marks)
(04 Marks)
(08 Marks)
is executed?
(04 Marks)
ALP for the
(04 Marks)
I of 2

13. 06cs4s
4 a. Consider the following program sequence. Compute the delays in MS(milliseconds). If the
processor time is 5MHz.
CNTDOWN: MOV AH, OFFH
ADD AL, AH
XOR AH, AH
INC CL
CMP CL, OFFH
JNZ CNTDOWN
The number of cycles required by each instruction, for execution rs 4, 4, 3,3, 4 and 4
ffump not executed) respectively and for jump execution requires l6 cye les. (05 Marks)
Explain the indirect intersegment for call in an 8086 ALP with an example.
Explain the function CALL instruction when parameters are pasSbd to the
stack with an example.
Write an 8086 ALP to compute the FACTORIAL of a numberusing recursion.
PART _ B
Differentiate between reentrant codes and an intemrpt code with example.
Write an ALP in 8086 to which makes use of PUBLIC and EXTERN assembler directives
for an 8 bit dividend and 8 bit divisor to perfonn a division operation. (06 Marks)
Differentiate between MACROS and PROCEDURES with all examples each. (06 Marks)
Write notes on passing parameters to functions using memory location and CPU registers.
t,'
Explain the following instructidur *itt an example each:
b.
c.
d.
5a.
b.
(05 Marks)
function using a
(05 Marks)
(05 Marks)
(04 Marks)
(04 Marks)
(04 Marks)
(10 Marks)
c.
d.
6a.
b.
c.
d.
7a.
b.
c.
,,".8,' 'a'
,tt :.' b.
c.
D CBW ii) TEST iii) t411P iv) XLAT.
Explain the following ass'bmbler directives with an example each:
D DD ii) INCLUDE iii) PTR iv) oRG.
Explain with a n_9,3!$agram, the 8086pp bus activities during aread machine cycle.
(06 Marks)
Differentiate between minimum modes and maximum mode functionality of an 8086 pp. (06 Marks)
.+:.'-$ -
Explain. AOISO88 addressing and address decoding with examples.
d. What is an intemrpt vector table? Explain.
Write'ait 8086 ALP to display a SQUARE WAVE using DAC interface on the CRO. Also,
deiermine the values to be displayed on a CRO. (06 Marks)
Differentiate between I/O MAPPED I/O and memory mapped I/O. (04 Marks)
What are the maskable intemrpts? Explain with a neat diagram how the interrupt will occur
and what happens later? (05 Marks)
Differentiate between the types of intemrpts DOS and BIOS with examples. (05 Marks)
What is PIC? How are external intemrpt generating devices connected to the processor?
(04 Marks)
(06 Marks)
.{< {< {< {< *
) nf )

14. USN 10cs46
' (08 Marks)
(04 Marks)
an example for each.
(08 Marks)
(08 Marks)
oo
()
ir
a
o
c.)
,n
ox
de
-o
co i'
FOO
.= c'l
cs$
xc)
C)=
E()
o3
Be
U)=
O()
oo=
i2 cg
-)
=vA-
^x
5cao-{
uio
o=
ii C)
?a
oD-
=co
c-U
a-
U<
-N
(.)
z
a
Fourth Semester B.E. Degree Examination, June/July 2015
Gomputer Organization
Time: 3 hrs. Max. Marks:100
Note: Answer any FIVE full questions, selecting atleast TWO questions from each parl
PART.A ]]: .
a. With a neat diagram, explain the different processor registers. (08 Marks)
b. List and explain the technological features and devices improvement made during different
generations of computers.
What are the factors that affect the Performance? Explain any four.
t,a t,
V/hat is an addressing mode? Explain any four addressing,._1n:?ded, with2a.
b.
C.
3a.
b.
c.
b.
c.
la.
b.
c.
8a.
b.
,.
Explain Big - endian and Little - endian method of byte addressing with an example.
,".., (04 Marks)
Define Exceptions. Explain two kinds of exceptions. (04.Marks)
Define bus arbitration. Explain in detail any one approach of bus arbitration. (08 Marks)
Draw and explain the general 8 bit parfllel processing. (08 Marks)
.ti
Explain the following with respect to'USB : i) USB Architecture ii) USB Addressing
iii) USB Protocols. .,. (09 Marks)
Briefly discuss the main phases involved in the operation of SCSI bus. (06 Marks)
Explain distributed Bus arbitrations. (05 Marks)
PART . B
a. Define : i) Memory Latency ii) Memory bandwidth iii) Hit - rate ir) Miss -
Penalty. (04 Marks)
b. Explain the different cache mapping functions. (10 Marks)
c. Explain,aoy one feature of memory design that leads to improved perforlnance
"r;r.Tfff;
a. With a neat diagram, explain the virtual memory organization. (08 Marks)
b. Design a logic circuit to perform addition / subtraction of two 'n' bit numbers X and Y.
(04 Marks)
Explain Booth Algorithm. Apply Booth Algorithm to multiply the signed numbers
+13 and -6. (08 Marks)
Explain the different arithmetic operations on floating point numbers. (06 Marks)
Perform division of number 8 by 3 (8 + 3) using the restoring division algorithm. (06 Marks)
Explain the process of fetching a word from memory along with a timing diagram.(,g
Marks)
Briefly explain the structure of General Purpose Multiprocessor. (08 Marks)
List different types of Networks. Expiain any four. (08 Marks)
Give a brief description on performance consideration with an example. (04 Marks)
c.
*r(rr?t*