Code: 9A05501

1
(Common to ECC and CSE)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14 PRINCIPLES OF PROGRAMMING LANGUAGES Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 3 (a) (b) 4 (a) (b) 5 (a) (b) (c) 6 (a) (b) With neat diagram explain von Neumann computer architecture. Which category of languages designed around this architecture? Distinguish between imperative and applicative languages. Explain the process of computation of attribute values of attribute grammar with example. What are design issues of pointers? Explain. What is named constant? What are the advantages of named constants? Explain the importance of operand evaluation order. What is operator overloading? Explain operator overloading in different languages. What are general characteristics of subprograms? Explain in detail different components of a subprogram. Clearly explain the two categories of subprograms. What are two categories of concurrency? What is the need for studying concurrency? What is task synchronization? Explain in detail two kinds of task synchronization with examples. Explain basic concepts of exception handling. Write design issues of exception handling. What are the three ways that ML is different from scheme? Give brief description about the various structured data types in ML. Max Marks: 70

7 (a) (b) 8 (a) (b)

*****

Code: 9A05501

2
(Common to ECC and CSE)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14 PRINCIPLES OF PROGRAMMING LANGUAGES Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 (a) (b) (c) 3 (a) (b) 4 (a) (b) (c) 5 (a) (b) 6 (a) (b) 7 Explain different programming methodologies for software development. Explain any two scripting languages. Explain the following terms: Left recursive grammar. Parse trees. Derivations What is implicit type declaration? What are its disadvantages? Explain different design choices used for array indexes in various languages. What are the advantages and disadvantages of user-defined overloading? Discuss about guarded commands. Explain in detail relational and Boolean expressions. What is the need of passing subprogram names as parameters? Explain how subprogram names are passed as parameters. Explain pass-by-reference parameter passing method. Explain pass by value and pass-by-result parameter passing techniques. What is a thread? Explain how threads are implemented in java. Write a detailed comparison of the exception handling capabilities of C++ and those of java. Explain in detail about the selection control flow of meta language. Write procedure to find the greatest common divisor by using python language. Max Marks: 70

8 (a) (b)

*****

Code: 9A05501

3
(Common to ECC and CSE)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14 PRINCIPLES OF PROGRAMMING LANGUAGES Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 (a) (b) What are the different ways that a programming language can be implemented? Explain. What is type checking? How it affects the reliability of a programming language? Write formal definition of attribute grammar. What do you mean by ambiguous grammar? What is the difficulty of ambiguity in using a grammar for programming languages? Explain. What are static variables? Explain advantages and disadvantages of static variables. Explain static scope of variable with example. Give the tree representation for the following, assuming C precedence: (i) ( A B / C ) * D / E / F + G (ii) A * B > C + D / E F With a neat diagram explain the concept of aliasing. What design issues to be considered for providing sub programs (or) functions? Explain in detail. Write about overloaded operators. Explain user defined abstract data types with examples. What are abstract data types? Write a prolog description of your family tree, going back to your grandparent at including all descendents. Be sure to include all relationships. Explain exception handlers in Ada. Mention the similarities between Haskell and ML. Explain with an example, the where clause using Haskell. Max Marks: 70

3 (a) (b) 4 (a)

(b) 5 (a) (b) 6 (a) (b) 7 (a) (b) 8 (a) (b)

*****

Code: 9A05501

4
(Common to ECC and CSE)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14 PRINCIPLES OF PROGRAMMING LANGUAGES Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) (c) 2 3 (a) (b) 4 (a) What is the disadvantage of having too many features in a language? In what language is UNIX written? What is linker? Explain. Illustrate the structure of a compiler with neat sketch. Explain the concept of named constants with examples. What are the advantages and disadvantages of dynamic type binding? Consider the following C Program: int fun (int *i) { *I += 5; return 4; } void main () { int X = 3; X = X + fun (&X); } What is the value of X after the assignment statement in main, assuming (i) Operands are evaluated left to right (ii) Operands are evaluated right to left What is associativity rule? Write associativity rules for some languages. Explain how subprogram is overloaded. Give examples. Distinguish between actual parameters and formal parameter methods. Discuss in detail how the encapsulation and data abstraction is achieved in Java with suitable examples. Write about message passing between two concurrent subprograms (processes). Explain in detail exception handling in C++ with example. What is lazy evaluation? Explain it with an example. Discuss in detail about the selection control flow using ML. Max Marks: 70

(b) 5 (a) (b) 6 (a) (b) 7 8 (a) (b)

*****