0% found this document useful (0 votes)
16 views5 pages

PPL QUESTION BANK

The document is a question bank for a course on Principles of Programming Languages, structured into five units with both Part A and Part B questions. It covers various topics including definitions, concepts, and comparisons related to programming languages, syntax, semantics, data types, subprograms, object-oriented programming, concurrency, and functional programming. Each unit contains a series of questions aimed at assessing understanding of key principles and methodologies in programming languages.

Uploaded by

ammuraks2000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views5 pages

PPL QUESTION BANK

The document is a question bank for a course on Principles of Programming Languages, structured into five units with both Part A and Part B questions. It covers various topics including definitions, concepts, and comparisons related to programming languages, syntax, semantics, data types, subprograms, object-oriented programming, concurrency, and functional programming. Each unit contains a series of questions aimed at assessing understanding of key principles and methodologies in programming languages.

Uploaded by

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

21150E56H / 22AIDC56H-PRINCIPLES OF PROGRAMMING LANGUAGES

QUESTION BANK
UNIT 1
PART A
1. Define programming language.
2. Define syntax of LISP.
3. What is the primary use of attribute grammar?
4. What is mean by parse tree?
5. Define parsing.
6. Differentiate static from dynamic semantics.
7. List the two tasks of parser.
8. Define bottom up parsing.
9. What is syntax analysis?
10. Define lexeme.

PART B
1. Describe the difference between top-down and bottom-parsers.
2. Explain the concept of lexical analysis.
3. Explain the formal methods for describing a syntax.
4. Discuss on semantics with example.
5. Explain the concept of LL parsing.
6. Describe the concept of evolution of programming languages.
UNIT 2
PART A

1. List the merits and demerits of dynamic scoping.


2. What are the design issues for character string types?
3. What is the purpose of scope?
4. Define referential transparency.
5. List the four attributes used for variable.
6. Define garbage collection.
7. What are the two user defined data types?
8. What is sub range?
9. Define counter-controlled loop.
10. Define the terms l-value and r-value.

PART B

1. Describe the concept of binding.


2. Explain the concept of string types with example.
3. What is primitive data types? Explain the different types of data types with example.
4. Explain the concept of array types with example.
5. Discuss on pointers with example.
6. What are selection statements? Elaborate the two general categories.
UNIT 3
PART A

1. Define blocks.
2. Distinguish between actual parameters and formal parameters.
3. List the characteristics of sub programs.
4. What are the two potential problems with the static-chain method?
5. Define subprograms.
6. Mention the two types of local variables.
7. What are the design issues in functions?
8. Define closure.
9. What is overloading?
10. Differentiate shallow access from deep access.

PART B
1. What are the design issues for subprograms? How it can be solved? Analyze.
2. Explain the parameter passing methods.
3. Explain the two methods of implementing blocks.
4. Discussion on overloaded methods.
5. Explain the implementation of sub programs with example.
6. Discuss on dynamic scoping.
UNIT 4
PART A

1. Define object-oriented programming.


2. List the general issues for functions.
3. Define monitors.
4. Define message passing.
5. What is CIR?
6. What are the two types of concurrency?
7. What are the ways to synchronize C# threads?
8. Mention the merits of OOP.
9. Define binary semaphore.
10. Define statement level concurrency.

PART B
1. Describe the design issues for object-oriented languages.
2. Explain the concept of concurrency.
3. Explain the concept of thread with example.
4. What are semaphores? Describe the actions of the wait and release operations.
5. Describe event handling with example.
6. Discuss on exception handling.
UNIT 5
PART A

1. Write the syntax for lambda calculus.


2. Mention the applications of logic programming.
3. How the objects are represented in propositions?
4. Define Haskell.
5. What does lambda expressions specify?
6. List the features of functional programming languages.
7. What is CAR?
8. Define programming paradigm.
9. What is beta conversion?
10. Define goal and rule order.

PART B

1. Explain the concept of functional programming language.


2. Describe the concept of scheme with example.
3. What is ML? what are the two ways that ML is fundamentally from scheme? Describe
the actions of the ML filter function.
4. What is prolog? Explain how back tracking works in prolog.
5. Explain the concept of multi-paradigm languages.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy