0% found this document useful (0 votes)
122 views9 pages

CCS358 Programming Languages Question Bank

This document is a question bank for the Principles of Programming Languages course for the VI Semester B.E./B.Tech in Artificial Intelligence and Data Science at Nadar Saraswathi College of Engineering and Technology. It includes a comprehensive list of questions categorized by units, covering topics such as programming language design, data types, subprograms, object-oriented programming, and functional programming. The question bank is structured into Part-A, Part-B, and Part-C, with varying marks assigned to each question.

Uploaded by

ishaniamutha08
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
0% found this document useful (0 votes)
122 views9 pages

CCS358 Programming Languages Question Bank

This document is a question bank for the Principles of Programming Languages course for the VI Semester B.E./B.Tech in Artificial Intelligence and Data Science at Nadar Saraswathi College of Engineering and Technology. It includes a comprehensive list of questions categorized by units, covering topics such as programming language design, data types, subprograms, object-oriented programming, and functional programming. The question bank is structured into Part-A, Part-B, and Part-C, with varying marks assigned to each question.

Uploaded by

ishaniamutha08
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

NAC/TLP-

Format No.
07a
Nadar Saraswathi College of Engineering and Technology,
Rev. No.
Vadapudupatti, Theni - 625 531
Date
(Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai)
Total Pages

Question Bank for the Units – I to V

SEM-06 VI Semester– B.E. / [Link].

Department of Artificial Intelligence and Data Science

CCS358-Principles of Programming Languages

Part-A (10 x 2 = 20 Marks)

UNIT – I

No Question Level Competence Mark

1.1 Why is it useful for a programmer to have some 1 Knowledge


2
background in language design, even though he or she
may never actually design a programming language

1.2 How can knowledge of programming language 4 Analysis


2
characteristics benefit the whole computing
community?

1.3 What language was the first to support the three 1 Knowledge 2
fundamental features of object-oriented programming

1.4 What are the three fundamental features of an object- 4 Analysis 2


oriented programming language

1.5 4 Analysis 2
Define Syntax and Semantics.

1.6 1 Knowledge 2
Who are language descriptions for?

1.7 1 Knowledge 2
Describe the operation of a general language generator.

1.8 Describe the operation of a general language recognizer. 2 Comprehend 2

1.9 What is the difference between a sentence and a 6 Synthesis 2


sentential form?

1.10 What the primary use of attribute grammars? 3 Application 2

1.11 Describe the two levels of uses of operational 1 Knowledge 2


semantics.
1.12 On what branch of math is axiomatic semantics based? 4 Analysis 2

1.13 What is the use of the WP function? Why it is called a 1 Knowledge 2


predicate transformer?

1.14 Give the difference between total correctness and partial 4 Analysis 2
correctness.

1.15 What are the design issues for names? 4 Analysis 2

1.16 What is an Alias? 1 Knowledge 2

1.17 What is the l value of a variable? 1 Knowledge 2

1.18 What is the r value .What is Block 2 Comprehend 2

1.19 What are the advantages of named constant? 6 Synthesis 2

1.20 What is Bottom up parsing 3 Application 2

UNIT-II

2.1 What are the advantages and disadvantages of decimal 3 Application


2
data types?

2.2 4 Analysis
What are the design issues for character string types? 2

2.3 1 Knowledge
Describe the three string length option. 2

2.5 4 Analysis
Describe ordinal, enumeration, and subrange types. 2

2.6 What are the advantages of user-defined enumeration 4 Analysis


2
types?

2.7 1 Knowledge
What are the design issues for arrays? 2

2.8 1 Knowledge
Define row major order and column major order. 2

2.9 Define fully qualified and elliptical references to fields 2 Comprehend 2


in records.

2.10 Define union, free union and discriminated union. 6 Synthesis 2

2.11 What are the design issues for unions? 3 Application 2

2.12 What is a compatible type? 1 Knowledge 2

2.13 Define type error. 3 Application 2


2.14 Define strongly typed. 4 Analysis 2

2.15 What is a ternary operator? 1 Knowledge 2

2.16 What is a prefix operator? 4 Analysis 2

2.17 What operator usually has right associatively? 4 Analysis 2

2.18 What is a conditional expression? 1 Knowledge 2

2.19 What is cast? 1 Knowledge 2

