BHARATHIDASAN UNIVERSITY, TIRUCHIRAPPALLI – 620 024.Master of Computer Application (M.C.A) - Course Structure under CBCS

(Applicable to the candidates admitted from the academic year 2011-2012 onwards)

Eligibility: A candidate who is a graduate in Mathematics or Physics or Chemistry or Statistics or Computer Science or Information Technology or Industrial Electronics or Applied Science (with Mathematics as an allied subject / major subject) or B.Com. or B.B.A. or B.E. / B. Tech. (except Computer Science Engineering Branch) / AMIE of this University or from a recognized University or a Examination accepted by the syndicate as equivalent thereto

Lateral entry: PGDCA OR B.Sc. Computer Science OR B.Sc. Information Technology OR BCA

Semester Course Course Title

Ins. Hrs / Week

Credit ExamHrs

MarksTotalInt. Extn.

I

Core Course – I (CC) Digital Electronics and Computer Organization 5 4 3 25 75 100

Core Course – II (CC) Data Structures and Algorithms 5 4 3 25 75 100

Core Course – III (CC) Operating Systems 4 4 3 25 75 100Core Course – IV (CC) Programming with C++ 5 4 3 25 75 100Core Course – V (CC) OOAD and UML 5 4 3 25 75 100

Core Course – VI (CC)C++ Programming Lab (Applied to Data Structures & Algorithms)

3 2 3 40 60 100

Core Course – VII (CC) OS Lab (DOS & UNIX ) 3 2 3 40 60 100Total 30 24 - - - 700

II

Core Course – VIII (CC) Computer Networks 5 4 3 25 75 100Core Course – IX (CC) Data Base Systems 5 4 3 25 75 100Core Course – X (CC) Software Engineering 4 4 3 25 75 100Core Course – XI (CC) Programming with Java 5 4 3 25 75 100Core Course – XII (CC) Java Programming Lab 3 2 3 40 60 100

Core Course – XIII (CC) RDBMS Lab (Oracle 9i with SQL) 3 2 3 40 60 100

Elective – I (EC) Any one from the Given List 5 4 3 25 75 100Total 30 24 - - - 700

Recommended Credits Distribution: (Total should not be less than 140 Credits)

Course Type Course Credits Total CreditsCore (Theory) 20 4 80Core (Practical) 10 2 20Core (Major Project ) 1 16 16Elective 5 4 20Professional Skill 1 2 2Skill Development 1 2 2Total 38 140

Professional Skill Course:

This course is intended to make the students to learn Hardware Assembly, Trouble Shooting a Computer System and Peripherals, configuration Management, System Maintenance, Installation of Software Tools & Packages, Network Fundamentals, System Administration, etc.,

No Theory Examination will be conducted. Students must learn the required things by themselves. The College may arrange for a workshop or invite Experts from the

Industry to demonstrate the essential methods, tools and techniques to the students.

An internal assessment of the knowledge acquired by the students should be evaluated at the End of the Semester and marks (Max: 100) awarded to each student to be communicated to the University.

List of Elective Courses ( For 2011 – 2012) :

Elective I1 Computer System Architecture 2 Distributed Operating Systems3 Computer Graphics4 Principles of Programming Languages

*******

CORE COURSE IDIGITAL ELECTRONICS AND COMPUTER ORGANIZATION

UNIT: INumber Systems and Codes: Binary, Octal and Hexadecimal number systems – conversion between number systems – binary arithmetic- Binary codes – BCD arithmetic.Boolean Algebra and Logic Gates: AND, OR, NOT, NAND, NOR, XOR and XNOR gates – Truth tables Applications of XOR Gate Fundamentals of Boolean Algebra – Boolean Functions Minterms and Maxterms – Laws and theorems of Boolean Algebra – Demorgan’s theorems – The Universal Building blocks – NAND & NOR gates as universal Building Blocks.

