semester- i 12pmtit101 opt imiza tn echn … dept/m...semester- i 12pmtit101 opt imiza tn echn ques...

55
SEMESTER- I 12PMTIT101 OPTIMIZATION TECHNIQUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method, Revised simplex method, Duality in Linear Programming (LP), Sensitivity analysis, other algorithms for solving problems, Transportation, assignment and other applications. UNIT - II NON LINEAR PROGRAMMING Non Linear Programming: Unconstrained optimization techniques, Direct search methods, Descent methods, constrained optimization. UNIT - III INTEGER PROGRAMMING Formulation of Integer Programming problems, Gomory s cutting plane methods, Branch and Bound Techniques. UNIT - IV DYNAMIC PROGRAMMING Characteristics of Dynamic Programming, Bellmans principle of optimality, Concepts of dynamic programming, tabular method of solution, Calculus method of solution. UNIT - V PERT/CPM Network Construction-computation of earliest start time, latest start time, Total, free and independent float time-Crashing-Computation of optimistic, most likely Pessimistic and expected time-Resource analysis in Network scheduling. REFERNCES: Taha, H.A., Operations Research: An Introduction, PearsonEducation, New Delhi, 2002. S.S. Rao, Engineering Optimization: Theory and practice, New Age International, New Delhi, 2000. Trivedi K.S., “Probability and Statistics with Reliability, Queuing and Computer Applications,

Upload: vuongtu

Post on 10-Mar-2018

217 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

SEMESTER- I

12PMTIT101 OPTIMIZATION TECHNIQUES

UNIT - I LINEAR PROGRAMMING

Linear Programming: Graphical method, Simplex method, Revised simplex method, Duality in

Linear Programming (LP), Sensitivity analysis, other algorithms for solving problems,

Transportation, assignment and other applications.

UNIT - II NON LINEAR PROGRAMMING

Non Linear Programming: Unconstrained optimization techniques, Direct search methods,

Descent methods, constrained optimization.

UNIT - III INTEGER PROGRAMMING

Formulation of Integer Programming problems, Gomory’s cutting plane methods, Branch and

Bound Techniques.

UNIT - IV DYNAMIC PROGRAMMING

Characteristics of Dynamic Programming, Bellman’s principle of optimality, Concepts of dynamic

programming, tabular method of solution, Calculus method of solution.

UNIT - V PERT/CPM

Network Construction-computation of earliest start time, latest start time, Total, free and

independent float time-Crashing-Computation of optimistic, most likely Pessimistic and expected

time-Resource analysis in Network scheduling.

REFERNCES:

Taha, H.A., “Operations Research: An Introduction”, PearsonEducation, New Delhi, 2002.

S.S. Rao, “Engineering Optimization: Theory and practice”, New Age International,

New Delhi, 2000.

Trivedi K.S., “Probability and Statistics with Reliability, Queuing and Computer Applications”,

Page 2: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Prentice Hall, New Delhi, 2003.

Page 3: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT102 ADVANCED JAVA PROGRAMMING

UNIT - I INTRODUCTION TO JAVA PROGRAMMING

Features – Java development environment – exception handling – Applets – Design of XML

documents – Generating an XML document – Parsing XML.

UNIT - II SWING

Swing mechanism – Frames – Panels and Borders – Layout manager – Label and buttons –

Tabbed panes – Scrolling panes – Combo boxes – List boxes and spinners – Menus – Table –

Trees – Constructing and XML editor

UNIT - III JAVA SERVLETS

Design – Servlet life cycle – Multithreaded Servlets – Handling exception – session Management

– filters

UNIT - IV JAVA SERVER PAGES

Basic JSP life cycle – JSP elements – Implicit objects – TOMCAT – JSTL

UNIT - V ENTERPRISE JAVA BEANS

Introduction – EJB container – classes – interfaces – Deployment description – Session Java

bean – Entity Java bean – Message driven bean – JAR file

REFERENCES:

Herbert Schildt, “Java Complete Reference”, Tata McGraw Hill, 2005

Jim Keogh, “J2EE – Complete Reference”, Tata McGraw Hill, 2003

Page 4: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT103 DATA STRUCTURES AND ANALYSIS OF ALGORITHMS

UNIT - I INTRODUCTION

Basic concepts of OOPs – Templates – Fundamentals of Analysis of Algorithm Efficiency –

ADT - List (Singly, Doubly and Circular) Implementation - Array, Pointer UNIT - II BASIC DATA STRUCTURES

Stacks and Queues – ADT, Implementation and Applications - Trees – General, Binary,

Binary Search, ExpressionSearch, AVL, Splay, B-Trees– Implementations - Tree Traversals

UNIT - III ADVANCED DATA STRUCTURES

Set - Implementation - Basic operations on set – Priority Queue - Implementation - G r a p h s -

Directed Graphs - S h o r t e s t P a t h P r o b l e m - Undirected Graph - Spanning Trees - Graph

Traversals UNIT - IV SEARCHINGANDSORTING

Searching Techniques, Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick Sort,

Heap Sort, Bin Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge Sort,

Polyphase Sorting

UNIT - V ALGORITHM DESIGN TECHNIQUES

Design Techniques - Divide and Conquer - Dynamic Programming - Greedy Algorithm –

Backtracking - Local Search Algorithms

REFERNCES:

MarkAllen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education,

2002.

A. Levitin, “Introduction to The Design and Analysis of Algorithms “, 2 n d

Edition, Addison Wesley, 2007 (chapter 2) Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 2000

Tanenbaum A.S., Langram Y, Augestien M.J., ”Data Structures using C & C++”, Prentice

Hall of India, 2002

Aho, H o p c r o f t , U l l m a n , “ Data S t r u c t u r e s a n d A l g o r i t h m s ”, P e a r s o n

Education, 2002.

Page 5: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT111 DATA STRUCTURES LABORATORY

LIST OF EXPERIMENTS

1. Implementation of List (Single, Double, Circular)

2. Implementation of Stack

3. Implementation of Queue.

4. Implementation of Searching Techniques (any Three)

5. Implementation of Sorting Techniques (any Three)

6. Implementation of Hash table

7. Implementation of Heaps

8. Implementation of AVL Rotations

9. Implementation of Prim’s Algorithm.

10. Implementation of Breadth First Search Techniques.

11. Implementation of Depth First Search Techniques.

12. Implementation of Dijkstra’s Algorithm.

13. Implementation of Kruskal’s Algorithm.

Page 6: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

SEMESTER- II 12PMTIT201 SOFTWARE ENGINEERING METHODOLOGIES UNIT - I PROCESS AND PROJECT MANAGEMENT Software Process models – process iteration – process activities – rational unified

process – computer aided software engineering. Management activities – Project planning –

project scheduling – risk management.

UNIT - II REQUIREMENT ANALYSIS

Functional and Non – functional requirements – user requirements - system requirements

– interface specificat ions – so f tw a r e requirements document . Requirements

engineering processes – feasibility studies – elicitation and analysis – validations –

management - System Models – Context – Behavioural– Data – Object – Structured.

UNIT - III SOFTWARE DESIGN

Architectural Design – Distributed Systems Architectures– Application Architectures – Object

Oriented Design – Real-time Software Design.

Page 7: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - IV SOFTWARE TESTING

Software testing fundamentals – Test Case Design – White Box - Basis Path Testing – Control Structure Testing – Block Box – Testing for Specialized environments, Architectures and Applications Software Testing Strategies – Approach – issues – testing – unit – integration – validation – system – art of debugging.

UNIT - V SOFTWARE QUALITY ASSURANCE

Software Quality Concepts – Quality Assurance – Software Technical Reviews – Formal

Approach To Software Quality Assurance - Reliability – Quality Standards– Software Quality

Assurance Plan – Software Maintenance - Software Configuration Management –

configuration item – process – objects in the software configuration – version control –

change control – configuration audit – status reporting – SCM Standards – Case study :

Martha Stockton Greengage (MSG) foundations.

REFERENCES:

Roger S. Pressman, Software Engineering: A Practitioner’s Approach”, Sixth Edition,

McGraw Hill, 2005. (Chapter 8, 9, 17, 18)

Sommerville, Software Engineering, V Edition: Addison Wesley, 1996.

(Chapter 4, 5, 6, 7, 8, 11 – 15).

Page 8: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT202 DISTRIBUTED COMPONENT ARCHITECTURE

UNIT - I INTRODUCTION Evolution of Distributed Systems – Distributed Objects – Issues in design of Distributed

Object Systems – multi tier architectures – component concepts – Component based

Software Development

UNIT - II CORBA TECHNOLOGIES

OMA – CORBA architecture - Object Request Broker Structure - Interface Definition

language –– Portable Object Adapter – Object and invocation life cycles - Interceptors -

CORBA services – Object location service – messaging service – security service –

CORBA Component Model -steps in creating a CORBA application using SII and DII. UNIT - III COM AND DCOM

From COM to Distributed COM – OLE - ActiveX – ATL – DCOM – COM IDL – COM

Interfaces – COM threading models - C O M services – Security - MTS – Clustering –

MSMQ - steps in creating and deploying COM using ATL.

UNIT - IV EJB

Introduction – EJB architecture – types of beans – life cycle of beans – steps in creating and

