UNIVERSITY DEPARTMENTS ANNA UNIVERSITY, CHENNAI 600 025 REGULATIONS - 2013 M.TECH.

INFORMATION TECHNOLOGY CURRICULUM AND SYLLABUS I TO IV SEMESTERS SEMESTER I SL. COURSE NO. CODE THEORY 1 2 3 4 5 6 MA8160 IF8152 IF8151 MM8163 IF8101 IF8102 Probability and Statistical Methods Advanced Data Structures and Algorithm Analysis Advanced Computer Architecture Software Engineering Methodologies Advanced Databases Network Engineering 3 3 3 3 3 3 1 0 0 0 0 0 0 0 0 0 0 0 4 3 3 3 3 3 COURSE TITLE L T P C

PRACTICAL 7 8 IF8111 IF8112 Data Structures Lab Networking and DBMS Lab 0 0 TOTAL 18 SEMESTER II SL. COURSE NO. CODE THEORY 1 2 3 4 5 6 PRACTICAL 7 8 IF8212 IF8211 Web Integrated Technologies Lab OS and Mobile Lab 0 0 TOTAL 18 1 0 0 0 3 3 6 2 2 22 IF8252 IF8254 IF8202 IF8201 IF8251 Cloud Computing Technologies Mobile and Pervasive Computing Web Integrated Technologies Data Analytics Advanced Operating System Elective I 3 3 3 3 3 3 0 0 0 0 0 0 0 0 0 0 0 0 3 3 3 3 3 3 COURSE TITLE L T P C 0 0 1 3 3 6 2 2 23

SEMESTER III SL. COURSE NO. CODE THEORY 1 2 3 PRACTICAL 4 5 IF8312 IF8311 Technical Seminar and Report writing Project Work (Phase I) 0 0 TOTAL 9 0 0 0 2 12 15 1 6 16 IF8301 Cryptography and Information Security Elective II Elective III 3 3 3 0 0 0 0 0 0 3 3 3 COURSE TITLE L T P C

SEMESTER IV SL. COURSE NO. CODE PRACTICAL 1 IF8411 Project Work (Phase II) TOTAL 0 0 0 0 24 24 12 12 COURSE TITLE L T P C

TOTAL NO OF CREDITS: 73

2

LIST OF ELECTIVE SUBJECTS SL. COURSE NO. CODE 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 IF8080 IF8008 IF8074 IF8081 IF8351 IF8084 IF8078 IF8003 IF8079 IF8082 IF8006 IF8013 IF8077 IF8012 IF8005 IF8071 IF8072 IF8083 IF8076 MG8071 IF8075 IF8011 IF8073 IF8004 IF8007 IF8002 IF8253 IF8001 MM8252 IF8010 IF8009 CP8075 MM8071 COURSE TITLE Service Oriented Architecture Grid Computing Data Warehousing and Data Mining Soft Computing Virtualization Adhoc and Sensor Networks Image Processing Computer Graphics and Multimedia Information Retrieval Software Quality and Testing E-Learning Machine Learning Human Computer Interaction X-Informatics Design of Software Agents Artificial Intelligence Compiler Design Unix Internals Embedded Computing System Design Operations Research Digital Signal Processing Text Mining Computer Vision Cyber Forensics Green Computing Building Internet of Things GPU Architecture and Programming 3G and 4G Wireless Networks Video Analytics Semantic Web Knowledge Engineering Social Network Analysis Digital Video Processing L 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 T 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 C 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3

3

Regression and Testing of hypothesis. and Kapoor V. 4. REFERENCES: 1. Uniform. Gupta S. Richard A.. UNIT I ONE DIMENSIONAL RANDOM VARIABLES 9+3 Random Variables . Johnson and Dean W. “Probability and Statistics for Engineering and the Sciences”. Poisson.Mean Vectors and Covariance Matrices . 2002. 2002.”Fundamentals of Mathematical Statistics”.Type I and Type II Errors . Prentice Hall . UNIT III ESTIMATION THEORY 9+3 Unbiased Estimators – Method of Moments – Maximum Likelihood Estimation . Variance And Proportions – Tests for Independence of Attributes and Goodness of Fit. UNIT II TWO DIMENSIONAL RANDOM VARIABLES 9+3 Joint Distributions – Marginal and Conditional Distributions – Functions of Two Dimensional Random Variables – Regression Curve – Correlation. TOTAL:45+15:60 PERIODS COURSE OUTCOME:  The course provides the basic concepts of Probability and Statistical techniques for solving mathematical problems which is useful in solving engineering problems. 1998. Devore. Thomson and Duxbury press. ”Miller & Freund’s Probability and Statistics for Engineer”. 2001. Pearson Education.Probability Function – Moments – Moment Generating Functions and Their Properties – Binomial.2 and F Distributions For Testing Of Mean.Curve fitting by Principle of Least Squares – Regression Lines. 4 . 3.  To enable the students to use the concepts of multivariate normal distribution and principal components analysis. Jay L.C.Multivariate Normal Density and Its Properties . Fifth Edition. Seventh Edition. 2007. t.K. Thomson and Duxbury. UNIT V MULTIVARIATE ANALYSIS 9+3 Random Vectors and Matrices . Gamma and Normal Distributions – Functions of a Random Variable. Wichern. Geometric.Principal Components: Population Principal Components Principal Components from Standardized Variables. Sultan and Sons. UNIT IV TESTING OF HYPOTHESES 9+3 Sampling Distributions . 2. Correlation.MA8160 PROBABILITY AND STATISTICAL METHODS L T PC 3 1 0 4 COURSE OBJECTIVE:  To introduce the basic concepts of one dimensional and two dimensional Random Variables. “Applied Multivariate Statistical Analysis”. “Applied multivariate methods for data analysis”. Richard Johnson.Tests based on Normal. 5. Exponential. Dallas E Johnson et al.  To provide information about Estimation theory.

Aho. Maximum Flow: Flow Networks – The Ford-Fulkerson method – Maximum Bipartite Matching. Clifford Stein. 1997. Fourth Edition. Jeffrey D.Minimum Spanning Trees: Growing a Minimum Spanning Tree – Kruskal and Prim.Red-Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion. Cormen. Alfred V. “Introduction to Algorithms”. Addison Wesley. Thomas H.Single-Source Shortest Paths: The Bellman-Ford algorithm – Single-Source Shortest paths in Directed Acyclic Graphs – Dijkstra’s Algorithm.  Design algorithms using graph structure and various string matching algorithms to solve reallife problems.Fundamental Algorithms”. John E. 3.Binomial Heaps: Binomial Trees and Binomial Heaps – Operations on Binomial Heaps UNIT III GRAPHS & STRINGS 9 Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First Search – Topological Sort – Strongly Connected Components. Ullman.Insertion Sort – Analyzing Algorithms – Designing Algorithms. Reprint 2006. Rivest. Hopcroft. Pearson Education. 4.B-Trees: Definition of Btrees – Basic operations on B-Trees – Deleting a key from a B-Tree. Leiserson.IF8152 ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the usage of algorithms in computing. Donald E Knuth. 5 . “Data Structures and Algorithms”.  Apply suitable design strategy for problem solving.  To study about NP Completeness of problems.Greedy Algorithms: An Activity-Selection Problem – Elements of the Greedy Strategy – Huffman Codes UNIT V NP COMPLETE AND NP HARD 9 NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP-Completeness and Reducability – NP-Completeness Proofs – NP-Complete Problems TOTAL: 45 PERIODS COURSE OUTCOMES:  Design data structures and algorithms to solve computing problems.Recurrences: The Substitution Method – The Recursion-Tree Method UNIT II HIERARCHICAL DATA STRUCTURES 9 Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion. REFERENCES: 1. UNIT I ROLE OF ALGORITHMS IN COMPUTING 9 Algorithms – Algorithms as a Technology.Growth of Functions: Asymptotic Notation – Standard Notations and Common Functions. Robert Sedgewick and Kevin Wayne. 2.  To select and design data structures and algorithms that is appropriate for problems. usage. Pearson Education.  Become familiar with the specification. Ronald L. implementation and analysis of hierarchical data structures and algorithms.  To learn and use hierarchical data structures and its operations.  To learn the usage of graphs and strings and its applications. “Algorithms”. Prentice-Hall. Third edition. Second Edition. String Matching: The Native String-Matching Algorithm – The Knuth-Morris-Pratt Algorithm UNIT IV ALGORITHM DESIGN TECHNIQUES 9 Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming – Longest Common Subsequence. AllPairs Shortest Paths: Shortest Paths and Matrix Multiplication – The Floyd-Warshall Algorithm. “Art of Computer Programming-Volume I. Charles E.

Overcoming Data Hazards with Dynamic Scheduling – Dynamic Branch Prediction . REFERENCES: 1. Patterson.Interconnection Networks – Buses. 2.Memory Technology and Optimizations – Name Mapping Implementations .Design of Memory Hierarchies .Speculation . the student will be able to:  Compare and evaluate the performance of various architectures. UNIT II THREAD-LEVEL PARALLELISM 8 Multi-threading – Multiprocessors .Concepts and Challenges .IF8151 ADVANCED COMPUTER ARCHITECTURE L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the evolution of computer architecture. UNIT III SIMD AND GPU ARCHITECTURES 8 SIMD Extensions for Multimedia – Graphics Processing Units – GPU Computational Structures – GPY ISA – GPU Memory Structures – Case Study.Multiple Issue Processors – Case Studies. Richard Y. 2012.Performance Issues – Synchronization Issues – Models of Memory Consistency . UNIT V WAREHOUSE-SCALE COMPUTERS 9 Programming Models and Workloads – Storage Architectures – Physical Infrastructure – Cloud Infrastructure – Case Study TOTAL: 45 PERIODS COURSE OUTCOMES: At the end of the course. 6 .Measuring and Reporting Performance .  Design sub-systems to meet specific performance requirements. Morgan Kaufmann / Elsevier. Hennessey and David A.Centralized and Distributed Shared Memory Architectures – Cache Coherence Issues . Crossbar and Multi-Stage Switches – Multi-Core Processor Architectures . UNIT I PIPELINING AND ILP 11 Fundamentals of Computer Design . UNIT IV MEMORY HIERARCHY DESIGN 9 Introduction . John L.Optimizations of Cache Performance .  To understand the state-of-the-art in computer architecture.Instruction Level Parallelism and Its Exploitation .Virtual Memory and Virtual Machines .  Analyze the requirements of large systems to select and build the right infrastructure. “Computer Architecture – A quantitative approach”. Kain. 2011. PHI.Case Study.Case Studies. Fifth edition. “Advanced Computer Architecture a Systems Design Approach”.  To understand the design challenges in building a system.

UNIT I SOFTWARE PRODUCT AND PROCESS 9 Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models – Component Based Design .Crowd Sourcing.Functional and Non-Functional – Software Document – Requirement Engineering Process – Feasibility Studies – Software Prototyping – Prototyping in the Software Process – Data – Functional and Behavioral Models – Structured Analysis and Data Dictionary. 7 .  Familiar with the Rational Rose and its equivalent open source tools for understanding basic software engineering concepts.  Familiar with software testing of simple mini projects. UNIT V SOFTWARE PROJECT MANAGEMENT 9 Measures and Measurements – ZIPF’s Law – Software Cost Estimation – Function Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value Analysis – Error Tracking – Software Configuration Management – Program Evolution Dynamics – Software Maintenance – Project Planning – Project Scheduling– Risk Management – CASE Tools.  To employ a selection of concepts and techniques to complete a small-scale analysis and design in mini projects.  Design and implement some basic cost estimation models.System Engineering – Business Process Engineering Overview – Product Engineering Overview – Agile Methods – Open Source Software Development . TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. UNIT IV TESTING 9 Taxonomy of Software Testing – Types of S/W Test – Black Box Testing – Testing Boundary Conditions – Structural Testing – Test Coverage Criteria Based on Data Flow Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation Testing – System Testing and Debugging – Software Implementation Techniques.  Implement mini projects incorporating the basic principles of software engineering.  Familiar with the basic concepts of software design. the students should be able to.Analysis Concepts .  To provide basic knowledge about software project management.  To impart knowledge and to translate requirement specifications into a design.  Critically analyze and apply software project management principles in simple projects.MM8163 SOFTWARE ENGINEERING METHODOLOGIES L T PC 3 0 0 3 COURSE OBJECTIVES:  To provide information about wider engineering issues that form the background in developing complex. UNIT II SOFTWARE REQUIREMENTS 9 Systems Engineering . implementation. and then realize that design practically. evolving (software-intensive) systems. all using an appropriate software engineering methodology. UNIT III DESIGN CONCEPTS AND PRINCIPLES 9 Design Process And Concepts – Modular Design – Design Heuristic – Architectural Design – Data Design – User Interface Design – Real Time Software Design – System Design – Real Time Executives – Data Acquisition System – Monitoring And Control System.  To plan a software engineering process that account for quality issues and non-functional requirements.

2008.1992 7.Humphrey.  To acquire knowledge on parallel and distributed databases and its applications. UNIT I PARALLEL AND DISTRIBUTED DATABASES 9 Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures – Parallel Systems. IF8101 ADVANCED DATABASES LT PC 3 0 0 3 COURSE OBJECTIVES:  To learn the modeling and design of databases.Spatial Data StructuresSpatial Access Methods. “An Integrated Approach to Software Engineering”.Taxonomy.Temporal Databases: Overview of Temporal DatabasesTSQL2. “Software Engineering”. Engineering Approach”.Data WarehousingData Mining. Ian Sommerville.  To acquire inquisitive attitude towards research topics in databases. UNIT IV ADVANCED DATA MODELS 9 Mobile Databases: Location and Handoff Management .Peters and Witold Pedrycz.Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Design of Parallel SystemsDistributed Database Concepts . 2.”A Discipline for Software Engineering”.Multimedia Databases. Roger S. 8 .Spatial Data Types.Spatial DB Implementation. Stephen R.Deductive Databases: Logic of Query Languages – Datalog. 5. Ninth Edition. Seventh Edition. Pankaj Jalote. 2006. Narosa publications.Text Mining.Schach. Pearson Education Asia. Cloud and Big Data.  To understand the usage of advanced data models.  To learn emerging databases such as XML. Watts S. “Software Engineering – A practitioner’s Approach”. Pressman. UNIT III INTELLIGENT DATABASES 9 Active Databases: Syntax and Semantics (Starburst. DB2).ApplicationsDesign Principles for Active Rules. Tata McGraw-Hill International Edition. 2007.  To study the usage and applications of Object Oriented and Intelligent databases.Information Retrieval. Pearson Education. “Object Oriented Software Engineering”.Spatial Databases. “Software engineering”. Third Edition.Implementation of Rules and Recursion. Languages and Design: ODMG Model – ODL – OQL – Object Relational and Extended – Relational Systems: Object Relational features in SQL/Oracle – Case Studies. 6. Pearson Education. 2009. “Software Engineering. WileyIndia. Seventh Edition. Oracle.Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Case Studies UNIT II OBJECT AND OBJECT RELATIONAL DATABASES 9 Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance – Complex Objects – Object Database Standards. 4. 3.REFERENCES: 1.Effect of Mobility on Data Management Location Dependent Data Distribution . 2011.Spatial Relationships. 2010.Mobile Transaction Models -Concurrency Control Transaction Commit Protocols.Recursive Queries in SQL. James F. Tata McGraw-Hill Publishing Company Limited.Recursive Rules-Syntax and Semantics of Datalog Languages. Ivar Jacobson.

UNIT II QUALITY OF SERVICE 9 Traffic Characteristics and Descriptors – Quality of Service and Metrics – Best Effort model and Guaranteed Service Model – Limitations of IP networks – Scheduling and Dropping Policies for BE and GS models – Traffic Shaping Algorithms – End to End Solutions – Laissez Faire Approach – Possible improvements in TCP – Significance of UDP in Inelastic Traffic 9 .Kannan. 5. 2. C. the students will be able. “Database Systems.  To design faster algorithms in solving practical database problems.Subrahmanian. Elmasri.Error and Flow Control – Congestion Control – Layered Architecture – Network Externalities – Service Integration. Thomas Cannolly and Carolyn Begg. Sudharshan.Geographic Information Systems. Roberto Zicari.  To understand and critique on each type of databases. Sixth Edition.Web Databases.B. 2011. S. Richard T. 2008. 4. “Fundamentals of Database Systems”. G. Vijay Kumar.  To explore the emerging technologies in network engineering. 6. IF8102 NETWORK ENGINEERING LTP C 3 0 0 3 COURSE OBJECTIVES:  To provide an introduction to the principles and practices of Network Engineering. “An Introduction to Database Systems”.Biological Data Management.  To understand the architecture of the network devices.XML Query Languages. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. A Practical Approach to Design.UNIT V EMERGING TECHNOLOGIES 9 XML Databases: XML-Related Technologies-XML Schema. Pearson Education/Addison Wesley. UNIT I FOUNDATIONS OF NETWORKING 9 Communication Networks – Network Elements – Switched Networks and Shared media Networks – Probabilistic Model and Deterministic Model – Datagrams and Virtual Circuits – Multiplexing – Switching .Introduction to Big Data-Storage-Analysis. Pearson Education.Date. Henry F Korth. 2006.Storing XML in Databases-XML and SQL. Christos Faloutsos.K. 2008. REFERENCES: 1. Tata McGraw Hill.Cloud Storage Architectures-Cloud Data Models. Stefano Ceri. S. S. John Wiley & Sons. Implementation and Management”. Eighth Edition. 2006.S. Abraham Silberschatz.Snodgrass. Pearson Education. Fourth Edition.Cloud Based Databases: Data Storage Systems on the Cloud.Swamynathan.”Database Management Systems”. 7. A.Gupta. “Mobile Database Systems”.  To develop in-depth understanding of relational databases and skills to optimize database performance in practice. Fifth Edition. R. Navathe. 2011. “Database System Concepts”.  To implement intelligent databases and various data models. Carlo Zaniolo.Native XML Databases. 3.J. Morgan Kaufmann publishers.  To learn QoS related methodologies. McGraw Hill.Query Languages.2006. V. “Advanced Database Systems”.

Configuring EGP –RIP – OSPF – IS-IS . Morgan Kaufman Publishers. “Routers and Routing Basics CCNA 2 Companion Guide (Cisco Networking Academy)”. 3. 2012. Larry L Peterson and Bruce S Davie. IF8111 COURSE OBJECTIVES:     DATA STRUCTURES LAB L T P C 0 0 3 2 To acquire the knowledge of using advanced tree structures.UNIT III HIGH PERFORMANCE NETWORKS 9 Integrated Services Architecture – Components and Services – Differentiated Services Networks – Per Hop Behavior – Admission Control – MPLS Networks – Principles and Mechanisms – Label Stacking – RSVP – RTP/RTCP. Graph Traversals 10 . UNIT V SOFTWARE DEFINED NETWORKING 9 History . Morgan Kauffman Publishers. Jean Warland and Pravin Vareya. ‘High Performance Networks’. 2002 4. Mahbub Hassan and Raj Jain. Multiplexers. the students will be able to. Fifth Edition. To learn the working of various string matching algorithms EXPERIMENTS: 1. James Macfarlane . Cisco press. Capability development includes gaining an understanding of network engineering principles for network. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. Pearson Education/PHI. REFERENCES: 1. Implementation of a Binary Search Tree 2. UNIT IV NETWORK DEVICE ARCHITECTURE 9 Network Devices – Switch – Router – Hardware Components. ‘Computer Networks: A Systems Approach’. Red-Black Tree Implementation 3. Modems and Internet Access Devices – Switching and Routing DevicesRouter Structure . 2009. Wendell Odom and Rick McDonald.Programming Languages – Applications – Data Centre Networking –Software Defined Radio –Campus Networks.Data Plane Support for SDN . 2.Bridges – Routers – Link Virtualization . To understand the usage of graph structures and spanning trees.Modern SDN Stack . Heap Implementation 4.Software – Configuration – Routing Concepts.Static Routing – Dynamics Routing – Routing Information Protocol – Configuration – Open Shortest Path First Protocol – Configuration – Access Control List – Standard – Extended – Named.” Network Routing Basics: Understanding IP Routing in Cisco Systems”. Binomial Heaps 5. Knowledge of advanced network engineering concepts and techniques.Hub . Wiley edition 1 2006. 5. 2006.Software Routers – Programmable Hardware –Control Plane Support for SDN . To learn the usage of heap structures. ‘High Performance TCP/IP Networking’.    Gain an understanding of the principles of network engineering.Multicast Architecture. system and service management.

 To practice DBMS query language such as SQL and embedded programming.  To study the design of databases for applications. Data Definition. Study of Software Defined Networking tools 7.6. Traffic Analysis 5.  To acquire knowledge about various networking tools. Database Querying – Simple queries. Triggers 10. IF8112 NETWORKING AND DBMS LAB L T PC 0 0 3 2 COURSE OBJECTIVES:  To learn network programming and establish connection between network. 11 . Network analyzer 4. Nested queries. Front End Tools / Programming Languages 14. Sub queries and Joins 9.  Design and develop efficient algorithms with minimum complexity. Socket programming ( TCP/UDP) 3. Database Design and Implementation (Case Study) TOTAL : 45 PERIODS COURSE OUTCOMES: Upon Completion of the course.  Design algorithms using graph structure and various string matching algorithms to solve reallife problems. To design databases for various applications. 8. the students will be able to:  Design and implement basic and advanced data structures extensively. 7. Client-server programming 2. Manipulation of Tables and Views 8. Transaction Control 11. Protocol Analysis 6. Procedures and Functions 16. Embedded SQL 12. Database Connectivity with Front End Tools 13. 9. High level language extensions . the students should be able to:   To gain knowledge about network connectivity and network components. EXERCISES: 1. Spanning Tree Implementation Shortest Path Algorithms String Matching Algorithms Approximation Algorithms TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course.PL/SQL Basics 15.

