CS1352 - Principles of Compiler Design, Anna University, BE CSE 2009 Question Paper

Looking for old, model, previous years question papers of CS1352 - Principles of Compiler Design? Here provided is an old question paper of this paper for B.E CSE conducted in the year 2009. Read the contents of the "Principles of Compiler Design".

Anna University, Chennai
B.E/B.Tech. Degree Examination, May/June 2009
Sixth semester
Computer Science and Engineering
CS1352-PRINCIPLES OF COMPILER DESIGN
(Regulation 2004)
Time:Three hours
Maximum:100 marks
Answer All questions
Part A - (10 * 2 = 20 marks)

1. What are the issues to be considered in the design of lexical analyzer?

2. Define concrete and abstract syntax with example.

3. Derive the string and construct a syntax tree for the input string ceaedbe using the grammar S->SaA|A,A->AbB|B,B->cSd|e

4. List the factors to be considered for top-down parsing.

5. Why is it necessary to generate intermediate code instead of generating target program itself ?

6. Define back patching.



7. List the issues in code generation.

8. Write the steps for constructing leaders in basic blocks.

9. What are the issues in static allocation?

10. What is meant by copy-restor?

PART B - (5 * 16 = 80 Marks)

11. (a) (i) Explain the need for dividing the compilation process into various phases and explain its functions. (8)

(ii) Explain how abstract stack machine can be used as translators. (8)

(or)

(b) What is syntax directed translation? How it is used for translation of expressions? (16)

12. (a) Given the following grammar S->AS|b,A->SA|a Construct a SLR parsing table for the string baab (16)

(or)

(b) Consider the grammar E->E+T,T->T*F,F->(E)\id.Using predictive parsing the string id+id*id. (16)

13. (a) Explain in detail how three address code are generated and implemented.

(or)

(b) Explain the role of declaration statements in intermediate code generation.

14. (a) Design a simple code generator and explain with example.

(or)

(b) Write short notes on:

1: Peep hole optimization

2: Issues in code generation

15. (a) Explain with an example how basic blocks are optimized.

(or)

(b) Explain the storage allocation strategies used in run time environments.

CS1351 - Artificial Intelligence, Anna University BE CSE 2008 Question Paper

Are you looking for CS1351/Artificial Intelligence old question paper of Anna University, Chennai. Hereunder provided is such paper conducted in the year 2008 for B.E Computer Science and Engineering course. Read on to collect the contents of the question paper.

Anna University, Chennai-25,
B.E/B.Tech Degree Examination
Computer Science Engineering
CS1351 - Artificial Intelligence
Time: 3 hours
Maximum: 100 marks

PART -A ( 2 x 10 = 20)

1) What is the use of heuristic functions?

2) Define artificial intelligence.

3) How to improve the effectiveness of a search based problem solving technique?

4) What is a constraint satisfactions problem?



5) What is a unification algorithm?

6) How can you represent the resolution in predicate logic?

7) List out the advantages of nonmonotonic reasoning.

8) Differentiate between JTMS and LTMS

9) List out the important components of a script.

10) What are framesets and instances?

PART - B (16 x 5 = 80)

11. (a) (i) Give an example of a problem for which breath first search would work better than depth first search.

(ii). Explain the algorithm for steepest hill climbing.

OR

(b) Explain the following search strategies.

(i) Best first search

(ii) A* search.

12. (a) Explain Min Max search procedure

OR

(b). Describe alpha-beta pruning and give the other modifications to the minmax procedure to improve its performance.

13. (a) Illustrate the use of predicate logic to represent the knowledge with suitable example.

OR

(b) Consider the following sentences:

John likes all kinds of food.

Apples are food.

Chicken is food

Anything anyone eats and isn't killed alive.

sue eats everything bill eats

(i) Translate these sentences into formulas in predicate logic.

(ii) Prove that john likes peanuts using backward chaining

(iii) Covert the formulas of a part into clause form

(iv) Prove the tjohn likes peanuts using resolution.

14 (a) With an example explain the logics for nonmonotonic reasoning

OR

(b) Explain how Beyesian statistics provides reasoning under various kinds of uncertainty

15. (a) (i) Construct semantic net representations for the following:

pomepeian (Marcus), Blacksmith ( marcus)

Mary gave the green flowered vase to her favorite cousin.

(ii) Construct partitioned semantic net represtations for the following:

Every batter hit a ball

All the batters like the pitcher.

OR

(b) (i) Illustrate the learning from examples by induction with suitable examples.