DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Similar documents
R13 SET Discuss how producer-consumer problem and Dining philosopher s problem are solved using concurrency in ADA.

St. MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad

INSTITUTE OF AERONAUTICAL ENGINEERING

Programming Languages, Summary CSC419; Odelia Schwartz

6. Discuss how producer-consumer problem and Dining philosophers problem are solved using concurrency in ADA. [16]

G COURSE PLAN ASSISTANT PROFESSOR Regulation: R13 FACULTY DETAILS: Department::

CMSC 331 Final Exam Section 0201 December 18, 2000

1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.

11. a b c d e. 12. a b c d e. 13. a b c d e. 14. a b c d e. 15. a b c d e

Programming Languages Third Edition. Chapter 7 Basic Semantics

S.No Question Blooms Level Course Outcome UNIT I. Programming Language Syntax and semantics

COURSE DESCRIPTION FORM. Level Credits Periods/ Week Prerequisites

NOTE: Answer ANY FOUR of the following 6 sections:

Semester Review CSC 301

G Programming Languages - Fall 2012

SE352b: Roadmap. SE352b Software Engineering Design Tools. W3: Programming Paradigms

CSE 307: Principles of Programming Languages

CMSC 331 Final Exam Section 0201 December 18, 2000

Object Oriented Paradigm

CS 415 Midterm Exam Spring 2002

Concepts of Programming Languages

Test 1 Summer 2014 Multiple Choice. Write your answer to the LEFT of each problem. 5 points each 1. Preprocessor macros are associated with: A. C B.

UNIT 3

Programming Languages (PL)

PL Revision overview

The results for a few specific cases below are indicated. allequal ([1,1,1,1]) should return true allequal ([1,1,2,1]) should return false

CS 314 Principles of Programming Languages

CSCI 3155: Principles of Programming Languages Exam preparation #1 2007

G Programming Languages Spring 2010 Lecture 4. Robert Grimm, New York University

Programming Languages Third Edition. Chapter 10 Control II Procedures and Environments

Introduction to Programming Using Java (98-388)

Thanks! Review. Course Goals. General Themes in this Course. There are many programming languages. Teaching Assistants. John Mitchell.

Lecture Notes on Programming Languages

Whom Is This Book For?... xxiv How Is This Book Organized?... xxiv Additional Resources... xxvi

Introduction Primitive Data Types Character String Types User-Defined Ordinal Types Array Types. Record Types. Pointer and Reference Types

Implementing Subprograms

11/6/17. Functional programming. FP Foundations, Scheme (2) LISP Data Types. LISP Data Types. LISP Data Types. Scheme. LISP: John McCarthy 1958 MIT

MIDTERM EXAMINATION - CS130 - Spring 2005

Chapter 9. Subprograms

0. Overview of this standard Design entities and configurations... 5

Programming Languages 2nd edition Tucker and Noonan"

Short Notes of CS201

CGS 2405 Advanced Programming with C++ Course Justification

CS201 - Introduction to Programming Glossary By

Question No: 1 ( Marks: 1 ) - Please choose one One difference LISP and PROLOG is. AI Puzzle Game All f the given

Get Unique study materials from

Outline. Programming Languages 1/16/18 PROGRAMMING LANGUAGE FOUNDATIONS AND HISTORY. Current

10. Abstract Data Types

Lecture 13: Object orientation. Object oriented programming. Introduction. Object oriented programming. OO and ADT:s. Introduction

Subprograms. Copyright 2015 Pearson. All rights reserved. 1-1

Imperative Programming

Lecture 7: Type Systems and Symbol Tables. CS 540 George Mason University

Chapter 3:: Names, Scopes, and Bindings (cont.)

Chapter 3:: Names, Scopes, and Bindings (cont.)

Names, Bindings, Scopes

CS 3360 Design and Implementation of Programming Languages. Exam 1

1. Describe History of C++? 2. What is Dev. C++? 3. Why Use Dev. C++ instead of C++ DOS IDE?

Chapter 9. Subprograms

Absolute C++ Walter Savitch

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

The Decaf Language. 1 Lexical considerations

Semantic Analysis. CSE 307 Principles of Programming Languages Stony Brook University

Principles of Programming Languages [PLP-2015] Detailed Syllabus