infrastructure and delivery models of cloud computing  Explain the core issues of cloud computing such as security. Elsevier/Morgan Kaufmann. UNIT III CLOUD INFRASTRUCTURE 9 Architectural Design of Compute and Storage Clouds – Layered Cloud Architecture Development – Design Challenges .Implementation Levels of Virtualization Virtualization Structures . Robert Elsenpeter. Smith.  To be able to set up a private cloud. “Cloud Application Architectures: Building Applications and Infrastructure in the Cloud” O'Reilly. 2010. OpenStack. James E.SaaS – E. Kai Hwang. Thomas Wozniak. privacy and interoperability  Choose the appropriate technologies.Programming Support Google App Engine. of IaaS Providers . of PaaS Providers .g. John W. 6.  To appreciate the emergence of cloud as the paradigm. 2005. Anthony Velte. Open Nebula. algorithms and approaches for the related issues REFERENCES: 1. Twister and Iterative MapReduce – Hadoop Library from Apache – Mapping Applications . I/O Devices Desktop Virtualization – Server Virtualization. Morgan Kaufmann Publishers. Santi Ristol.Tools and Mechanisms . CRC Press. UNIT V SECURITY IN THE CLOUD 9 Security Overview – Cloud Security Challenges – Software-as-a-Service Security – Security Governance – Risk Management – Security Monitoring – Security Architecture Design – Data Security – Application Security – Virtual Machine Security. 4. Jack G Dongarra. A Practical Approach”. Amazon AWS .Types of Virtualization . “Distributed and Cloud Computing. Toby Velte. 2012. 2. 12 .  To understand the various issues in cloud computing.g. Springer. 2010.g.PaaS – E. Geoffrey C Fox.Cloud Software Environments -Eucalyptus. 3.Rittinghouse and James F. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. of SaaS Providers – Public . Management. the students should be able to:  Articulate the main concepts. George Reese. 2009. “Cloud Computing. UNIT II VIRTUALIZATION 9 Basics of Virtualization . 5. next generation computing UNIT I INTRODUCTION 8 Evolution of Cloud Computing –System Models for Distributed and Cloud Computing – NIST Cloud Computing Reference Architecture -IaaS – On-demand Provisioning – Elasticity in Cloud – E. From Parallel Processing to the Internet of Things”. TMH. Memory.Inter Cloud Resource Management – Resource Provisioning and Platform Deployment – Global Exchange of Cloud Resources. “Virtual Machines: Versatile Platforms for Systems and Processes”. Ravi Nair. Private and Hybrid Clouds.Virtualization of CPU. “Cloud Computing: Implementation.  To familiarize themselves with the lead players in cloud. UNIT IV PROGRAMMING MODEL 10 Parallel and Distributed Programming Paradigms – Map Reduce .IF8252 CLOUD COMPUTING TECHNOLOGIES L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the concept of cloud and utility computing. strengths and limitations of cloud computing  Identify the architecture. Katarina Stanoevska-Slabeva. 2009.Ransome. “Grid and Cloud Computing – A Business Perspective on Technology and Applications”. and Security”. key technologies.

RLC and MAC – WiMax IEEE 802.Memory Management – Information Access Devices – PDAs and Smart Phones – Smart Cards and Embedded Controls – J2ME – Programming for CLDC – GUI in MIDP – Application Development ON Android and iPhone.5G and 3. UNIT I INTRODUCTION 9 Differences between Mobile Communication and Mobile Computing – Contexts and Names – Functions – Applications and Services – New Applications – Making Legacy Applications Mobile Enabled – Design Considerations – Integration of Wireless and Wired Networks – Standards Bodies – Pervasive Computing – Basics and Vision – Principles of Pervasive Computing – Categories of Pervasive Devices UNIT II 3G AND 4G CELLULAR NETWORKS 9 Migration to 3G Networks – IMT 2000 and UMTS – UMTS Architecture – User Equipment – Radio Network Subsystem – UTRAN – Node B – RNC functions – USIM – Protocol Stack – CS and PS Domains – IMS Architecture – Handover – 3.  To become familiar with the pervasive devices and mobile computing platforms.  To deploy 3G networks.  To develop suitable algorithms for 4G networks. TOTAL: 45 PERIODS COURSE OUTCOMES: At the end of the course the student should be able to. 13 .  To learn the role of wireless networks in Mobile Computing and Pervasive Computing.  To understand the architectures of mobile and pervasive applications.9G a brief discussion – 4G LAN and Cellular Networks – LTE – Control Plane – NAS and RRC – User Plane – PDCP.Model View Controller Architecture .  To develop mobile computing applications based on the paradigm of context aware computing.IF8254 MOBILE AND PERVASIVE COMPUTING L T PC 3 0 0 3 COURSE OBJECTIVES :  To understand the basics of Mobile computing and Personal computing.Functionality and Data – Transcoding – Location Aware Computing – Location Representation – Localization Techniques – Triangulation and Scene Analysis – Delaunay Triangulation and Voronoi graphs – Types of Context – Role of Mobile Middleware – Adaptation and Agents – Service Discovery Middleware UNIT V APPLICATION DEVELOPMENT 9 Three tier architecture .  To use sensor and mesh networks to develop mobile computing environment.  To study about the underlying wireless networks.16d/e – WiMax Internetworking with 3GPP UNIT III SENSOR AND MESH NETWORKS 9 Sensor Networks – Role in Pervasive Computing – In Network Processing and Data Dissemination – Sensor Databases – Data Management in Wireless Mobile Environments – Wireless Mesh Networks – Architecture – Mesh Routers – Mesh Clients – Routing – Cross Layer Approach – Security Aspects of Various Layers in WMN – Applications of Sensor and Mesh networks UNIT IV CONTEXT AWARE COMPUTING 9 Adaptability – Mechanisms for Adaptation .

Wrox Wiley. Frank Adelstein.Pei Zheng and Lionel M Li. Reto Meier. “Professional Android 2 Application Development”.NET – Case Study UNIT III ENTERPRISE APPLICATION DEVELOPMENT 9 Three Tier Architecture – Working With Model-View-Controller – JCP – J2EE . Stefan Poslad. ‘Smart Phone & Next Generation Mobile Computing’. Environments and Interactions”. ‘Principles of Mobile Computing’.Quality Evaluation and Experimental Web Engineering – Measuring and Evaluating Web Application – Need for Empirical Web Engineering UNIT II WEB APPLICATION DEVELOPMENT 9 Web Technology Basics – HTML5 – Cascading Style Sheet – Client side scripting – JavaScript – JavaScript Objects – XML Basics – DOM – SAX – XSL – AJAX – RSS – Database Connectivity – Server Side Scripting – Servlet – Servlet Life Cycle – Servlet based Web Application – JSP – PHP – ASP. Service Tier and Data Tier Patterns – J2ME . 3. IF8202 WEB INTEGRATED TECHNOLOGIES L T PC 3 0 0 3 COURSE OBJECTIVES  To understand the issues in the design of web application development. Wiley. Springer.  To learn the concept of other framework. Jochen Burthardt et al. Reto Meier. ‘Pervasive Computing: Technology and Architecture of Mobile Internet Applications’. “Ubiquitous Computing: Smart Devices. 9.XML Based APIs – Application Servers . 2010. 2003 8. Morgan Kaufmann Publishers.REFERENCES: 1. .  To learn the concepts of client side and server side technologies. Wrox Wiley. Morgan Kaufmann Publishers. “Mobile Computing: Technology. 2. Feng Zhao and Leonidas Guibas. UNIT I WEB DESIGN PRINCIPLES 9 Web Engineering and Application Development – Introduction – Challenges and Role of Web Engineering – Web Design Methods – Design Issues – OOWS Model Driven approach – OOHDM – UML based Web Engineering – Designing Multichannel Web Application – Designing Web Application with Web ML and Web Ratio – Semantic Web Information System . Tata McGraw Hill.Struts – Hibernate – Spring 14 . 2006. 2003 6. Second Edition.  To learn the concept of three tier application using MVC. 2010.Presentation Tier and EIS Tier – Java Mail – JMS – Java Transactions – JNDI – Java Authentication and Authorization Services – Java Cryptography UNIT IV COMPONENTS AND FRAMEWORKS 9 Service Tier And Data Tier – EJB Architecture – Session Beans – Entity Beans – Message Driven Beans – J2EE Connector Architecture . 2005 5. ‘Fundamentals of Mobile and Pervasive Computing’. TMH.Web Services – J2EE Web Services – Patterns – Presentation. 4. 2009. Applications and Service Creation”. Asoke K Talukder. Uwe Hansmaan et al. Pearson Education. Hasan Ahmed.  To understand and learn the importance of Java based security solutions. 2004 7.  To learn the concepts of software components using EJB. ‘Wireless Sensor Networks’. Roopa R Yavagal. 2010. “Professional Android 2 Application Development”.

