GTU Computer Engineering (Semester 5)
System Programming
May 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Compare user-centric view and system-centric view of system software.
7 M
1 (b) What is Symbol table? Explain how one can organize Symbol table using Linear Data Structure?
7 M

2 (a) What are the Advanced Assembler Directives? Explain any two with example.
7 M
Solve any one question from Q2(b) & Q2(c)
2 (b) List various phases of Language Processor. Explain any one phase in detail.
7 M
2 (c) Given the source program:
(a) Show the contents of the symbol table at the end of Pass I.
(b) Explain the significance of EQU and ORIGIN statement in the program and explain how they are processed by the assembler.
(c) Show the intermediate code generated for the program.
  START 100
A DS 3
LI MOVER AREG, B
  ADD AREG, C
  MOVEM AREG, D
D EQU A+1
L2 PRINT D
  ORIGIN A-1
C DC '5'
  ORIGIN L2+1
  STOP  
B DC '19'
  END L1
7 M

Solve any two question from Q3(a), Q3(b) & Q3(c), Q3(d)
3 (a) Explain use and field of following tables of macro. KPDTAB, MDT, EVTAB, SSTAB
7 M
3 (b) Explain following facilities for expansion time loop with example.
(1) REPT statement
(2) IRP statement
7 M
3 (c) Explain following terms with suitable example.
(1) Expansion time variable
(3) Semantic expansion
(2) Positional parameter
(4) Macro Pre-processor
7 M
3 (d) Draw a flowchart and explain simple one pass macro processor.
7 M

Solve any two question from Q4(a), Q4(b) & Q4(c), Q4(d)
4 (a) With example explain how relocation is performed by linker?
7 M
4 (b) Explain Absolute loader with example.
7 M
4 (c) What is overlay? Explain linking of overlay structured program.
7 M
4 (d) In brief explain relocating loader.
7 M

Solve any two question from Q5(a), Q5(b) & Q5(c), Q5(d)
5 (a) (i) Explain types of grammar.
3 M
5 (a) (ii) Explain lexical analysis of language processor.
4 M
5 (b) Given following expression: x = -a*b + -a*b (1) Write three address codes for the expression.
(2) Optimize the three address code if it is possible to do so.
(3) Give triple implementation for the three address code of the expression.
7 M
5 (c) Explain recursive descendent parsing algorithm.
7 M
5 (d) What is interpreter? Explain pure & impure interpreters.
7 M



More question papers from System Programming
SPONSORED ADVERTISEMENTS