deploying an EJB application.

UNIT - V OTHER DISTRIBUTED OBJECT MODELS

Java RMI - Java Beans – MDA - .NET- Comparison between different distributed models and

their interoperability

REFERENCES

Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”, Pearson

Education, New Delhi, 2003

G Sudha Sadasivam, “D i s t r i bu t ed Component Architecture”, Wiley India Pvt. Ltd.,

New Delhi, 2007

Ed Roman, “Enterprise Java Beans”, Wiley, New York, 2004 Gerald Brose, Andreas Vogel, Keith Duddy, “Java Programming with CORBA”, John

Wiley, New York, 2003,

Page 9: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT203 COMPUTER COMMUNICATION NETWORKS UNIT - I INTRODUCTION Networking basics - LANs and WANs - Network hardware components, Server- based

networks - Peer-to-peer networks - Server-based vs. peer-to-peer networks - Specialized

servers - Combination networks - Network packets – Addressing packets – Multiplexing

- Protocols - The OSI reference model – Internet Protocol Stack

UNIT - II DATA LINK CONTROL

Asynchronous and Synchronous transmission - MAC protocol; Controlled & contention-

based - IEEE 802.11 LANs – IEEE 802.11a,802.11g - System architecture, protocol

architecture– physical layer, Media Access Control – MAC management – Data

Transmission Module wrap-up LAN architecture - Error Detection and Correction

Techniques – CRC and Linear Block Codes – Transmission Protocols – Retransmission

techniques -Token ring – FDDI

UNIT - III NETWORK PROTOCOLS

IP Layers and functions - Congestion control - X.25 - Internetworking concepts and X.25

architectural models – Naming addressing and routing using IP - Unreliable

connectionless delivery - Datagram’s - Routing IP datagram’s - ICMP.

UNIT - IV INTERNETWORKING

LAN Addresses and ARP - Bridges, and Switches – Hubs – Routers – Brouters – gateways

and Repeaters - Choice for Implementation - File Transfer: FTP - Electronic Mail in the

Internet - DNS - Socket Programming with UDP -Building a Simple Web Server.

UNIT - V NETWORK MANAGEMENT

The dial-in end-user - the direct connection user - the Internet Service Provider - the global

Internet - emerging technologies over the Internet: IPv6 and ATM for a multimedia network -

desktop conferencing and collaboration - mobile Internet - high-quality audio - Push

Technologies

REFERENCES

Fitzgerald and Dennis, “Business Data Communications and Networking”, John Wiley and

Sons, New Delhi, 2004

William Stallings, “Data and Computer Communications”, Prentice Hall, New Delhi, 2005

Page 10: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT211 COMPUTER NETWORK LAB

LIST OF EXPERIMENTS

1. Simulation of ARP / RARP.

2. Write a program that takes a binary file as input and performs bit stuffing and CRC Computation.

3. Develop an application for transferring files over RS232.

4. Simulation of Sliding-Window protocol.

5. Simulation of BGP / OSPF routing protocol.

6. Develop a Client – Server application for chat.

7. Develop a Client that contacts a given DNS Server to resolve a given host name.

8. Write a Client to download a file from a HTTP Server.

9. Study of Network Simulators like NS2/Glomosim / OPNET.

10. Write a program mail using mail server.

Page 11: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

SEMESTER - III

12PMTIT301 OBJECT ORIENTED SYSTEM DESIGN

UNIT - I INTRODUCTION

Overview of System Analysis- Structured System Analysis vs. Object Oriented

Analysis- Examples.

UNIT - II OBJECT MODELING

Objects & Classes- Links and Associations- Object model- Evolution of object models-

Applications- Object classifications – Generalization – Aggregation- Abstract Classes-

Metadata-Candidate keys-Constraints.

UNIT - III FOUNDATION OF OBJECT ORIENTED COMPUTING

Major foundations: Inheritance – Polymorphism – Overriding – Overloading Minor

foundations: Typing - Concurrency – Persistence Object Oriented Language vs. Object Based

Language

UNIT - IV UML & USE CASE MODELING

Introduction to UML- Need for UML- Diagrams for Analysis & Design- Extended

UML - Use Cases in UML: Describing - Testing – Realizing. UNIT - V UML BEHAVIOR MODELING

Static - Class diagram- Object diagram. Dynamic State Transition Diagrams- Interaction

Diagrams- Module Diagrams- Process Diagrams. UNIT - VI CASE STUDY

Cruise Control System - Automatic Teller Machine – Library Management

System – Inventory Control System. REFERENCES

Rumbaugh J, Blaha M, Premerlani W, Eddy F and Lorensen W., “Object Oriented

Modeling and Design”, PHI/ Pearson Education, New Delhi, 2004.

Ali Bahrami, “O b j ec t Oriented System Development”, Tata McGraw Hill, New Delhi,

1999.

Grady Booch, “Object Oriented Analysis and Design with Applications”, Pearson Education, Singapore, 2000.

Page 12: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT302 INFORMATION SECURITY UNIT - I CONVENTIONAL AND MODERN ENCRYPTION Services – Attacks – Steganography - Classical Encryption Techniques – DES – Differential a n d L i n e a r C r yp t a n a l ys i s – M o d e s o f o p e r a t i o n – Encryption Algorithms -Triple DES – Blowfish – CAST128

UNIT - II PUBLIC KEY ENCRYPTION

Uniqueness – Number Theory concepts – Primality – Modular Arithmetic – Fermat &

Euler Theorem – Euclid Algorithm – RSA Algorithm – Elliptic Curve Cryptography –

Diffie Hellman Key Exchange

UNIT - III AUTHENTICATION AND SECURITY PRACTICE

Digests – Requirements – MAC – Hash function – Security of Hash and MAC – Birthday

Attack – MD5 – SHA – RIPEMD – Digital Signature Standard - Authentication

applications – Kerberos – Kerberos Encryption Techniques – PGP– IP Security

Architecture– Web security – SSL – TLS – SET.

UNIT - IV PUBLIC- KEY INFRASTRUCTURE:

Legislation - Regulation and Guidelines, Non-repudiation - Certification Policies and

Practices- Public-Key Infrastructure Assessment and Accreditation

UNIT - V SYSTEM SECURITY

Intruders and Intrusion – Viruses and Worms – OS Security – Firewalls – Design Principles

– Packet Filtering – Application gateways – Trusted systems – Counter Measures

UNIT - VI STANDARDS

Blueprint for Security – Information Security Policy – Standards and Practices – ISO

17799/BS 7799 – NIST Models – VISA International Security Model – Design of

Security Architecture – Planning for Continuity

REFERENCES

William Stallings, “Cryptography & Network Security”, Pearson Education,

New Delhi 2005

Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security, Private

Communication in a Public World”, PHI, New Delhi, 2002.

Bruce Schneier, Niels Ferguson, “Practical Cryptography”, Wiley Dreamtech

India Pvt Ltd, New Delhi, 2003.

Page 13: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT303 WEB TECHNOLOGIES

UNIT - I XML TECHNOLOGIES

XML fundamentals – Document Type Definitions – XML Schema – Benefits – XML

Schema Vocabulary – Converting DTDs to Schemas - Validating Documents against

Schemas - Basics of Namespace - Declaring Namespaces - Xlink – Xpointer - Xpath –

XSL – XSLT- XML as document format- XML on the Web. Document Object Model–

concepts and API. UNIT - II WEB SERVICES TECHNOLOGIES

Introduction to SOAP – Relation to XML RPC – Message Syntax – Envelope – Header –

Body - SOAP Transport WSDL - Capabilities – Format – Semantics - Encoding -

Endpoint UDDI - . The UDDI data structures - Publishing Services - The Publish API -

F i n d i n g Services - The Inquiry API - Invoking a service. Introduction to .NET –

web service architecture – RPC style web services – Message Style Web services

UNIT - III ebXML

Overview - Collaboration Protocol Profile and Agreement (CPP and CPA) - Core

components - Business modeling – Registry - XML with JSP /Servlet – XML and

Messaging services (JMS)-Transactions – XML and Databases.

UNIT - IV J2EE AND WEB SERVICES

Enterprise Web services (J2EE and Web services) - The back end service component -

The Web application framework - The Web service front end - The Web service client -

S2ML (Secure Services Markup Language) - XAML (Transaction Authority Markup

Language).

UNIT - V XML AND CONTENT MANAGEMENT

Semantic Web – Role of Meta data in web content - Resource Description Framework

–RDF schema – Architecture of semantic web – content management workflow –

XLANG – WSFL

Page 14: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

REFERENCES:

Harold and Means, “XML in a Nutshell”, O’Reilly Publishers, Orlando, 2004

Ron Schmelzer et al. “XML and Web Services”, Pearson Education, New Delhi, 2002

Sandeep C h a t t e r j e e a n d J a m e s W eb b e r , “ Developing E n t e r p r i s e we b Services:

An Architect's Guide”, Prentice Hall, New Delhi, 2004.

Frank P.Coyle, “XML, Web Services and the Data Revolution”, Pearson Education,

New Delhi, 2002

12PMTIT311 WEB TECHNOLOGY LAB LIST OF EXPERIMENTS