UNIT I INTRODUCTION TO BIG DATA 8 Introduction to BigData Platform – Challenges of Conventional Systems . Pearson. UNIT III MINING DATA STREAMS 8 Introduction To Streams Concepts – Stream Data Model and Architecture .Fuzzy Decision Trees . Technology.Neural Networks: Learning And Generalization Competitive Learning .UNIT V SOA BASICS 9 SOA Principles – Evolution of SOA – SOA and WS_Extension – Service Activity – Coordination – Transaction – Orchestration – Choreography – Security – Advanced Messaging . 2008. Concepts.Case Studies – Current Trends TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. “Service Oriented Architecture.Analysis vs Reporting .Statistical Inference Prediction Error.Support Vector and Kernel Methods .Stochastic Search Methods. the students should be able to:       Design and development of web applications using various models. Sameer Tyagi.Web Data – Evolution Of Analytic Scalability .Modern Data Analytic Tools . Web application development using HTML and scripting technologies. Developing web services using J2EE and related technologies.Rule Induction . Stock Market Predictions. Thomas Erl. IF8201 DATA ANALYTICS L T PC 3 0 0 3 COURSE OBJECTIVES:  To know the fundamental concepts of big data and analytics. Stevens.Case Studies .Analysis of Time Series: Linear Systems Analysis . Sunil Mathew.  To learn various techniques for mining data streams. Gustavo Rossi. Web application development using advanced features. REFERENCES: 1.Real time Analytics Platform(RTAP) Applications . 2. Springer. “Web Engineering Modeling and Implementing web Applications”. Luis Olsina. 2003. 15 .Statistical Concepts: Sampling Distributions .Inference and Bayesian Networks . 3. UNIT II DATA ANALYSIS 12 Regression Modeling .  To learn Event Modeling for different applications.Nonlinear Dynamics .Stream Computing Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a Window – Decaying Window .Bayesian Modeling . Oscar Pastor. Elsevier. Design and development of applications using other frameworks. James McGovern. “Java Web Services Architecture”.Re-Sampling .Principal Component Analysis and Neural Networks . and Design”. Security features supported in java.Notification and Eventing .Multivariate Analysis .Real Time Sentiment Analysis.Fuzzy Logic: Extracting Fuzzy Models from Data .Analytic Processes and Tools . Daniel Schwabe. Michael E. 2005.

Market Based Model – Apriori Algorithm – Handling Large Data Sets in Main Memory – Limited Pass Algorithm – Counting Frequent Itemsets in a Stream – Clustering Techniques – Hierarchical – K-Means – Clustering High Dimensional Data – CLIQUE And PROCLUS – Frequent Pattern based Clustering Methods – Clustering in Non-Euclidean Space – Clustering for Streams and Parallelism. UNIT V FRAMEWORKS AND VISUALIZATION 8 MapReduce – Hadoop. O’Reilly. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. recovery and commit protocols. 2011. “Big Data Glossary”. “Mining of Massive Datasets”. Reprinted 2008.Visual Data Analysis Techniques . Micheline Kamber “Data Mining Concepts and Techniques”. Hand. UNIT II DISTRIBUTED OPERATING SYSTEM 9 Issues in Distributed Operating System – Architecture – Communication Primitives – Lamport’s Logical clocks – Causal Ordering of Messages – Distributed Mutual Exclusion Algorithms – Centralized and Distributed Deadlock Detection Algorithms – Agreement Protocols. Mobile operating systems. “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics”. Second Edition. 2007 5. Hive. Glenn J.    Work with big data platform and its analysis techniques. Bill Franks. John Wiley & Sons. UNIT I OPERATING SYSTEM BASICS 9 Overview – Synchronization Mechanisms – Process and Threads. 16 . 2. Springer. Elsevier. MapR – Sharding – NoSQL Databases . Design efficient algorithms for mining the data from large volumes. 2012. Mutual exclusion algorithms. IF8251 ADVANCED OPERATING SYSTEM L T PC 3 0 0 3 COURSE OBJECTIVES:  To learn the fundamentals of Operating system.Hadoop Distributed File Systems – Visualizations .  To gain insight on to the distributed resource management components viz. Pete Warden.S3 . 2007. 2012. Myatt. 3. Cambridge University Press. Deadlock detection algorithms and agreement protocols. David J.Process Scheduling – Deadlocks: Detection – Prevention. “Making Sense of Data”.Interaction Techniques.  To know the components and management aspects of Real time. Model a framework for Human Activity Recognition. 4. the algorithms for implementation of distributed shared memory. “Intelligent Data Analysis”. REFERENCES: 1. Systems and Applications. Jiawei Han.UNIT IV FREQUENT ITEMSETS AND CLUSTERING 9 Mining Frequent Itemsets . Anand Rajaraman and Jeffrey David Ullman. the students should be able to.Recovery – Models of Resources – Memory Management. Michael Berthold. John Wiley & sons. 6.  To gain knowledge on Distributed operating system concepts that includes architecture.

Process Management Scheduling .Core OS Layer . Andrew S.File System. Greg Gagne. and Multiprocessor Operating Systems”.Input-Output Management . UNIT IV REAL TIME & MOBILE OPERATING SYSTEMS 9 Basic Model of Real Time Systems . 2008. Windows XP: Design Principles .Mobile Operating Systems –Micro Kernel Design .Memory Management . Seventh Edition. TOTAL:45 PERIODS COURSE OUTCOMES: Upon Completion of the course. 2004. Abraham Silberschatz.Memory Management . Neil Smyth. REFERENCES: 1. Payload media. Rajib Mall. “Operating System Concepts”. P J Deital and D R Choffnes. 2. UNIT V CASE STUDIES 9 Linux System: Design Principles . Mukesh Singhal. “iPhone iOS 4 Development Essentials – Xcode”. Pearson Education.File system.File System . 5. H M Deital. “Modern Operating System”. Niranjan G Shivaratri. 3. John Wiley & Sons. padding and colors. iphone iOS4: Architecture and SDK Framework . 2001.Client Server Resource Access – Processes and Threads . lists. Fourth Edition..  To construct dynamic server-side web pages and integrate the web application with many of the other Java2 Enterprise Edition application server methodologies.System Components . 2004. Pearson Education India. 4. “Operating Systems”. 6. IF8212 WEB INTEGRATED TECHNOLOGIES LAB L T PC 0 0 3 2 COURSE OBJECTIVES:  To learn how to create a simple web page using HTML along with the usage of style sheets. 2006. Database.Kernel Modules .  To get acquainted with JavaScript and how to embed JavaScript in HTML code. Prentice Hall Inc. “Advanced Concepts in Operating Systems – Distributed.Tanenbaum.Interprocess Communication. creation or tables with borders.UNIT III DISTRIBUTED RESOURCE MANAGEMENT 9 Distributed File System – Design Issues .  To develop Java Enterprise Applications using EJB3 and other Java EE technology and J2ME.Characteristics. 17 .File System. the students should be able to:  A complete overview of process management & memory management of Operating system. Tata McGraw-Hill.Media Layer Services Layer . “Real-Time Systems: Theory and Practice”. 2011. Peter Baer Galvin. Deadlock detection and agreement protocols of Distributed operating system. Third Edition.Memory Management .Handling Resource Sharing .Applications of Real Time Systems – Real Time Task Scheduling .Process and Thread Management .Distributed Shared Memory – Algorithms for Implementing Distributed Shared memory–Issues in Load Distributing – Scheduling Algorithms – Synchronous and Asynchronous Check Pointing and Recovery – Fault Tolerance – Two-Phase Commit Protocol – Nonblocking Commit Protocol – Security and Protection.  Ability to demonstrate the Mutual exclusion.

the students should be able to. TOTAL : 45 PERIODS IF8211 OS AND MOBILE LAB L T PC 0 0 32 COURSE OBJECTIVES:  To know about various platforms and tools available for developing mobile applications. Simulation of Deadlock detection. Networking applications 18 . 2.  Web application development using HTML and scripting technologies.EXPERIMENT 1.  Hands on experience on Web application development using advanced features. 12. Web site creation with PHP for server side programming for storing current date-time using cookies and for storing page views using sessions 7. JavaMail. Implementation of Distributed mutual exclusion Algorithms. Developing Java Enterprise Applications Using EJB3 Session beans. COURSE OUTCOMES: Upon Completion of the course. 9. Constructing dynamic server-side web pages using JSF and integrate the Web application with many of the other Java2 Enterprise Edition application server methodologies such as Enterprise Java Beans. Creating XML file with XML DTD and XML schema. Survey of Mobile Application Development Tools 9.  To learn programming skills in J2ME and Android SDK. Graphical and Multimedia applications 12. Working with PHP and MySQL. Develop webpage using JavaScript for client side programming and HTML forms 3. XSL 6. prevention and recovery process. SAX. Web programming with HTML tags.NET 8. Form design for mobile applications 10.  Design and development of dynamic server-side web pages. Using The DOM and the JavaScript object models 4. JDBC and JMS. Application development using J2ME.  Develop web services using J2EE and related technologies. 5. Applications using controls 11. 8. 4. Implementation of Distributed OS Agreement protocols. Two-Phase Commit Protocol in Distributed OS. 11. IOS app development.  To study about micro browser based applications to access the Internet using Sun Java Toolkit. Implementation of Distributed OS Resource Scheduling algorithms 6. 3. CSS for styling. entity beans and message-driven beans.  Design and development of applications using other frameworks.  To realize the differences between developing conventional applications and mobile applications. 10. Web application development using Servlet/ PHP/ JSP/ ASP. 7. Website optimization: crunching HTML. using CSS to replace HTML and light-weight graphics to speed up websites 5. Working with JNDI. Page layout 2. Implementation of Process scheduling algorithms. EXPERIMENTS: 1. and SOAP. Data retrieval applications 13.

Posteriori Design Auditing mechanisms .Inference – Application Controls .Public-Key Cryptography and RSA – Key Management . Gaming applications (Perform the experiments from 2 to 7 in J2ME and Android SDK framework) 15.Incomplete mediation XSS .OWASP/SANS Top Vulnerabilities . Micro browser based applications using WAP. UNIT II ENCRYPTION TECHNIQUES 9 Symmetric Encryption Techniques – DES – AES.X. the students should be able to.linear cryptanalysis .side channel attack .differential cryptanalysis . WML and WML scripts (Perform experiments in 8 using Sun Java Wireless toolkit) TOTAL: 45 PERIODS COURSE OUTCOMES: At the end of the course the student should be able to.Merkle-Hellman knapsack attack Hellman's time-memory tradeoff (TMTO) attack UNIT III HASH FUNCTIONS AND SIGNATURES 9 Message Authentication and Hash Functions – Description of MD Hash Family – Secure Hash Algorithms – SHA 512 . UNIT I FUNDAMENTALS AND MATHEMATICS OF CRYPTOGRAPHY 9 Overview .Disaster Recovery Planning/Incident Response Planning .Digital Signature Schemes. NRL taxonomy and Aslam’s model Auditing .509 Authentication Service .Intrusion Detection System UNIT V SECURE DEVELOPMENT 9 Secure Coding .Buffer Overflows .Secure Software Development Life Cycle Testing. Services.  Develop useful mobile applications for the current scenario in mobile computing and pervasive computing IF8301 CRYPTOGRAPHY AND INFORMATION SECURITY L T P C 3 0 0 3 COURSE OBJECTIVES:  To understand the mathematics behind Cryptography. UNIT IV SECURITY PRACTICES 9 Vulnerability Analysis .Flaw Hypothesis Methodology.Anatomy of an Auditing System .Evaluation of Security Systems TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course.Canonical Data Format . Attacks on Digital Signature. Maintenance and Operation .  To understand the standard algorithms used to provide confidentiality. 19 .Command Injection Redirection .Stream and Block Ciphers – Introduction to Number Theory – Congruences – Chinese Remainder theorem – Modular Arithmetic-Modular Exponentiation – Fermats and Eulers Theorem .Anti Cross Site Scripting Libraries .14.Finite Fields – GF(2n) Fields.Design of Auditing Systems . integrity and authenticity.  To get the knowledge of various security practices applied in the field of information technology.Classical Crypto Systems – Substitution Ciphers –Transposition Ciphers.Digital Signatures and Authentication Protocols – Digital Signature Standard – Process.lattice reduction attack .Diffie-Hellman Key Exchange – Elliptic Curve Cryptography – Symmetric Key Distribution – Kerberos .Risk Analysis and Management .