UNIT: IISimplification of Boolean Expressions : Canonical SOP and POS forms – Algebraic Simplification – Karnaugh Maps – SOP & POS Simplification – NAND / NOR implementation of Boolean expressions – Don’tcare, conditions – Overlapping groups, eliminating redundant groups. Combinational Logic circuits : Half and Full Adders – Half and Full subtractors – BCD adder – parallel binary adder – Multiplexer & Demultiplexer – Encoder & Decoder.UNIT: IIISequential Logic circuits: NAND latch – SR, flipflop – JK flipflop – Edge triggering – PRESET and CLEAR inputs, Shift Register, Universal Shift register – Asynchronous and Synchronous counters – BCD counter.Unit: IVParallel Computer Models: Introduction - Flynn’s Classifications - Parallel & Vector Computer System - Attributes to performance - implicit and explicit parallelism - shared memory – multiprocessors – Uniform and Non-Uniform Memory Access and Cache only Memory Access Models – Distributed Memory Multicomputers – Multivector & SIMD Computers – PRAM and VLSI ModuleUNIT: VProcessors and Memory Hierarchy: CISC & RISC Architectures – CISC Family – RISC Scalar processors – Super Scalar Processors and their features – Very Long Instruction word Architecture vector & symbolic processors, Memory hierarchyTEXT BOOK(S)1. Meena K, “Principles of Digital Electronics”, PMI, I Edition.2. Thomas Bartee C, Digital Computer Fundamentals, TMH, 3rd Edition3. Moris Mano, Computer Architecture and Logic Design, TMH Publications4. Liu and Gibson “ Microcomputer Systems” PHIREFERENCE(S)

1. Malvino and Leech “ Digital Principles and Applications” , TMH2. Malvino and Brown, Digital Computer Electronics, TMH, III rd Edition

*******

CORE COURSE II - DATA STRUCTURES AND ALGORITHMS

Unit: I

Introduction to data structures, Records, Arrays, Stacks, Queues, Recursion, Linked list, Binary tree and traversing.

Unit: II

Sorting and Searching Techniques: Introduction, Internal and External Sorting, Insertion, Selection, Merging, Radix, Quick sort, Heap sort and Bubble sort. Searching: Introduction, Sequential search, Binary search, Binary Tree search.

Unit: III

Graphs and Their applications: Introduction, Graph Theory, Terminology, Representation of graphs, Tree & Binary tree, operations on graphs, shortest path Algorithms, Topological sorting.

Unit: IV

Algorithms, Development of Algorithms, basic concepts, Structured Program Concepts, Top down development of algorithms, Principle of analyzing Algorithms, Algorithms design methods, Sub goals, Hill climbing.

Unit: V

Algorithms Design Techniques: Divide and Conquer algorithms, Dynamic Programming, Greedy algorithms, Backtracking and Branch & bound.

Text Books

1. Seymour Lipschitz "Data Structures, Tata McGraw-Hill2. Ellis Horowitz & S. Sahni, Fundamentals of Data Structures, Galgotia

Pub.References

Data Structures Using C - Langsam, Augenstien, Tenenbaum, PHI1. Data structures and Algorithms, V.Aho, Hopcropft, Ullman , LPE2. Introduction to design and Analysis of Algorithms - S.E. Goodman, ST.

Hedetniem- TMH

*******

CORE COURSE III – OPERATING SYSTEMSUnit: IOperating Systems Objectives and functions – Operating System and User /Computer Interface, Operating System as a Resource Manager: Evaluation of OperatingSystems – Serial Processing, Sample Batch Systems, Time Sharing Systems.

Unit: II Process Description, Process Control – Processes and Threads. Concurrency – Principles of Concurrency, Mutual Exclusion – Software support, Dekker’s Algorithm – Mutual Exclusion – Hardware support, Mutual Messages – Deadlock – Deadlock prevention, Deadlock Detection, Deadlock Avoidance – An Integrated deadlock Strategy.

Unit: III Memory Management – Memory Management Requirements – Fixed Partationing, Placement Algorithm, Relocation in a Paging System – Sample Segmentation. Virtual Memory – Paging – Address Translation in a Paging System. Segmentation –Organization, Address Translation in a Segmentation System – Combined Paging and Segmentation – Virtual Memory – Operating System Software – Fetch Policy, Placement Policy and replacement Policy, Page buffering resident setManagement.

