lJSN I I I L I I [ J -[ I 1

I NEW SCHEME I
Fifth Semester B.E. Degree Examination, Dec. 06 I .Jan. 07
CS / IS
System Software
Time: 3 hrs.] [Max. Marks:IOO
Note : Auswer any FIVE full questio11s.
a. Bring out the difference between system software ami application sollware.
(04 "lnrks)
b. Fxplain SIC/XL:. machine instruction l\1m1ats and all addressing modes. by dearly
indicat ing setting of different Oag bits. (tO M:orks)
c. Suppose that RECORD contains a I 00 byte record. Write a subroutine [or SIC/XE
that will write record on to device 05. Usc immediate addressing and register-to-
register instructions to make the subroutine as efficient as possible. (06 Mrk.<)
2 a. Write and explain r.hc algorithms of pass I of two-pass
b. Generate the machine code for the foll owing:
1) I JStTB ROREC
ii) STL RETAOR
iii} LDB #LENGTII
Assume the opcodc for :
JSI JB = 4811. S'rL = l4TTand
The location counter value for:
RDREC 10:161-1. RETADR= 00301-1 and LENGTil 00331-1
3 u. G.:ncratc the object code for the program shown below :
LOX 110
LOT #100
Loop TO I>IDEV
JEQ Loop
RD INDEV
S I'Cll RECORD. X
TIXRT
JLT L<>op
11\DI.:.V DYTE X ft'
RFCORD IU:Sfi LOO
E\ID
( I (I \larks)
(lU Mark\!
Assume starting address I OOOH
Opcodc for mnemonics are 1(11!ows :
LDX = 04H, LOT = 7411, TO EOI-l, JLQ = 301 I, RD = JJ8II. STCII = 5411.
TlXR = B8H. JL 1 = 3&H (10 Marks)
b. What is relocating loader? Explain the two mctbods for specitying relocation a
part of program. (1 o Mrk.J
For More Question Papers Visit - http://pediawikiblog.blogspot.com

s
6
a Jinkmg loadc1 and l'dihlr with the- hdp nf
ll . . t 10
J1agrams. .
h. a

Ho
1
t-strap loader. with tm algonthm nr a "''urcc program. (IO hbrl'l
" \\'hal is an interacliv.: editor'! Explain briefly. structure of a t)pio:al edit<>r with the
help of 'uitahle block di;q;rant bneOy discuss cummand language proc.:ssor.
traveling, editing, vu.:wmg and d1splay functions. (12 Mark.)
b. Explain the different debugging function' and dcbuggmg capahaliues. (Oil I
With to the machanc-independcnt macwpn>ecssor fe:llures, the
lillowing :
1) Conditional mucro expansion
"J h. e) \lOrd macro parametc:n.. (US
b. Write the algorithm for one pass macroprocessor and explain. Urieny discuss v:lri<lus
data stnJcturcs required for a design of a mucro pronssor. ( 12 Mark.<)
7 o. f'xplain rc..:ur.i\C parsing Wntc Jcc..:nt pal"e fin a Rl- \IJ
;tatemcnl.
h. Briclly cxplam shill-reduce parsing.
c Wme expl.tnatory nHtcs on interpreter.
8 " I xphun .
i) P-cndc compliers
(10 \hrl.>)
(OS Marl.<)
'lbrLJ
u) ('omplcr-compilcrs (10 :\brLJ
b. J Fxpl.1111 the stmcturc ul I.E:\ pmgr.un
11 J a program m l hX to count the number nl and in a
given stnng tiO !\brlo.'l
For More Question Papers Visit - http://pediawikiblog.blogspot.com