Pearson Education. 3. TOTAL:45 PERIODS 20 .org/OWASP-TopTen. IF8080 SERVICE ORIENTED ARCHITECTURE L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand various architecture for application development. Fourth Edition. Predict the vulnerabilities across any computing system and hence be able to design a security solution for any computing system.  Apply the basic security algorithms required by any computing system.  To learn web service and SOA related tools.pdf 5. SOAP and Java/XML mapping in SOA – JAXB Data Binding. Pfleeger. “Cryptography and Network Security – Principles and Practices”. William Stallings. Client and business Process Services – Technologies of SOA – SOAP – WSDL – JAX – WS – XML WS for . “Security in Computing”. 4. 2011. 2.0 Client side/Server side Development – Packaging and Deployment of SOA Component – SOA Shopper Case Study – WSDL Centric Java WS with SOA. 2007. Pearson Education. REFERENCES: 1. Shari Lawrence Pfleeger. “Information Security: Principles and Practice”.  To learn the importance of SOA in application integration. OWASP top ten security vulnerabilities: http://xml.NET – Service integration with ESB – Scenario – Business case for SOA – Stakeholder Objectives – Benefits of SPA – Cost Savings UNIT III SOA GOVERNANCE 9 SOA Implementation and Governance – Strategy – SOA Development – SOA Governance – Trends in SOA – Event-Driven Architecture – Software as a Service – SOA Technologies – Proofof-Concept – Process Orchestration – SOA Best Practices UNIT IV SOA IMPLEMENTATION 9 SOA using REST – RESTful Services – RESTful Services with and without JWS – Role of WSDL. Fourth Edition. Washington.J –Related Software – Current Trends. Charles B. UNIT I SOA BASICS 9 Software Architecture – Types of IT Architecture – SOA – Evolution – Key components – Perspective of SOA – Enterprise-wide SOA – Architecture – Enterprise Applications – Solution Architecture for Enterprise Application – Software Platforms for Enterprise Applications – Patterns for SOA – SOA Programming Models UNIT II SOA ANALYSIS AND DESIGN 9 Service-Oriented Analysis and Design – Design of Activity. UNIT V APPLICATION INTEGRATION 9 JAX –WS 2. 2006. Mark Stamp. Pearson Education. Wiley Inter Science. “Introduction to Cryptography with Coding Theory” Second Edition. Data. Wade Trappe and Lawrence C.coverpages. 2007.

“Service – Oriented Architecture for Enterprise Applications”. “SOA using Java Web Services”.  To utilize grid for various applications.Web and Grid Services.  To understand different types of grids.Grid Computing Anatomy and Physiology of Grid . Practice Hall. UNIT IV GRID MIDDLEWARE 9 List of Globally Available Toolkits – GT3 – Architecture Details – Grid Service Container – OGSI Implementation – Security Infrastructure . UNIT III DATA AND KNOWLEDGE GRID 9 Data Source – Collective Data Services .  Explain the services offered by grid. 2007.  Implement web services and realization of SOA. Wiley India Pvt Ltd. 2.COURSE OUTCOMES: Upon Completion of the course. Mark D.Knowledge Oriented Grid. UNIT V APPLICATIONS 9 Scientific – Medical – Bioinformatics – Federated Computing – ERM – Multiplayer Games Collaborative Science – Case Study. IF8008 GRID COMPUTING LT PC 3 0 0 3 COURSE OBJECTIVES:  To understand Grid Architecture. Shankar Kambhampaly. 21 . TOTAL:45 PERIODS COURSE OUTCOMES: Upon Completion of the course. 2008. the students should be able to.  Design and implement SOA based application integration using BPEL.Grid Security – WS Security – GSI.  Implement RESTful services. WSRF –Grid Resource and Service Management –Resource Management Framework – Service Negotiation and Acquisition Protocol – Layers of Grid Computing – Building Reliable Services .System Level Services – Hosting EnvironmentsProgramming Model.  Analyze and design SOA based applications. REFERENCES: 1. OGSA.  Create Grid Middleware architecture.  Compare different IT architecture. the students should be able to.Cluster Computing . UNIT II FRAMEWORK 9 Architecture – Implementation of Grid Architecture – Grid Services OGSI. UNIT I INTRODUCTION 9 Parallel and Distributed Computing .  To acquire the knowledge of Grid computing in various areas.Grid Monitoring – Sensors and Sensor Management . Hansen.Data Management – Collective Data Management – Federation Services – Representing Knowledge – Processing Knowledge .  To know Grid standards.

2006. 3.G. Wiley.Association Rule Mining . UNIT I DATA WAREHOUSE 8 Data Warehousing .Mining Frequent Itemsets with and without Candidate Generation .  To identify Business applications and Trends of Data mining. Software: Practice and Experience”. 2008.  To expose the students to the concepts of Data Warehousing Architecture and Implementation.Dimensional Data – ConstraintBased Cluster Analysis – Outlier Analysis. Geoffrey Fox. Carl Kesselman. USA. 2003. Mark Baker. Hey. Krishna Nadiminti. 2.REFERENCES: 1. Hussein Gibbins and Rajkumar Buyya. Second edition.Mining Various Kinds of Association Rules . Wiley Press. Data Warehouses . “The Grid 2: Blueprint for a New Computing Infrastructure”. “Designing a Resource Broker for Heterogeneous Grids. Ian Foster.Need for Data Preprocessing – Data Cleaning – Data Integration and Transformation – Data Reduction – Data Discretization and Concept Hierarchy Generation. UNIT V CLUSTERING 10 Cluster Analysis: . Prediction – Data preparation for Classification and Prediction – Classification by Decision Tree Introduction – Bayesian Classification – Rule Based Classification – Classification by Back Propagation – Support Vector Machines – Associative Classification – Lazy Learners – Other Classification Methods – Prediction – Accuracy and Error Measures – Evaluating the Accuracy of a Classifier or Predictor – Ensemble Methods – Model Section. Elsevier Series. Srikumar Venugopal. New York. Text mining and ethical aspects of Data mining. Anthony J. “The Grid: Core Technologies”.Types of Data in Cluster Analysis – A Categorization of Major Clustering Methods – Partitioning Methods – Hierarchical methods – Density-Based Methods – Grid-Based Methods – Model-Based Clustering Methods – Clustering High. UNIT II DATA MINING & DATA PREPROCESSING 9 Introduction to KDD process – Knowledge Discovery from Databases .Operational Database Systems vs.Multidimensional Data Model . Wiley.ConstraintBased Association Mining. “Grid Computing: Making the Global Infrastructure a Reality”. TOTAL : 45 PERIODS 22 . IF8074 DATA WAREHOUSING AND DATA MINING L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand Data mining principles and techniques and introduce Data Mining as a cutting edge business intelligence. 4. Fran Berman. Maozhen Li. UNIT IV CLASSIFICATION & PREDICTION 10 Classification vs.  To study the overview of developing areas – Web mining.Schemas for Multidimensional Databases – OLAP Operations – Data Warehouse Architecture – Indexing – OLAP queries & Tools. 2005.Data Mining Functionalities . UNIT III ASSOCIATION RULE MINING 8 Introduction .

Ajay.Machine Learning Basics UNIT II GENETIC ALGORITHMS 9 Introduction to Genetic Algorithms (GA) – Applications of GA . UNIT V NEURO-FUZZY MODELING 9 Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling – Classification and Regression Trees – Data Clustering Algorithms – Rule base Structure Identification – Neuro-Fuzzy Control – Case Studies. 4.Building block hypothesisRepresentation – Fitness Measures – Genetic Operators-. Gupta. Jiawei Han and Micheline Kamber. 2. Easter Economy Edition. Michael Steinbach and Vipin Kumar.  To gain insight onto Neuro Fuzzy modeling and control. Prentice Hall of India. Reprinted 2008. K. “Data Mining Concepts and Techniques” Second Edition. 3.COURSE OUTCOMES: Upon Completion of the course. Shyam Diwakar and V. UNIT IV FUZZY LOGIC 9 Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership Functions-Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems – Fuzzy Expert Systems – Fuzzy Decision Making.  To gain knowledge in machine learning through Support Vector Machines. Pearson Education. Elsevier. K. “Introduction to Data Mining with Case Studies”. A Pang-Ning Tan. 2006.Reinforcement Learning – Unsupervised Learning Neural Networks – Adaptive Resonance Architectures – Advances in Neural Networks. GA based Machine Learning. Prentice Hall of India. Easter Economy Edition. the students will be able to. REFERENCES: 1. 2007. 2006.  To study the fuzzy logic components. Soman. Adaptive Networks – Feed Forward Networks – Supervised Learning Neural Networks – Radial Basis Function Networks . UNIT III NEURAL NETWORKS 9 Machine Learning using Neural Network. IF8081 SOFT COMPUTING L T PC 3 0 0 3 COURSE OBJECTIVES:  To learn the key aspects of Soft computing and Neural networks. G.  To know about the components and building block hypothesis of Genetic algorithm.  Discover the knowledge imbibed in the high dimensional system.Soft Computing Constituents – From Conventional AI to Computational Intelligence .P.  Evolve Multidimensional Intelligent model from typical system.  Evaluate various mining techniques on complex data objects. “Insight into Data mining Theory and Practice”. “Introduction to Data Mining”. TOTAL: 45 PERIODS 23 . UNIT I INTRODUCTION TO SOFT COMPUTING 9 Evolution of Computing .

