JNTU

JNTU B.Tech III PRINCIPLES OF PROGRAMMING LANGUAGES Previous Question Paper (March-2024 - R13)

B.Tech | III | I | R13 | March-2024

Answer PaperPaper Code: 115ANMaximum Marks: 75Time: 3 hours

Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.

Part A

125 marks
a

Define parse tree and provide an example.

2 marks

Answer

A parse tree is a graphical representation of the derivation of a string from a context-free grammar, where the root is the start symbol, internal nodes are non-terminals, and leaves are terminals. For a grammar S -> aSb | ab, the parse tree for string 'aabb' has S as the root, with children 'a', S, and 'b', where the inner S branches into 'a', 'b'.

b

Give an example of ambiguous grammer.

3 marks

Answer

A grammar is ambiguous if it generates more than one parse tree for a single string. A classic example is the expression grammar: E -> E + E | E * E | id. For the string id + id * id, this grammar allows two distinct parse trees, one prioritizing the addition and the other prioritizing the multiplication.

c

What do you mean by short-circuit evaluation?

2 marks

Answer

Sign in to view the complete answer paper.

d

What is an associative array?

3 marks

Answer

Sign in to view the complete answer paper.

e

Define sub program.

2 marks

Answer

Sign in to view the complete answer paper.

f

What are the design issues of sub-programs?

3 marks

Answer

Sign in to view the complete answer paper.

g

What is a semaphore?

2 marks

Answer

Sign in to view the complete answer paper.

h

Define concurrency. State the need for concurrency.

3 marks

Answer

Sign in to view the complete answer paper.

i

What are the features of Haskell?

2 marks

Answer

Sign in to view the complete answer paper.

j

Compare functional languages and procedural languages.

3 marks

Answer

Sign in to view the complete answer paper.

Part B

210 marks
a

A programming language can be compiled or interpreted. Give relative advantages and disadvantages of compilation and interpretation. Give examples of compiled and interpreted languages.

5 marks

Answer

Sign in to view the complete answer paper.

b

In what way do operational semantics differ from denotational semantics? Explain.

5 marks

Answer

Sign in to view the complete answer paper.

OR
310 marks
a

List and explain the reasons for studying concepts of programming languages.

5 marks

Answer

Sign in to view the complete answer paper.

b

What purpose do predicates serve in attribute grammar? Give illustrations.

5 marks

Answer

Sign in to view the complete answer paper.

410 marks
a

Define Data Type. Explain in detail various primitive data types.

4 marks

Answer

Sign in to view the complete answer paper.

b

Explain the compound statements.

3 marks

Answer

Sign in to view the complete answer paper.

c

Difference between pointer and references.

3 marks

Answer

Sign in to view the complete answer paper.

OR
510 marks
a

Discuss the variable initialization and variable definition.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain the design issues for all the iterative control statements.

5 marks

Answer

Sign in to view the complete answer paper.

610 marks
a

Give an overview of relational and problem expressions.

5 marks

Answer

Sign in to view the complete answer paper.

b

Discuss the scope and lifetime of the variable.

5 marks

Answer

Sign in to view the complete answer paper.

OR
710 marks
a

Discuss the design issues of subprograms.

5 marks

Answer

Sign in to view the complete answer paper.

b

What do you mean by local referencing environment? Explain.

5 marks

Answer

Sign in to view the complete answer paper.

810 marks
a

Explain how Binary semaphore provides the solution to the competition synchronization problem with example pseudo-code.

5 marks

Answer

Sign in to view the complete answer paper.

b

What is exception handling? Explain exception handling in Java.

5 marks

Answer

Sign in to view the complete answer paper.

OR
910 marks
a

Give an overview of Java threading.

5 marks

Answer

Sign in to view the complete answer paper.

b

What are the basic elements of prolog? Explain.

5 marks

Answer

Sign in to view the complete answer paper.

1010 marks
a

Write down the features of functional and imperative languages.

5 marks

Answer

Sign in to view the complete answer paper.

b

Explain bindings and scope in python.

5 marks

Answer

Sign in to view the complete answer paper.

OR
1110 marks
a

Explain the fundamentals of Functional Programming language.

5 marks

Answer

Sign in to view the complete answer paper.

b

List and explain the common characteristics of the scripting languages.

5 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of PRINCIPLES OF PROGRAMMING LANGUAGES from JNTU for B.Tech CSE III I, March-2024, R13.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in PRINCIPLES OF PROGRAMMING LANGUAGES

Loading Question Papers

Fetching data from database...