course plan

20
09NN01 OPTIMIZATION TECHNIQUES 3 1 0 4 LINEAR PROGRAMMING: Linear Programming: Graphical method, Simplex method, Revised simplex method, Duality in linear programming (LP), Sensitivity analysis, other algorithms for solving LP problems, Transportation, assignment and other applications. (9) NON-LINEAR PROGRAMMING: Non Linear Programming: Unconstrained optimization techniques, Direct search methods, Descent methods, constrained optimization. (9) INTEGER AND DYNAMIC PROGRAMMING: Formulation of Integer Programming Problems, Gomory’s cutting plane methods, Branch and Bound Techniques, Characteristics of Dynamic programming, Bellman’s principle of optimality, Concepts of dynamic programming, Tabular method of solution, Calculus method of solution. (11) 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. (5) NON TRADITIONAL TECHNIQUES: Genetic Algorithm, Simulated Annealing, Tabu Search and Neural Networks. (8) Total 42 REFERENCES: 1. Rao S S, “Engineering Optimization: Theory and Practice”, New Age International, New Delhi, 2006. 2. Trivedi K S, “Probability and Statistics with Reliability, Queuing and Computer Applications”, Prentice Hall, New Delhi, 2006. 3. Taha H A, “Operations Research: An Introduction”, Pearson Education, New Delhi, 2006. 4. Alberto Leon–Garcia, “Probability and Random Processes for Electrical Engineering”, Pearson Education, New Delhi, 2007. 5. Jang J S R, Sun C T and Mizutani, “Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence”, Pearson Education, New Delhi, 2005. 09NN02 DATA STRUCTURES AND ALGORITHMS 3 1 0 4 INTRODUCTION: Primitive Data Types - Abstract Data types – Algorithm Analysis – Time and Space Complexity. (3) LISTS: Arrays – Linked Lists – Stacks and Queues – Applications – Implementation of Recursive Functions. (5) TREES: Binary Trees – Tree Traversals – Binary Search Trees – Balanced Search Trees – AVL – Red-Black Trees – Binary Heap – Heap Sort – Priority Queues. (8) GRAPHS: Representation of Graphs, Breadth First Search, Depth First Search, Strongly Connected Components, Dijkstra’s and Bellman Ford’s Algorithms – Floyd - Warshall‘s All 342

Upload: gopitheprince

Post on 21-Jul-2016

4 views

Category:

Documents


0 download

TRANSCRIPT

09NN01 OPTIMIZATION TECHNIQUES  3 1 0 4

LINEAR PROGRAMMING: Linear Programming: Graphical method, Simplex method, Revised simplex method, Duality in linear programming (LP), Sensitivity analysis, other algorithms for   solving LP problems, Transportation, assignment and other applications.                                                                                                (9)

NON-LINEAR PROGRAMMING: Non Linear Programming: Unconstrained optimization techniques, Direct search methods, Descent methods, constrained optimization.      (9)

INTEGER AND DYNAMIC PROGRAMMING: Formulation of Integer Programming Problems, Gomory’s cutting plane methods, Branch and Bound Techniques, Characteristics of Dynamic programming, Bellman’s principle of optimality, Concepts of dynamic programming, Tabular method of solution, Calculus method of solution.    (11)

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. (5)                                                                                  NON TRADITIONAL TECHNIQUES: Genetic Algorithm, Simulated Annealing, Tabu Search and Neural Networks. (8)

Total 42REFERENCES:1. Rao S S, “Engineering Optimization: Theory and Practice”, New Age International, New Delhi, 2006.2. Trivedi K S, “Probability and Statistics with Reliability, Queuing and Computer Applications”, Prentice Hall, New

Delhi, 2006. 3. Taha H A, “Operations Research: An Introduction”, Pearson Education, New Delhi, 2006.4.   Alberto Leon–Garcia, “Probability and Random Processes for Electrical Engineering”, Pearson Education, New

Delhi, 2007.5. Jang J S R, Sun C T and Mizutani, “Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and

Machine Intelligence”, Pearson Education, New Delhi, 2005. 

09NN02 DATA STRUCTURES AND ALGORITHMS                                                                                                                               

 3 1 0 4

INTRODUCTION: Primitive Data Types - Abstract Data types – Algorithm Analysis – Time and Space Complexity. (3)

LISTS: Arrays – Linked Lists – Stacks and Queues – Applications – Implementation of Recursive Functions. (5)

TREES: Binary Trees – Tree Traversals – Binary Search Trees – Balanced Search Trees – AVL – Red-Black Trees – Binary Heap – Heap Sort – Priority Queues. (8)

GRAPHS: Representation of Graphs, Breadth First Search, Depth First Search, Strongly Connected Components, Dijkstra’s and Bellman Ford’s Algorithms – Floyd - Warshall‘s All Pair Shortest Paths Algorithm. (8)

SEARCHING: Hash Tables – Collision resolution – Tree Structures. (4)

ALGORITHM DESIGN METHODS: Greedy Method - Divide and Conquer - Dynamic Programming - Backtracking - Branch and Bound. (14)

                                                                                                                             Total 42REFERENCES:1. Weiss M A, “Data Structures & Algorithm analysis in C++”, Addison Wesley, New Delhi, 2006.2. Ellis Horowitz and Sartaz Sahni, “Fundamentals of Computer Algorithms”, Computer Science Press, Delhi, 2008.3. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, “Introduction to Algorithms”, Prentice Hall, Delhi 2001.4. Vijayalakshmi Pai , “Data Structures-Concepts, Techniques and Applications”, Tata McGraw Hill, New Delhi, 2008.

09NN03 ADVANCED COMPUTER ARCHITECTURE4 0 0 4

342

REVIEW OF COMPUTER ARCHITECTURE: Fundamentals of Computer design- Technology trends- cost- measuring and reporting performance - Instruction set principles- addressing modes. (9)

PIPELINING AND ILP: Pipelining - Design issues - Instruction level parallelism (ILP) -over coming data hazards - reducing branch costs – high performance instruction delivery - hardware based speculation- limitation of ILP - ILP software approach-compiler techniques- static branch protection-VLIW approach- Hardware and software solutions. (9)

MEMORY: Memory hierarchy design- cache performance- reducing cache misses penalty and miss rate – virtual memory- protection. (7)

