Code No: RR310505 Set No.

1
III B.Tech I Semester Supplimentary Examinations, November 2007
PRINCIPLES OF PROGRAMMING LANGUAGES
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Exception handling is very important, but often neglected by programming

languages. Comment on it. [6]
(b) What are the disadvantages of aliasing. [5]
(c) Readability and writability influence the reliability. Comment on it. [5]

2. What is BNF notation. Explain it with examples. [16]

3. Explain how C language deals with scope of the variables. [16]

4. Define associative array. What are the different design and implementation issues
associated with associative arrays. [16]

5. (a) Discuss briefly about co routines. [8]

(b) Explain the separate compilation and independent compilation. [8]

6. Explain java threads with examples. [16]

7. (a) Discuss about essential characteristics of logic programming. [8]

(b) Explain the generate and test programming strategy in prolog. [8]

8. Discuss about expressions and standard functions in LISP. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 2
III B.Tech I Semester Supplimentary Examinations, November 2007
PRINCIPLES OF PROGRAMMING LANGUAGES
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. A programming language can be compiled or interpreted. Give relative advantages

and disadvantages of compilation and interpretation. Give examples of compiled
and interpreted languages. [16]

2. What do you mean by program verification. Explain the steps involved in program
verification. [16]

3. Define string. Assuming yourself as a language designer, what are the different
string operations which you permit and why. [16]

4. Define array and record. Classify arrays based on storage allocation. What are the
advantages and disadvantages of allocating memory during compilation time and
run time. [16]

5. (a) Discuss how parameter-passing techniques are implemented. [8]

(b) Explain how multidimensional arrays are passed as parameters. [8]

6. (a) Define abstract types. What are the language design requirements for a lan-
guage that supports abstract data types? [8]
(b) What are the differences between private and limited private types in Ada?
[8]

7. (a) Explain the uses of exception handling in programming languages. [8]

(b) Explain the salient features of prolog. [8]

8. Explain the PROG features of LISP. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 3
III B.Tech I Semester Supplimentary Examinations, November 2007
PRINCIPLES OF PROGRAMMING LANGUAGES
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) What do you mean by imperative programming language. [6]

(b) What makes a language portable. [5]
(c) What are the differences between the special purpose and general purpose
programming languages. [5]

2. (a) In what way do operational semantics differ from denotational semantics. [8]
(b) What purpose do predicates serve in an attribute grammar. [8]

3. A variable is more than a name given to a memory location. What are the attributes
of a variable. Explain in detail. [16]

4. (a) What is short circuit evaluation. What is its advantage. [8]

(b) Explain the side-effect related to expression evaluation. [8]

5. (a) Explain with examples pass-by-result and pass-by-name parameter passing

techniques. [8]
(b) Explain the design issues involved in subprogram. [8]

6. Explain java threads with examples. [16]

7. (a) Explain how exceptions are raised. [8]

(b) How exceptions are propagated? Explain. [8]

8. (a) Define Cambridge polish and lambda notation. Explain with examples. [8]
(b) What is S-Expression and how is evaluated. Give an example. [8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 4
III B.Tech I Semester Supplimentary Examinations, November 2007
PRINCIPLES OF PROGRAMMING LANGUAGES
( Common to Computer Science & Engineering and Computer Science &
Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Compare procedure oriented and object oriented programming. Explain the object
oriented features supported by C++. [16]

2. (a) How do you describe the meanings of programs using dynamic semantics. [8]
(b) How do you describe the meaning of program using operational semantics.
Explain with example. [8]

3. (a) What is strongly typed language. Give examples of strongly typed languages.
[6]
(b) What are the advantages and disadvantages of strongly typed languages. [10]

4. Assume a programming language is used to extensively manipulate arrays. What

are the different array operations which you permit as language designer. Justify
your choices. [16]

5. (a) Discuss about actual parameters, positional parameters and keyword parame-
ters. [8]
(b) Explain the general subprogram characteristics. [8]

6. (a) What is a binary semaphore? What is a counting semaphore? [8]

(b) Explain why java includes the runnable interface? [8]

7. (a) Explain basic concepts and design issues of exception handling. [8]
(b) Discuss how exception handlers are helpful in C++ exception handling. [8]

8. Discuss about expressions and standard functions in LISP. [16]

⋆⋆⋆⋆⋆

1 of 1