Skip to content

B.Tech 2nd Year Principles of Programming Languages Study Materials BOOKPDF 2020| Download B.Tech 2nd Year Principles of Programming Languages Study Materials 2020

Here, we have provided the links which contains the study materials which will help you in studying and preparing for your examinations of the B.Tech 2nd Year Principles of Programming Languages. Referring to the links we’ve provided below and the links which contains the study materials in PDF Format along with the list of recommended books which we’ve provided below, you will be able to ace your examinations. We have also provided you the further details which will allow you to do well in your exams and learn more. These study materials help you understand the concepts and everything easily and creates a better space for you to work on. These study materials give you the best resources to study from.

Objectives of Principles of Programming Languages

  • Helps a student understand syntax, semantics of programming languages.
  • This helps to analyze data, type of data, basic statements and call return architecture and ways to implement them.
  • Helps in understanding more about object orientation, concurrency, event handling.
  • Helps to develop programs in non-procedural programming paradigms.

Download B.Tech 2nd Year Principles of Programming Languages

principles of programming languages textbook Download
 principles of programming languages ebook  Download
 principles of programming languages lecture note ppt  Download
 principles of programming languages Question paper Pdf  Download
 Principles of Programing Language Lecture Notes Pdf Download
 Principles of Programing Language Pdf Download

Recommended Books

  • Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison Wesley, 2012.
  • Programming Languages, Principles & Paradigms, 2ed, Allen B Tucker, Robert E Noonan, TMH
  • R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press, 2009.
  • Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall, 1998.
  • Richard A. O’Keefe, “The craft of Prolog”, MIT Press, 2009.
  •  W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition, Springer, 2003

Syllabus

UNIT- I:

Syntax and semantics: Evolution of programming languages, describing syntax, context, free grammars, attribute grammars, describing semantics, lexical analysis, parsing, recursive – decent bottom-up parsing

UNIT -II:

Data, data types, and basic statements: Names, variables, binding, type checking, scope, scope rules, lifetime and garbage collection, primitive data types, strings, array types, associative arrays, record types, union types, pointers and references, Arithmetic expressions, overloaded operators, type conversions, relational and boolean expressions , assignment statements , mixed mode assignments, control structures – selection, iterations, branching, guarded Statements

UNIT -III:

Subprograms and implementations: Subprograms, design issues, local referencing, parameter passing, overloaded methods, generic methods, design issues for functions, the semantics of call and return, implementing simple subprograms, stack and dynamic local variables, nested subprograms, blocks, dynamic scoping

UNIT -IV:

Object- orientation, concurrency, and event handling: Object – orientation, design issues for OOP languages, implementation of object, oriented constructs, concurrency, semaphores, Monitors, message passing, threads, statement level concurrency, exception handling, event handling

UNIT -V:

Functional programming languages: Introduction to lambda calculus, fundamentals of functional programming languages, Programming with Scheme, – Programming with ML,

UNIT -VI:

Logic programming languages: Introduction to logic and logic programming, – Programming with Prolog, multi-paradigm languages

Important Questions

  • How do you describe the meanings of programs using dynamic semantics?
  •  Explain in detail about recursive descent parsing.
  • Give an example of a left-recursive rule in CFG. What is the significance of the left Recursive rule?
  •  Explain about the following
    i) associative arrays ii) union types
  •  State whether the static binding is more reliable or dynamic binding. Justify.
  • Define a function. What are the design issues for functions? Explain.
  • Explain how a subprogram is overloaded? Give examples.
  •  Compare and contrast the cooperation synchronization and competition synchronization in message passing.
  • Explain the basic concepts of exception handling.
  • How is ML different from other functional programming languages?
  •  Why were imperative features added to most dialects of LISP?
  • Explain how RDBMS and expert systems are helped using logic programming.
  • Discuss Terms and Goal statements in Prolog with examples.

Leave a Reply

Your email address will not be published. Required fields are marked *