Informal Semantics of Data. semantic specification names (identifiers) attributes binding declarations scope rules visibility

CSC 533: Organization of Programming Languages. Spring 2005

Introduction to Scheme

Chapter 11. Categories of languages that support OOP: 1. OOP support is added to an existing language


The PCAT Programming Language Reference Manual

Course Description. Learn To: : Intro to JAVA SE7 and Programming using JAVA SE7. Course Outline ::

CMSC 330: Organization of Programming Languages. Operational Semantics

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

14. Exception Handling

Principles of Programming Languages. Lecture Outline

CPS 506 Comparative Programming Languages. Programming Language Paradigm

CS 314 Principles of Programming Languages

CS508-Modern Programming Solved MCQ(S) From Midterm Papers (1 TO 22 Lectures) BY Arslan

Microsoft. Microsoft Visual C# Step by Step. John Sharp

1 Lexical Considerations

Contents. Chapter 1 SPECIFYING SYNTAX 1

Welcome to Teach Yourself Acknowledgments Fundamental C++ Programming p. 2 An Introduction to C++ p. 4 A Brief History of C++ p.

Lexical Considerations

CPSC 3740 Programming Languages University of Lethbridge. Data Types

CPS 506 Comparative Programming Languages. Programming Language

Chapter 5 Names, Binding, Type Checking and Scopes

The Decaf language 1

Informatica 3 Syntax and Semantics

Microsoft Visual C# Step by Step. John Sharp

Object-Oriented Programming

An Object Oriented Programming with C

VALLIAMMAI ENGINEERING COLLEGE

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

OBJECT ORIENTED PROGRAMMING USING C++

Abstract Data Types and Encapsulation Concepts

Interview Questions of C++

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

/99/$ IEEE

Weiss Chapter 1 terminology (parenthesized numbers are page numbers)

Functional Programming. Pure Functional Programming

Transcription:

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : I Year / II Semester Section : CSE - I Subject Code : CS7203 Subject Name : PRINCIPLES OF PROGRAMMING LANGUAGES Degree & Branch : M.E C.S.E. UNIT - 1 1. Why is it useful for a programmer to have some background in language design, even though he or she may never actually design a programming language 2. How can knowledge of programming language characteristics benefit the whole computing community? 3. What language was the first to support the three fundamental features of object-oriented programming 4. What are the three fundamental features of an object-oriented programming language 5. Define Syntax and Semantics. 6. Who are language descriptions for? 7. Describe the operation of a general language generator. 8. Describe the operation of a general language recognizer. 9. What is the difference between a sentence and a sentential form? 10. What the primary use of attribute grammars? 11. Describe the two levels of uses of operational semantics. 12. On what branch of math is axiomatic semantics based? 13. What is the use of the WP function? Why it is called a predicate transformer? 14. Give the difference between total correctness and partial correctness.

15. What are the design issues for names? 16. What is an Alias 17.. What is the l value of a variable? 18. What is the r value.what is Block 19. What are the advantages of named constant? 20. What is Bottom up parsing 1. What are the formal methods of describing the syntax? Explain the Grammar. 2. What are the rules of EBNF. Explain in detail the advantage and disadvantage of EBNF.Compare the BNF with EBNF 3. Explain Dynamic semantics 4. What is Parsing problem? What are the two parsing algorithms What are the complexities of Parsing process 5. What is Lexical Analyzer.What are the approaches for building a lexical analyzer. Implement using an example using state diagram 6. Explain Attribute Grammar 7. Explain life time.what is Referencing environment 8. Explain Semantics.What are the various methods 9. What is recursive Parsing 10. What is bottom Parsing UNIT - 2 1. What are the advantages and disadvantages of decimal data types? 2. What are the design issues for character string types? 3. Describe the three string length option. 4. Describe ordinal, enumeration, and subrange types. 5. What are the advantages of user-defined enumeration types? 6. What are the design issues for arrays?

