|
|
Syllabus of Andhra University MCA - MCA 1.2.3 Principles of Programming Languages
With effect from 2004-05 admitted batch
Instruction: 3 Periods/week
Sessional Marks: 50
Univ-Exam-Marks:100
Time: 3 Hours
1. The Role of Programming Languages:- Toward Higher-level Languages, Problems of Scale, Programming Paradigms, Language Implementation Bridging the Gap
2. Language Description:- Syntactic Structure: Expression Notations, Abstract Syntax Trees, Lexical Syntax, Context -Free Grammars, Grammars for Expressions, Variants of Grammars
I IMPERATIVE PROGRAMMING:
3. Statements: Structured Programming:- The Need for Structured Programming, Syntax-Directed Control Flow, Design Considerations: Syntax, Handling Special Cases in Loops, Programming with invariants, Proof Rules for Partial Correctness, Control flow in C.
4. Types: Data Representation:- The Role of Types, Basic Types, Arrays Sequences of Elements, Records: Named Fields, Unions and variant Records, Sets, Pointers: Efficiency and Dynamic Allocation, Two String Tables, Types and Error Checking.
5. Procedure Activations:- Introduction to Procedures, Parameter-passing Methods, Scope Rules for Names, Nested Scopes in the Source Text, Activation Records, Lexical Scope: Procedures as in C, Lexical Scope: Nested Procedures and Pascal.
II OBJECT ORIENTED PROGRAMMING:
6. Groupings of Data and Operations:- Constructs fro Program Structuring, Information Hiding, Program Design with Modules, Modules and Defined Types, Class Declarations in C++, Dynamic Allocation I C++, Templates: Parameterized Types, Implementation of Objects in C++.7. Object-Oriented Programming:- What is an Object?, Object-Oriented Thinking,Inheritance, Object-Oriented Programming in C++, An extended C++ example, Derived Classes and information Hiding, Objects in Smalltalk, Smalltalk Objects have self.
III FUNCTIONAL PROGRAMMING:
8. Elements of Functional Programming:- A little Language of expressions, Types : Valuesand Operations, Function declarations, Approaches to Expression Evaluation, Lexical Scope,Type Checking.
9. Functional Programming in a Typed Languages:- Exp loring a List, Function Declarationby Cases, Functions as First-Class Values, ML: Implicit Types, Data Types, Exception Handling in M, Little quit in Standard ML
10. Functional Programming with Lists:- Scheme, a Dialect of Lisp, The Structure of Lists,List Manipulation, A Motivating Example: Differentiation, Simplification of Expressions,Storage Allocation for Lists.
IV OTHER PARADIGMS:
11. Logic Programming:- Computing with Relations, Introduction to Prolog, Data Structures inProlog, Programming techniques, Control in Prolog, Cuts.
12. An Introduction to Concurrent Programming:- Parallelism in Hardware, Streams:Implicit Synchronization, Concurrency as interleaving, Liveness Properties, Safe Access toShared Data, Concurrency in Ada, Synchronized Access to Shared variables.
Text Book:
Programming Languages – Concepts & Constructs , Ravi Sethi, Pearson Education.
References:
1. Programming Languages – Design & Implementation ,Terrance W. Pratt, Marvin V. Zelkowitz, Pearson Education.
2. Concepts of Programming Languages – Robert L. Sebesta, Pearson Education.
|
No responses found. Be the first to respond and make money from revenue sharing program.
|