STORAGE SYSTEMS: Types – Buses - RAID- errors and failures- bench marking a storage device- designing a I/O system. (8)

MULTIPROCESSORS: Multiprocessors and thread level parallelism- symmetric shared memory architectures- distributed shared memory- Synchronization-multi threading. Inter connection networks and clusters- interconnection network media – practical issues in interconnecting networks- examples – clusters- designing a cluster. (9)

Total 42

REFERENCES:1. Patterson D A and Hennessy J L, “Computer Architecture: A Quantitative Approach”, Morgan Kaufmann Amsterdam,

2006.2.   Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “Computer Organization”, McGraw Hill, New York, 2006.3. Vincent T Heuring, Jordan H F, “Computer Systems Design and Architecture”, Addison Wesley, NewDelhi, 2006.4. Kai Hwang, “Advanced Computer Architecture, Parallelism, Scalability, Programmability”, McGraw Hill,London, 2003.

09NN04 OPERATING SYSTEM DESIGN3 1 0 4

INTRODUCTION: Introduction - Operating Systems Services – Types of Operating Systems and Operating systems structure. (5)

PROCESS MANAGEMENT: Processes - CPU Scheduling Approaches – Process Synchronization – Semaphores – Deadlocks – Handling Deadlocks –Multithreading – Case study: process management in Linux. (10)

MEMORY MANAGEMENT: Memory Management – Paging – Segmentation – Virtual Memory – Demand Paging – Replacement Algorithms – Case study: Memory management in Linux.                                     (9)

  FILE HANDLING: 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 – Case study: I/O management in Linux (9)

  ADVANCED OS: Design issues in Distributed Operating System- Network Operating Systems –Symbion OS (9)

                                                                                                     Total 42REFERENCES:1. Abraham Silberschatz, Peter B Galvin, Gagne G, “Operating System Concepts”, John Wiley & Sons, New York,

2005.2. Charles Crowley, “ Operating systems: A Design Oriented Approach”, Tata McGraw Hill, 2004.3. Dhamdhare, “Operating Systems-a concept based approach”, Tata McGraw Hill, 2006.4. Tanenbaum, “Distributed Operating Systems”, Pearson Education, New Delhi, 2004.5. Pradeep K Sinha, “Distributed OS concepts and Design”, IEEE computer Society Press, PHI 2005.

09NN05 /09NE35 SOFTWARE ENGINEERING METHODOLOGIES                                                                                                                               3 0 0 3

INTRODUCTION: Definition of terms – Role of Software – Software characteristics – Software classification – Software myths – Software Life Cycle Models - Selection of process models for projects. (8)

SOFTWARE REQUIREMENT ANALYSIS: Software Requirements elicitation – Requirement Specifications – Joint Application development – Analysis modeling. (8)

343

SOFTWARE DESIGN: Design concepts – Function Oriented Design – Object Oriented Design – User interface design – Software Architecture. (8)

PROGRAMMING STANDARDS: Structured programming – Coding standards – Maintainability of programs. (4)

SOFTWARE TESTING: Testing fundamentals – Test cases – Testing Techniques – Testing strategies. (6) SOFTWARE CONFIGURATION MANAGEMENT: SCM process – Version control – Change control – Configuration audit – SCM Standards. (4)

SOFTWARE MAINTENANCE: Types of changes – Maintenance issues – Measuring maintenance effort – Proactive, Preventive and Perfective maintenance – Software rejuvenation. (4)

Total 42REFERENCES: 1. Roger Pressman S, “Software Engineering: A Practitioner's Approach”, Tata McGraw Hill, New Delhi, 2005. 2. Sommerville I, “Software Engineering”, Pearson Education, New Delhi, 2007.3. Shari Lawrence Pfleeger, “Software Engineering: Theory and Practice”, Pearson Education, New Delhi, 2007.

09NN06 / 09NE21 INFORMATION THEORY AND CODING TECHNIQUES4 0 0 4

INFORMATION ENTROPY FUNDAMENTALS: Relation between information and probability, mutual and self information, information entropy, Shannon's theorem, Code design, Shannon-Fano coding, Huffman coding, Implementation of Huffman code. (8)

DATA AND VOICE CODING: Context dependent coding, arithmetic codes, overall efficiency consideration. Voice coding, Delta Modulation and adaptive delta modulation, linear predictive coding, silence coding, sub-band coding. (8)

IMAGE AND VIDEO COMPRESSION: Direct cosine transform, quantization loss, loss estimation, JPEG components and standards Inter frame, coding, motion compensation techniques, MPEG-2 standards, Introduction to MPEG-4. (9)

ERROR CONTROL CODING :Backward error correction linear block codes, BCH codes, Golay codes, efficiency of LBC, performance of simple ARQ go back-n and selective repeat schemes forward correction codes-Convolution coding decoding algorithms, Viterbi decoding optimum decoding performance measures. (9)

ENCRYPTION CODING: Transposition and substitution coding, Data Encryption Standards (DES), key distribution problem, public key encryption, public key decryption and MIT algorithm. Direct sequence CDMA based encryption, Orthogonal sequences, R-S codes. (8)

Total 42REFERENCES:1. Cover T M and Thomas J A, “Elements of Information theory”, 2nd edition, John Wiley & Sons, 2006. 2. Roth R, “Introduction to Coding theory”, Cambridge University Press, 2006.3. Peter Sweeney, “Error Control Coding: From Theory to Practice”, John Wiley & Sons, 2002.

09NN07 / 09NE34 DATABASE TECHNOLOGY3 0 0 3

INTRODUCTION: Data models, structure of relational databases, component of management system – DDL, DML, database languages, SQL standard, database users and administrators. (9)

RELATIONAL DBMS: Design issues - basic normal forms and additional normal forms, Transforming E-R diagram to relations, Integrity constraints, Query processing and optimization. (9)

TRANSACTION PROCESSING: Transaction concept, concurrent execution, isolation, testing for serializability, Concurrency control, lock based - time-stamp based - validation based protocols, multi-version schemes, deadlock handling. (9)

DATABASE ADMINISTRATION: Functions of DBA, Data volume and usage analysis, security and authorization, recovery and atomicity, buffer management, backup systems. (9)

ADVANCED DATABASES: Object oriented, parallel, distributed, web databases. (6)

344

Total 42

