Cp4154-Principles of Programming Languages Iat Ii

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

Reg.

No.: 2105 – DMI COLLEGE OF


ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING INTERNAL ASSESSMENT-II (2020-
2021, ODD SEMESTER)
M.E--I ST Year / I ST Semester
CP4154-PRINCIPLES OF PROGRAMMING LANGUAGES
DATE: 03/ 01/ 2024 TIME: 09.20 AM To 12.20 PM Max. : 100 Marks
COURSE OUTCOMES:
CO1: Describe syntax and semantics of programming languages
CO2: Explain data, data types, and basic statements of programming languages
CO3: Design and implement subprogram constructs
CO4: Apply object-oriented, concurrency, and event handling programming constructs
CO5: Develop programs in Scheme, ML, and Prolog
CO6: Understand and adopt new programming language.
Blooms Taxonomy:
K1- Remembering, K2-Understanding, K3-Applying, K4-Analyzing, K5-Evaluating, K6-Creating

Part – A (10*2=20)
1 Define Syntax and Semantics. CO1 K1

2 What is Lexical Analyzer? CO1 K1


3 Distinguish between Static scope and Dynamic scope CO2 K2
4 What do you mean by garbage collection? CO2 K1

5 Mention the implementation models of parameter passing. CO3 K1

6 Provide an example for user defined overloaded function in Java. CO3 K1

7 Draw the flow diagram of different states of a Task. CO4 K1

8 Write a C++ program to illustrate the use of ‘this’ pointer. CO4 K1


9 List any four numeric functions in Scheme. CO5 K1

10 When the prepositions are said to be Horn clauses? Give an example. CO5 K1

Part – B (5*16=80)
a) What are the formal methods of describing the syntax? Explain the Grammar in CO1 K2
11 detail.
Or
b) Define Attribute Grammar. Generate the fully attributed parse tree for the assignment K2
statement B = C * D – E CO1
a) Explain in detail about the Pointers and References. K2
CO2
12 Or
b) What is meant by data type ?What are the various Primitive Data type .Evaluate the
CO2 K2
various data types
a) What are the various parameter Passing methods Explain with an example CO3 K2
13 Or
b) What is Overloaded methods .Explain the generic methods CO3 K2
a) How the different types of semaphores to synchronize the tasks? Explain. In what
CO4 K2
14 way the monitors are different semaphores?
Or K2
CO4
b) How the Exceptions are handled in C++? Explain with suitable examples.
a) Compare the functional features of LISP, Scheme and ML. Provide necessary CO5 K2
15 examples.
Or
b) Discuss about Predicate calculus. How are they used to prove the theorems? Explain K3
CO6
with proper examples.

SUBJECT IN-CHARGE
HOD

You might also like