Unit: IV Scheduling – Types of Scheduling, scheduling Algorithms, scheduling criteria, FIFO, Round Robin, Shortest Process next, Shortest Remaining Time, Highest response ratio and Feedback scheduling Performance comparison – Fair – Share Scheduling. I/O Management and disk scheduling – Organization of the I/O function – the Evaluation of the I/O function, Logical structure of the I/O function, I/O Buffering, Disk Cache.

Unit: VFile Management – Files, File Management Systems, File System Architecture, Functions of File Management File Directories – File Sharing – Secondary Storage Management – File allocation.

Text Books

1. William Stallings, “Operating Systems”, Second edition, Maxwell McMillan, International Editions, 1997.

2. Charles Crowley, “Operating Systems-A Design Oriented Approach”, IRWIN Publications Chicago, 1997.

References

1. Dental H.M. “An Introduction to Operating Systems”, Addison Wesley Publishing Co., 1998.

2. Silberchatz A., Peterson J.L., Galvan P. “Operating System Concepts”, Third Edition, Addison Wesley Publishing Co., 1992.

*******

Core Course IV – Programming with C++

Unit I

What is Object Oriented Programming? – C++ Console I/O- C++ comments- Classes: Some difference between C and C++ - Introducing Function Overloading - Constructor and Destructor Functions- Constructors take parameters- Introducing Inheritance – Object Pointers – In line Functions – Automatic in lining.

Unit II

Assigning Objects – Passing Object to Functions – Returning Object from Functions- An Introduction to friend functions- Arrays of objects – Using Pointers to Objects – Using new & delete – More about new & delete – references – Passing references to objects - Returning references- Independent References and restrictions.

Unit III

Overloading Constructor Functions- Creating and Using a Copy constructor- Usingdefault arguments- Overloading and ambiguity – Finding the address of an overload function- the basics of operator overloading- overloading binary operators-overloading the relational and logical operators- overloading a Unary operator – using friend operator functions- a closer at the assignment operator- overloading the subscript() operator.

Unit IV

Base class access control –using protected members- Constructors, destructors and inheritance - multiple inheritance- virtual bas classes- Some C++ I/O basics- formatted I/O using width(), precision () and fill() – using I/O manipulators- Creating your own inserters- creating extractors.

Unit V

Creating your own manipulators- File I/O basics- unformatted, binary I/O- more unformatted I/O functions- random access- checking the I/O status- customized I/O and files- Pointers and derived classes- Introduction to virtual functions- more about virtual functions- applying polymorphism- Exception handling.

Text Book(s)

Herbert Schildt, “Teach Your self C++”, III edition, Tata McGraw Hill 5th Reprint2000.

Reference(s)

1. Robert Lafore, “Object Oriented Programming in Turbo C++”, Galgotia 20012. E. Balagurusamy “Object Oriented Programming with C++ “, TMH New Delhi

*******

Core Course V – OOAD and UML

UNIT-IStructured approach to system construction : SSADM/SADT - An overview of object oriented systems development & Life cycle

UNIT-IIVarious object oriented methodologies – Introduction to UML

UNIT-IIIObject oriented analysis – Use cases- Object classification, relationships, attributes, methods

UNIT-IVObject oriented design – Design axioms – Designing classes – Layering the software design :- data access layer, User interface layer, Control/business logic layer

UNIT-VUML - Examples on : Behavioral models – Structural models – Architectural models from real world problems.

TEXT BOOK:1. Bahrami Ali, Object oriented systems development, Irwin McGrawHill,

2005 (First 4 units covered here).2. Booch Grady, Rumbaugh James, Jacobson Ivar, The Unified modeling

language – User Guide, Pearson education, 2006 (ISBN 81-7758-372-7) (UNIT -5 covered here).

*******

Core Course – VIC++ Programming Lab (Applied to Data Structures and Algorithms)

1. Implement Array Merging, sorting of array elements [Integer elements & character Elements]