1. Implement the inventory control system with a reorder level

2. Develop a package for a bank to maintain its customer details

3. Develop a package for the payroll of a company

4. Web Page Creation using HTML and DHTML and Client side Scripting Languages

5. Web Page Creation using HTML and DHTML and Sever side Scripting Languages

6. Write an application/GUI program in java for getting time and data information from the

Server using TCP/UDP

7. Write a program in java to implement Database Connectivity

8. Write a JSP program for order processing

9. Write a Servlet, bean program to access information from databases

10. Write an ASP program using the components

Page 15: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

SEMESTER - IV

12PMTIT401 ADVANCED OPERATING SYSTEMS

UNIT - I INTRODUCTION

Main frame Systems, Desktop Systems – Multiprocessor Systems – Distributed Systems

– Clustered Systems – Real Time systems – Hand held Systems, Operating Systems

Structures: System Components – Operating System Services – System calls – System

Programs – System Design and Implementation - CPU scheduling: Basic Concepts –

Scheduling Algorithms.

UNIT – II PROCESS MANAGEMENT

Process Concepts - Process Scheduling - Operation on Process - Co-Operating process -

Inter Process Communication - Threads: Multithreading Models - Process

Synchronization: The Critical Section Problem – Synchronization Hardware -

Semaphores – classical problem of Synchronization – Monitors - Deadlock: Deadlock

Characterization - Methods for handling Deadlocks - Deadlock Prevention –

Deadlock Avoidance - Deadlock Detection – Recovery from Deadlock. UNIT - III MEMORY MANAGEMENT

Background – Swapping – Contiguous Memory Allocation – Paging - Segmentation –

Segmentation with paging - Virtual Memory: Demand paging - Page Replacement -

Thrashing. Buddy Systems – Storage Compaction UNIT - IV FILE SYSTEMS

File Concepts - Access methods - Directory Structure - File Protection - File System

Implementation: File System Structure and Implementation – Directory Implementation –

Allocation methods Free Space Management – Recovery - Disk Structure – Disk

Scheduling. UNIT - V DISTRIBUTED OPERATING SYSTEM

Design issues in distributed operating system-Distributed file systems - Naming and

Transparency-Remote File Access-Stateful versus Stateless service – Distributed

Coordination- Event Ordering-Mutual Exclusion- Atomicity- Concurrency Control-

Deadlock Handling-Election Algorithms-Case Study-Linux.

Page 16: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

REFERENCES

Silberschatz, Galvin, Gagne “Operat ing System Concepts” Sixth Edition, 2003

Pradeep K.Sinha, “Distributed OS concepts and Design”, IEEE computer Society Press,

PHI 1998.

Andrew S. Tanenbaum, “Modern Operating Systems”, PHI, 2nd

Edition 2001

Achut S. Godbole and Kahate Atul, “Operating Systems & Systems Programming”,

Tata Mcgraw Hill, 2003.

Charles Crowley, “Operating systems: A Design Oriented Approach”,

Tata McGraw Hill, 1999.

12PMTIT401 ADVANCED DATABASE TECHNOLOGY

UNIT - I INTRODUCTION

Review of the formal relational data model - Database architecture, Components of database

management system – DDL, DML. Database Security and Database recovery, Creating SQL

Databases and Tables, Defining tables and views, Specifying integrity constraints,

Selecting Data, Queries – stored procedures and functions - triggers and active databases

UNIT - II DATABASE DESIGN ISSUES

ER Model - Normalization - Security - Integrity - Consistency - Database Tuning -

- Optimization and Research Issues – Design of active databases - spatio- temporal databases

- multi-media databases

UNIT - III TRANSACTION PROCESSING

Introduction – Properties of transaction – Serializability – Concurrency control – Locking

mechanisms – two-phase commit protocol – dead locks – Database recovery

UNIT - IV DISTRIBUTED DATABASES

Architecture- Design considerations-Interoperability Query processing - semi- joins - query

optimization - Concurrency control – transactions and Heterogeneity issues – schema

translation and schema integration

UNIT - V OBJECT ORIENTED DATABASES

Object-oriented data models - Object Identity and its implementation – Supporting object

modeling in database systems--Database programming and querying in object-oriented

databases - ODMG standard, including ODL, OQL – Comparing RDBMS with OODBMS

Page 17: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

REFERENCES

Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, Tata Mc- Graw Hill,

New Delhi, 2004

Barry, Eaglestone and Mick, Ridley,”Object Databases: An Introduction”,

Tata Mc-Graw Hill, New Delhi, 1998.

Mario Piattini, Oscar Diaz, “Advanced database Technology and Design”, Artech House

Publishers, Massachusetts, 2000.

Ozsu M. T. & Valduriez P., “Principles of Distributed Database Systems”, Prentice Hall,

New Delhi, 1999.

12PMTIT403 INFORMATION STORAGE AND MANAGEMENT

AIM

To understand the content and successfully complete this course, a student must have an

understanding of computers, operating systems, networking, and databases. Experience in

specific segments of storage infrastructure would also be helpful to fully assimilate the course

material.

OBJECTIVES

To evaluate storage architectures, including storage subsystems, DAS, SAN, NAS, CAS

To define backup, recovery, disaster recovery, business continuity, and replication

To examine emerging technologies including IP-SAN

To understand logical and physical components of a storage infrastructure

To identify components of managing and monitoring the data center

To define information security and identify different storage virtualization technologies

UNIT - I INTRODUCTION TO STORAGE TECHNOLOGY

Review data creation and the amount of data being created and understand the value of data to a

business– challenges in data storage and data management– Solutions available for data storage–

Core elements of a data center infrastructure– role of each element in supporting business

activities UNIT - II STORAGE SYSTEMS ARCHITECTURE Hardware and software components of the host environment– Key protocols and concepts used

by each component –Physical and logical components of a connectivity environment –Major

physical components of a disk drive and their function– logical constructs of a physical disk–

Page 18: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

access characteristics– and performance Implications– Concept of RAID and its components –

Different RAID levels and their suitability for different application environments RAID 0,

RAID 1, RAID 3, RAID 4, RAID 5, RAID 0+1, RAID 1+0, RAID 6– Compare and contrast

integrated and modular storage systems –High – level architecture and working of an intelligent

storage system.

UNIT - III INTRODUCTION TO NETWORKED STORAGE Evolution of networked storage– Architecture– components– and topologies of FC – SAN–

NAS– and IP – SAN – Benefits of the different networked storage options– Understand the need

for long – term archiving solutions and describe how CAS fulfills the need – Understand the

appropriateness of the different networked storage options for different application environments

UNIT - IV INFORMATION AVAILABILITY & MONITORING & MANAGING

DATACENTER List reasons for planned/unplanned outages and the impact of downtime– Impact of downtime–

Differentiate between business continuity (BC) and disaster recovery (DR) –RTO and RPO–

Identify single points of failure in a storage infrastructure and list solutions to mitigate these

failures – Architecture of backup/recovery and the different backup/recovery topologies –

replication technologies and their role in ensuring information availability and business

continuity– Remote replication technologies and their role in providing disaster recovery and

business continuity capabilities

Identify key areas to monitor in data center– Industry standards for data center monitoring and

management– Key metrics to monitor for different components in a storage infrastructure– Key

management tasks in a data center.

UNIT - V SECURING STORAGE AND STORAGE VIRTUALIZATION Information security– Critical security attributes for information systems– Storage security

domains– List and analyzes the common threats in each domain– Virtualization technologies–

block – level and file – level virtualization technologies and processes

REFERENCES

EMC Corporation, 2003, “Information Storage and Management”, 2nd

Edition, Wiley, ISBN

number 04702942134, New York.

Robert Spalding, 2003, “Storage Networks the Complete Reference“, 3rd

Edition, Tata McGraw

Hill, Osborne.

Marc Farley, 2001, “Building Storage Networks”, 2nd

Edition, Tata McGraw Hill, Osborne.

Meeta Gupta, 2002, “Storage Area Network Fundamentals” 3rd

Edition, Pearson Education

Limited, Asia.

Page 19: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,
Page 20: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTIT411 DATABASE TECHNOLOGY LAB

LIST OF EXPERIMENTS

1. Library Management System

2. Quiz System

3. Payroll System

4. HR Management System

5. Inventory Control System

6. e -Book

7. Online Banking

8. Online Ticket Reservation System

9. Online Shopping

10. Online Tax Payment System

Page 21: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

SEMESTER - V

12PMTIT501 RESEARCH METHODOLOGY PEDAGOGY&

COMMUNICATION SKILLS

AIM

To study the research methodology and pedagogy

OBJECTIVE

To enable the students to get involved in research activities.

UNIT - I HIGHER EDUCATION AN INTRODUCTION

Historical perspectives – the objectives of higher education – role of higher education – social

focus – curricular focus – administrative focus – rivers of change in higher education –

globalization – changing demographics – structuring of employment – technological change –

demand of accountability – consumerism – Expectations by employers – rate of knowledge

growth – ampus demographics – concern for community – Restructuring and new patterns of

decision making.

UNIT - II RESEARCH PROCESSES AND METHODOLOGY

Introduction to Research – Research strategies – Ethics – Code of conduct for Research – Health