7. Define row major order and column major order. 8. Define fully qualified and elliptical references to fields in records. 9. Define union, free union and discriminated union. 10. What are the design issues for unions? 11. What is a compatible type? 12. Define type error. 13. Define strongly typed. 14. What is a ternary operator? 15. What is a prefix operator? 16. What operator usually has right associatively? 17. What is no associative operator? 18. What is a conditional expression? 19. What is short-circuiting evaluation? 20. What is cast? 1. Explain briefly about scope and its lifetime 2. What is binding.how the variables are binded. What are the various methods of binding 3. Explain in detail the Pointers and References 4. Explain in detail the attribute grammar 5. Explain Arithmetic expression? Explain with example Relational and Boolean Expressions. 6. What is meant by data type?what are the various Primitive Data type.evaluate the various data types 7. Explain briefly about control Structures 8. Explain Overloaded Operators 9. What is Selection?Explain various branching Statements 10. What are the various assignments statements

UNIT- 3 1. What are the three general characteristics of subprograms? 2. What are formal parameters? What are actual parameters? 3. What are the differences between a function and a procedure?. 4. What are the design issues for subprograms?. What is an overloaded subprogram? 5. What is ad hoc binding? 6. What is multicast delegate? 7. What exactly is a delegate? 8. What is a closure? 9. Which of the caller or callee saves execution status information? 10. What is the task of a linker? 11. What is the difference between an activation record and an activation record instance? 12. What kind of machines often use registers to pass parameters? 13. What is an EP, and what is its purpose? 14. What are the issues of Subprogram 15. What is Local referencing 16. What is Global referencing 17. What are design issues of functions 18. What is Dynamic scoping 19. Write an example of call and return statements 20. What is Stack and dynamic local variables 1. What is subprogram Explain with an example 2. What are the design issues of subprogram 3. What are the various parameter Passing methods Explain with an example 4. What is Overloaded methods.explain the generic methods 5. Explain the design issues of functions 6. What is Semantic call.explain

7. Implant the various subprogram 8. Explain stack and dynamic variables 9. Explain the nested subprograms 10. What is dynamic scoping UNIT-4 1. What are the two kinds of abstractions in programming language? 2. Define abstract data type. 3. What is the difference between private and limited private types in Ada? 4. What is the use of the Ada with clause? 5. What is the use of the Ada use clause? 6. What is the fundamental difference between a C++ class and an Ada package? 7. What is the purpose of a C++ destructor? 8. What are the legal return types of a destructor? 9. What are initializes in Objective-C? 10. What is the use of @private and @public directives? 11. Where are all Java methods defined? 12. What is a friend function? What is a friend class? 13. What is a C++ namespace, what is its purpose? 14. What is the advantage of inheritance? 15. What is message protocol? 16. What is an overriding method?\ 17. What is dynamic dispatch? 18. From where are Smalltalk objects allocated? 19. What kind of inheritance, single or multiple, does Smalltalk support?. 20. How are C++ heap-allocated objects de allocated?. 1. What are the design issues of OOP languages 2. Implement the oops constructor 3. Explain with an example Concurrency

4. Explain with an example about semaphores 5. Explain with an example monitors 6. Explain with an example about message passing 7. What is Thread explain 8. What are the various methods of Exception handling 9. What is State level concurrency 10. What is Event handling Unit-5 1. What data types were parts of the original LISP?. 2. Explain why QUOTE is needed for a parameter that is a data list. 3. What is a simple list? 4. -What does the abbreviation REPL stand for? 5. What are the two forms of DEFINE? 6.. Why are CAR and CDR so named?. 7. What is tail recursion? Why is it important to define functions that use recursion to specify repetition to be tail recursive? 8. -. Why were imperative features added to most dialects of LISP? 9. What is type inferencing, as used in ML? 10. -. What is a curried function?. 11. What does partial evaluation mean? 12. -. What is the use of the evaluation environment table? 13. -. Explain the process of currying. 14. How is the functional operator pipeline ( > ) used in F#? 15. What is exception propagation in Ada?. 16. What is the scope of exception handlers in Ada 17.. What are the four exceptions defined in the Standard package of Ada? 18.. What is the use of Suppress pragma in Ada?- 19.. What is the name of all C++ exception handlers? 20.. What is the use of the assert statement?

1. What is lamda? Describe briefly 2. Write the fundamentals of FP languages 3. Write a Program with scheme 4. Explain in brief about programming with ML 5. Describe Logic and Logic Programming 6. Explain Prolog 7. What are the Multi paradigm languages 8. Explain the various programming languages 9. Write a program in scheme 10. Write an program using prolog