2. Implement sorting of array of English words (in Dictionary order) 3. Implement Stack Data Structures and Operations on it (push, pop) 4. Implement Singly linked list Data structure and operations on it (insert,

delete, print, navigate, search) 5. Implement sorting operation on a singly linked list data structure 6. Implement doubly linked list data structure and operations on it (insert,

delete, print, navigate, search) 7. Implement Sorting operation on a doubly linked Data Structure 8. Implement Queue Data Structure and operations on it 9. Implement table Data structure and operations on it (insert, delete, print,

navigate, search) 10. Implement binary tree data structure and operations on it (node

insertion, deletion)11. Implement pre-order, in-order, post-order traversal of binary tree and

print node contents *******

Core Course VII – OS Lab (DOS & UNIX)

Write Shell Programming to implement the following: 1. Mark list preparation 2. Menu Creation 3. Login Greetings Script 4. Copying files 5. Searching a word in a file 6. Compression techniques 7. Paragraph formatting 8. User Creation 9. Group Creation 10. Cron Scheduling11. All DOS Commands & Batch File Creation

*******

CORE COURSE VIII – COMPUTER NETWORKS

Unit IComputer Networks - Applications - Line configuration - Topology - Transmission Modes - Categories of Network: LAN, MAN, WAN - OSI Layer. Physical Layer: Signals - spectrum - bandwidth of analog/digital signals – signal encoding - DTE-DCE interface - Transmission Media - Multiplexing : FDM, TDM.

Unit IIData Link Layer: Error Detection - Error correction - Line discipline Flow Control: stop - wait protocol and sliding window protocol Error control: ARQ, Go-back-n ARQ, selective - repeat ARQ. Data Link Protocols: Asynchronous protocols – synchronous protocol: character oriented - bit oriented protocols - HDLC. LLC, MAC, PDU. MAN: DQDB - SMDS.

Unit III Network Layer: Circuit switching - packet switching - message switching - Connection oriented and connectionless services. Routing Algorithms – congestion control Algorithms - internetworking - Routers and Switches - Introduction to firewalls- Wide Area Network - X.25 - Frame Relay - Frame relay - Protocol Architecture - Frame relay call control - User Data Transfer Network Function – Congestion Control.

Unit IV LAN Protocols: Ethernet - Token Ring - Token Bus - FDDI - Addressing and Frame format – Bridges - LAN Security: Types of threats - Levels of security Case Study: Novell Netware - Wireless LAN: need - components - Receiving Devices - advantages &disadvantages

Unit V TCP/IP Networking : TCE/IP Architecture - Structural overview – Inter networking model - Protocol evolution - Division of functions - Network characteristics - implementation characteristics - Network addressing and Routing: Datagram Header - IP address space - Basic routing consideration -Hardware addressing – Common interior Gateway Protocols - Internet control Message Protocol. Transport Layer: Data flow, ports, sockets - user Data gram protocol - Transmission control protocol - TCP Header - connection establishment and termination - TCP Reliable Delivery & Flow control - Applications and services: Domain name system - Remote Logon – Mail Exchange - File Transfer - Remote Procedure Call - Remote File Access - Security - Window system.

Text Book(s)Data Communication and Networking, Behruz A. Ferouzon, Tata McGraw, 2004. References

1. Computer Networks - III edition - Andrew S.Tanenbaum - Pearson Edun. 1998.2. Data and Computer Communication – William Stallings, Pearson Education,

5thEdition, September 2000

*******

CORE COURSE IX – DATABASE SYSTEMSUnit I

Introduction – purpose of database systems – Data Abstraction – Data models – Instances and schemes – Data independence – DDL – DML – Database users – ER model – Entity sets – Keys – ER diagram – relational model – Structure – Relations Algebra – Relational Calculus – Views. Unit II

SQL – QBE – QUEL – Basic structure – various Operations – Relational database design problems in the relational data base design – Normalisation – normalization using functional, Multi value and join dependencies.

Unit III

File and system structure – overall system structure – file Organization – data dictionary – Indexing and hashing – basic concept B and B+ tree indices – Static and Dynamic hash functions. Unit IV

Recovery and atomicity – failures classification and types – Transaction model and Log based recovery, schedules – serial and non-serial types – Serialization of schedules and views – testing for seriability – lock based protocols – time based protocols – validation techniques – multiple Granularity – multiversion schemes – insert and delete Operations. Unit V

