Total No. of Question: 6 Seat No.

: ( )
PNOV19 Total No. of Pages in Paper (02)
B.Tech Computer Engineering
(Semester –I)
BTECHCS516 /BTECHCS603 – Systems Programming
Time: 2.15hr. Max. Marks: 50
Instructions to the Candidates:
i All questions are compulsory.
ii Figures to right indicate full marks.
iii Assume suitable data if necessary.

Q No Question Marks

Q1 A Consider the following Assembly language code.

START
MOV A , = ' 6 '
LOOP : READ N
MOV B , N
SUB A,B
JZ LOOP
ORG 500
LTORG
ADD B , = ' 30 '
LTORG
INC B
N DC 10
STR DS ( 20 )
NUM EQU N
END
Assume each imperative instruction is of length 2.

Generate Symbol table. 3

Generate Literal table and Pool Table 3

Perform LC processing 2
Q2 A Compare Variant I and Variant II forms of Intermediate Code of assembler with example. 8

OR

What are expansion time variables? Explain with a relevant example their usage.

Q3 A Justify the reason to create the additional tables SEGTAB and EXTTAB during second pass of 8
8080 linker.

Q4 A Compare top down and bottom up parsers and their working. 8

OR

Consider the following "C" code. Generate the tokens with lexemes and token values.

if ( a == 10)
c = a–b;
else
b= a%c;

Q5 A With a neat diagram of I/O software stack, explain 8

i) Device driver and Working of device driver.

ii) Device driver design issues

Q6. A Consider the assembly code:

START 500

ENTRY TOTAL 10

EXTERN ALPHA, BETA

READ STR

LOOP : MOVER AREG, APLPHA

 ADD AREG, BREG

JMP LOOP

STR DS 10

TOTAL DS 20

END

Assume MOT given below:

Mnemonic Opcode Size

READ 09 1

MOVER 04 1

ADD 05 1

JMP 06 2

Write the contents of all the components of object module for the above program Unit.

Total No. of Question: 6 Seat No.: ( )

PNOV19 Total No. of Pages in Paper (02)
B.Tech Computer Engineering
(Semester –I)
 BTECHCS516 / BTECHCS603 – Systems Programming
Time: 2.15hr. Max. Marks: 50
Instructions to the Candidates:
I All questions are compulsory.
Ii Figures to right indicate full marks.
Iii Assume suitable data if necessary.

Q No Question Marks

Q1 A Write an algorithm for the PASS I of two pass assembler. 8

Q2 A Describe the structure, scope and purpose of following tables in Macro Processing with example: 8

SSTAB, EVTAB and PNTAB

OR

Differentiate between lexical expansion and semantic expansion of macro with a suitable
example.

Q3 A With a neat diagram describe the data structures for expanding nested macro calls. 8

OR

Elaborate the processing of EXTRN and ENTRY definitions by Linker with an example.

Q4 A Write LEX specification to count the number of words, constants and special characters in the 8
input text.

Q5 A Differentiate between the following device drivers with an example of each 8

i) Block Vs Character
ii) Dedicated Vs Shared
iii) Sequential Vs Random access
Q6. A Consider the following code. Assume mnemonic op codes and length.

START 500
ENTRY TOTAL
EXTERN ALPHA, BETA, GAMMA
READ N
NEXT : MOV C, N
..
..
MOV A, ALPHA
MOV B, BETA
SUB A, B
JC NEXT
MOV C, GAMMA
N DC 10
TOTAL DS 20
END
Generate RELOCTAB 2

Generate LINKTAB 3

Generate Object code as produced by assembler with LC. (Assume opcodes and size for each 5
mnemonic)
 Total No. of Question: 6 Seat No.: ( )
PNOV19 Total No. of Pages in Paper (02)
B.Tech Computer Engineering
(Semester – I)
BTECHCS516 / BTECHCS603 – Systems Programming
Time: 2.15hr. Max. Marks: 50
Instructions to the Candidates:
i All questions are compulsory.
ii Figures to right indicate full marks.
iii Assume suitable data if necessary.

Q No Question Marks
Q1 A Consider the following Assembly language code.

START
MOV A , = ' 6 '
NEXT : READ N
MOV B , N
SUB A,B
JZ NEXT
ORG 500
LTORG
ADD B , = ' 30 '
LTORG
INC B
N DC 10
STR DS ( 20 )
RESULT EQU N
END

Assume each imperative instruction is of length 2

 Perform LC processing and design Symbol table as generated in PASS I of assembler. 5

Design Literal table as generated in PASS I of assembler. 3

Q2 A Discuss the issues in single pass assembly. Propose an algorithm for the same with tables 8
required.

Q3 A Compare the following: 8

i) Auto Linking Vs Dynamic Linking

ii) Conditional expansion Vs Expansion time loops
OR

With an example explain the purpose and usage of FIXUPP records in 8088 Linker.

Q4 A What is a parser? Compare the two types of parsers. 8

OR

Describe any 3 examples of code optimizations performed by the compiler.

Q5 A Elaborate on data flow in USB device with a neat block diagram. 8

Q6. A Consider the assembly code:

START 500 10

ENTRY TOTAL

EXTERN ALPHA, BETA

READ STR

LOOP : MOVER AREG, APLPHA

ADD AREG, BREG

JMP LOOP

STR DS 10

TOTAL DS 20
 END

Assume MOT given below:

Mnemonic Opcode Size

READ 09 1

MOVER 04 1

ADD 05 1

JMP 06 2

Write the contents of all the components of object module for the above program Unit.