How To Exam?

a knowledge trading engine...


Sathyabama University 2008 B.E Computer Science and Engineering System Programming - Question Paper

Wednesday, 30 January 2013 09:25Web


SATHYABAMA UNIVERSITY

SATHYABAMA UNIVERSITY

(Established under section 3 of UGC Act, 1956)

 

Course & Branch: B.E - CSE (Part Time)

Title of the paper: System Programming

Semester: III Max. Marks: 80

Sub.Code: 6CPT0013 (2006/2007 JAN) Time: 3 Hours

Date: 27-04-2008 Session: FN

 

PART A (10 x 2 = 20)

Answer All the Questions

 

1. What is the purpose of POOLTAB?

2. What are the assembler directives?

 

3. What is an object module?

 

4. What is meant by self relocating program?

 

5. State the role of lexical analyzer in compilation process?

 

6. What is a finite automaton?

 

7. List the error recovery strategies.

 

8. What is a triple?

 

9. What is a DAG?

 

10. What is the purpose of pre header?

 

PART B (5 x 12 = 60)

Answer All the Questions

 

11. Write short notes on the following

(a) Analysis phase of an assembler

(b) Backpatching

(c) Advanced assembler Directives

(or)

12. Discuss in detail passes of a two pass assembler.

13. (a) Explain in detail nested macro calls with an example. (8)

(b) Discuss about data structures of the macro processor. (4)

(or)

14. Briefly explain design of a linker.

 

15. (a) Construct a minimum state DFA for (a/b)*a(a/b)(a/b). (8)

(b) What is left factoring? Left factorize the grammar.

S->iEtS / iEtSeS / a

E-> b (4)

(or)

16. (a) How will you construct an NFA from a regular expression?
Using Thompsons construction. Give Example.

(b) Explain elimination of left recursion with an example.

 

17. (a) Construct a predictive parser for the grammar.

bexpr ->bexpr or bterm / bterm

bterm -> bterm and bfactor / bfactor

bfactor -> not bfactor / (bexpr)/true/false. (8)

(b) Translate (a+b) * (c+d) + (a+b+c) into

(i) Quadruple (ii) indirect triples. (4)

(or)

18. Discuss briefly operator precedence parsing with example.

 

19. (a) Briefly explain about principle sources of optimization. (7)

(b) Explain detection of loop invariant computation. (5)

(or)

20. (a) Discuss in detail detection of induction variable with an
example.

(b) Write short notes on

(i) Reduction flow Graph (ii) Dominators.


 


( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Sathyabama University 2008 B.E Computer Science and Engineering System Programming - Question Paper