Distributed data bases – structure of distributed databases – Trade offs in Distributing the database – Transparency and autonomy – distributed query processing – recovery in distributed systems – commit protocols – security and integrity violations – authorization and views – security specification – encryption – Statistical databases. Text Book(s):

Henry F.Korth, and Abraham Silberschatz,, Sudarshan “Database system Concepts”, McGraw Hill, 4th Edition, 2002References:

1. Pipin C.Desai, “An Introduction to data base systems”, Galgotia Publications Private Limited, 1991.

2. C.J.Date, “An Introduction to Database Systems”, 3rd Edition, Addison Wesley 1983.

*******

CORE COURSE X – SOFTWARE ENGINEERINGUNIT 1: SOFTWARE PROCESS Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) – system engineering – computer based system – verification – validation – life cycle process – development process –system engineering hierarchy.

UNIT 2: SOFTWARE REQUIREMENTS Functional and non-functional – user – system –requirement engineering process – feasibility studies – requirements – elicitation – validation and management – software prototyping – prototyping in the software process – rapid prototyping techniques – user interface prototyping –S/W document. Analysis and modeling – data, functional and behavioral models – structured analysis and data dictionary.

UNIT 3: DESIGN CONCEPTS AND PRINCIPLES Design process and concepts – modular design – design heuristic – design model and document. Architectural design – software architecture – data design – architectural design – transform and transaction mapping – user interface design – user interface design principles. Real time systems – Real time software design – system design – real time executives – data acquisition system – monitoring and control system. SCM – Need for SCM–Version control – Introduction to SCM process – Software configuration items.

UNIT 4: TESTING Taxonomy of software testing – levels – test activities – types of s/w test – black box testing – testing boundary conditions – structural testing – test coverage criteria based on data flow mechanisms – regression testing – testing in the large. S/W testing strategies – strategic approach and issues – unit testing – integration testing – validation testing – system testing and debugging.

UNIT 5: SOFTWARE PROJECT MANAGEMENT Measures and measurements – S/W complexity and science measure – size measure – data and logic structure measure – information flow measure. Software cost estimation – function point models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned Value Analysis – Error Tracking – Software changes – program evolution dynamics – software maintenance – Architectural evolution. Taxonomy of CASE tools.

Text Books:

1. “Software engineering- A practitioner’s Approach” , Roger S.Pressman, McGraw-Hill International Edition, 5 th edition, 2001.

2. “Software engineering”, Ian Sommerville, Pearson education Asia, 6 th edition, 2000.

3. “Software Engineering Concepts “, Richard E. Fairley, McGraw-Hill edition, 2002.

Reference Books:

1. “Software Engineering – An Engineering Approach”, James F Peters and Witold Pedryez, John Wiley and Sons, New Delhi, 2000.

*******

CORE COURSE XI – PROGRAMMING WITH JAVA

UNIT-IIntroduction – Literals – Data types – The structure of Java program – Operators – Control statements

UNIT-IIArrays – Classes - Inheritance

UNIT-IIIPackages and Interfaces – Wrapper classes – mathematical methods – Exceptions

UNIT-IVInput and Output classes

UNIT-VThreads – Applets - Graphics.

TEXT BOOK:1. Dr. K. Somasundaram, “Programming in Java 2”, Jaico Publishing House -

2008

REFERENCE BOOK1. Ken Arnold, Games Gosling, David Holmes, “The Java Programming

Language”, 3rd Edition, TMH2. Patric Naughton and Herbert Schildt, “Jave 2 Complete Reference”,

TMH, 19993. Nortron Peter and William Stanek, “Guide to Java Programing”,

Samsnet 1996

*******

CORE COURSE XII – JAVA PROGRAMMING LAB

1. Assume that a bank maintains 2 kinds of account for its customers' one called savings account and the other current account' The savings account provides compound interest and withdraw facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account falls below this level a service charge is imposed. Create a class Account that stores customers name' account number and type of account. From this derive the classes curr-acct and sav-acct to make them more specific to their requirements. Introduce the necessary methods in order to achieve the following tasks:

a. Accept deposit form a customer and update the balance. b. Display any deposit interest c. Compute and deposit interest. d. Permit withdrawal and update the balance. e. Check for the minimum balance' impose penalty' if necessary and update the balance.

1. Use constructors and methods to initialize the class members. Write a program that accepts a shopping list of five items from the command line and stores them in a vector and accomplish the following: a. To delete an item in the list. b. To add an item at a specified location in the list. c. To add an item at the end of the list. d. To print the contents of the vector.

3.Implementation of the concept of multiple inheritance using interfaces and design a package to contain the class students and another package to contain the interfaces sports. 4. Develop a simple real-life application program to illustrate the use of multithreads. 5. Create a try block that is likely to generate three types of exception and then incorporate necessary catch blocks to catch and handle them appropriately.

6. Write a Java applet' which will create the layout below: FORMATEnter your Name:Enter your Age:Select City: *Delhi *MadrasSelect SIW: *Oracle *Visual Basic *JavaOK CANCELHandle the following simple validations.The name entered should be less than 25 characters wide.Age entered should be done as the user exits the fields as well as when OK button is pressed. Hint use the Boolean action (Event evt' object arg). 7. Write an Applet which will play two sound notes in a sequence continuously use the play ( ) methods available in the applet class and the methods in the Audio clip interface.

*******

CORE COURSE XIII - RDBMS LAB (Oracle 9i with SQL)

1. Creating & updating and inserting into database & simple queries.

2. Uses of Select statement - for queries. a. AND' OR' NOT Operators' WHERE clause. b. UNION' INTERSECTION' MINUS. c. Sorting and grouping.

3. Nested queries using SQL. a. Sub queries. b. Join.

4. Built-in-functions of SQL.

5. Use of indexes' creating views and querying in views.

6. Cursors' triggers and stored procedures and functions.

7. Case studies: a. Student evaluation systems. b. Pay - roll system c. Income tax calculations. d. Seat reservation Problems e. Mark - sheet Preparation.

*******

ELECTIVE COURSE I:1 – COMPUTER SYSTEM ARCHITECTUREUNIT IData Representation: Data Types – Complements – Fixed Point Representation – Floating Point Representation – Error Detection codes. Register Transfer and Microoperations: Register Transfer Language – Register Transfer – Bus and Memory Transfers – Arithmetic Microoperations – Logic Microoperations – Shift Microoperations – Arithmetic Logic Shift Unit UNIT IIBasic Computer Organization and Design: Instruction Codes – Computer Registers - Computer Instructions – Timing and Control – Memory-Reference Instructions – Input – Output and Interrupt –Complete Computer Description – Design of Accumulator Logic.UNIT IIICentral Processing Unit: Introduction – General Register Organization – Stack Organization – Instruction Formats – Addressing Modes – Data Transfer and Manipulation – Program Control – Reduced Instruction Set Computer(RISC)UNIT IVComputer Arithmetic: Introduction – Addition and Subtraction – Multiplication Algorithms – Division Algorithms –Floating point Arithmetic Operations - Decimal Arithmetic Unit – Decimal Arithmetic OperationsUNIT VInput-Output Organization: Peripheral Devices – Input Output Interface – Asynchronous Data Transfer – Modes of Transfer – Priority Interrupt – Direct Memory Access – Input Output Processor – Serial Communication. Memory Organization: Associative Memory – Cache MemoryText Book:M.Morris Mano, “Computer System Architecuture”, Prentice Hall of India pvt Ltd , New Delhi, Third Edition.,1999.

*******

ELECTIVE COURSE I:2 – DISTRIBUTED OPERATING SYSTEMS

Unit I

Fundamentals: What is Distributed Operating System – Evolution of Distributed Computing System – Distributed Computing System Models – Why are Distributed Computing Systems gaining popularity – What is a Distributed Computing System – Issues in Designing Distributed Computing System – Introduction to Distributed Computing Environment. Introduction to Computer Networks – Network types – LAN –WAN – Communication protocols – Internetworking – ATM Technology

Unit II