and Safety – IPR – Research Events – Networks – Outreach Activities – Best Research practices

– Quality assurance for Research – Career Management for Researchers – Research seminars –

Journal critiques.

UNIT - III EFFECTIVE RESEARCH SKILLS

Data collection – Modeling – Simulation – Analysis – Prototyping – Presentation Skills – Data

Presentation Skills – Research Writing skills (For Articles, Reports, Journals and Thesis) –

Creative Skills – Effective Interview Skills – Team Building Skills – Communication and

Interpersonal Skills – knowledge Transfer skills – Vivo voce – Teaching and Information Skills –

Effective use of Library – Survey Skills – Planning and Control Methods – Statistical Tools –

Patents and Copyrights – Advanced Research Techniques and Tools.

Page 22: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - IV TECHNIQUES OF TEACHING AND EVALUATION

Large group techniques – lecture, seminar – symposium – panel discussion – project approaches

and workshop – Small Group techniques – group discussion simulation – role playing – Buzz

techniques – brain storming – case discussion and assignment – system approach in education –

Individualized techniques – CAI Keller plan – PSI and programmed learning – methods of

evaluation – self evaluation and student evaluation in higher education – question banking –

diagnostic testing and remedial teaching.

UNIT - V ESSENTIALS FOR EFFECTIVE COMMUNICATION IN ENGLISH

Improving Vocabulary stock – general and technical vocabulary – British and American

vocabulary – homophones & homonyms – idioms and phrases – Different grammatical functions

of the same word – Grammar – Tenses – Voice – reported speech – Modals – spoken English

structures – formal and informal – letters – project reports – descriptions – circulars – synopsis

and summary writing – Listening skills for competitive exams – Reading skills – skimming and

scanning – Reading journals – magazines and newspapers for comprehension – Practical use of

English – conversation – seminars – individual speeches and group discussions – Reference skills

– Using dictionary, thesaurus and encyclopedia – Error shooting for better use of English.

TEXT BOOKS

Alley, Michael, 2003,”The Craft of Scientific Writing”, 3rd

Edition, Springer, New York.

Alley, Michael, 2003, “The Craft of Scientific Presentations”, Springer, New York.

REFERENCES

Hubbuch, Susan M., 2005, “Writing Research Papers Across the Curriculum”, 5th

Edition,

Thompson, New York.

Vedanayagam.E.G, 2003, “Teaching technology for college teachers”, 4th

Edition, Sterling

publishers (Pvt) Ltd, New Delhi.

Page 23: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

ELECTIVES

12PMTITE01 THEORY OF COMPUTATION

AIM

To have a introductory knowledge of automata, formal language theory and computability.

OBJECTIVES

To have an understanding of finite state and pushdown automata.

To have a knowledge of regular languages and context free languages.

To know the relation between regular language, context free language and

corresponding recognizers.

To study the Turing machine and classes of problems.

UNIT - I FINITE AUTOMATA AND REGULAR LANGUAGES

Finite Automata and Regular languages – Regular expressions and Regular languages – non

determinism and Kleenes theorem – Equivalence of DFA and NFA – Finite Automation with e-

moves – equivalence of regular expression and NFA with e-moves – pumping lemma for regular

sets.

UNIT - II CONTEXT FREE LANGUAGES

Context free languages – Derivation and languages – Relationship between derivation and

derivation tree – Simplification of context free grammars – Normal forms for context free

grammars – CNF and GNF.

UNIT - III PUSH DOWN AUTOMATA (PDA)

Acceptance by PDA – Pushdown automata and Context free languages – Pumping lemma for

CFL – deterministic Context free languages and Deterministic pushdown automata.

UNIT - IV TURING MACHINE

Context sensitive languages and LBA – Turing machine (Definition and examples) – Computable

languages and functions – Church Turing hypothesis – Universal Turing machine – P and NP

problems – NP-complete.

Page 24: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - V UNSOLVABLE PROBLEMS

Unsolvable problems – Rice Theorem – Post's correspondence Problem – Recursive and

recursively enumerable languages.

REFERENCES:

Hopcroft and Ullman, 2001, “Introduction to Automata, Languages and Computation”, 2nd

Edition, Narosa Publishers, New York.

Natarajan A.M., Tamilarasi.A & Balasubramani.B, 2002,” Theory of Computation”, 3rd

Edition,

New age International publishers, New Delhi.

Page 25: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE02 SOFT COMPUTING

AIM

To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems

which differ from conventional AI and computing in terms of its tolerance to imprecision and

uncertainty.

OBJECTIVES

To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human

experience

To become familiar with neural networks that can learn from available examples and

generalize to form appropriate rules for inferencing systems

To provide the mathematical background for carrying out the optimization associated with

neural network learning

UNIT - I FUZZY SET THEORY

Introduction to Neuro – Fuzzy and soft Computing – Fuzzy Sets – Basic Definition and

Terminology – Set-theoretic operations – Member Function Formulation and parameterization –

Fuzzy Rules and Fuzzy Reasoning – Extension principle and Fuzzy Relations – Fuzzy If-Then

Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy

Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling.

UNIT - II OPTIMIZATION

Derivative-based Optimization – Descent Methods – The Method of steepest Descent – Classical

Newton’s Method – Step Size Determination – Derivative-free Optimization – Genetic

Algorithms – Simulated Annealing – Random Search – Downhill Simplex Search.

UNIT - III NEURAL NETWORKS

Supervised Learning Neural Networks – Perceptrons-Adaline – Backpropagation Multilayer

perceptrons – Radial Basis Function Networks – Unsupervised Learning and Other Neural

Networks – Competitive Learning Networks – Kohonen Self – Organizing Networks – Learning

Vector Quantization – Hebbian Learning.

UNIT - IV NEURO FUZZY MODELING

Page 26: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – learning

Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro-Fuzzy Modeling – Framework

– Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum.

UNIT - V APPLICATION OF COMPUTATIONAL INTELLIGENCE

Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency

prediction – Soft Computing for Color Recipe Prediction.

REFERENCES

Jang J.S.R., Sun.C.T and Mizutani.E, 2004, “Neuro-Fuzzy and Soft Computing”, 5th

Edition,

PHI, Pearson Education, Asia.

Timothy J.Ross, 2004,”Fuzzy Logic with Engineering Application “,2nd

Edition, McGraw Hill,

New Delhi.

12PMTITE03 MOBILE COMPUTING

AIM

To provide basics for various techniques in Mobile Communications and Mobile Content

services.

OBJECTIVES

To learn the basics of Wireless voice and data communications technologies.

To build working knowledge on various telephone and satellite networks.

To study the working principles of wireless LAN and its standards.

To build knowledge on various Mobile Computing algorithms.

To build skills in working with Wireless application Protocols to develop mobile content

applications

UNIT - I INTRODUCTION

Medium Access Control – Motivation for Specialized MAC – SDMA – FDMA – DMACDMA –

Comparison of Access mechanisms – Tele communications GSM – DECTTETRA – UMTS –

IMT-200 – Satellite Systems Basics – Routing – Localization – Handover – Broadcast Systems

Page 27: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Overview – Cyclic Repetition of Data – Digital Audio Broadcasting – Digital Video

Broadcasting.

UNIT - II WIRELESS NETWORKS

Wireless LAN Infrared Vs Radio Transmission – Infrastructure Networks – Ad hoc Networks –

IEEE 802.11 – HIPERLAN – Bluetooth – Wireless ATM Working Group – Services –

Reference Model – Functions – Radio Access Layer – Handover- Location Management –

Addressing Mobile Quality of Service – Access Point Control Protocol.

UNIT - III MOBILE NETWORK LAYER

Mobile IP Goals – Assumptions and Requirement – Entities – IP packet Delivery – Agent

Advertisement and Discovery – Registration – Tunneling and Encapsulation – Optimization –

Reverse Tunneling – IPv6 – DHCP- Ad hoc Networks.

UNIT - IV MOBILE TRANSPORT LAYER

Traditional TCP – Indirect TCP – Snooping TCP – Mobile TCP – Fast retransmit/ Fast Recovery

– Transmission/ Timeout Freezing – Selective Retransmission – Transaction Oriented TCP.

UNIT - V WAP

Architecture – Datagram Protocol – Transport Layer Security – Transaction Protocol – Session

Protocol – Application Environment – Wireless Telephony Application.

REFERENCES

William Stallings, 2003, “Wireless Communication and Networks”, 3rd

Edition, Pearson

Education, Asia.

Lother Merk, Martin. S. Nicklaus and Thomas Stober, 2003, “Principles of Mobile

Computing”, 2nd

Edition, Springer, Asia.

12PMTITE04 DISTRIBUTED COMPUTING

AIM

Page 28: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

To understand the basic concepts in distributing computing in operating systems

OBJECTIVES

To enable the students to involve in research activities in recent trends

To make the students to get idea of distributed operating systems

UNIT - I INTRODUCTION

Characterization of Distributed Systems – Examples – Resource Sharing and the Web –

Challenges – System Models – Architectural and Fundamental Models – Networking and

Internetworking – Types of Networks – Network Principles – Internet Protocols – Case Studies.

UNIT - II PROCESSES AND DISTRIBUTED OBJECTS