UNIT-III

3.1 What are the three general characteristics of 6 Synthesis 2


subprograms?

3.2 What are formal parameters? What are actual 3 Application 2


parameters?

3.3 What are the differences between a function and a 1 Knowledge 2


procedure?.

3.4 What are the design issues for subprograms?. What is an 3 Application 2
overloaded subprogram?

3.5 What is ad hoc binding? 3 Application 2

3.6 What is multicast delegate? 1 Knowledge 2

3.7 What exactly is a delegate? 6 Synthesis 2

3.8 What is a closure? 3 Application 2

3.9 Which of the caller or callee saves execution status 1 Knowledge 2


information?

3.10 What is the task of a linker? 3 Application 2

3.11 What is the difference between an activation record and 4 Analysis 2


an activation record instance?

3.12 What kind of machines often use registers to pass 1 Knowledge 2


parameters?

3.13 What is an EP, and what is its purpose? 4 Analysis 2

3.14 What are the issues of Subprogram 4 Analysis 2

3.15 What is Local referencing 1 Knowledge 2


3.16 What is Local referencing 1 Knowledge 2

3.17 What are design issues of functions 2 Comprehend 2

3.18 What is Dynamic scoping 6 Synthesis 2

3.19 Write an example of call and return statements 3 Application 2

3.20 What is Stack and dynamic local variables 1 Knowledge 2

UNIT-IV

4.1 What are the two kinds of abstractions in programming 1 Knowledge 2


language?

4.2 Define abstract data type. 2 Comprehend 2

4.3 What is the difference between private and limited 6 Synthesis 2


private types in Ada?

4.4 What is the use of the Ada with clause? 3 Application 2

4.5 What is the use of the Ada use clause? 1 Knowledge 2

4.6 What is the fundamental difference between a C++ class 6 Synthesis 2


and an Ada package?

4.7 What is the purpose of a C++ destructor? 3 Application 2

4.8 What are the legal return types of a destructor? 1 Knowledge 2

4.9 What are initializes in Objective-C? 2 Comprehend 2

4.10 What is the use of @private and @public directives? 6 Synthesis 2

4.11 Where are all Java methods defined? 4 Analysis 2

4.12 What is a friend function? What is a friend class? 1 Knowledge 2

4.13 What is a C++ namespace, what is its purpose? 4 Analysis 2

4.14 What is the advantage of inheritance? 4 Analysis 2

4.15 What is message protocol? 1 Knowledge 2

4.16 What is an overriding method? 1 Knowledge 2


4.17 What is dynamic dispatch? 2 Comprehend 2

4.18 From where are Smalltalk objects allocated? 6 Synthesis 2

4.19 What kind of inheritance, single or multiple, does 3 Application 2


Smalltalk support?.

4.20 How are C++ heap-allocated objects de allocated?. 1 Knowledge 2

UNIT-V

5.1 What data types were parts of the original LISP?. 3 Application 2

5.2 Explain why QUOTE is needed for a parameter that is a 1 Knowledge 2


data list.

5.3 What is a simple list? 6 Synthesis 2

5.4 What does the abbreviation REPL stand for? 3 Application 2

5.5 What are the two forms of DEFINE? 1 Knowledge 2

5.6 Why are CAR and CDR so named?. 2 Comprehend 2

5.7 What is tail recursion? Why is it important to define 6 Synthesis


2
functions that use recursion to specify repetition to be
tail recursive?

5.8 Why were imperative features added to most dialects of 3 Application 2


LISP?

5.9 What is type inferencing, as used in ML? 4 Analysis 2

5.10 What is a curried function?. 1 Knowledge 2

5.11 What does partial evaluation mean? 4 Analysis 2

5.12 . What is the use of the evaluation environment table? 4 Analysis 2

5.13 Explain the process of currying. 1 Knowledge 2

5.14 How is the functional operator pipeline ( |> ) used in 1 Knowledge 2


F#?

5.15 What is exception propagation in Ada?. 2 Comprehend 2

5.16 What is the scope of exception handlers in Ada 6 Synthesis 2


5.17 What are the four exceptions defined in the Standard 3 Application 2
package of Ada?

5.18 What is the use of Suppress pragma in Ada? 1 Knowledge 2

5.19 What is the name of all C++ exception handlers? 3 Application 2