Message Passing: Introduction – Desirable features – Issues in PC Message Passing – Synchronization – Buffering – Multidatagram Messages – Encoding and Decoding – Process Addressing – Failure Handling – Group Communication Unit III

Distributed Shard Memory: Introduction – General Architecture of DSM system – Design and Implementation Issues of DSM – Granularity – Structure of Shared Memory – Consistency Models – Replacement Strategy – Thrasing – Other Approaches to DSM – Heterogeneous DSM – Advantages Synchronization: Introduction – Clock Synchronization – Event Ordering – Mutual Exclusion – Deadlock – Election Algorithm Unit IV

Distributed File System: Introduction – Desirable features – File Models – File Accessing Models – File Sharing Semantics – File Caching Schemes – File Replication – Fault Tolerance – Atomic Transactions – Design PrinciplesUnit V

Security: Introduction – Potential Attacks to Computer System – Cryptography – Authentication – Access Control – Digital Signatures – Design Principles Text Book

Distributed Operating Systems – Concepts and Design, Pradeep K Sinha, PHI, 2003 References:

Distributed Operating Systems 1e, Andrew S Tanenbaum, PHI.

*******

ELECTIVE COURSE I:3 – COMPUTER GRAPHICS

UNIT-IA survey of computer graphics – Overview of Graphic systems- output primitive (Mathematical functions for creating graphic output) – setting attribute of Output primitives

UNIT-IITwo dimensional geometric transformations – Two dimensional viewing

UNIT-IIIGraphic structures – Hierarchical modeling – Graphical user interfaces and interactive input methods

UNIT-IV3D Concepts – 3D- object Representation – 3D Geometric and Modeling Transformations.

UNIT-VVisible surface detection methods – Illumination models – Computer Animation

TEXT BOOK:1. Hearn Donald, Baker Paulin M., Computer graphics – C version,

Second edition, Pearson education, 2006. (ISBN 81-7758-765-X)

REFERENCE BOOK:1. Newman William M., & Sproull Robert F., Principles of interactive

computer graphics, Second edition, Tata –McGraw Hill, 1 (ISBN 0-07-463293-0)

*******

ELECTIVE COURSE I:4 – PRINCIPLES OF PROGRAMMING LANGUAGESUnit 1

The Study of Programming Languages – Why Study Programming Languages ? – A Short History of Programming Languages – What Makes a Good Language? – Effects of Environments on Languages. Language Design Issues: The Structure and Operation of a Computer – Virtual Computers and Binding Times – Languages Paradigms. Language Translation Issues: Programming Language Syntax – Stages in Translation – Formal Translation Models.

Unit II

Elementary and structured data type: Data object variables, constants, data type, elementary data types, declaration, assignments and initialization, enumeration, characters strings. Structured data type and objects: Specification of data structured types, vectors and arrays, records, variable size data structure, pointers and programmer constructed data structure, Set files. Imperative Languages: Block structure, Scope rules, Parameter Passing, Construct like co-routines, Tasks etc.

Unit III

Object oriented languages: The class notion- Information hiding and data abstraction using classes, derived classes and inheritance– Polymorphism – Parameterized types.

Unit IV

Functional languages: Functional programming concepts – Referential transparency – Types – Type systems - Names, bindings, environment and scope – Recursive functions – Polymorphic functions – Type variables – High order functions – Curried functions – Lists and programming with lists – Definition of new user defined types in ML – Abstract data types – Evaluation methods.

Unit V

Logic languages: Review of predicate logic – Clause-form logic – Logic as a programming language- Unification algorithm - Abstract interpreter for logic programs – Theory of logic programs – Applications of Logic programming - Introduction to Prolog, Data Structures in Prolog, Programming techniques, Control in Prolog

Text Book

“Programming Languages – Design and Implementation”  - by Terrence W. Pratt & Marvin V. Zelkowitz, Fourth Edition

“Programming Languages – Concepts & Constructs” - by Ravi Sethi, Pearson Education.

Reference Books

“Programming Language Design Concepts”– by David A. Watt and William Findlay “Fundamentals of Programming Languages” – by Ellis Horowitz – SecondEdition

*******