Code No: RR310505 Set No.

1
III B.Tech I Semester Supplimentary Examinations, February 2008
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. What is the significance of abstraction. What are the two different categories of
abstractions that a programming language can support. Explain with examples
from different languages. [16]

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

3. Write short notes on coercion, type error, type checking and strong typing. [16]

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) Explain the local referencing environments. [8]

(b) Explain with examples pass-by-value and pass-by-result parameter passing
techniques. [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) Discuss about standard functions in prolog. [8]

(b) What are the design issues that are involved in exception handling? [8]

8. Describe briefly about expressions, functions and exceptions in Meta Language.

[16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 2
III B.Tech I Semester Supplimentary Examinations, February 2008
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. Explain in detail programming domains. [16]

2. Give BNF notation for if loop, case statement, does-while statement in C. give the
corresponding syntax graph. [16]

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

4. (a) What are the design issues for pointer types. [6]
(b) What are the two common problems with pointers. [6]
(c) Why are pointers of most languages restricted to pointing at a single type
object. [4]

5. (a) Discuss the design issues of subprograms. [8]

(b) Discuss about the procedures and functions in subprograms. [8]

6. (a) Explain data abstraction in Ada. [8]

(b) Define a task. What are the different states of tasks? Explain. [8]

7. Explain any three deficiencies of prolog with examples. [16]

8. (a) Explain the differences between functional and imperative languages. [8]
(b) Explain how Meta Language differs from Haskell. [8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 3
III B.Tech I Semester Supplimentary Examinations, February 2008
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 are the steps in compilation process. [6]

(b) What does it mean for a program to be reliable. [5]
(c) Why is readability important to writability. [5]

2. (a) What is the significance of mathematical logic in the context of axiomatic

semantics. Explain with examples. [6]
(b) What is the significance of denotational semantics in describing the meaning
of programs. Explain with examples. [10]

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. (a) Discuss precedence and associativity rules of different programming languages.

[8]
(b) What is the significance of precedence and associativity. Give examples. [8]

5. (a) What are the advantages and disadvantages of dynamic local variables? [8]
(b) What are the design issues for subprograms? [8]

6. (a) What are the three levels of concurrency in programs? Explain. [8]
(b) What is a semaphore? What are the operations that can be performed on
semaphores? Explain. [8]

7. (a) Discuss Terms and Goal statements in prolog. [8]

(b) Explain prolog interfacing process. [8]

8. (a) Explain structures and arrays in ML. Give examples. [8]

(b) Discuss briefly about expressions in ML. [8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR310505 Set No. 4
III B.Tech I Semester Supplimentary Examinations, February 2008
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. Give BNF notation for identifier, for loop, while loop in C. Give the corresponding
syntax graph. [16]

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. What are unconditional branching statements supported by different programming

languages. What are their limitations. [16]

5. (a) Explain with examples pass-by-value and pass-by-reference parameter passing

techniques. [8]
(b) Explain type-checking technique in parameter passing. [8]

6. Explain with example, how cooperation synchronization is implemented using mon-

itors. [16]

7. Explain any three deficiencies of prolog with examples. [16]

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