Interprocess Communication – The API for the Internet Protocols – External Data

Representation and Marshalling – Client-Server Communication – Group Communication – Case

Study – Distributed Objects and Remote Invocation – Communication Between Distributed

Objects – Remote Procedure Call – Events and Notifications – Java RMI – Case Study.

UNIT - III OPERATING SYSTEM ISSUES – I

The OS Layer – Protection – Processes and Threads – Communication and Invocation – OS

Architecture – Security - Overview – Cryptographic Algorithms – Digital Signatures –

Cryptography Pragmatics – Case Studies – Distributed File Systems – File Service Architecture –

Sun Network File System – The Andrew File System.

UNIT - IV OPERATING SYSTEM ISSUES – II

Name Services – Domain Name System – Directory and Discovery Services – Global Name

Service – X.500 Directory Service – Clocks, Events and Process States – Synchronizing Physical

Clocks – Logical Time And Logical Clocks – Global States – Distributed Debugging –

Distributed Mutual Exclusion – Elections – Multicast Communication Related Problems.

UNIT - V DISTRIBUTED TRANSACTION PROCESSING

Page 29: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Transactions – Nested Transactions – Locks – Optimistic Concurrency Control – Timestamp

Ordering – Comparison – Flat and Nested Distributed Transactions – Atomic Commit Protocols –

Concurrency Control in Distributed Transactions – Distributed Deadlocks – Transaction

Recovery – Overview of Replication And Distributed Multimedia Systems.

REFERENCES

George Coulouris, Jean Dollimore and Tim Kindberg, 2002, “Distributed Systems Concepts and

Design”, 3rd Edition, Pearson Education, Asia.

Liu M.L., 2004, “Distributed Computing Principles and Applications”, 3rd

Edition, Pearson

Education, Asia.

Andrew S Tanenbaum, Maartenvan Steen, 2002, “Distributed Systems – Principles and

Paradigms”, 4th

Edition, Pearson Education, Asia.

Mugesh Singhal, Niranjan G Shivaratri, 2001,”Advanced Concepts in Operating Systems”, 5th

Edition, Tata McGraw Hill, New Delhi.

Page 30: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE05 MULTIMEDIA SYSTEMS

AIM

To impart the fundamental concepts of Multimedia.

OBJECTIVES

To study the multimedia concepts and various Applications.

To enable the students to develop their creativity

UNIT - I INTRODUCTION AND QOS

Introduction – QOS Requirements and Constraints – Concepts – Resources – Establishment

Phase – Runtime Phase – Management Architectures.

UNIT - II OPERATING SYSTEMS

Real-Time Processing – Scheduling – Interprocess Communication – Memory and Management

– Server Architecture – Disk Management.

UNIT - III FILE SYSTEMS AND NETWORKS

Traditional and Multimedia File Systems – Caching Policy – Batching – Piggy backing –

Ethernet – Gigabit Ethernet – Token Ring – 100VG AnyLAN – Fiber Distributed Data Interface

(FDDI) – ATM Networks – MAN – WAN.

UNIT - IV COMMUNICATION

Transport Subsystem – Protocol Support for QOS – Transport of Multimedia – Computer

Supported Cooperative Work – Architecture – Session Management – MBone Applications.

UNIT - V SYNCHRONIZATION

Synchronization in Multimedia Systems – Presentation – Synchronization Types – Multimedia

Synchronization Methods – Case Studies – MHEG – MODE – ACME.

Page 31: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

REFERENCES

Ralf Steinmetz and Klara Nahrstedt, 2004, “Multimedia Systems”, 1st Edition, Springer,

New York.

Rao K. R., Zoran S. Bojkovic, Dragorad A. Milovacovic, D. A. Milovacovic,

“Multimedia Communication Systems Techniques, Standards, and Networks”, 3rd

Edition,

Prentice Hall, New Delhi.

Ze – Nian Li and Mark S. Drew, 2004, “Fundamentals of Multimedia” 2nd

Edition, Pearson

education, Asia.

12PMTITE06 XML AND WEB SERVICES

AIM

To impart the basic concepts of web services.

OBJECTIVES

To study the XML techniques in real time application.

To study the security feature in web application.

UNIT - I INTRODUCTION

Role Of XML – XML and The Web – XML Language Basics – SOAP – Web Services –

Revolutions Of XML – Service Oriented Architecture (SOA).

UNIT - II XML TECHNOLOGY

XML – Name Spaces – Structuring With Schemas and DTD – Presentation Techniques –

Transformation – XML Infrastructure.

UNIT - III SOAP

Overview Of SOAP – HTTP – XML – RPC – SOAP Protocol – Message Structure –

Intermediaries – Actors – Design Patterns And Faults – SOAP With Attachments.

UNIT - IV WEB SERVICES

Overview – Architecture – Key Technologies – UDDI – WSDL – ebXML – SOAP And

Web Services In E – Com – Overview Of .NET And J2EE.

Page 32: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - V XML SECURITY

Security Overview – Canonicalization – XML Security Framework – XML Encryption –

XML Digital Signature – XKMS Structure – Guidelines For Signing XML Documents –

XML In Practice.

REFERENCES

Frank. P. Coyle, 2002, “XML, Web Services And The Data Revolution”, 2nd

Edition, Pearson

Education, Asia.

Ramesh Nagappan, Robert Skoczylas and Rima Patel Sriganesh, 2004, “Developing Java Web

Services”, 4th

Edition, Wiley Publishing Inc, New York.

Sandeep Chatterjee, James Webber, 2004, “Developing Enterprise Web Services”, 4th

Edition,

Pearson Education, Asia.

12PMTITE07 BIO INFORMATICS

AIM

To study the importance of Bio Informatics among the students

OBJECTIVES

To study the relationship between Data mining with Bio informatics

To simulate the Biological tools using softwares

UNIT - I INTRODUCTION

The Central Dogma – Killer Application – Parallel Universes – Watson’s Definition – Top Down

Vs Bottom Up Approach – Information Flow – Conversance – Communications.

UNIT - II DATABASE AND NETWORKS

Definition – Data Management – Data Life Cycle – Database Technology – Interfaces –

Implementation – Networks Communication Models – Transmission Technology – Protocols –

Bandwidth – Topology – Contents – Security – Ownership – Implementation.

Page 33: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - III SEARCH ENGINES AND DATA VISUALIZATION

Search Process – Technologies – Searching And Information Theory – Computational Methods –

Knowledge Management – Sequence Visualizations – Structure Visualizations – User Interfaces

– Animation Vs Simulation.

UNIT - IV STATISTICS, DATA MINING AND PATTERN MATCHING

Statistical Concepts – Micro Arrays – Imperfect Data – Basics – Quantifying – Randomness –

Data Analysis – Tools Selection – Alignment – Clustering – Classification – Data Mining

Methods – Technology – Infrastructure Pattern Recognition – Discovery – Machine Learning –

Text Mining – Pattern Matching Fundamentals – Dot Matrix Analysis – Substitution Matrix –

Dynamic Programming – Word Method – Bayesian Method – Multiple Sequence Alignment

Tools.

UNIT - V MODELING SIMULATION AND COLLABORATION

Drug Discovery Fundamentals – Protein Structure – System Biology Tools – Collaboration And

Communication – Standards – Issues – Case Study.

REFERENCES

Bryan Bergeron, 2003, “Bio Informatics Computing”, 2nd

Edition, Prentice Hall, New York.

Affward T.K. ,D.J. Parry Smith, 2001, “Introduction to Bio Informatics”, 4th

Edition, Pearson

Education, Asia.

Pierre Baldi, Soren Brunak, 2003, “Bio Informatics – The Machine Learning Approach”,

2nd Edition, First East West Press, Moscow.

12PMTITE08 GRID COMPUTING

AIM

To understand the technology application and tool kits for grid computing.

OBJECTIVES

Page 34: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

To understand the basics of grid computing

To know the application of grid computing

To understanding the technology and tool kits to facilitated the grid computing

UNIT - I GRID COMPUTING

Introduction – Definition – Scope of grid computing

UNIT - II GRID COMPUTING INITIATIVES

Grid Computing Organizations and their roles – Grid Computing analog – Grid Computing road

map.

UNIT - III GRID COMPUTING APPLICATIONS

Merging the Grid sources – Architecture with the Web Devices Architecture.

UNIT - IV TECHNOLOGIES

OGSA – Sample use cases – OGSA platform components – OGSI – OGSA Basic Services.

UNIT – V GRID COMPUTING TOOL KITS

Globus Toolkit – Architecture, Programming model, High level services – OGSI .Net

middleware Solutions.

REFERENCES

Joshy Joseph & Craig Fellenstein, PTR – 2003, “Grid Computing”, 4th

Edition, PHI, Asia.

Ahmar Abbas, 2003, “Grid Computing A Practical Guide to technology and Applications”, 2nd

Edition, Charles River media, New York.

12PMTITE09 NETWORK SECURITY

AIM

Page 35: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

To understand the principles of encryption algorithms; conventional and public key

cryptography. To have a detailed knowledge about authentication, hash functions and application

level security mechanisms.

OBJECTIVES

To know the methods of conventional encryption.

To understand the concepts of public key encryption and number theory