REFERENCES: 1. Abraham Silberschatz, Hanry F Korth, Sudarshan S, “Database Systems Concepts”, McGraw Hill, 2007.2. Raghu Ramakrishnan, “Database Management Systems”, McGraw Hill , 2003.3. Michael Kifer, Arthur Bernstein, Philip M Lewis, Prabin K Panigrahi, “Database Systems – An application

oriented approach“,Pearson Education, 2008.4. Jeffrey D Ullman, “ A First Course in Database Systems”, Pearson Education, 2007.5. Date C J, “An Introduction to Database Systems”, Pearson Education, 2003.

09NN08 NETWORKING TECHNOLOGY                                                                                                                                3 0 2 4

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.  (8)

DATA LINK CONTROL: Asynchronous and Synchronous transmission - MAC protocol; Controlled & contention-based - IEEE 802.11 LANs – System architecture, physical layer, Media Access Control – MAC management – Error Detection and Correction Techniques – CRC and Linear Block Codes – Transmission Protocols – Retransmission techniques  -Token ring – FDDI. (9)

TRANSPORT LAYER: Introduction to TCP – packet format – sliding window protocol – Establishing  and Closing TCP connection – Response to Congestion and variance in delay – TCP performance – Reserved and available port numbers.           (8)

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. (9)

NETWORK PERFORMANCE MEASUREMENT AND MODELING: Traffic modeling and simulation - self-similar and heavy-tailed models - Buffering – Blocking - Fast Forwarding Internet traffic: self-similarity - Ethernet traffic - World-Wide- Web traffic - IP Switching - IP multicast - multicast routing.       (8)

  Total 42REFERENCES:1. Fitzgerald and Dennis, “Business Data Communications and Networking”, John Wiley and Sons, Delhi, 2005.2.   William Stallings, “Data and Computer Communications”, Eighth edition, Prentice Hall, New  Delhi, 2006.3.   James F Kurose, et al, “Computer Networking: A Top-Down Approach Featuring the Internet”, Fourth edition,

Addison Wesley, 2008.4. Achyut S Godbole, “Data Communications and Networks”, Tata Mc-Graw Hill, 2002.5. Ferouzan, “Data Communications and Networking”, Tata Mc-Graw Hill, 2006.

09NN09 DISTRIBUTED COMPUTING SYSTEMS3 0 0 3

INTRODUCTION: Characterization of distributed systems – System models – architectural models – Fundamental models – Networking and Internetworking – Network principles – Inter-network protocols – Inter process communication – API for the internet protocols – External data representation and marshalling – client/server communication – group communication – RPC communication. (6)

SYSTEM INFRASTRUCTURE FOR DISTRIBUTED SYSTEMS: Operating system support – security – Distributed file systems – sun NFS – Distributed Shared Memory: Design and implementation models - Consistency Models.  (9) DISTRIBUTED ALGORITHMS: Clocks, Event and Process states – Clock synchronization – Event ordering – Logical time and logical clocks – Global States – Distributed Mutual Exclusion – election algorithms – Consensus problems. (9) DISTRIBUTED TRANSACTIONS: Transactions and concurrency control – Distributed transactions – flat and nested distributed transactions – concurrency control – distributed deadlocks – replication – fault tolerance.          (9)

DISTRIBUTED OBJECTS TECHNOLOGY: Distributed objects and remote invocation – Directory and discovery services – case study: sun RPC – DCE RPC – MS RPC – CORBA – JAVA RMI – COM – SOAP – J2EE and Enterprise Computing   - SOA and Cloud Computing.  (9)

345

               Total 42

REFERENCES:1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts and Design”, Pearson Education,

New Delhi, 2005.2.  Liu M L, “Distributed Computing Principles and Applications”, Pearson Education, New Delhi, 2005.3. Tanenbaum A S, Van Steen M, “Distributed Systems”, Pearson Education, New Delhi, 2006.

ELECTIVES

09NN21/09NE25 SERVICE ORIENTED ARCHITECTURE3 0 0 3

SERVICE ORIENTED ARCHITECTURE CONCEPTS: Service governance, processes, guidelines, principles, methods and tools – Key Service characteristics – Technical benefits of a service-oriented architecture – Service-oriented architecture – Benefits. (6) QUALITY OF SERVICE: Web services orchestration – Workflow and Business Process Management – Business Process Execution Language – ACID Transactions - Web services Transactions – SOA Management – Systems Management – Alerting – Provisioning – Leasing – Lifecycle management – Management Architecture. (7) SOFTWARE ORIENTED ARCHITECTURE IN WEB SERVICES: Introduction to XML Technologies – XML – DTD – XSD - Universal Description Discovery and Integration – Programming UDDI – UDDI Data Model – UDDI SOAP APIs – Inquiry APIs – Publisher APIs – Web Service Definition Language – Defining Message data types – Defining Operations on Messages – Importing WSDL documents – Extensions for binding to SOAP – Simple Object Access Protocol – SOAP Specification – SOAP Message processing – SOAP use of Namespaces – SOAP Multipart MIME attachments. (14)

SOA AND BUSINESS PROCESS MANAGEMENT: Basic Business process management concepts – Examples – Combining BPM, SOA, and web services – Orchestration and Choreography specification – Examples- Web services.- The simple approach to metadata management – Metadata specification-– Impact of web services on transactions.

(7)SERVICES SECURITY: Overarching concern – Core concepts – Summary of challenges, threats and remedies – Securing the communication layer – Overview of message-level security – Data-level security, Risk of loose coupling-layers of SOA security-Solutions to SOA security. (8)

Total 42REFERENCES:1. Thomas Erl, “ Service Oriented Architecture (SOA): Concepts, Technology and Design”, Prentice Hall, 2005.2. Greg Lomow, Eric Newcomer, “Understanding SOA with Web Services”, Pearson Education, New Delhi, 2005.3. Eric New Comer,”Understanding Web Services: XML, WSDL, SOAP and UDDI”, Addison Wesley, 2002.4. Chatterjee, Sandeep and James Webber, “Developing Enterprise Web Services: An Architect’s Guide”, Prentice Hall

of India, New Delhi, 2005.

09NN22 DIGITAL IMAGE PROCESSING3 0 0 3

DIGITAL IMAGE FUNDAMENTALS: Elements of digital image processing system-Image sensing and acquisition- Image sampling and quantization – Basic relationship between pixels.  (4) IMAGE TRANSFORMS: Need for image transforms- Discrete Fourier transform- Discrete Cosine transform-Walsh transform- Hadamard transform- Hotelling transform- Haar transform-Radon transform. (4)