Sever Virtualization – Physical and Logical Partitioning . Goldberg. REFERENCES: 1. 5. “Genetic Algorithms in Search. “An Introduction to Genetic Algorithm”. Mitchell Melanie. Klir and Bo Yuan. 2007. the students should be able to  To discuss on machine learning through Neural networks.VFIs Virtual Firewall Contexts Network Device Virtualization – DataPath Virtualization Layer 2: 802. “First course on Fuzzy Theory and Applications”. Applications.VLANs Layer 3 VRF Instances Layer 2 . 3. Chuen-Tsai Sun.Lee. S.Process Virtual Machines . Prentice Hall.Control-Plane Virtualization–Routing Protocols.  Able to model Neuro Fuzzy system for clustering and classification. James A. Pearson Edn.N. IF8351 VIRTUALIZATION L T P C 3 0 0 3 COURSE OBJECTIVES:  To understand the concept of virtualization.  To familiarize themselves with the types of virtualization. 2. Freeman and David M. UNIT II SERVER CONSOLIDATION 8 Hardware Virtualization – Virtual Hardware Overview .1q . Prentice Hall. 7.  Discover knowledge to develop Genetic Algorithm and Support vector machine based machine learning system.Virtualization Types – Desktop Virtualization – Network Virtualization – Server and Machine Virtualization – Storage Virtualization – System-level of Operating Virtualization – Application Virtualization-Virtualization Advantages .. Springer.IPsec L2TPv3 Label Switched Paths . 1998.Aware Routing Multi-Topology Routing. Prentice-Hall of India. “ Introduction to Genetic Algorithms”. Skapura. Optimization and Machine Learning”. UNIT III NETWORK VIRTUALIZATION 10 Design of Scalable Enterprise Networks . 1995.Theory Network Device Virtualization Layer 2 . David E. 2005.VRF . Jyh-Shing Roger Jang.Virtualizing the Campus WAN Design – WAN Architecture .Virtual Machine Basics – Taxonomy of Virtual Machines . 6. Springer–Verlag Berlin Heidelberg. 2003.Trunking Generic Routing Encapsulation . 2007.COURSE OUTCOMES: Upon Completion of the course. 4. “Neural Networks Algorithms. and Programming Techniques”. Eiji Mizutani.System Virtual Machines – Hypervisor . 2003. 24 .Types of Server Virtualization – Business cases for Sever Virtualization – Uses of Virtual server Consolidation – Planning for Development –Selecting server Virtualization Platform. UNIT I OVERVIEW OF VIRTUALIZATION 10 Basics of Virtualization .Sivanandam. “Neuro-Fuzzy and Soft Computing”. S. Addison Wesley. George J.  To understand the various issues in virtualization.Deepa.Key Concepts.  Apply knowledge in developing a Fuzzy expert system. Kwang H.WAN Virtualization . “Fuzzy Sets and Fuzzy Logic-Theory and Applications”.Virtual Enterprise Transport Virtualization–VLANs and Scalability .  To compare and analyze various virtual machines products.N.

3.Using SCSI buses – Fiber Channel – Fiber Channel Cables –Fiber Channel Hardware Devices – iSCSI Architecture – Securing iSCSI – SAN backup and recovery techniques – RAID – SNIA Shared Storage Model – Classical Storage Model – SNIA Shared Storage Model – Host based Architecture – Storage based architecture – Network based Architecture – Fault tolerance to SAN – Performing Backups – Virtual tape libraries. IF8084 AD HOC AND SENSOR NETWORKS L T P C 3 0 0 3 COURSE OBJECTIVES:  To understand the basics of Ad-hoc & Sensor Networks.Other Routing Protocols. the students should be able to  Create a virtual machine and to extend it to a virtual network. 2006.  Discuss on various virtual machine products. Erick M. Halter. A Press 2005.  To understand various security practices and protocols of Ad-hoc and Sensor Networks. Hybrid Routing Approach . Reynolds.TCP over Ad-Hoc Networks-TCP Protocol Overview .  To understand the nature and applications of Ad-hoc and sensor networks. UNIT I ADHOC NETWORKS FUNDAMENTALS AND MAC PROTOCOLS 9 Fundamentals of WLAN’s – IEEE 802.Speaking SCSI.Introduction -Topology based versus Position based Approaches Proactive. Wrox Publications. “Virtualization: From the Desktop to the Enterprise”.  To learn various fundamental and emerging protocols of all layers. 4.Principles and issues – Location services DREAM – Quorums based Location Service – Grid – Forwarding Strategies – Greedy Packet Forwarding – Restricted Directional Flooding. REFERENCES: 1. 2. Chris Wolf. 2005. “Professional Xen Virtualization”. TOTAL:45 PERIODS COURSE OUTCOMES: Upon Completion of the course. 2006. 2008.Hierarchical Routing.Xen API – VMware – VMware products . Reactive.  To study about the issues pertaining to major obstacles in establishment and efficient management of Ad-hoc and sensor networks.  Compile all types of virtualization techniques and utilize them in design of virtual machines. Ravi Nair.UNIT IV VIRTUALIZING STORAGE 8 SCSI. “Network virtualization”. Cisco Press. 25 . Victor Moreno. January. David Marshall. 5. “Virtual Machines: Versatile Platforms for Systems and Processes”. Kumar Reddy. James E. July.TCP And MANET’s – Solutions For TCP over Ad-Hoc Networks UNIT II ADHOC NETWORK ROUTING AND MANAGEMENT 9 Routing in Ad-Hoc Networks.VMware Features – Microsoft Virtual Server – Features of Microsoft Virtual Server. Auerbach Publications. UNIT V VIRTUAL MACHINES PRODUCTS 9 Xen Virtual machine monitors.11 Architecture . William von Hagen. “Advanced Server Virtualization: VMware and Microsoft Platform in the Virtual Data Center”.Self Configuration and Auto ConfigurationIssues in Ad-Hoc Wireless Networks – MAC Protocols for Ad-Hoc Wireless Networks – Contention Based Protocols . Elsevier/Morgan Kaufmann. Smith. Wade A.

2004. Pearson Education. “Security in Wireless Ad Hoc and Sensor Networks”. 5. J. Chunming Rong. protocols and standards.  To familiarize the student with the image processing environments like Matlab and its equivalent open source Image processing environments. 2011. Inc . 2002.Siva Ram Murthy and B. Erdal Çayırcı .Localization and Positioning – Operating Systems and Sensor Network Programming – Sensor Network Simulators. Adrian Perrig.K. 2006 IF8078 IMAGE PROCESSING L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the basic concepts and algorithms of digital image processing. John Wiley & Sons.Transceiver Design Considerations – MAC Layer Protocols – IEEE 802. “Ad-Hoc and Sensor Networks: Theory and Applications”. 3. 2. “Fundamentals of Wireless Sensor Networks Theory and Practice”. "Secure Broadcast Communication: In Wired and Wireless Networks". John Wiley and Sons. UNIT IV SENSOR NETWORK MANAGEMENT AND PROGRAMMING 9 Sensor Management . Andreas willig. and to provide the student with practical experience using them.2005.  To expose the student to a broad range of image processing and issues and their applications. Second Edition.Secure Ad-hoc Routing Protocols – Broadcast Authentication WSN Protocols – TESLA – Biba – Sensor Network Security Protocols .Manoj. 4.Data Centric & Contention Based Networking – Transport Protocols & QoS – Congestion Control Issues – Application Layer Support.Toh. Holger Karl.Single Node Architecture – Sensor Network Design Considerations – Energy Efficient Design Principles for WSN’s – Protocols for WSN – Physical Layer . John Wiley and Sons. Springer. 26 . D. UNIT V ADHOC AND SENSOR NETWORK SECQURITY 9 Security in Ad-Hoc and Sensor Networks – Key Distribution and Management – Software based Anti-tamper Techniques – Water Marking techniques – Defense against Routing Attacks .Routing Protocols – Mobile Nodes and Mobile Robots .S.Topology Control Protocols and Sensing Mode Selection Protocols . 2009 6. Carlos De Morais Cordeiro. “Ad Hoc Wireless Networks – Architectures and Protocols”. Christian Poellabauer. Tygar.4 Zigbee – Link Layer and Error Control Issues .UNIT III SENSOR NETWORK FUNDAMENTALS AND COMMUNICATION PROTOCOLS 9 Introduction – Architecture . C. Pearson Education. the students should be able to  To conversant with Ad-hoc and sensor networks.Time Synchronization .SPINS TOTAL: 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. Dharma Prakash Agrawal.  To appreciate the use of image processing in current technologies and to expose the students to real-world applications of image processing. C. “Protocols and Architectures for Wireless Sensor Networks”. Waltenegus Dargie. 2010 7.15. World Scientific Publishing. “Ad Hoc Mobile Wireless Networks”.  To establish a Sensor network environment for different type of applications. REFERENCES: 1.

Wilhelm Burger. Springer International Edition. S. India.Wavelet Packets . 27 .compression-wavelet processing and image morphology. Frequency Domain: Filtering in Frequency Domain – DFT. Smoothing and Sharpening filters – Homomorphic Filtering.  Design an application that incorporates different concepts of Image Processing. 2011. Statistical and Spatial Operations.Image Morphology . 5. New Delhi.Component Labeling – Regional descriptors and Feature Selection Techniques.Woods. UNIT IV MULTI RESOLUTION ANALYSIS AND MORPHOLOGICAL PROCESSING 9 Multi Resolution Analysis: Image Pyramids – Multi resolution expansion – Wavelet Transforms Fast Wavelet Transforms .Image Understanding – Case Studies in Biometrics . New Delhi. PHI. “Introduction to Digital Image Processing with Matlab”. 4.  Apply and explore new techniques in the areas of image enhancement. Pearson Education. Logical.Sridhar.Image Acquisition – Sampling and Quantization – Pixel Relationships – File Formats – Color Images and Models . DCT.Image Operations – Arithmetic. 2008. Oxford University Press. “Digital Image Processing”. Constrained and Unconstrained Restoration Models.Video Image Fusion – Steganography TOTAL : 45 PERIODS COURSE OUTCOMES: Upon Completion of the course. UNIT II IMAGE ENHANCEMENT AND RESTORATION 9 Spatial Domain . Noise models. 3.Opening and Closing Operations – Distance Transforms – Basic Morphological Operations. Cengage Learning 2011. Third Edition. Image Features – Textures Boundary representations and Descriptions. the students should be able to  Implement basic image processing algorithms using MATLAB tools. “Digital Image Processing”. 2011. Mark J Berge. Alasdair McAndrew.restorationsegmentation. “Digital Image Processing: An algorithmic Introduction using Java”.Gray Level Transformations Histogram Processing Spatial Filtering – Smoothing and Sharpening. Steps in Image Processing Systems – Digital Imaging System . UNIT III IMAGE SEGMENTATION AND IMAGE FEATURE ANALYSIS 9 Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection – Thresholding – Region Based Segmentation – Motion Segmentation. FFT. UNIT V IMAGE PATTERN RECOGNITION AND CASE STUDIES 9 Statistical Classifiers – Clustering Algorithms – Hierarchical and Partitional clustering – Image classification and Recognition . “Fundamentals of Digital Image Processing”. Rafael C. Anil J Jain. 2008. 2.Gonzalez and Richard E.Binary and Gray Level Morphology Operations – Erosion – Dilation .UNIT I FUNDAMENTALS OF IMAGE PROCESSING 9 Introduction – Elements of Visual Perception.  Critically analyze different approaches to implement mini projects  Explore the possibility of applying Image processing concepts in various domains REFERENCES: 1.