5.20 What is the use of the assert statement? 3 Application 2

Part-B (5 x 13 = 65 Marks)

UNIT 1

1.1 What are the formal methods of describing the syntax? 1 Knowledge 13
Explain the Grammar

1.2 What are the rules of EBNF. Explain in detail the advantage 3 Application 13
and disadvantage of EBNF .Compare the BNF with EBNF

1.3 4 Analysis 13
Explain Semantics .What are the various methods

1.4 1 Knowledge 13
What is recursive Parsing

1.5 1 Knowledge 13
What is bottom Parsing

UNIT-II

2.1 2 Comprehend
Explain briefly about scope and its lifetime 13

2.2 What is binding .How the variables are binded. What are the 6 Synthesis
13
various methods of binding

2.3 Explain in detail the Pointers and References 3 Application 13

2.5 Explain Arithmetic expression? Explain with example Relational 3 Application


13
and Boolean Expressions.

2.6 5 Evaluation
What are the various assignments statements 13

UNIT-III

3.1 3 Application
What is subprogram Explain with an example 13

3.2 4 Analysis
What are the design issues of subprogram 13

3.3 What are the various parameter Passing methods Explain with an 1 Knowledge
13
example

3.4 1 Knowledge
What is Overloaded methods .Explain the generic methods 13
3.5 5 Evaluation
Explain the design issues of functions 13

3.6 3 Application
What is Semantic call .Explain 13

3.7 2 Comprehend
Implant the various subprogram 13

3.8 6 Synthesis
Explain stack and dynamic variables 13

3.9 3 Application 13
Explain the nested subprograms

3.10 2 Comprehend
What is dynamic scoping 13

UNIT-IV

4.1 1 Knowledge
What are the design issues of OOP languages 13

4.2 3 Application
Implement the oops constructor 13

4.3 4 Analysis 13
Explain with an example Concurrency

4.4 1 Knowledge
Explain with an example about semaphores 13

4.5 1 Knowledge
Explain with an example monitors 13

4.6 5 Evaluation
Explain with an example about message passing 13

4.7 2 Comprehend
What is Thread explain 13

4.8 6 Synthesis
What are the various methods of Exception handling 13

4.9 3 Application 13
What is State level concurrency

4.10 2 Comprehend
What is Event handling 13

UNIT-V

5.1 1 Knowledge
What is lamda? Describe briefly 13

5.2 1 Knowledge
Write the fundamentals of FP languages 13

5.3 5 Evaluation
Write a Program with scheme 13

5.4 3 Application
Explain in brief about programming with ML 13
5.5 1 Knowledge
Describe Logic and Logic Programming 13

5.6 1 Knowledge
Explain Prolog 13

5.7 2 Comprehend
What are the Multi paradigm languages 13

5.8 6 Synthesis
What are the Multi paradigm languages 13

5.9 3 Application 13
Write a program in scheme

5.10 2 Comprehend
Write an program using prolog 13

Part-C (1x 15 = 15 Marks)

UNIT-I

1.1 1 Knowledge 15
Explain Dynamic semantics and Attribute Grammar

1.2 What is Parsing problem? What are the two parsing algorithms 3 Application
15
What are the complexities of Parsing process

1.3 What is Lexical Analyzer .What are the approaches for building a 1 Knowledge
lexical analyzer. Implement using an example using state 15
diagram

UNIT-II

2.1 Explain briefly about control Structures and Overloaded 1 Knowledge 15


Operators

2.2 3 Application 15
What is Selection ?Explain various branching Statements

2.3 What is meant by data type ?What are the various Primitive Data 1 Knowledge
15
type .Evaluate the various data types

UNIT-III

3.1 1 Knowledge 15

3.2 5 Evaluation 15

3.3 1 Knowledge 15

UNIT-IV
4.1 1 Knowledge 15

4.2 3 Application 15

4.3 1 Knowledge 15

4.4 5 Evaluation 15

UNIT-V

5.1 5 Evaluation 15

5.2 3 Application
15

5.3 1 Knowledge 15

L1: Knowledge, L2: Comprehension, L3: Application, L4: Analysis, L5: Evaluation, L6: Synthesis

Prepared By:

Staff Name: Mrs. [Link] , AP-AI&DS

STAFF IN CHARGE HOD PRINCIPAL

You might also like