IMAGE ENHANCEMENT: Spatial domain methods- Frequency domain methods- Histogram modification techniques- Neighborhood averaging-median filtering- Lowpass filtering- averaging of multiple images- image sharpening by differentiation- high pass filtering.                                                           

(9) IMAGE FILTERING AND RESTORATION: Image observation models- restoration in the presence of noise only- spatial filtering: mean filters, order statistics filters, adaptive filters- Inverse filtering- Wiener filtering – Constrained least squares filtering- blind deconvolution.   (8) 

346

IMAGE CODING: Quantization: scalar Quantization and vector Quantization-code word assignment: uniform length and variable length codeword assignment – differential pulse code modulation, two channel coders, pyramid coding; hybrid transform coding – wavelet coding. (9)

IMAGE SEGMENTATION AND REPRESENTATION: Edge detection: Gradient operators - edge linking and boundary detection: Global processing via Hough transform, Graph theoretic techniques -Thresholding: Global thresholding, adaptive threshold-Representation: Chain codes, Polygonal approximations, Signatures, boundary segments, skeletons - Boundary descriptors: Shape numbers, Fourier descriptors, Statistical moments - Regional descriptors: Texture - Relational descriptors. (8)                                                                                                                                                                                                                     

Total 42REFERENCES:1. Gonzalez R C, Woods R E, ”Digital Image Processing”, Pearson Education, Second edition, 2002.2. Jain A K, ”Fundamentals of Digital Image Processing”, Prentice Hall of India,1989.3. Jae S Lim, ”Two-Dimensional Signal and Image Processing”, Prentice Hall,Inc., 1990.4.    Kenneth R Castleman, ”Digital Image Processing”, Prentice Hall International,Inc., 2001.5.    Milan Sonka, VaclauHlavac, Roger Boyle, “Image Processing, Analysis, and Machine Vision”, Brooks/Cole

Publishing Company, 1999.6. William K Pratt, “Digital Image Processing”, John Wiley & Sons, 2003.

 09NN23 ENTERPRISE RESOURCE PLANNING

3 0 0 3

INTRODUCTION: Business processes, basic differences between manufacturing and services, data Integration Issues, benefits of ERP, brief history of ERP and related technologies – BPR, data warehousing, data Mining, OLAP. (9)

ERP ARCHITECTURE: Concepts of ERP- major components and their functions in ERP system. ERP architecture - system control interfaces, services, presentation interface, database Interface. Interfaces with other systems, Multi- client server solution, Application Integration - ERP and Internet, ERP and Commerce. (9)

IMPLEMENTATION ISSUES: package selection, implementation methodology, ERP Lifecycle, people Issues, ERP and business/process drivers, office Integration, software selection, project management, feasibility issues, project initiation, risk Involved, hidden costs, user education. (9)

ERP MODULES: The Development of Enterprise Resource Planning Systems, Business Modules– Finance, Manufacturing, Human Resources, Plant Maintenance, Materials Management, Quality Management, Sales & Distribution. (9)

ERP APPLICATIONS: Marketing Information Systems and the Sales Order Process, Production and Supply Chain Management, Human Resources management, Processes management/ Improvement. (6)

Total 42REFERENCES:1. Leon, Alexis, “ERP Demystified”, Second edition, Tata McGraw Hill, New Delhi, 2007.2. Olson, David, “Managerial Issues of Enterprise Resource Planning Systems,” Tata McGraw Hill, New Delhi,

2007.3. Sumner, Mary, “Enterprise Resource Planning”, Prentice Hall, New Jersey, 2005. 4. O’Leary, Daniel, “Enterprise Resource Planning Systems: Systems, Life Cycle, Electronic Commerce and Risk”,

Cambridge University Press, Cambridge, 2002.5. Ellen Monk, Bret Wagner,” Concepts in Enterprise Resource Planning”, Thomson Course Technology, USA,

2006. 

09NN24/09NE27 XML AND WEB SERVICES3 0 0 3

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. (9)                                                                                                 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 - Finding Services - The Inquiry API - Invoking a service. Introduction to .NET – web service architecture – RPC style web services – Message Style Web services. (9)

347

 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. (8)

J2EE AND WEB SERVICES: Enterprise Web services -  Back end service component - Web application framework - Web service front end - Web service client - S2ML (Secure Services Markup Language) – XAML. (8)

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. (8)  

  Total 42REFERENCES:1. Harold and Means, “XML in a Nutshell”, O’Reilly Publishers, Orlando, 2004.2. Ron Schmelzer et al. “XML and Web Services”, Pearson Education, New Delhi,2002.3. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services: An Architect's Guide”, Prentice  Hall,

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

09NN25 INFORMATION SECURITY3 0 0 3

INTRODUCTION: Security - Attacks - Computer criminals - Method of defense - Program Security: Secure programs - Non-malicious program errors - Viruses and other malicious code - Targeted malicious code - Controls against program threats. (6)

OPERATING SYSTEM SECURITY: Protected objects and methods of protection – Memory address protection - Control of access to general objects - File protection mechanism - Authentication: Authentication basics – Password - Challenge-response. (8)

DATABASE SECURITY: Security requirements - Reliability and integrity - Sensitive data – Interface - Multilevel database - Proposals for multilevel security. (6)

SECURITY IN NETWORKS: Threats in networks - Network security control – Firewalls - Intrusion detection systems -Secure e-mail - Networks and cryptography – Example protocols: PEM – SSL – Ipsec. (8)

ADMINISTRATING SECURITY: Security planning - Risk analysis - Organizational security policies - Physical security. (6)

LEGAL, PRIVACY, AND ETHICAL ISSUES IN COMPUTER SECURITY: Protecting programs and data - Information and law - Rights of employees and employers - Software failures - Computer crime – Privacy - Ethical issues in computer society. (8)

Total 42REFERENCES:1. Whitman M, Mattord H, “Principles of Information Security”, Thomson Cole Publishers, New Delhi, 2008.2. Pfleeger C P, Pfleeger S L, “Security in Computing”, Pearson Education, 2006.3. William Stallings, “Cryptography & Network Security”, Pearson Education, New Delhi, 2006.4. Micki Krause, Harold F Tipton, “Handbook of Information Security Management”, Vol 1-3 CRC Press LLC, 2005.5.   Matt Bishop, “Computer Security: Art and Science”, Pearson Education, 2003.