the students should be able to  Implement basic graphics transformation and projection techniques. “Computer Graphics – C Version”. Pearson Education. TOTAL:45 PERIODS COURSE OUTCOMES: Upon Completion of the course. “Computer Graphics. Feiner. Andries Van Dam. Second Edition in C.Dimensional Clipping .Two. UNIT V MULTIMEDIA DATA COMPRESSION 9 Lossless and Lossy Compression Algorithms – Image Compression Standards – Basic Audio and Video Compression Techniques – MPEG Audio and Video Coding – Computer and Multimedia Networks – Content Based Retrieval. Second Edition.Three Dimensional Object Representation –Visualization of Data Sets – Visible Surface Identification .S. UNIT II TRANSFORMATION AND PROJECTION 9 Two dimensional Geometric Transformation – Camera View Port – Viewing Pipeline -Viewing Transformation .Attributes of output primitives – Line. Bitmap and Vector. James D. Pearson Education. “Computer Graphics using OPENGL”.Bezier Curves . 2007.MIDI.Drawing Three Dimensional Scenes.Three-Dimensional Transformations . “Fundamentals of Multimedia”.Spline Curve Representation . F.  To appreciate the use of multimedia authoring tools and multimedia compression techniques.Parallel and Perspective Viewing and Projections . Donald Hearn.Clipping In Three Dimensions Text Clipping.Principles and Practice”.  Design an application that incorporates different concepts of various color models. REFERENCES: 1.  To familiarize the student with the transformation and projection techniques.Based Graphics .  To expose the student to various color models. 3. Hughes. Circle and Ellipse drawing algorithms and Other Conics.Graphics Programming using OPENGL – Basic Graphics Primitives – Drawing Three Dimensional Objects . 28 . 4. UNIT III CURVE AND SURFACE DESIGN AND COLOUR MODELS 9 Parametric Curve Design . Pearson Education. 2003.B-Spline Curves and Surface Design . UNIT I INTRODUCTION TO GRAPHICS 9 Introduction . 2. Foley. 2004.Basic Graphics Pipeline. Raster . Second Edition.Pictures Storage and Display . John F.Constructive Solid Geometry .2004. Pauline Baker.Color Models – RGB – YIQ – CMY . Drew.Polygon Clipping .IF8003 COMPUTER GRAPHICS AND MULTIMEDIA L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the basic concepts of graphics designs. Prentice Hall. Hill.HSV – Animations – General Computer Animation.  Apply and explore new techniques in the areas of compression techniques. UNIT IV MULTIMEDIA AUTHORING AND DATA REPRSENTATIONS 9 Introduction to Multimedia – Multimedia Authoring Tools – Graphics and Image Data Representations – Basics of Digital Video – Types of Video Signals – Analog and Digital Video – Digitization of Sound – Quantization and Transmission of Audio . Ze-Nian Li and Mark S. Steven K.Design and Drawing .Key Frame .

Text-Similarity Metrics .Agglomerative Clustering . UNIT II PREPROCESSING 9 Basic Tokenizing Indexing and Implementation of Vector-Space Retrieval .Inverted Indices .Efficient Processing with Sparse Vectors Query Operations and Languages .  To get an understanding of machine learning techniques for text classification and clustering. UNIT III METRICS 9 Experimental Evaluation of IR .Clustering Algorithms .Using Thesauri . 3.Kantor.Word Statistics . UNIT IV CATEGORIZATION AND CLUSTERING 9 Text Categorization and Clustering . Rokach.The Impact of the Web on IR . UNIT V EXTRACTION AND INTEGRATION 9 Recommender Systems .Collaborative Filtering and Content-Based Recommendation of Documents and Products Information Extraction and Integration . B.Semantic Web . Shapira.Web Search .The Role of Artificial Intelligence (AI) in IR . Web Search.Extracting Data from Text – XML . 2008 2.  To understand the concepts of digital libraries. “Recommender Systems Handbook”. First Edition.Query Languages.  Design an efficient search engine.Query Expansion . Cambridge University Press.Precision and F Measure Evaluations on Benchmark Text Collections . Manning.Search Engines – Spidering – Metacrawlers .Metadata and Markup Languages .  To understand the various applications of Information Retrieval giving emphasis to Multimedia IR. Springer. 2011.K-Means .Applications to Information Filtering – Organization and Relevance Feedback.Performance Metrics – Recall . REFERENCES: 1.Expectation Maximization (EM) .Directed Spidering . UNIT I INTRODUCTION 9 Introduction .IF8079 INFORMATION RETRIEVAL L T PC 3 0 0 3 COURSE OBJECTIVES:  To understand the basics of Information Retrieval with pertinence to modeling.Zipf's Law Porter Stemmer – Morphology .Categorization Algorithms .Naive Bayes .Cosine Similarity.Goals and History of IR .Relevance Feedback . Prabhakar Raghavan and Hinrich Schütze.  Apply machine learning techniques to text classification and clustering which is used for efficient Information Retrieval. “Introduction to Information Retrieval”. query operations and indexing. Peter. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon completion of the course.Collecting and Integrating Specialized Information on the Web.Basic IR Models . Brusilovsky.Link Analysis Shopping Agents.Index Term Selection .Ranked Retrieval .TF-IDF (Term Frequency/Inverse Document Frequency) Weighting . the students will be able to  Build an Information Retrieval system using the available tools  Identify and design the various components of an Information Retrieval system. Christopher D. 2007 29 . Ricci.  Analyze the Web content structure. L. “The Adaptive Web: Methods and Strategies of Web Personalization”.Simple Tokenizing Stop-Word Removal and Stemming .Boolean and Vector-Space Retrieval Models .Text Representation . F.Decision Trees and Nearest Neighbor .

Test Planning . William E. UNIT III EMERGING SPECIALIZED AREAS IN TESTING 9 Test Process Assessment – Test Automation Assessment .Modern Software Testing Tools.Test Automation Framework – Nonfunctional Testing – SOA Testing – Agile Testing – Testing Center of Excellence – Onsite/Offshore Model .  To design and develop software quality models and implement software quality assurance. Management and Performance”. UNIT IV SOFTWARE QUALITY MODELS 9 Software quality –Verification versus Validation– Components of Quality Assurance – SQA Plan – Quality Standards – CMM – PCMM – CMMI – Malcolm Baldrige National Quality Award. Kshirasagar Naik. the students will be able to  To work with various software testing strategies.Conduct System Test .Summarize Testing Results. 3.  To introduce various testing techniques along with software production. UNIT V QUALITY THROUGH CONTINUOUS IMPROVEMENT PROCESS 9 Role of Statistical Methods in Software Quality – Transforming Requirements intoTest Cases – Deming’s Quality Principles – Continuous Improvement through Plan Do Check Act (PDCA).Lewis.Acceptance Test . Priyadarshi Tripathy. Addison-Wesley.Test Coverage . John Paul. Ron Patton.Static and Dynamic Testing.Test Evaluation -Prepare for Next Spiral .Test Case Design . TOTAL: 45 PERIODS COURSE OUTCOMES: Upon completion of the course. Third edition. Auerbach Publications.IF8082 SOFTWARE QUALITY AND TESTING L T PC 3 0 0 3 COURSE OBJECTIVES:  To introduce the basics and necessity of software testing. 2011. 2.– Software Testing in Spiral Manner .  To become aware of the current business potential of E-learning based business.  To introduce the concepts of Software quality and its assurance. “Software Testing and Continuous Quality Improvement”. Second edition. Elfriede Dustin. IF8006 E-LEARNING LT P C 3 0 0 3 COURSE OBJECTIVES:  To gain knowledge about modern technology for learning.Information Gathering . 2011. “Software testing”. Jeff Rashka. “Automated Software Testing: Introduction. 2007 4. 1999. 30 .  To acquaint with the E-Learning Tools.Types of Technical Reviews . UNIT I INTRODUCTION 9 Basics of Software Testing – Testing Principles – Goals – Testing Life Cycle– Phases of Testing– Test Plan(IEEE format) – Importance of Testing in Software Production Cycle.Test Development .  To learn technologies involved in E-learning application development. Pearson Education. “Software Testing and Quality Assurance Theory and Practice”. John Wiley & Sons publication. UNIT II SOFTWARE TESTING METHODOLOGY 9 Software Test Plan–Components of Plan . REFERENCES: 1.

