We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
OLE NO. s.secssecsesesceseesensnne Total Pages : 04
BT-3/D-19 ’ 33131
PRINCIPLES OF PROGRAMMING
LANGUAGES
ES-227A
ime : Three Hours] [Maximum Marks : 75
ote: All questions in Part A and Part B are compulsory.
Attempt any four questions from Part C, by selecting
at least one question from each Unit.
Part A G5 marks) 5x3=15
Answer the following questions :
(i) Recognize the role of using assignment and
initialization in programming languages. 3
(ii) Identify the basic nature of généric Subprogram with
the help of suitable example. 3
ii) Interpret the role of using synchronization through
semaphores. 3
(iv) What are the problem implications which may arise
during evaluation of tree representation of an
arithmetic expression ? 3
{v) Discuss the function of major run time elements
which require storage. 3
0/12) L-33131 . P.T.O. Part B (20 marks)
Unit I
Discuss the role of persistence for defining variables,
constants and literals. . 5
Unit
Identify the factors which influence the evolution of data
types in the programming languages. . 5.
Unit 1
In what way subprogram level concurrency can be
achieved to control the sequence of a program ? 5
Unit IV
Briefly explain the perspective of functional programming.
5
Part C (40 marks) ;
Unit I C
(a) Identify and explain the general problems of
describing syntax. Also elaborate the concept of
dynamic semantics in programming languages. §
(b) Define type checking and type conversion. Explain
both of them using suitable programs or algorithms.
5
L-33131 * 2 (b)
(6)
With the help of diagrams, explain and compare the
translation, compilation and interpretation. 5
Why the breakpoints and assertions are useful
components in programming languages ? a)
Unit Mt
Give the accessing formula for computing the
location of component A[l, J] of a matrix A declared
as : V : array [LB,..UB,, LB,..UB,] where A is
stored in column-major order. : 5
Investigate the logic’ of using type definitions in
programming languages. Give the justification by
using Name equivalence and Structural equivalence
with examples. : 5
9, Explain the following <
i)
Gi)
10. (a)
()
Type conversion and coercion
Packed storage representation and whole vector
operations. 10
Unit
Explain the following by using suitable programs
or algorithms : 6
(i) Call by address
Gi) Call by Name
Differentiate between recursive subprograms and
routines. 4
(2-50/13) L-33131 3). P.T.O. il. (a) How the synchronization through: semaphores is
achieved ? Mention its advantages and
disadvantages. 6
(b) Differentiate between explicit and explicit sequence
. control. 4
Unit IV
12. Explain the following :
(i) Heap storage management
(ii) Stack based storage management. 10
13. Identify and explain various functional definitions and
types, of standard functions available in the functional
programming language of LISP. 10
L-33131 4 . 1,100