09NN26 NEURAL NETWORKS AND FUZZY SYSTEMS3 0 0 3

 FEED FORWARD NETWORKS AND SUPERVISED LEARNING: Biological Neural Networks - Artificial Neuron- Activation Functions, Learning rules- Hebb Network- Perceptron Networks- Adaline- Madaline-Back propagation networks-Learning factors- Linear Separability. (8)

SINGLE LAYER FEEDBACK NETWORKS: Hopfield Network-Associative Memories- Recurrent auto association memory –Bi-directional Associative memory-Boltzmann machine. (6)

UNSUPERVISED LEARNING NETWORKS: Neural Network based on competition - Maxnet -Hamming Network- Self-Organizing feature Maps- Learning Vector Quantization - Adaptive Resonance Theory Network – Counter propagation Network. (8) FUZZY SETS AND RELATIONS: Crisp Set-Vagueness-Uncertainty and Impression-Fuzziness-Basic Definitions-Basic set theoretic Operations for Fuzzy –Types-Operations-Properties- Crisp and Fuzzy relations-Fuzzy relation-Cardinality Operations, Properties-Fuzzy Cartesian product and Composition-Non-Interactive fuzzy sets- Tolerance and Equivalence

348

relations-Fuzzy Ordering relations-Composition of fuzzy relations – Crisp to fuzzy conversion – membership function. (8) 

FUZZY–TO–CRISP CONVERSIONS: Lambda cuts for fuzzy sets and relations-Definitions- Defuzzification methods. (6)

APPLICATIONS OF NEURAL NETWORKS AND FUZZY LOGIC: Pattern Recognition-Image compression- Fuzzy Pattern Recognition- Fuzzy Image compression. (6)

Total 42REFERENCES: 1.   Laurene Fausette, “Fundamentals of Neural Networks”, Pearson Education, New Delhi, 2004. 2.   Timothy Ross, “Fuzzy Logic with Engineering Applications”, McGraw Hill, Singapore, 2000. 3. Zimmermann H J, “Fuzzy set theory and its Applications”, Allied Publishers Ltd, New Delhi, 1999.4. Rajasekaran S and Vijayalakshmi Pai G A, “Neural Networks, Fuzzy Systems and Genetic Algorithms”, Prentice

Hall of India, New Delhi, 2003.5. Haykins, “Neural Networks – A Comprehensive foundation”, Prentice Hall of India, New Delhi, Second Edition

2003.6. Limin Fu, “Neural Networks in Computer Intelligence” Tata McGraw Hill Publishing Company, New Delhi, 2006.

09NN27/09NE31 EVOLUTIONARY COMPUTATION  3 0 0 3 

 INTRODUCTION TO EVOLUTIONARY COMPUTATION: Biological and Artificial evolution - Evolutionary computation and AI - Different historical branches of EC-GAs- EP- ES- GP - A simple evolutionary algorithm. (7)

SEARCH AND SELECTION OPERATORS: Recombination/Crossover for strings- One-point- multi-point-uniform crossover operators - Mutation for strings- Bit flipping - Recombination/Crossover and mutation rates - Recombination for real-valued representations- Fitness proportional selection and fitness scaling – Ranking methods – Tournament selection. (10)

EVOLUTIONARY COMBINATORIAL OPTIMIZATION: TSP - Evolutionary algorithms for TSPs – Hybrid evolutionary and local search algorithms. (6)

THEORETICAL ANALYSIS OF EVOLUTIONARY ALGORITHMS: Schema theorems - Convergence of EAs - Computational time complexity of EAs - No free lunch theorem. (6)

CONSTRAINT HANDLING: Common techniques- penalty methods- repair methods - Analysis -Some examples. (7)

MULTIOBJECTIVE EVOLUTIONARY OPTIMIZATION: Pareto optimality – Multi objective evolutionary algorithms. (6)  

   Total 42REFERENCES:1. Goldberg and David E, “Genetic Algorithms in Search. Optimization and Machine learning”, Pearson Education, New

Delhi, 2007.2. Kalyamoy Deb, “Multiobjective Optimization using Evolutionary Algorithms”, John Wiley & Sons, USA,  2003. 3. Koza, John, Wolfgang Banzhaf, Kumar Chellapilla, Kalyanmoy Deb, Marco Dorigo, David Fogel, Max Garzon, David

Goldberg, Hitoshi Iba and Rick Riolo(Eds), “Genetic  Programming”, Academic  Press Morgan Kaufmann, USA, 1998.4. John R Koza, Forrest H Bennett III, David Andre, Martin A Keane, “Genetic Programming III:Darwinian Invention and

Problem Solving” Morgan Kaufmann, USA, 1999. 

09NN28/09NE29 GRID COMPUTING

3 0 0 3

INTRODUCTION: High Performance Computing, Cluster Computing, Meta-computing, Peer-to-Peer Computing, Internet Computing, Grid Computing – Types of grids - The Grid: Past, Present, Future - A New Infrastructure for 21st Century Science, Grid Applications. (6) GRID COMPUTING TECHNOLOGY: The Evolution of the Grid - Desktop Grids - Cluster Grids – HPC Grids – Computational and Data Grids. (6) THE ANATOMY OF THE GRID: Virtual organizations, Grid architecture and its Relationship to other distributed technologies – autonomic computing – service on demand – SOA and the Grid – semantic grids - Service virtualization – Infrastructure and applications. (9) THE OPEN GRID SERVICES ARCHITECTURE & INFRASTRUCTURE: Evolution to OGSA, Physiology of the Grid: OGSA Infrastructure - OGSA Basic Services, Creating and Managing Grid Services, Managing Grid Environments - Grid-

349

Enabling software applications, Grid-Enabling network services, Grid Security, Grid Resource Management and Scheduling - High-level Introduction to OGSI, Technical details of OGSI specification. (12)

APPLICATION CASE STUDY: Globus Toolkit – Architecture, Programming model, Sample Implementation, High Level Services – Study of a cloud computing infrastructure. (9)

