Scribd
Upload
1K views3 pages

CCS358 QP

This document is a question paper for the B.E./B.Tech. degree examinations in Information Technology, specifically for the course CCS358 on Principles of Programming Languages. It includes various sections with questions categorized by cognitive levels, covering topics such as syntax, semantics, programming paradigms, and parsing methods. The paper consists of multiple parts, including lower-order and higher-order cognitive questions, with a total maximum score of 100 marks.

Uploaded by

dhurgadevi.m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
1K views3 pages

CCS358 QP

This document is a question paper for the B.E./B.Tech. degree examinations in Information Technology, specifically for the course CCS358 on Principles of Programming Languages. It includes various sections with questions categorized by cognitive levels, covering topics such as syntax, semantics, programming paradigms, and parsing methods. The paper consists of multiple parts, including lower-order and higher-order cognitive questions, with a total maximum score of 100 marks.

Uploaded by

dhurgadevi.m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Reg. No.

:
ADITHYA INSTITUTE OF TECHNOLOGY
(AUTONOMOUS)

Question Paper Code: 205503


B.E., /B.Tech., DEGREE EXAMINATIONS, NOVEMBER / DECEMBER - 2024
Fifth Semester
Information Technology
CCS358– Principles of Programming Languages
(Regulations 2021)
Time: Three Hours Maximum Marks: 100 Marks

Answer all the questions

Part- A (10 x 2 = 20 marks)


Note to question paper setter
 Five questions should be of lower order (LO) cognitive type i.e. remembrance type questions.
 Five questions should be of intermediate order (IO) cognitive type i.e. understanding type questions.
1 Differentiate complier and interpreter. CO1
2 Define Syntax and Semantics. CO1
3 Infer the term short-circuit evaluation. CO2
4 Discuss the importance of guarded statement. CO2
5 Differentiate procedures and functions. CO3
6 Define dynamic scoping with example. CO3
7 Extend the importance of semaphore. CO4
8 In what ways are exception handling and event handling related? CO4
9 Examine the limitations of logic programming. CO5
10 Define Multiparadigm programming. CO5
Part-B (5 x 13 = 65 marks)
Note to question paper setter
 Two or three questions (both subdivisions) should be of lower order (LO) cognitive type i.e. remembrance
type questions.
 Two or three questions (both subdivisions) should be of intermediate order (IO) cognitive type i.e.
understanding type questions.
11a Explain the three formal methods of describing syntax. CO1
OR
11b Illustrate recursive descent parsing process and LR parser with its CO1
structure.
12a Examine how to implement multiple selection structures and brief about CO2
the guarded commands.
OR
12b Elucidate about how record types are implemented in programming languages and CO2
how it references to record fields.
13a Discuss about the generic subprograms with example. Express the design issues of CO3
functions.
OR
13b Interpret the three methods of parameter passing models and its CO3
implementation methods with its advantages.
14a Discuss inheritance with dynamic binding and show how an object ins allocated and CO4
deallocated in programming languages.
OR
14b Interpret Cooperation synchronization and competitive synchronization in message CO4
passing.
15a i) Explain about ML and compare it with other languages. CO5
ii) Describe about functional description of ML.
OR
15b Define logic programming and write about proposition. Discuss the applications of CO5
logic programming.

Part-C (1 x 15 = 15 marks)
Compulsory Questions
(Application / Design / Analysis / Evaluation / Creativity / Case study questions)
Part C should be a Higher Order cognitive type question
16 a Design and implement a C++ program to get the average marks of six subjects CO4
using the multiple inheritance and document on it.
OR
16 b Construct LR parsing table for the given arithmetic expression grammar and CO5
define all the parser actions.
1. E E + T
2. E T
3. T T * F
4. T F
5. F (E)
6. Fid
Parse the string id + id * id using the above algorithm.

You might also like