service – speed evaluation UNIT V CASE STUDY 9 Reinventing the Training Organization – Training at CISCO System – case study . TOTAL:45 PERIODS COURSE OUTCOMES: Upon completion of this course.the role of Training . Marc J. 2012 4.building knowledge management solution UNIT III E-LEARNING ARCHITECTURE 9 Integrating E-Learning and Classroom Learning . REFERENCES: 1.  To learn aspects of computational learning theory.Basic Concepts in Machine Learning .Types of Machine Learning .Quality – demonstration . 2001. In Tech Publication.knowledge Management – types – benefits .sales development .UNIT I INTRODUCTION 9 Introduction – Learning . "E-Learning Experiences and Future". Saul Carliner and Patti Shank.the role of E-Learning – New Era . "E-Learning and Social Networking Handbook – Resources for Higher Education" .Machine Learning Foundations –Overview – Applications . UNIT I INTRODUCTION 9 Machine Learning .E-Learning. 2. Pfeiffer Publication.classroom course to the web-case study .Examples of Machine Learning . 2008.  Design and develop E-Learning application and work with E-Learning tools.  To appreciate the concepts and algorithms of reinforcement learning.knowledge management pyramid . "The E-Learning Handbook: Past Promises. Safeeullah Soomro.Building Learning Culture – strategies . students should be able to:  Work with technologies involved in E-Learning Applications. 2010 3. McGraw Hill. executives E-Learning Applications UNIT IV LEARNING MANAGEMENT SYSTEM 9 Building and Managing an E-Learning Infrastructure .E-Learning Revolution .creating Elearning strategy for self – future of E-learning. Tara Morrison.community and collaboration in knowledge management .E-Learning Strategy UNIT II KNOWLEDGE MANAGEMENT 9 Computer Based Training – Pitfalls .Learning Management Systems (LMS) .knowledge management for professionals – services .Applications 31 .Rosenberg. "E-Learning: Strategies for Delivering Knowledge in the Digital Age". Frank Rennie.E-Learning costs – justification .Learning Architecture for . IF8013 MACHINE LEARNING L T P C 3 0 0 3 COURSE OBJECTIVES:  To understand the concepts of machine learning.  To understand the theoretical and practical aspects of Probabilistic Graphical Models.initial call center training.financial consultants . Present Challenges".Learning portals .  To appreciate supervised and unsupervised learning and their applications.building Learning Architecture .

Markov Random Fields.Learning . Tibshirani.Generalization – Undirected graphical models .Linear Basis Function Models . Ethem Alpaydin. 2008 6.Error Back-Propagation . “Machine Learning: A Probabilistic Perspective”.Accuracy and Confidence Boosting.The Setting.Mistake Bound Analysis . "Machine Learning".Bayesian Logistic Regression .The Curse of Dimensionality Dimensionality Reduction . Tom Mitchell. MIT Press. “Pattern Recognition and Machine Learning” Springer.Inference in Graphical Models Learning –Naive Bayes Classifiers .Temporal Difference Learning. 2006 2.Conditional Independence Properties .EM .Probabilistic Generative Models Probabilistic Discriminative Models . UNIT II SUPERVISED LEARNING 9 Linear Models for Classification . “Introduction to Machine Learning”.Sample Complexity Analysis .Decision Trees Classification Trees . Murphy. Christopher Bishop.Value Iteration.K-means .Policy Iteration .  To use a tool to implement typical clustering algorithms for different types of applications.Computational Learning Theory .Bayesian Linear Regression .Occam Learning . Prentice Hall of India.Parameterization of MRFs .Reinforcement Learning .Probabilistic PCAIndependent Components Analysis.Model-Based Learning .SemiSupervised Learning . UNIT V ADVANCED LEARNING 9 Sampling – Basic sampling methods – Monte Carlo . 1997. Springer. TOTAL: 45 PERIODS COURSE OUTCOMES: Upon completion of the course.Regression Trees – Pruning . .From Distributions to Graphs .Examples .Boosting.Dual Representations . Hastie.VC Dimension .The EM Algorithm in General -Model Selection for Latent Variable Models .Linear Models for Regression .Bayesian Networks . CRC Press.Radial Basis Function Networks .Examples .Bayesian Model Comparison. “Machine Learning –An Algorithmic Perspective”.Markov Models – Hidden Markov Models – Inference – Learning.Markov Random Fields .Ensemble methods .  To implement probabilistic discriminative and generative algorithms for an application of your choice and analyze the results.The Bias-Variance Decomposition .Structural SVMs.  To design and implement an HMM for a sequence model type of application  To identify applications suitable for different types of machine learning with suitable justification. Stephen Marsland.Mixture Density and Bayesian Neural Networks . REFERENCES: 1.Generalization.Feed-Forward Network Functions . McGraw-Hill. 2005 4.Neural Networks .Factor Analysis . Friedman. 5. 2009 32 .Conditional Random Fields (CRFs) .Exploration Strategies. “The Elements of Statistical Learning” (2nd ed).  To implement a neural network for an application of your choice using an available tool.Exploiting Independence Properties . UNIT III UNSUPERVISED LEARNING 9 Clustering.Discriminant Functions .Bagging .Principal Component Analysis .Deterministic and Non-deterministic Rewards and ActionsEligibility Traces. UNIT IV PROBABILISTIC GRAPHICAL MODELS 9 Directed Graphical Models .K-Armed BanditElements .Kernel Methods ..Mixtures of Gaussians .Partially Observable States.High-Dimensional Spaces -. 2012 3. Kevin P.Example . the students will be able to.Regularization .

UNIT IV EXPERIMENTAL DESIGN AND STATISTICAL ANALYSIS OF HCI 9 Basic Design Structure – Single Independent Variable – Multiple Independent Variable – Factorial Design – Split-Plot Design – Random Errors – Experimental Procedure – Statistical Analysis – T Tests – Analysis of Variance Test – Regression – Chi-Square Test – Survey – Probabilistic Sampling – Non-Probabilistic Sampling – Developing Survey Questions. as they relate to collaborative or social software.IF8077 HUMAN COMPUTER INTERACTION L T P C 3 0 0 3 COURSE OBJECTIVES:  To learn the principles and fundamentals of human computer interaction (HCI).  Apply HCI techniques and methods to the design of software. UNIT III MODELS 9 Universal Design Principles – Multimodal Systems – User Support – Presentation and Implementation Issues – Types – Requirements – Approaches – Cognitive Model – Hierarchical Model – Linguistic Model – Physical and Device Models – Socio technical Models – Communication and Collaboration Models – Task Models – Task Analysis And Design. 33 .  To know the applications of multimedia on HCI. and interface requirements for a given computer application.  Design and develop issues related to HCI for real application.  Categorize and carefully differentiate various aspects of multimedia interfaces. UNIT V THEORIES 9 Dialogue Notations and Design – Dialogue Need – Dialogue Design Notations – Graphical – Textual . and apply them to designing an interface.  To understand user interface design principles.  To establish target users. UNIT I DESIGN PROCESS 9 Humans – Information Process – Computer – Information Process – Differences and Similarities – Need for Interaction – Models – Ergonomics – Style – Context – Paradigms – Designing of Interactive Systems – Usability – Paradigm shift – Interaction Design Basics – Design Process – Scenarios – Users Need –Complexity of Design UNIT II DESIGN AND EVALUATION OF INTERACTIVE SYSTEMS 9 Software Process – Usability Engineering – Issue based Information Systems – Iterative Design Practices – Design Rules – Maximum Usability – Principles – Standards and Guidelines – Design Patterns – Programming Tools – Windowing Systems – Interaction Tool Kit – User Interface Management System – Evaluation Techniques – Evaluation Design – Evaluating Implementations – Observational Methods.  To learn user interface designs through usability inspection and user models.Representing Dialogue – Formal Descriptions – Dialogue Analysis – System Models – Interaction Models – Relationship with Dialogue – Formalisms – Formal Notations – Interstitial Behavior – Virtual Reality – Modeling Rich Interaction – Status Event Analysis – Properties – Rich Contexts – Sensor-based Systems – Groupware – Applications – Ubiquitous Computing – Virtual Reality TOTAL:45 PERIODS COURSE OUTCOMES: Upon completion of the course. the students will be able to  Interpret the contributions of human factors and technical constraints on human-computer interaction. functional requirements.  To analyze HCI theories.  Evaluate the role of current HCI theories in the design of software.

Contingency Planning and Disaster Recovery. Fifth Edition.Development Tools – Intranet .Nuclear Medicine .Computerized Prescriptions for Patients.Selecting a Health Care Information System .  To study and use different tools for clinical information system.REFERENCES: 1.  To apply the knowledge of Bio informatics for systems. “Research Methods in HumanComputer Interaction”. UNIT II HEALTHCARE INFORMATICS 9 Strategic Planning . Dialogue with the Computer . Janet Finlay. 2010. UNIT IV MEDICAL IMAGING 9 Automated Clinical Laboratories . Alan Dix.  To work with different medical imaging techniques.Cytology and Histology Intelligent Laboratory Information System . TOTAL:45 PERIODS COURSE OUTCOMES: Upon completion of the course. Nuclear Magnetic Resonance. Ben Shneiderman and Catherine Plaisant. 3. UNIT III COMPUTERISED PATIENT RECORD 9 Introduction . EEG And EMG .Radiation Therapy and Planning. Third Edition. UNIT I MEDICAL INFORMATICS 9 Introduction . 2004.Ultrasound Imaging Ultrasonography -Computed XRay Tomography . Harry Hochheiser. the students will be able to  To design and develop clinical and hospital management system on his own. Addison-Wesley Publishing Co.Components and Functionality of CPR .Systems Integration . Jonathan Lazar Jinjuan Heidi Feng. 2. Wiley. 34 .Computer Assisted Medical Imaging .Automated Methods in Hematology .Clinical Information System . “Human Computer Interaction”.  To understand the case study of computerized patient record.Health Informatics – Medical Informatics – Bioinformatics.Functional Capabilities of a Computerized HIS .History taking by Computer.Systems Integration and Maintenance .  To apply the knowledge of bio informatics for biological databases.Regulatory and Accreditation Issues .Structure of Medical Informatics –Internet and Medicine -Security Issues Computer based Medical Information Retrieval.Computerized ECG. IF8012 X – INFORMATICS L T PC 3 0 0 3 COURSE OBJECTIVES:  To gain knowledge about medical informatics and healthcare informatics. Russell Beale. Hospital Management and Information System .CPR in Radiology .Application Server Provider . Gregory Abowd. “Designing the User Interface: Strategies for Effective Human-Computer Interaction”. 2009.E-Health Services . Prentice Hall. UNIT V BIO-INFORMATICS 9 Pair wise Sequence Alignment – Local Versus Global Alignment – Multiple Sequence Alignment – Computational Methods – Dot Matrix Analysis – Substitution Matrices – Dynamic Programming – Word Methods – Bayesian Methods – Multiple Sequence Alignment – Dynamic Programming – Progressive Strategies – Iterative Strategies – Tools – Nucleotide Pattern Matching – Polypeptide Pattern Matching – Utilities – Sequence Databases.

R. Second Edition. Bryan Bergeron. 4. 2003. 3.D. 2003. “Medical informatics”. Tata Mcgraw Hill Publishing Computers. IF8005 DESIGN OF SOFTWARE AGENTS L T PC 35 . 2005. Tata McGraw Hill Publishing. 2006. Pearson Education. Barbara. “Bio Informatics Computing”. “Information Technology for the Health Professions”.REFERENCES: 1.Lele. Mohan Bansal. “Computers in Medicine Progress in Medical Informatics”. Well. Prentice Hall. Lillian. 2. Burke.