Total 42REFERENCES:1. Ahmar Abbas, “Grid Computing Practical Guide to Technology and Applications”, Firewall Media, New Delhi, 2008.2. Ian Foster, Carl Kesselman, “The Grid : Blueprint for a New Computing Infrastructure”, Morgan Kaufman, New Delhi,

2006.3. Fran Berman, Geoffrey Fox, Anthony Hey J G, “Grid Computing Making the Global Infrastructure a Reality”, Wiley,

USA, 2003.4. Joshy Joseph, Craig Fallenstein, “Grid Computing”, Pearson Education, New Delhi, 2004.5. Prabhu C S R, “Grid and Cluster Computing”, PHI Pvt Ltd, New Delhi, 2008.6. Janakiraman, “Grid Computing-Models, A Research Monograph”, Tata Mc Graw Hill, 2005.

09NN29 PERVASIVE COMPUTING                                                                                                                      3 0 0 3

CONTEXT-AWARE COMPUTING: Ubiquitous/Pervasive Computing – Context - Types of context-Context aware computing and applications - Middleware support. (6)

INTRODUCTION TO MOBILE MIDDLEWARE: Mobile middleware - The spectrum of adaptation-Resource monitoring - Characterizing adaptation strategies - Mobile agents -Agent architectures - Migration strategies - Communication strategies. (8)

SERVICE DISCOVERY MIDDLEWARE: Common ground – Services - Universally unique identifiers - Standardization - Textual Descriptions - Interfaces for standardization - Discovery and advertisement Protocols - Unicast discovery - Multicast discovery - Service catalogs - Garbage collection – Eventing – Security - Interoperability. (8)

INTRODUCTION TO ADHOC AND SENSOR NETWORKS: Overview - Properties of an Adhoc network – Unique features of sensor networks-Proposed applications - Challenges – Constrained resources – Security – Mobility – Protocols – Auto configuration - Energy efficient communication - Mobility requirements. (8)

APPROACHES AND SOLUTIONS: Deployment and configuration – Routing - Fault tolerance and reliability - Energy efficiency. (5)

PDA IN PERVASIVE COMPUTING: Introduction - PDA software components – Standards - Emerging trends - PDA device characteristics - PDA based access architecture – User interface issues – Architecture - Smart card based authentication mechanisms - Wearable Computing Architecture. (7)

                                                                                            Total 42REFERENCES:1.     Frank Adelstein, Sandeep K S Gupta, Golden G Richard, Loren Schwiebert, “Fundamentals of Mobile and Pervasive

Computing”, Tata Mc Graw Hill , New Delhi, 2005.2. Jochen Burkhardt, Horst Henn, Stefan Hepper, Thomas Schaec,  Klaus Rindtorff,  “Pervasive Computing Technology

and Architecture of Mobile Internet Applications”, Addison Wesley, New Delhi, 2002.3.     Uwe Hansman, Lothat Merk, Martin S Nicklous, Thomas Stober, “Pervasive Computing - Handbook”, Springer-

Verlag, New Delhi,  2003.4.     Uwe Hansman, Lothat Merk, Martin S Nicklous, Thomas Stober, “Principles of Mobile Computing”, Springer-

Verlag, New Delhi, 2003.

09NN30/09NE22 MOBILE COMMUNICATION 3 0 0 3

INTRODUCTION: Introduction to Mobile Computing, Mobile Computing Architecture, Cellular Mobile Wireless Networks: Systems and Design Fundamentals, Propagation Models, Description of cellular system, Propagation Models for Wireless Networks, Overview 1G, 2G, 2.5G, 3G and 4G technologies. (7)

WIRELESS ARCHITECTURES: Global System for Mobile Communication (GSM): System architecture,

Radio interface, Protocols, Localization and calling, Handover, Security GPRS: GPRS System Architecture and Protocol layers. Introduction to EDGE. Emerging wireless networks: Ultra wide band(UWB)- Free space optics(FSO)-Mobile ad-hoc network(MANET)-Wireless sensor networks-OFDM and Flash OFDM.

(9)

350

WIRELESS MAC: Infrared vs. Radio transmission, Infrastructure and Ad hoc Networks, IEEE 802.11 WLAN: System architecture, Physical layer, Medium access control layer, MAC management HIPERLAN: Protocol architecture, Physical layer, Channel access control. Sub layer, Medium access control Sub layer, Information bases And Networking; BLUETOOTH: User scenarios, Physical layer, MAC layer, Networking. Security, Link Management.                (9)

MOBILE NETWORK LAYER: Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation, Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc .networks: Routing Destination sequence distance vector, Dynamic source routing, Hierarchical algorithms, and Alternative metrics.   (9)

MOBILE DATA BASE MANAGEMENT: Data Caching, Transaction Models, Query processing, Data recovery process, Issues relating to quality of service. WIRELESS INTERNET - Web services and mobile web services-Wireless middleware-wireless gateway and mobile application servers-Wireless Access Protocol(WAP)-WAP protocol layers. (8)

Total 42

REFERENCES:                                                                                                             1. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007. 2.  Jochen Schiller, “Mobile Communications”, Pearson Education Limited, 2003.3. Asoke Talukder, Roopa Yavagal, “Mobile Computing”, Tata Mc-Graw Hill, 2006. 4. Amjad Umar, “Mobile Computing and Wireless Communications”, NGE Solutions, 2004. 5. William C Y Lee,“Mobile Communication Engineering”, Tata Mc-Graw Hill, 2008.

09NN31/09NE33 AGENT BASED INTELLIGENT SYSTEMS 3 0 0 3

INTRODUCTION: Basic Definitions- History – Intelligent Agents – Agents and Environments – Structure of Agents. (4) PROBLEM SOLVING AGENTS: Searching for Solutions – Uninformed Search Strategies – Informed Search strategies – online search agents and unknown environments – Constraint satisfaction problems. (8)

KNOWLEDGE BASED AGENTS: Knowledge representation - logic – proposition – Inference – First order logic – Inference in FOL - Algorithms – knowledge representation Issues. (8)

PLANNING & PROBABLISTIC AGENTS: The planning problem – partial order planning – conditional planning – multi agent planning – uncertainty and probabilistic reasoning. (8)

LEARNING AGENTS: learning from observations – learning decision trees – statistical learning methods – instance based learning – neural network techniques for learning. (10) ADVANCED TOPICS: Introduction to communicative agents – probabilistic agents – perception and robotics – AI future. (4)

(4)