To know the network security tools and applications.

To understand the system level security used

UNIT - I INTRODUCTION

Attacks – Services – Mechanisms – Conventional Encryption – Classical And Modern

Techniques – Encryption Algorithms – Confidentiality.

UNIT - II PUBLIC KEY ENCRYPTION

RSA – Elliptic Curve Cryptography – Number Theory Concepts

UNIT - III MESSAGE AUTHENTICATION

Hash Functions – Digest Functions – Digital Signatures – Authentication Protocols.

UNIT - IV NETWORK SECURITY PRACTICE

Authentication, Applications – Electronic Mail Security – IP Security – Web Security.

UNIT - V SYSTEM SECURITY

Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems.

REFERENCES

Stallings, 2002, “Cryptography & Network Security – Principles & Practice”, 3rd Edition

Prentice Hall, New Delhi.

Bruce, Schneier, 2002, “Applied Cryptography”, 2nd Edition, Toha Wiley & Sons, New York.

12PMTITE10 EMBEDDED SYSTEMS

Page 36: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

AIM

To give sufficient background for undertaking embedded systems design.

OBJECTIVES

To introduce students to the embedded systems, its hardware and software.

To introduce devices and buses used for embedded networking.

To explain programming concepts and embedded programming in C and C++.

To explain real time operating systems, inter-task communication and an exemplary case

of MUCOS – IIRTOS.

UNIT - I INTRODUCTION TO EMBEDDED SYSTEMS

Definition and Classification – Overview of Processors and hardware units in an embedded

system – Software embedded into the system – Exemplary Embedded Systems – Embedded

Systems on a Chip (SoC) and the use of VLSI designed circuits

UNIT - II DEVICES AND BUSES FOR DEVICES NETWORK

I/O Devices – Device I/O Types and Examples – Synchronous – Iso – synchronous and

Asynchronous Communications from Serial Devices – Examples of Internal Serial –

Communication Devices – UART and HDLC – Parallel Port Devices – Sophisticated interfacing

features in Devices/Ports – Timer and Counting Devices – ‘12C’, ‘USB’, ‘CAN’ and advanced

I/O Serial high speed buses – ISA, PCI, PCI – X, cPCI and advanced buses.

UNIT - III EMBEDDED PROGRAMMING

Programming in assembly language (ALP) vs. High Level Language – C Program Elements,

Macros and functions – Use of Pointers – NULL Pointers – Use of Function Calls – Multiple

function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt

Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ –

Objected Oriented Programming – Embedded Programming in C++, ‘C’ Program compilers –

Cross compiler – Optimization of memory codes.

UNIT - IV REAL TIME OPERATING SYSTEMS – PART – 1

Page 37: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

OS Services – Interrupt Routines Handling, Task scheduling models – Handling of task

scheduling and latency and deadlines as performance metrics – Inter Process Communication

And Synchronisation – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem

and Deadlock Situations – Inter Process Communications using Signals – Semaphore Flag or

mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets –

RPCs.

UNIT - V REAL TIME OPERATING SYSTEMS – PART – 2

Study of RTOS, VxWorks – Basic Features – Task Management Library at the System – Library

Header File – VxWorks System Functions and System Tasks – Inter Process (Task)

Communication Functions – Case Study of Coding for Sending Application Layer Byte Streams

on a TCP/IP Network Using RTOS Vxworks

REFERENCES

Rajkamal, 2003, “Embedded Systems Architecture, Programming and Design”, 2nd

Edition,

TATA McGraw Hill, New Delhi.

David E.Simon, 2000, “An Embedded Software Primer”, 2nd

Edition, Pearson Education Asia.

Page 38: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE11 DIGITAL IMAGING

AIM

To understand the basic concepts of Digital image processing

OBJECTIVES

To enable the students to analyse the details of image compression ans segmentataion

To make the students to understand image recognition and Interpretation

UNIT - I DIGITAL IMAGE FUNDAMENTALS

Image formation, Image transforms – fourier transforms, Walsh, Hadamard, Discrete cosine,

Hotelling transforms.

UNIT - II IMAGE ENHANCEMENT & RESTORATION

Histogram modification techniques – Image smoothening – Image Sharpening – Image

Restoration – Degradation Model – Noise models – Spatial filtering – Frequency domain

filtering.

UNIT - III IMAGE COMPRESSION & SEGMENTATION

Compression Models – Elements of information theory – Error free Compression – Image

segmentation – Detection of discontinuities – Edge linking and boundary detection –

Thresholding – Region based segmentation – Morphology.

UNIT - IV REPRESENTATION AND DESCRIPTION

Representation schemes – Boundary descriptors – Regional descriptors – Relational Descriptors

UNIT - V OBJECT RECOGNITION AND INTERPRETATION

Patterns and pattern classes – Decision – Theoretic methods – Structural methods.

REFERENCES

Gonzalez.R.C & Woods. R.E., “Digital Image Processing”, 2nd Edition, Pearson

Education, Asia.

Anil Jain.K, 2002, “Fundamentals of Digital image Processing”, 2nd

Edition, Prentice Hall of

India, New Delhi.

Page 39: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE12 SOFTWARE QUALITY ASSURANCE

AIM

To introduce an integrated approach to software development incorporating quality assurance

technologies.

OBJECTIVES

To study the Software quality models

To study the Quality plan, implementation and documentation

To understand the Quality measurement and metrics and CASE Tools

UNIT - I CONCEPTS

Concepts of Quality Control, Quality Assurance, Quality Management – Total Quality

Management; Cost of Quality; QC tools – 7 QC Tools and Modern Tools; Other related topics –

Business Process Re – engineering – Zero Defect, Six Sigma, Quality Function Deployment,

Benchmarking, Statistical process control.

UNIT - II SOFTWARE ENGINEERING CONCEPTS

Software Engineering Principles, Software Project Management, Software Process, Project and

Product Metrics, Risk Management, Software Quality Assurance; Statistical Quality Assurance –

Software Reliability, Muse Model; Software Configuration Management; Software Testing;

CASE (Computer Aided Software Engineering).

UNIT - III QUALITY ASSURANCE MODELS

Models for Quality Assurance – ISO – 9000 – Series, CMM, SPICE, Malcolm Baldrige Award.

UNIT - IV SOFTWARE QUALITY ASSURANCE RELATED TOPICS

Software Process – Definition and implementation; internal Auditing and Assessments; Software

testing – Concepts, Tools, Reviews, Inspections & Walkthroughts; P – CMM.

Page 40: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,
Page 41: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - V FUTURE TRENDS

PSP and TSP, CMMI, OO Methodology, Clean – room software engineering, Defect injection

and prevention.

REFERENCES

Watts Humphery, 2001, “Managing Software Process ", 5th

Edition, Addison – Wesley, New

York.

Philip B Crosby, 2002, "Quality is Free The Art of Making Quality Certain ", 2nd

Edition, Mass

Market, New York.

Roger Pressman, 2005, “Software Engineering ", 6th

Edition, McGraw Hill, New Delhi.

12PMTITE13 AD HOC NETWORKS

AIM

To have a detailed knowledge about Adhoc Networks and its protocols.

OBJECTIVES

To know the different Adhoc Network protocol..

To understand the concepts of multicast routing in Adhoc Networks

UNIT - I INTRODUCTION

Introduction – Fundamentals of Wireless Communication Technology – The Electromagnetic

Spectrum – Radio Propagation Mechanisms – Characteristics of the Wireless Channel – IEEE

802.11a,b Standard – Origin Of Ad hoc Packet Radio Networks – Technical Challenges –

Architecture of PRNETs – Components of Packet Radios – Ad hoc Wireless Networks – What Is

an Ad Hoc Network? Heterogeneity in Mobile Devices – Wireless Sensor Networks – Traffic

Profiles – Types of Ad hoc Mobile Communications – Types of Mobile Host Movements –

Challenges Facing Ad Hoc Mobile Networks – Ad hoc wireless Internet.

UNIT - II AD HOC ROUTING PROTOCOLS

Introduction – Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks –

Classifications of Routing Protocols – Table – Driven Routing Protocols – Destination

Sequenced Distance Vector (DSDV) – Wireless Routing Protocol (WRP) – Cluster Switch

Gateway Routing (CSGR) – Source – Initiated On – Demand Approaches – Ad Hoc On –

Demand Distance Vector Routing (AODV) – Dynamic Source Routing (DSR) – Temporally

Page 42: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Ordered Routing Algorithm (TORA) – Signal Stability Routing (SSR) – Location – Aided

Routing (LAR) – Power – Aware Routing (PAR) – Zone Routing Protocol (ZRP).

UNIT - III MULTICASTROUTING IN AD HOC NETWORKS

Introduction – Issues in Designing a Multicast Routing Protocol – Operation of Multicast Routing

Protocols – An Architecture Reference Model for Multicast Routing Protocols – Classifications

of Multicast Routing Protocols – Tree – Based Multicast Routing Protocols – Mesh – Based

Multicast Routing Protocols – Summary of Tree – and Mesh – Based Protocols – Energy –

Efficient Multicasting – Multicasting with Quality of Service Guarantees – Application –

Dependent Multicast Routing – Comparisons of Multicast Routing Protocols.

