Punjab Technical University 2005 B.E Computer Science SYSTEM PROGRAMMING CS 210 - Question Paper

SYSTEM PROGRAMMING CS 210 fourth Sem May 2k5

Max Marks 60

Note: part A is compulsory. Attempt any 4 ques. from part B and two from part C.

part A Marks two every

1.
(a) What data structure is used for assembler pass one?
(b) Illustrate the issues of 2 pass assembly.
(c) What are the features of machine-independent macro processor?
(d) Explain the purpose of the Segment index field in an LEDATA record.
(e) How does Dynamic Linking work for Subroutine?
(f) What fare the Debugging Functions and Capabilities?
(g) Compare structure editors and screen editors.
(h) Which are the tow ways of Code Optimization? discuss.
(i) Compare code generation actions and code generation routine.
(j) Can swapping be used in multiprogramming systems? discuss.

part B Marks five every

2. Develop complete program for the passes of 2 pass assemblers indicating:
(a) Inputs (files and tables) for every pass
(b) Outputs (files and tables) for every pass.

3. On a few systems, control parts can be composed of several various parts just as program blocks can. What issues does this pose for the assembler? How might these issues be solved?

4. Suppose we want macro definition to appear as a part of the assembly listing. How could the macro processor and the assembler accomplish this?

5. Define binary object format for SICF and write an absolute loader to load program in this format.

6. consider the subsequent possibilities for the storage, linking and execution of a user’s program:
(a) Store the source and object versions of the program, use linking loader every time the program is to be executed.
(b) Solve the source program and linked version with all externals references resolved. Use a relocating loader every time the program is to be executed.

part C

7. (a) What type of source program errors would be detected using Lexical analysis?
(b) What type of source program errors would be detected during Syntactic analysis?

8. Select a high level programming language with which you are familiar and write a lexical scanner for it.

9. (a) Is memory-protection hardware necessary of a machine that uses demand-paged memory management? Justify your ans.
(b) How might the operating system detect that a deadlock has occurred? Write the methods to prevent deadlock situation.

Earning:   Approval pending.