Total 42REFERENCES:1. Stuart Russel, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Second edition, Pearson Education, 2006.2. Padhy N P, “Artificial Intelligence and Intelligent Systems”, Oxford University Press, New Delhi, 2005.3. Nils J Nilsson, “Artificial Intelligence – A New Synthesis”, Morgan Kaufmann, New Delhi, 2007.4. George F Luger, “Artificial Intelligence – Structures and Strategies for Complex Problem Solving”, Pearson

Education, New Delhi, 2004.

09NN32 INFORMATION STORAGE MANAGEMENT 3 0 0 3

INTRODUCTION TO STORAGE TECHNOLOGY: Concepts of storage networking -Business applications defined for Storage - Sources of Data and states of data creation - Data center requirements and evolution - Managing complexity - I/O - Storage infrastructure - Evolution of storage - Information lifecycle management. (8)

STORAGE SYSTEMS ARCHITECTURE: Storage architectures- Device overviews- Peripheral connectivity- Components and concepts- Magnetic disk storage- Disk systems –Disk arrays- RAID storage arrays- Magnetic tape storage- Physical

351

vs. Logical disk organization- Caching properties and algorithms connectivity options- Differences in bus and network architectures. (8) INTRODUCTION TO NETWORK STORAGE: Putting storage on the Network- The NAS Hardware- Software architecture- Network connectivity- NAS as a Storage system- NAS connectivity options- Connectivity protocols- Management principles- Storage Area Networks: Architecture- Hardware devices- Host bus adaptors- Connectivity- Content Addressable Storage (CAS) : Elements- Connectivity options- Standards and Management principles- Hybrid storage solutions overview. (10) INTRODUCTION TO INFORMATION AVAILABILITY: Business continuity and disaster recovery basics: Local business continuity techniques- Remote business continuity techniques- Storage design and implementation of the Business continuity plan- Managing availability- Disaster recovery principles & techniques. (8)

MANAGING AND STORAGE VIRTUALIZATION: Managing Availability: Availability metrics implementing the plan finding the holes maintaining serviceability capacity planning- Management tools overview information security virtualization- Different virtualization technologies and processes including file and block level virtualization. (8)

Total 42REFERENCES:1. Robert Spalding, “Storage Networks: The Complete Reference” Tata McGraw Hill Publishing Company, Delhi, 2003.2. Gerald J Kowalski and Mark T Mayburk,” Information storage and Retrieval Systems”, Springer, New Delhi, 2006.3. Ulf Troppens, Rainer Erkens and Wolfgang Müller, “Storage Networks Explained” Wiley & Sons, USA, 2004.4. Marc Farley Osborne, “Building Storage Networks”, Tata McGraw Hill Publishing Company, New Delhi, 2000.

09NN33 EMBEDDED SYSTEMS3 0 0 3

INTRODUCTION: Challenges of Embedded Systems – Fundamental Components – Examples of Embedded Systems – Hardware Fundamentals – Gates – Timing Diagrams –Memory – Direct Memory Access – Buses – Interrupts – Schematics – Build Process of Embedded Systems.                                                            (8)

    MEMORY MANAGEMENT AND INTERRUPTS: Memory Access Procedure – Types of Memory – Memory Management Methods –  Pointer Related Issues – Polling Versus Interrupts – Types of Interrupts – Interrupt Latency – Reentrancy – Interrupt Priority – Programmable Interrupt Controllers – Interrupt Service Routines. (9)

                     REAL-TIME OPERATING SYSTEMS: Desktop Operating Systems Versus RTOS – Need for Board Support Packages – Task Management – Race Conditions – Priority Inversion – Scheduling – Inter Task Communication – Timers – Semaphores – Queues.                                  (8) DESIGN AND IMPLEMENTATION: Requirements of an Embedded System – Architecture Styles and Patterns – Design Practices – Implementation Aspects and Choices. Hardware and Software co-design. (8)

EMBEDDED SOFTWARE DEVELOPMENT TOOLS: Host and Target Machines – Cross Compilers – Linker and Locators for Embedded Software – Address Resolution – Locating Program Components – Initialized Data and Constant Strings – PROM Programmers – ROM Emulators –Flash Memory.                                              (9)

 Total 42REFERENCES:1. Sriram V Iyer, Pankaj Gupta, “Embedded Real-Time Systems Programming”, Tata McGraw Hill, New Delhi, 2007.2.   David E Simon, ”An Embedded Software Primer”, Pearson Education, New  Delhi, 2008.3. Frank Vahid and Tony Givargis, “Embedded System Design – A Unified Hardware/Software Introduction”, John Wiley

and Sons, New Delhi, 2005.4. Wayne Wolf, “Computer as Components: Principles of Embedded Computing System Design”, Morgan Kaufmann

Publishers Inc, New Delhi, 2006.5. Rajkamal , “Embedded Systems”, Tata McGraw Hill, New Delhi, 2008.

09NN34/09NE26 OPEN SOURCE SYSTEMS 3 0 0 3

INTRODUCTION: Open source system definition - Merits and demerits of open source software vs. closed source or proprietary software and freeware – software licensing and intellectual property rights. (6)

OPEN SOURCE OPERATING SYSTEMS: OpenSolaris, OpenDarwin, MINIX, Haiku, Linux – General overview – Kernel types - architectures - Supported file systems - networking technologies - Security features. (9)

OPEN SOURCE DATABASES: MySQL, PostgreSQL, MaxDB, Firebird, Ingres – general properties - SQL standard compliance - supported platforms - programming interfaces. (9)

352

OPEN SOURCE PROGRAMMING LANGUAGES: Perl, PHP, Python, Ruby – General features - Syntax and Style - Execution Environment - Programming in web environment – File handling and data storage. (9)

OPEN SOURCE TOOLS AND TECHNOLOGIES: Apache Web server, Mozilla Firefox, Wikipedia, Eclipse software development platform. (9)

Total 42

REFERENCES: 1. Chris DiBona, Mark Stone, Danese Cooper, “Open Sources 2.0, The Continuing Evolution”, O'Reilly Media, Inc.,

2008.2. Greg Kroab Hartman, “Linux Kernel in A Nutshell”, Shroff Publishers and Distributors, 2007. 3. Tim Converse, Joyce Park, Clark Morgan, “PHP 5 and MYSQL Bible”, Wiley Dream Tech, 2005.4. Wesley J Chun, “Core Phython Programming”, Second edition, Pearson Education Asia, 2007.5. James Lee, Brent Ware, “Open Source Development with LAMP: Using Linux, Apache, MySQL, Perl and PHP”,