UNIT - IV TRANSPORT LAYER, SECURITY PROTOCOLS

Introduction – Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks –

Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks – Classification of

Transport Layer Solutions – TCP Over Ad Hoc Wireless Networks – Other Transport Layer

Protocols for Ad Hoc Wireless Networks – Security in Ad Hoc Wireless Networks – Network

Security Requirements – Issues and Challenges in Security Provisioning – Network Security

Attacks – Key Management – Secure Routing in Ad Hoc Wireless Networks.

UNIT - V QoS AND ENERGY MANAGEMENT

Introduction – Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks –

Classifications of QoS Solutions – MAC Layer Solutions – Network Layer Solutions – QoS

Frameworks for Ad Hoc Wireless Networks Energy Management in Ad Hoc Wireless Networks

– Introduction – Need for Energy Management in Ad Hoc Wireless Networks – Classification of

Energy Management Schemes – Battery Management Schemes – Transmission Power

Management Schemes – System Power Management Schemes.

REFERENCES

Siva Ram Murthy C. and Manoj.B.S, 2004, “Ad Hoc Wireless Networks Architectures and

Protocols”, 2nd

Edition, Prentice Hall PTR, New Delhi.

Toh C.K., 2001, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, 3rd

Edition,

Prentice Hall PTR, New Delhi.

Charles E. Perkins, 2002, “Ad Hoc Networking”, 3rd

Edition, Addison Wesley, New York.

Page 43: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE14 DATA WAREHOUSING AND DATA MINING

AIM

To serve as an introductory course to under graduate students with an emphasis on the design

aspects of Data Mining and Data Warehousing

OBJECTIVES

This course has been designed with the following objectives:

To introduce the concept of data mining with in detail coverage of basic tasks, metrics,

issues, and implication. Core topics like classification, clustering and association rules are

exhaustively dealt with.

To introduce the concept of data warehousing with special emphasis on architecture and

design.

UNIT - I INTRODUCTION

Relation To Statistics, Databases – Data Mining Functionalities – Steps In Data Mining Process

– Architecture Of A Typical Data Mining Systems – Classification Of Data Mining Systems –

Overview Of Data Mining Techniques.

UNIT - II DATA PREPROCESSING AND ASSOCIATION RULES

Data Preprocessing – Data Cleaning, Integration, Transformation, Reduction, Discretization

Concept Hierarchies – Concept Description Data Generalization And Summarization Based

Characterization – Mining Association Rules In Large Databases.

UNIT - III PREDICTIVE MODELING

Classification And Prediction Issues Regarding Classification And Prediction – Classification By

Decision Tree Induction – Bayesian Classification – Other Classification Methods – Prediction –

Clusters Analysis Types Of Data In Cluster Analysis – Categorization Of Major Clustering

Methods Partitioning Methods – Hierarchical Methods

UNIT - IV DATA WAREHOUSING

Data Warehousing Components – Multi Dimensional Data Model – Data Warehouse

Architecture – Data Warehouse Implementation – – Mapping The Data Warehouse To

Multiprocessor Architecture – OLAP. – Need – Categorization Of OLAP Tools.

Page 44: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,
Page 45: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - V APPLICATIONS

Applications of Data Mining – Social Impacts Of Data Mining – Tools – An Introduction To DB

Miner – Case Studies – Mining WWW – Mining Text Database – Mining Spatial Databases.

REFERENCES

Jiawei Han, Micheline Kamber, 2002, "Data Mining Concepts and Techniques", 4th

Edition,

Morgan Kaufmann Publishers, New York.

Alex Berson, Stephen J. Smith, 2004, “Data Warehousing, Data Mining,& OLAP”, 2nd

Edition,

Tata McGraw – Hill, New Delhi.

12PMTITE15 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS

ANDNETWORKS

AIM

To understand the performance Evaluation Techniques

OBJECTIVES

To study the fundamentals ofprobability and Queuing theory used for evaluating the

systems performance

To study the algorithm used in analysis of network performance.

UNIT - I INTRODUCTION

Need for performance evaluation – Role of performance evaluation – performance evaluation

Methods – Performance Metrics and Evaluation Criteria – CPU and I/O Architectures –

Distributed and Network Architectures – Secondary Storage – Topologies – Computer

Architecture – Fundamental Concepts and Performance Measures.

UNIT - II PROBABILITY AND STOCHASTIC PROCESSES

Scheduling Algorithms – Workloads – Random Variables – Probability Distributions – Densities

– Expectation – Stochastic Processes – Poisson Process – Birth – Death Process – Markov

Process.

UNIT - III QUEUING THEORY

Queuing Systems – Networks of Queues – Estimating Parameters and Distributions –

Computational Methods – Simulation Process – Time Control – Systems and Modeling.

Page 46: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - IV PETRI NETS AND SYSTEM PERFORMANCE

Petri Nets – Classical Petri Nets – Timed Petri Nets – Priority – based Petri Nets – Colored Petri

Nets – Generalized Petri Nets – Tool Selection – Validation of Results – Performance Metrics –

Evaluation – Multiple Server Computer System Analysis.

UNIT - V ANALYSIS

OS Components – System Architecture – Workloads – Design – Simulation – Analysis –

Database System Performance – Computer Networks Components – Simulation Modelling of

LAN.

REFERENCES

Paul J. Fortier, Howard E. Michael, 2003, “Computer Systems Performance

Evaluation and Prediction”, 4th

Edition, Elsvier Science, USA.

Thomas G. Robertazzi, , 2003, “Computer Networks and Systems Queing theory and

Performance Evaluation”, 3rd Edition, Springer, New York

12PMTITE16 AGENT BASED INTELLIGENT SYSTEMS

AIM

Artificial Intelligence aims at developing computer applications, which encompasses perception,

reasoning and learning and to provide an in-depth understanding of major techniques used to

simulate intelligence.

OBJECTIVES

To provide a strong foundation of fundamental concepts in Artificial Intelligence

To provide a basic exposition to the goals and methods of Artificial Intelligence

To enable the student to apply these techniques in applications which involve perception,

reasoning and learning.

UNIT - I INTRODUCTION

Page 47: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Definitions – Foundations – History – Intelligent Agents – Problem Solving – Searching –

Heuristics – Constraint Satisfaction Problems – Game playing.

UNIT - II KNOWLEDGE REPRESENTATION AND REASONING

Logical Agents – First order logic – First Order Inference – Unification – Chaining – Resolution

Strategies – Knowledge Representation – Objects – Actions – Events

UNIT - III PLANNING AGENTS

Planning Problem – State Space Search – Partial Order Planning – Graphs – Nondeterministic

Domains – Conditional Planning – Continuous Planning – MultiAgent Planning.

UNIT - IV AGENTS AND UNCERTAINITY

Acting under uncertainty – Probability Notation – Bayes Rule and use – Bayesian Networks –

Other Approaches – Time and Uncertainty – Temporal Models – Utility Theory – Decision

Network – Complex Decisions.

UNIT - V HIGHER LEVEL AGENTS

Knowledge in Learning – Relevance Information – Statistical Learning Methods –

Reinforcement Learning – Communication – Formal Grammar – Augmented Grammars –

Future of AI.

REFERENCES

Stuart Russell and Peter Norvig, 2002, “Artificial Intelligence – A Modern Approach”,

2nd Edition, Prentice Hall, New Delhi.

Michael Wooldridge, 2002, “An Introduction to Multi Agent System”, 4th

Edition, John Wiley,

New York.

Patrick Henry Winston, 2002, “Artificial Intelligence”, 3rd

Edition, AW, New York.

Nils.J.Nilsson, 2000, “Principles of Artificial Intelligence”, 2nd

Edition, Narosa Publishing

House, New Delhi.

12PMTITE17 VISUALIZATION TECHNIQUES

AIM:

To understand the basic visualization techniques

Page 48: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

OBJECTIVES:

To study the basic principles of 2D and 3D Graphics

To study the fundamental concepts of virtual realization systems design

UNIT - I INTRODUCTION

Introduction to Visualisation – Principles of 2D & 3D Computer Graphics – Models and

Simulation strategies.

UNIT - II POPULAR TECHNIQUES

Surface Plots – City scopes – Fish eye views – Benediktine Space – Perspective walls – Cone

trees and Cam trees – Sphere Visualisation – Rooms – Emotical icons.

UNIT - III ADVANCED TECHNIQUES

Self – Organising graphs – Spatial Data arrangements – Benediktine Cyberspace – Statistical

Clustering and Proximity measures – Hyper Structures – Human Centered Approaches –

Information Cube.

UNIT - IV VISUALIZATION SYSTEMS

Database Visualisation – Populated Information Terrains – Legibility enhancement – Hyper

structure Visualisation – Information Visualisation.

UNIT - V SOFTWARE VISUALIZATION

Rapid Prototyping – Models for user interaction – Formal Specification of Software – DFD –

Software Architecture.

REFERENCES

Chaomei Chan, 2002, “Information Visualisation and Virtual Environment”, 2nd

Edition,

Springer –Verlag, New York.

Benedikt.M, 2004, “Cyberspace First Steps”, 3rd

Edition, MIT Press, New Delhi.

Page 49: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE18 ADVANCED DATABASES

