MODEL PAPER

B. Tech (CSE) Degree Examination

Third Year - Second Semester

PRINCIPLES OF PROGRAMMING LANGUAGES

Effective from the admitted batch of 2004-2005

Time: 3 hrs
Max Marks: 70

First Question is Compulsory

Answer any four from the remaining questions

All Questions carry equal marks

Answer all parts of any question at one place

1. Briefi explain the following (7 x 2 = 14)
a. Binding times
b. BNF grammars
c. Type equivalence
d. Block structured languages
e. Coroutines
f. Variant records.
g. Unification.

2. Discuss briefly about language paradigms. (8)
b. Briefly explain about recursive descent parsing. (6)

3. a. Explain with suitable examples type checking and conversion rules (6)
b. Discuss briefly about Abstract Data Types. (8)

4. a. The Pascal if statement has the syntax
"if Boolean expression then statement else statement"
where as the Ada if is
"if Boolean expression then statement else statement end if"
Comment on the relative merits of having an explicit termination to the statement, such as the end if of Ada. (4)
b. With suitable examples explain about polymorphism and its implementation aspects. (10)

5. Discuss parameter transmission methods, semantics and implementation. (14)

6. Discuss heap storage management. (14)

7. Discuss the principles of parallel programming languages. (14)

8. Discuss network programming languages. (14)