Addison - Wesley Professional, 2008.

09NN35 SOFTWARE TESTING AND QUALITY ASSURANCE3 0 0 3

TESTING FUNDAMENTALS: Principles of testing – Test Plan – Test case development – Types of software Testing – Testing Object Oriented systems. (8)

TESTING STRATEGIES: White-box Testing – Statement coverage – Branch coverage – Mutation testing – Black-box Testing – Boundary value Analysis – Equivalence Partitioning – Levels of Testing – Unit, Integration and System Testing – Verification and Validation. (9)

TEST MANAGEMENT AND AUTOMATION: People and organizational issues – Organization structure for Testing teams – software test automation - scope of automation – Test automation tools – Generic requirement for test tool/framework – Selecting a test tool - Challenges in automation. (9)

 SOFTWARE QUALITY ASSURANCE: Software quality concepts – Cost of quality – Software Quality Assurance Group – Formal technical reviews – Quality standards. (8)

SOFTWARE QUALITY MANAGEMENT: Software Quality Metrics – Product Quality – Process Quality – Quality Management Models – Rayleigh Model – Problem Tracking Report Model – Reliability Growth Model – Case studies. (8)

 Total 42

REFERENCES:1. Gopalaswamy Ramesh, Srinivasan Desikan, “Software Testing: Principles and Practices”, Pearson Education, New

Delhi, 2007.2. Nina S Godbole “Software Quality Assurance: Principles and Practice”, Narosa Publishers, New Delhi, 2004. 3.   Stephen H Kan, “Metrics and Models in Software Quality Engineering”, Pearson Education, New Delhi, 2002.4.   Cem Kaner, Jack Falk, Hung Quoc Nguyen, “Testing Computer Software”, Comdex, New Delhi, 2002.5.    William E Perry, “Effective Methods for Software Testing”, Wiley, New York, 2007.

09NN36 DATA WAREHOUSING AND MINING                                                                                                                                 3 0 0 3

INTRODUCTION: Motivation – Data Mining Functionalities – Classification on data mining systems – Task Primitives – Major Issues - Data Preprocessing. (4)

    DATA WAREHOUSE AND OLAP: Data warehouse – Multidimensional data model – Data Warehouse architecture – OLAP Technology – Data Cube Computation. (8)

ASSOCIATION ANALYSIS: Basic Concepts – Frequent Item set mining methods - Types of association rules. (7)

CLASSIFICATION: Introduction – Statistics and Probability - Decision Tree Induction – Bayesian Classification – Classification by Back propagation – Rule Based Classification – Support Vector Machines. (9)

CLUSTER ANALYSIS: Partitioning methods – Hierarchical Methods – Density based methods - Neural Network Based Methods. (8)

353

ADVANCED TOPICS: Introduction to spatial data mining – Text Mining – Web Mining. (6)

                                                                                                                  Total 42REFERENCES:1. Jaiwei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Elsevier, 2006.2. Rajan Chattamvelli, “Data Mining Methods”, Narosa, 2009.3. Pang-Ning Tan, Michael Steinbach, "Introduction to Data Mining", Addision Wesley, 2006.4. Margaret Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education, New Delhi, 2007.5. Alex Berson, “Data Warehousing, Data Mining and OLAP,”Tata Mc Graw Hill , 2004.

09NN37 SOFTWARE ARCHITECTURE3 0 0 3

DESIGN PRINCIPLES: Programming review and introduction to software design – The Unified Modeling Language – Correctness and robustness of design – Flexibility, Reusability and Efficiency. (8)

DESIGN PATTERNS: Introduction to design Patterns – Creational Design Patterns – Structural Design Patterns – Behavioral Design Patterns. (10)

ENVISIONING ARCHITECTURE: Architecture Business Cycle – Overview of Architecture – Case study. (6)

CREATING AN ARCHITECTURE: Understanding Quality Attributes – Achieving Qualities – Architectural Design – Documenting Software Architecture – Reconstruction. (10)

ANALYZING ARCHITECTURES: Architecture Evaluation – Design Decision Making – Interoperability – Case study. (8)

Total 42REFERENCES:1. Eric Braude, “Software Design – from Programming to Architecture”, John Wiley & Sons, Inc, 2005.2. Len Bass, Paul Clements, “Software Architecture in Practice”, Pearson Education, 2006.

SEMINAR

09NN41 INDUSTRIAL VISIT AND TECHNICAL SEMINAR1 0 2 2

The student will make atleast two technical presentations on current topics related to the specialization. The same will be assessed by a committee appointed by the department. The students are expected to submit a report at the end of the semester covering the various aspects of his/her presentation together with the observation in industry visits. A quiz covering the above will be held at the end of the semester.

PRACTICALS09NN51 DATA STRUCTURES LABORATORY

0 0 3 2 Students will be assigned with an application that employs the use of data structures in problem solving. Typical applications include;

1. Solving Maze Problem – Stack.2. Traffic Signal Simulation – Queue.3. Sparse Matrix Manipulation – Linked Lists.4. Creating Optimal Binary Search Trees – Trees.5. PERT – Graph.6. Dictionary Application – Hashing.7. Simulation of various sorting techniques.

09NN52 RDBMS LABORATORY0 0 3 2

1. Implementation of DDL and DML queries in SQL.2. Create an Employee database to set various constraints.

354

3. Impose restrictions on queries for security reasons.4. Use Rollback, Commit, save point, Grant and Revoke commands.5. Developing applications effectively using RDBMS concepts.

09NN53 DISTRIBUTED COMPUTING LABORATORY  0 0 3 2

1. Developing Distributed applications using CORBA. 2.   Programs in Distributed Object Technology such as COM, DCOM and RMI. 3. Application Development using J2EE. 4. Web Services Programming.5. Mini Project work supporting distributed programming concepts.

09NN54 SOFTWARE DEVELOPMENT LABORATORY  0 0 3 2

Analysis ,Design and Implementation of Software system involving an application domain.

Sample systems are:

1. Core Banking2.   Health Care System 3. e-learning. 4. e-Commerce.5. Enterprise Resource Planning Modules6. Management Information System

355