AIM

Advanced database aims at developing computer application with different kinds of data models.

It is also deals with the Transaction management of these different databases.

OBJECTIVES

To study the needs of different databases.

To understand about different data models that can be used for these databases.

To make the students to get familiarized with transaction management of the database

To develop in-depth knowledge about web and intelligent database.

UNIT - I DATABASE MANAGEMENT

Relational Data Model – SQL – Database Design – Entity – Relationship Model – Relational

Normalization – Embedded SQL – Dynamic SQL – JDBC – ODBC.

UNIT - II ADVANCED DATABASES

Object Databases – Conceptual Object Data Model – XML and Web Data – XML Schema –

Distributed Data bases – OLAP and Data Mining – ROLAP and MOLAP

UNIT - III QUERY AND TRANSACTION PROCESSING

Query Processing Basics – Heuristic Optimization – Cost, Size Estimation – Models of

Transactions – Architecture – Transaction Processing in a Centralized and Distributed System –

TP Monitor.

UNIT - IV IMPLEMENTING AND ISOLATION

Schedules – Concurrency Control – Objects and Semantic Commutativity – Locking – Crash,

Abort and Media Failure – Recovery – Atomic Termination – Distributed Deadlock – Global

Serialization – Replicated Databases – Distributed Transactions in Real World.

UNIT - V DATABASE DESIGN ISSUES

Security – Encryption – Digital Signatures – Authorization – Authenticated RPC – Integrity –

Consistency – Database Tuning – Optimization and Research Issues.

Page 50: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

REFERENCES

Philip M. Lewis, Arthur Bernstein, Michael Kifer, 2002, “Databases and Transaction

Processing An Application – Oriented Approach”, 2nd

Edition, Addison – Wesley, New York.

Elmasri R. and S.B. Navathe, 2004, “Fundamentals of Database Systems”, 3rd Edition,

Addison Wesley, New York.

Abraham Silberschatz, Henry. F. Korth, S.Sudharsan, 2004, “Database System Concepts”,

4thEdition, Tata McGraw Hill, New Delhi.

Raghu Ramakrishnan & Johannes Gehrke, 2003, “Database Management Systems”, 3rd

Edition, TMH, New Delhi.

Page 51: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE19 SOFTWARE PROJECT MANAGEMENT

AIM

To build knowledge on software project management

OBJECTIVES

To provide a strong foundation on concept of software process.

To understand the software management disciplines.

UNIT - I INTRODUCTION

Conventional Software Management – Evolution of Software Economics – Improving Software

Economics – Conventional versus Modern Software Project Management

UNIT - II SOFTWARE MANAGEMENT PROCESS FRAMEWORK

Lifecycle Phases – Artifacts of the Process – Model Based Software Architectures – Workflows

of the Process – Checkpoints of the Process

UNIT - III SOFTWARE MANAGEMENT DISCIPLINES

Iterative Process Planning – Organisation and Responsibilities – Process Automation – Process

Control and Process Instrumentation – Tailoring the Process

UNIT - IV MANAGED AND OPTIMIZED PROCESS

Data Gathering and Analysis Principles of Data Gathering, Data Gathering Process, Software

Measures, Data Analysis – Managing Software Quality – Defect Prevention

UNIT - V CASE STUDIES

COCOMO Cost Estimation Model – Change Metrics – CCPDS – R

REFERENCES

Walker Royce, 2004, “Software Project Management – A Unified Framework “,5th

Edition,

Pearson Education, Asia.

Ramesh Gopalaswamy, 2001, “Managing Global Projects”, 3rd

Edition, Tata McGraw Hill, New

Delhi.

Bob Hughes, Mikecotterell, 2004, “Software Project Management”,3rd Edition, Tata

McGraw Hill, New Delhi.

Page 52: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

12PMTITE20 COMPONENT BASED TECHNOLOGY

AIM

To introduce different software components and their application.

OBJECTIVES

Introduces in depth JAVA, Corba and .Net Components

Deals with Fundamental properties of components, technology and architecture and

middleware.

Component Frameworks and Development are covered in depth.

UNIT - I INTRODUCTION

Software Components – objects – fundamental properties of Component technology – modules –

interfaces – callbacks – directory services – component architecture – components and

middleware.

UNIT - II JAVA COMPONENT TECHNOLOGIES

Threads – Java Beans – Events and connections – properties – introspection – JAR files –

reflection – object serialization – Enterprise Java Beans – Distributed Object models – RMI and

RMI – IIOP.

UNIT - III CORBA TECHNOLOGIES

Java and CORBA – Interface Definition language – Object Request Broker – system object

model – portable object adapter – CORBA services – CORBA component model – containers –

Application server – model driven architecture.

UNIT - IV COM AND .NET TECHNOLOGIES

COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces –

connectable objects – OLE containers and servers – Active X controls – .NET components –

assemblies – appdomains – contexts – reflection – remoting.

Page 53: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - V COMPONENT FRAMEWORKS AND DEVELOPMENT

Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component

framework – directory objects – cross – development environment – component – oriented

programming – Component design and implementation tools – testing tools – assembly tools.

REFERENCES

Clemens Szyperski, 2002, “Component Software Beyond Object – Oriented Programming”, 2nd

Edition, Addison Wesley, New York.

Ed Roman, 2004, “Enterprise Java Beans”,3rd Edition, Wiley, New York.

12PMTITE21 ENTERPRISE JAVA (J2EE)

AIM

To provide fundamental ideas on Java required to implement Real Time Application

OBJECTIVES

To enable the students to understand the concepts in Enterprise Java

By building sample applications, the student will get experience and be ready for large-

scale projects

UNIT - I INTRODUCTION

J2EE and J2SE – The Birth of J2EE – Databases – The Maturing of Java – Java Beans and

Java Message Service – Why J2EE?

J2EE Multi – Tier Architecture – J2EE Best Practices – J2EE Design Patterns and Frameworks

UNIT - II JAVA SERVER PAGES

J2EE FOUNDATION – Java servlets – Java Server Pages

UNIT - III JAVA INTERFACES

Enterprise JavaBeans – JavaMail API – Java Interface Definition Language and CORBA.

Page 54: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

UNIT - IV JAVA RMI AND SECURITY

Java Remote Method Invocation – Java Message Service – Security – Java Naming and

Directory Interface API

UNIT - V WEBSERVICES

WEB SERVICES – SOAP – Universal Description, Discovery, and Integration (UDDI) –

Electronic Business XML – The Java API for XML Registries (JAXR) – Web Services

Description Language (WSDL)

REFERENCES

Budi Kurniawan, 2002,”Java for the Web with Servlets, JSP, and EJB”, 2nd

Editon, New Riders

Publishing, New Delhi.

James Keogh,2002, “J2EE - The complete Reference”, 3rd

Edition, Tata Mc-Graw Hill, New

Delhi.

Robert McGovern and Stuart Charlton, 2002,“CodeNotes for J2EE: EJB, JDBC, JSP, and

Servlets” ,2nd

Edition, Random House, New York.

12PMTITE22 JSP AND SERVLET

AIM:

To provide the knowledge of advance Java among the students.

OBJECTIVES:

To enable the students to have knowledge on real time application.

UNIT - I SERVLET BASICS

HTTP Basics – Common Gateway Interface Programming – Servlet vs Common Gateway

Interface – Servlet Architecture – Simple Java servlet– Anatomy of Java servlet–Deployment

Descriptor – Reading Data from a client– Reading HTTP Request Headers – Sending Data to a

Client and writing the HTTP Response Header– Working with Cookies– Tracking Sessions

UNIT - II JSP BASICS

JSP Overview – Setting up the JSP Environment – Common Navigation Bar – Dynamically

Change the Display of Common Navigation Elements – Login System's Logic –Create a

Page 55: SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN … Dept/M...SEMESTER- I 12PMTIT101 OPT IMIZA TN ECHN QUES UNIT - I LINEAR PROGRAMMING Linear Programming: Graphical method, Simplex method,

Registration Form –Validate Form Data –Store and Retrieve Session Data –Forward a User from

One JSP Page to Another –Update a Database with User Data

UNIT - III PERSONALIZATION AND SESSION MANAGEMENT

Plan a Personalization System –Store Data in a Cookie –Retrieve and Use Cookie Data –Test for

Live Session Data –Destroy a Session– Error Handling and Debugging

UNIT - IV DATABASE CONNECTION

Plan the Display of Dynamic Content –Display Database Results in Manageable Groups –Enable

Navigation for Long Record Sets– Internationalization

UNIT - V ENTERPRISE JAVA BEANS

Build a JavaBean that Creates a Database Connection– Build a JavaBean that Closes a Database

Connection –Create a JavaBean that Updates the Database –Use JavaBean in JSP Page –

Working with XML Data – Working with Scripting Elements

REFERENCE BOOKS:

Marty Hall and Larry Brown,2004,”Core Servlets and Java Server Pages”Prentice hall,

Budi Kurniawan,2002, “Java for the Web with Servlets, JSP, and EJB”, New Riders Publishing

Robert McGovern and Stuart Charlton,2002, “CodeNotes for J2EE: EJB, JDBC, JSP, and

Servlets” , Random House