You are on page 1of 21

Syllabi of M.E.

Computer Science & Engineering
First Semester Code No. 07ZC01 07ZC02 07ZC03 07ZC04 07ZC05 07ZC06 07ZC11 07ZC12 Course Mathematical Foundations of Computer Science Data Structures and Algorithms Software Engineering Methodologies Computer Architecture Operating Systems Principles of Compiler Design Data Structures and Algorithms Laboratory Operating Systems and Compiler Laboratory Total L 4 4 4 4 4 4 0 0 24 T 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 6 C 4 4 4 4 4 4 2 2 28

Second Semester Code No. 07ZC07 07ZC08 07ZC09 Course Advanced Database Technology Network Engineering and Management Object Oriented System Design Elective Elective Elective 07ZC13 07ZC14 Database Technology Laboratory Technical Seminar Total L 4 4 4 4 4 4 0 0 24 T 0 0 0 0 0 0 0 0 0 P 0 0 0 0 0 0 3 3 6 C 4 4 4 4 4 4 2 2 28

Third Semester Code No. Elective Elective Elective 07ZC15 07ZC16 Industrial Training Project Phase - I Total Course L 4 4 4 -0 12 T 0 0 0 -0 0 P 0 0 0 -12 12 C 4 4 4 2 6 20

Fourth Semester Code No. 07ZC17 Project Phase – II Total Course L 0 0 T 0 0 P 24 24 C 12 12

List of Electives 07ZC21 07ZC22 07ZC23 07ZC24 07ZC25 07ZC26 07ZC27 07ZC28 07ZC29 07ZC30 07ZC31 07ZC32 07ZC33 07ZC34 Theory of Computation Web Technology Soft Computing Mobile Computing Distributed Computing Multimedia Systems XML and Web Services Grid Computing Network Security Digital Imaging Software Quality Assurance Ad hoc Networks Data Warehousing and Data Mining Agent Based Intelligent Systems


Operations on sets . Fourth Edition.Formal Languages – Classes of Grammars – Type_0 – Context Sensitive – Context Free – Regular Grammars – Ambiguity.. 10 Hours Unit II Priority Queue and Search Trees Priority Queues . Geetha P. and Manohar R.Principle of inclusion and exclusion Minsets.deterministic finite state machines – Turing Machines . Sridharan N.Equivalence relations. Pearson Education Asia. Chennai.Permutations and Combinations .Binary Search Tree .. 2003.Conditional Probability – Independence .Partial orderings . Venkataraman M.Relationships between sets . 10 Hours Unit III Combinatorics Basics of counting – Counting arguments – Pigeonhole principle .Tree – General . “Discrete Mathematics”.Set identities .List – Arrays – Cursors – Pointers -Implementation and Applications .P.Splay Tree . 2002.Recursion and Recurrence relations – Generating functions. 07ZC02 DATA STRUCTURES AND ALGORITHMS 4004 Unit I Basic Data Structures Modeling of problem solving – ADT . “Discrete Mathematics”. Tata McGraw Hill Publications Co. Ltd..Complexity Analysis.07ZC01 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 4 0 0 4 Unit I Fundamental Structures Set theory . 3..Implementations . 10 Hours Unit II Logic Propositional logic – Logical connectives – Truth tables – Normal forms (conjunctive and disjunctive) .Bayes’ theorem Mathematical expectation. Relations: – Binary relations ..Universal and existential quantifiers .B-Trees – Red Black Tree – Applications – Implementation – Tree Traversals. “Discrete and Combinatorial Mathematics: An Applied Introduction”. K.Probability distributions . “Discrete Mathematical Structures with Applications to Computer Science”. 2.. and Chandrasekaran N.Binary Tree . The National Publishing Company. References: 1. Functions: – Properties of functions Composition of functions – Inverse functions . Ralph P Girmaldi. Scitech Publications. 10 Hours Total: 50 Hours Textbook: Trembly J.Proof techniques – Direct and indirect – Proof by contradiction – Mathematical Induction.Predicate logic . Delhi. 10 Hours Unit IV Modeling Computation and Languages Finite state machines – Deterministic and Non. 10 Hours Unit V Discrete Probability Finite probability .Expression Search Tree – AVL Tree .Permutation functions.Internal and External Sorting . 10 Hours 2 . New Delhi 2003.

Product Metrics.Class-Based Modeling – Creating a Behavioral Model.Garbage Collection Algorithms for Equal Sized Blocks .Travelling Salesman Problem –Graph Coloring. 2000.Managing Equal Sized Blocks . 10 Hours Unit IV Design Techniques Divide and Conquer .Algorithm for Kruskal’s and Prims for finding minimum cost of Spanning Tree .Analysis – Analysis Modeling Approaches – Data Modeling Concepts – Object Oriented Analysis – Scenario – Based Modeling – Flow. 10 Hours Unit V Memory Management Issues . Ullman. Hopcroft. Thomas. 2002.Buddy Systems . “Data Structures and Algorithms”. “Data Structures and Algorithm Analysis in C++”.Strongly Connected Components.Floyd – Warshall algorithm for all pair Shortest Path.H. “Introduction to Algorithms”. 3. 10 Hours Total: 50 Hours Textbook: Mark Allen Weiss. 10 Hours Unit III Design and Testing Design Engineering – Concepts – Model – Pattern Based Software Design – Creating an Architectural Design – Software Architecture – Data Design – Architectural styles and patterns . McGraw Hill Publishers.Level Design Performing User Interface Design –Testing Strategies – Testing Tactics .Dynamic Programming . 2002. 07ZC03 SOFTWARE ENGINEERING METHODOLOGIES 4004 Unit I Introduction Introduction – A generic view of process – A Layered Technology – Personal and Team Process Models – The Waterfall Model – Incremental Process Models – Evolutionary Process Models – Specialized Process Models – The Unified Process – An Agile View of Process. Pearson Education. 10 Hours Unit II Requirements and Analysis modeling The System Engineering –Business Process Engineering : An Over View – Product Engineering : An Over View – System Modeling – Requirements Engineering .Greedy Algorithm – Backtracking – Queens Problem – Branch and Bound: Knapsack . References: 1. 2. The MIT Press.Modeling Component .Oriented Modeling .Dijkstra’s and Bellman Fort Algorithm for finding single source Shortest Path . Aho. 10 Hours Unit IV Project Management WEB Engineering – Initiating A WebApp Project – Project Management – Metrics for Process and Project Estimation – Project Scheduling – Risk Management . Pearson Education.Storage Allocation for Objects with Mixed Sizes .Storage Compaction. “Data Structures and Application in C++”. 10 Hours 3 .Cormen.Software Engineering Practice – Communication Practices – Planning Practices – Modeling Practices – Construction Practice – Deployment.Unit III Graph Algorithms Representation of Graphs – BFS – DFS .Tasks – Initiating – Eliciting – Developing Use Cases – Building The Analysis Model – Negotiating – Validating . 2001. Sartaj Sahni.

4 ." Computer Architecture: A Quantitative Approach". 10 Hours Unit II Instruction Level Parallelism Concepts and challenges – overcoming data hazards with dynamic scheduling – examples. 10 Hours Unit V Multiprocessors and Thread Level Parallelism Symmetric shared memory architectures-performance of symmetric shared memory multiprocessors – Distributed shared memory architectures-synchronization.reducing branch costs with dynamic hardware prediction.Quantitative principles of computer design-Instruction set principles and examples. Springer Verlag.” Software Engineering”.Analysis and Design for Reuse – Reengineering – Business Process Reengineering – Software Reengineering – Reverse engineering – Forward Engineering. Sixth Edition. Pankaj Jalote. 1997. Third Edition. Fairely. 2003. 2000.Hardware support. 10 Hours Unit IV Memory Hierarchy Design Introduction. 10 Hours Unit III ILP with Software Approaches Basic compiler techniques for exposing systems – types of storage devices. 10 Hours Total: 50 Hours Textbook: Roger S. Hennessey and David A. “Software Engineering Concepts”. McGraw Hill. 1996 07ZC04 COMPUTER ARCHITECTURE 4004 Unit I Fundamentals of Computer Design Introduction-measuring and reporting performance. McGraw Hill. James F Peters and Witold Pedryez. “Software Engineering – An Engineering Approach”.cache performance. 2005.static branch prediction.high performance instruction delivery. 3.classifying instructions.set architectures-memory addressing-addressing modes for signal processing-type and size of operands. Pressman. 2.Formal Methods –The Clean room Approach – Functional Specification – Component-Based Development .“An Integrated Approach to Software Engineering”.static multiple issues: VLIW approachAdvanced compiler support for exposing and exploiting ILP. New Delhi. fifth Edition: Addison Wesley. 1995 4.reducing cache miss penalty.reducing miss rate. 10 Hours Total: 50 Hours Textbook: John L.. Patterson.taking advantages of ILP with multiple issues limitations of of caches. “Software Engineering: A Practitioner’s Approach “.Unit V Quality and Reusability Quality Management – Change Management .miss rate via parallelism –reducing hit time – main memory and organizations for improving performance. References: 1. John Wiley and Sons. Sommerville J. Morgan Kaufmann.memory technologyvirtual memory.

Galvin.File Concepts .Case Study: Memory management in Linux.Concurrency Control .Naming and Transparency . 1999. 10 Hours Unit V Distributed systems Topology . Gagne.Case Study: Network management and security in Linux. Sima. T.File Sharing – File Protection.Design issues . 2003 References: 1. Tata Mcgraw Hill. 2000. Fountain and P. 2.Event Ordering Mutual Exclusion – Atomicity . Godbole and Kahate Atul. Tata McGraw Hill Edition.Disk Structure – Disk Scheduling – Disk management – Swap Space Management – RAID Structure. Briggs “Advanced Computer Architecture: Parallelism. 10 Hours Unit II Process Synchronization and Deadlock The Critical Section Problem – Synchronization Hardware . “Advanced Computer Architectures: A Design Space Approach”. Kai Hwang and Faye A. 10 Hours Total: 50 Hours Textbook: Silberschatz. Addison Wesley. Sixth Edition.Swapping . Prentice Hall of India .Segmentation – Segmentation with paging . Prentice Hall of India 1998.Contiguous Memory Allocation .CPU scheduling Algorithms – Multiple-processor Scheduling – Real Time Scheduling . “Operating System Concepts”.Case Study: Process model and management in Linux. Charles Crowley.Threads . 2003. Programmability”. 5 .Case Study: I/O management in Linux. Achut S.Election Algorithms – Protection and Security .Virtual Memory: Demand paging .Operating Systems Structures – Process management – operating system services – system calls – virtual machines – Processes – Process scheduling – Interprocess communication .Deadlock Prevention – Avoidance Detection – Recovery . IEEE computer Society Press.Stateful versus Stateless service – Distributed Coordination . “Operating systems: A Design Oriented Approach”. 10 Hours Unit III Storage management Memory management . Andrew S. 07ZC05 OPERATING SYSTEMS 4 0 0 4 Unit I Introduction Introduction to operating systems – Operating systems and services – Hardware Protection .Remote File Access . “Operating Systems & Systems Programming”. D. 4.Deadlock Handling . “Modern Operating Systems”.Free Space Management – Recovery – I/O systems – I/O Hardware –Application I/O interface – Kernel I/O subsystem – Mass storage structure .Semaphores – classical problem of Synchronization – critical regions – Monitors – Deadlock .Network types – Communication protocols . 2. 10 Hours Unit IV File System Implementation File System Structure and Implementation – Directory Implementation – Allocation methods .Page Replacement – Thrashing . Pradeep K. “Distributed OS concepts and Design”.Paging .Access methods Directory Structure . Tata McGraw Hill. Scalability. Kacsuk. 2001.Algorithm Evaluation.Methods for handling Deadlocks .Sinha. 2nd Edition 2001 3.File System Mounting .References: 1.Distributed file systems . Tanenbaum .

Top-down parsing . Implementation of Binary Search trees.Run-time storage management . 07ZC11 DATA STRUCTURES AND ALGORITHMS LABORATORY 0 0 3 2 1.Assignment statements .. Holub. 2003. 5. 4.Declarations .V. 10 Hours Unit II Finite Automata and Lexical Analysis Finite automata .Basic blocks and flow graphs .Next-use information . Prentice Hall of India.Lexical analysis .LEX -Implementation of lexical analyzer using LEX.A Simple code generator .Intermediate code generation .Optimization of basic blocks .Syntax-direct definitions . 10 Hours Unit IV Syntax Directed Translation and Intermediate Code Generation Introduction to syntax-directed translation . “Compiler Design in C”. “Compiler Construction Principles and Practice”. 8. 10 Hours Unit III Syntax Analysis Role of a parser . Techniques and Tools”.Register allocation and assignment .Bottom-up parsing . Implementation of Singly. 10. Implementation of Depth First Search Techniques. Implementation of Kruskal’s Algorithm Implementation of Searching Techniques Implementation of Sorting Techniques 6 . 2. Addison. Allen I. Implementation of AVL Rotations.The principal sources of optimization . Vikas publishing House. Implementation of Circular Queue.Analysis of source program .Specification and recognition of tokens. 2. 9. Implementation of Prim’s Algorithm.Introduction to optimization techniques . 12.Intermediate languages . References: 1. Implementation of Breadth First Search Techniques.Implementation of parser using YACC.YACC . 1988. Doubly and Circular linked list. 10 Hours Total: 50 Hours Textbook: Aho A. 7..Basic concepts of compiler .Phases of compiler . Implementation of Dijkstra’s Algorithm.Construction of syntax tree . 11.Introduction to global data-flow analysis.Optimization of DFA-Based pattern matchers Introduction to language for specifying lexical analyzer . 3. 6.Peephole optimization .Regular expression to finite automation . “Compilers .Case statements.LR parser .Principles.Loops in flow graphs . Ravi Sethi.Compilerconstructions tools .D. Implementation of Multistack in a Single Array.Wesley. 10 Hours Unit V Code Generation and Optimization Issues in the design of a code generator .Introduction to language for specifying parser .Louden. Kennath C.Role of the lexical analyzer .Target machine .The DAG representation of basic blocks . Ullman J.07ZC06 PRINCIPLES OF COMPILER DESIGN 4004 Unit 1 Introduction to Compiler Introduction of compiling .Boolean expressions .Input buffering . 2001.Context-free grammars .

Data mining concepts. 2003 2. Implement Banker’s algorithm. Implement the following operation with a grammar a) Removal of left recursion. 4th Edition. Pearson Education.Database systems . 9.J. “Database management systems”. Ramakrishnan R and Gehrke J.Data Dictionary Database Administration and control. 11. References: 1. 7th Edition. “Database System Concepts”.Codd's rules.Embedded SQL. Implement Best fit.Domains and key concept .07ZC12 OPERATING SYSTEMS AND COMPLIER LABORATORY 0 0 3 2 1. “An Introduction to Database system”. 2003 7 . Implement the CPU Scheduling Algorithms. Implement Memory Allocation with Pages. c) Finding First and Follow of non terminals. Implement of lexical analyzer using lex tool.Relational Databases. McGraw Hill. 07ZC07 ADVANCED DATABASE TECHNOLOGY 4004 Unit I Relational Database Concepts File systems . 5. Implementation Shift reduce parser.Object relational database-Distributed database-Parallel databases. 10 Hours Total: 50 Hours Textbooks: 1..Data models . Pearson Education.Database security and Authorization. Ramez Elmasri. F. 2002. Henry. Generation of intermediate code. 10 Hours Unit II Relational Database Design Functional dependencies and Normalization for Relational Databases. 10. Korth. 10 Hours Unit III Database System Design Query processing-Query optimization-Transaction processing-Concurrency control techniques-Database Recovery schemes. Navathe. 2. 2004. S. 10 Hours Unit IV Advanced Databases Object-oriented database.Database system concepts and architecture .Sudharsan. Implementation of predictive parser. 3. Construction of NFA for a regular expression. First Fit Algorithm for Memory Management. 10 Hours Unit V Recent Trends in Database XML & Internet databases. 5th Edition. 6. 4. 7. “Fundamentals of Database Systems”. Abraham Silberschatz. Implement FIFO & LRU page Replacement Algorithm. Tata McGraw Hill. Date C. 8. 2.Data warehousing and OLAP-Mobile databases-Multimedia databases-Temporal databases.Integrity rulesRelational Algebra – Relational calculus-SQL. b) Left factoring. Shamkant B.Relational database design algorithms and further dependencies-Practical database design methodology and use of UML diagrams-Disk storage-Basic file structures-Hashing-Indexing structures for files.

. William Stallings. 6th Edition. 10 Hours Unit II Network Layer The channel allocation problem – Multiple Access protocols – Ethernet – Wireless LANS – Broadband wireless – Bluetooth – Data link layer switching – Network layer design issues – Routing algorithm .Layering and protocols – Comparison of OSI and TCP/IP Reference Models – Guided Transmission Media – Wireless Transmission – The mobile telephone system – Data link layer design issues – Error Detection and correction – stop and wait – Sliding window protocols .go back-n ARQ – selective repeat ARQ . 10 Hours Unit III Transport Layer The Transport layer service – Elements of Transport protocols – A Simple Transport protocol – UDP –TCP – Performance issues . Prentice Hall of India.Elements of Notation – Class diagrams – State transition diagrams Object Diagrams.HTTP – Multimedia.. Mani Subramanian. Addison Wesley. “Computer Networking –A top –down approach featuring the internet”.Interaction Diagrams . and Ross K. 2000.Congestion Control – Quality of services – Internetworking – The Network layer in the Internet.Traditional Applications – DNS – Electronic mail – WWW . Andrew S.Introduction to Cryptography – Symmetric-Key Algorithms – Public–Key Algorithm – Digital Signatures – communication security – Authentication protocols – E-Mail security – Web Security. 07ZC09 OBJECT ORIENTED ANALYSIS AND DESIGN 4004 Unit I The Object Model The structure of complex systems – the models of object-oriented development – Major and Minor elements in object model – Classes and Objects – Relationships among classes and objects – Building classes and objects. 4. 2. 10 Hours Total: 50 Hours Textbooks: 1. “SNMP. 10 Hours Unit IV Network Security Network security . Fourth Edition. 2002. 10 Hours Unit II Methodology Importance of classification .F. 2002 2.Applying notation. Addison Wesley. William Stallings.W. “Computer Networks”. Second Edition. Addison Wesley. 10 Hours Unit V Network Management Introduction – Network Monitoring – Network Control – SNMPVI Network Management Concepts – Information – Standard MIBS. 3.Davie. Larry L.Module Diagrams-Process Diagrams.Peterson and Brule S. 2003. References: 1. “Network Management: Principles and Practice”. SNMP V2. “Computer Networks – A System Approach” MarGankangmann – Harcourt Asia.Key abstractions . RMON 1 and 2”. “Data & Computer Communication”. 10 Hours 8 . 3rd Edition. Kurose J. 6th Indian reprint 2002. SNMPV3. Pearson Education. 2001.07ZC08 NETWORK ENGINEERING AND MANAGEMENT 4 0 0 4 Unit I Introduction to Networking Methodologies Uses of computer network – Network Hardware and Software . Tanenbaum.

Addison Wesley.Shaler/Mellor . Packages. Ivar Jacobson. • Development of deployment diagrams • Development of prototypes and validation 10 Hours Total: 50 Hours Textbook: James Rumbaugh. 10. Blaha M. Working with Exception handling in PL/SQL. Function. Working with DDL. 11. 9 . Grady Booch. Design and implementation of an application like payroll processing. library information system etc using PL/SQL. 3. Eddy F. 8.Coad/Yourdon – Rumbaugh . 2. DCL of SQL commands. 7. design patterns and frameworks. High level language extension with triggers. Premerlani W.Booch .UML. “Object Oriented Analysis and Design with Applications”. 2004. Pearson Education. 4. “The UML Reference Manual”. 2002. banking system. Addison Wesley Publication Company. “Object Oriented Analysis And Design”. 1999. 2002. Library Management. High level language extension with cursors. Embedded SQL. Procedures. Working with PL/SQL blocks. Working with other database objects: Synonyms. TCL. • Defining a draft plan • Creation of Preliminary investigation report • Definition of requirements • Record terms in Glossary • Design of Use case Diagrams • Identification of potential Objects and Classes • Identification of associations and operations • Development of class diagrams. 07ZC13 DATABASE TECHNOLOGY LAB 0032 1. DML. Sequences. References: 1.Unit III Object Oriented Analysis Overview. James Rumbaugh. Lorenson W. Working with Locks and Partitions. Views and Indexes. 12. Working with Single-row functions and group functions in SQL. 3.UML Meta model. Ali Bahrami. Grady Booch. Mc Graw Hill International Edition. 2. Inventory Management. 9. 10 Hours Unit V Managing Object Oriented Development Managing Analysis and Design – Evaluation Testing – Coding – Maintenance – Metrics Applications Case study of some systems like ATM. 5. “Object Oriented System Development”. 6. activity diagrams and state chart diagrams. Working with Joins and Integrity constraints. Cruise Control system with sample project development activities with the following guidelines. 10 Hours Unit IV Unified Modeling Language Introduction – static and dynamic models – UML Diagrams – Class Diagrams – Use cases – UML Dynamic modeling.

Languages and Computation”.Chandrasekaran.Martin. 10 Hours Unit II Common Gateway Interface Common Gateway Interface: Programming CGI Scripts – HTML Forms – Custom Database Query Scripts – Server Side Includes – Server security issues – XML. Church Turing hypothesis.Closure properties of Regular languages. 10 Hours Unit III Java Programming Java fundamentals: Classes – Inheritance – Packages – Interfaces – Exceptions Handling – Multi threading – Applets 10 Hours 10 . Derivation and languages.Mishra. Simplification of context free grammars – Normal forms for context free grammars. Finite Automation with e-moves. and GNF. 2000 References: 1. 2nd Edition. 07ZC22 WEB TECHNOLOGY 4 0 0 4 Unit I Introduction Introduction – Network concepts – Web concepts – Internet addresses . 2001. Narosa Publishing House.Diagonalization Language . “An Introduction to formal languages and Automata”. Prentice Hall. 3. Narosa Publishers. Peter Linz.2nd Edition. “Introduction to languages and the Theory of Computation”. 4. Prentice Hall of India. 2002.Regular expressions and Regular languages –non deterministic and deterministic finite automata -Equivalence of DFA and NFA.Post's correspondence Problem. 1998. “Theory of Computation”. Papadimitriou.Scripting Languages: Javascript – Vbscript.P.Rice Theorem . John. “Elements of Theory of Computation”.1997 2. CNF. McGraw Hill. 10 Hours Unit III Push Down Automata (PDA) Acceptance by PDA. Relationship between derivation and derivation trees. 10 Hours Total: 50 Hours Textbook: Hopcroft and Ullman.L. 10 Hours Unit II Context Free Languages Context free languages. K. Lewis. Pushdown automata and Context free languages.C. Harry R. Pumping lemma for CFL. Deterministic pushdown automata – Equivalence of PDA’s and CFG’s – Closure properties of CFL. 10 Hours Unit V Unsolvable Problems Unsolvable problems – Halting problem. “Introduction to Automata. Programming techniques -Computable languages and functions. Christos H. EEE. 2nd Edition. equivalence of regular expression and NFA with e-moves – pumping lemma for regular sets. Recursive and recursively enumerable languages – class P and class NP. N.Retrieving Data with URL – HTML – DHTML: Cascading Style Sheets . Universal Turing machine – Random Access Turing machine. 10 Hours Unit IV Turing Machine Turing machine (Definition and examples).ELECTIVES 07ZC21 THEORY OF COMPUTATION 4 0 0 4 Unit I Finite Automata and Regular Languages Finite Automata and Regular languages .

Genetic Modeling Inheritance operators – Crossover .Fitness Function – Reproduction .Crisp Sets .Convergence of Genetic Algorithm – Applications .Inference by Fuzzy BP . Eric Ladd and Jim O’Donnell.Fuzzy Rule Based System . and JAVA1. 10 Hours 11 .Fuzzy Sets .Early Neural Network Architectures Back Propagation Networks .Learning in Fuzzy BP .Variations of Standard Propagation Algorithm.Working Principle – Encoding .Effect of Tuning Parameters of the BPN .Differences and similarities between GA and other traditional methods .Architecture of a back Propagation Network . 2004. Michael Erwin and Robert Nikes “USING CGI”.Genetic algorithm based BPN .Fundamentals of Genetic Algorithms .Basic Concepts . O’Reilly Publications.Creation of Offspring’s . 2000. “Java Network Programming”.Fuzzy Neuron .Unit IV Server Side Programming Server side Programming – Active server pages – Java server pages – Java Servlets: Servlet container – Exceptions – Sessions and Session Tracking – Using Servlet context – Dynamic Content Generation – Servlet Chaining and Communications.ART1 .Single Layer Artificial Neural Network Back propagation Learning – Applications . Schildt.Defuzzification Methods – Applications Fuzzy Back propagation Networks . “INTERNET and WORLD WIDE WEB – How to program”. 3rd Edition.LR-type Fuzzy numbers . D. 2.Exponential BAM –Applications .2”.Learning Methods . “USING HTML 4.Inversion and Deletion . Jeffy Dwight.Norton and H. Deitel and Neito.Applications. 2003.GA Based Weight Determination – Applications.Characteristics of Neural Networks .Taxonomy of Neural Network Architectures .Fuzzy Relations . Pearson education asia.Model of an Artificial Neuron . XML. “Java 2: The complete Reference”.Neural Network Architectures . Prentice Hall of India Publications.Generational Cycle . 3.Human Brain .Basic concepts of Neural networks .Fuzzy BP Architecture . 10 Hours Unit III Fuzzy Logic Fuzzy Set Theory .Real life problem . 4. Elliotte Rusty Herold. Tata McGraw Hill. 10 Hours Unit II Associate Memory Associative Memory – Autocorrelators – HeteroCorrelators .Fundamentals of Neural Networks .Fuzzy Logic .Predicate Logic .Genetic Algorithm History .Fuzzy versus Crisp .The Hopfield Memory .Multilevel Optimization . 10 Hours Unit V Applications Simple applications – Internet Commerce – Database connectivity – Online databases – EDI Applications in Business – Plug-ins – Firewalls 10 Hours Total: 50 Hours Textbook: Deitel.Advances in GA . 10 Hours Unit IV Genetic Algorithms Genetic Algorithms .Selection of various parameters in BPN .Fuzzy Systems Crisp Logic .Mutation operator .Crisp Relations. 1997 07ZC23 SOFT COMPUTING 4 0 0 4 Unit I Introduction to Neural Networks Introduction to Artificial intelligence Systems .Bitwise Operators . Prentice Hall of India publications.ART2 – Applications. 2001 References: 1.Adaptive Resonance Theory – Introduction .

Spread Spectrum . Pearson Education 2004. 10 Hours Unit V Middleware Programming Software – Java – Language Characteristics-Java Class Library-Java Edition –Micro Edition – Personal Java and Embedded Java – Development tools for Java. J. Fuzzy Logic. 2003. Davis E.Support for mobility .Telecommunication systems – GSM .Ross. and Vijayalakshmi Pai G.Soft Computing Tools . 1989. Fuzzy Logic and Genetic Algorithms –Simplified fuzzy ART map-Working of Simplified fuzzy ART map-Application-Recent trends.Jang.Smart tokens .Dynamic host configuration protocol .Reference model-functions .”Genetic Algorithms: Search.Problem Description of Optimum Design . References: 1.Windows CE – Palm OS – Symbian OS – Java 12 . Timothy J. TDMA.”Fuzzy Logic with Engineering Application “. McGraw Hill..Wireless transmission-frequencies for radio transmission – Signals – Antennas . 3.Smart Identification – Smart Cards-Smart Labels . FDMA.T.IEEE 802.Fuzzy Logic Controller – Applications.File systems .Signal propagation – Multiplexing – Modulation . Sivanandam S. C. Wiley India.FAM.Entertainment Systems – Television Systems . Prentice Hall India.Sun and E.Smart Appliances .Indirect TCP .ISBN-81-203-2186-3.Medium access control-SDMA.Fuzzy Constraints .Digital video broadcasting.Y.Appliances and Home Networking Automotive Computing .Selective retransmission .Operating Systems . 10 Hours Unit IV Pervasive Computing Pervasive Computing – Devices .DECT – TETRA .Game Consoles. 10 Hours Unit II Wireless LAN Wireless LAN .GA in Fuzzy Logic Controller Design .Single Association FAM .Broadcast systems .Smart Sensors and Actuators .World Wide Web . “Neuro-Fuzzy and Soft Computing”.Snooping TCP .Cellular systems .Embedded Controls .. and Genetic Algorithms Synthesis and Applications”.Mizutani. 4.Fast retransmit/ fast recovery .Fuzzy Associative Memories .Satellite systems-Applications – Basics – Routing – Localization – Handover .Transaction oriented TCP .Information Access Devices – Handheld Computer -Palm OS-Based Devices Windows CE-based Handheld Computer .. Deepa S.Mobile transport layer Traditional TCP .Fuzzy Logic Controlled Genetic Algorithms . CDMA – Comparison of S/T/F/CDMA . Prentice Hall India.FAM involving a Rule Base .Radio access layer – Handover .Goldberg.adhoc networks . An introduction .Infrastructure and adhoc networks . A.Fuzzy Hebb FAMs .Location Management – Addressing -Mobile quality of service . N. 10 Hours Unit III Mobile Network Layer Mobile network layer .Wireless ATM .11 – HIPERLAN – Bluetooth .FAM Rules with Multiple Antecedents/Consequents – Applications . 10 Hours Total: 50 Hours Textbook: Rajasekaran S.Mobile TCP . 07ZC24 MOBILE COMPUTING 4 0 0 4 Unit I Introduction .Cyclic repetition of data . 1977..Infrared Vs Radio transmission .Unit V Integration of Soft Computing Tools Hybrid Systems .Integration of Neural Networks .R.S. N.Digital audio broadcasting .EPOC based – Handheld Computer-Sub-Notebooks-Phones-Data transmission Capabilities-Smart Phones . “Neural Networks.Wireless Transmission Introduction .Screen Phones .Transmission/ timeout freezing .WATM services . “Introduction to Soft Computing with Matlab”.Mobile IP .UMTS – IMT 2000 . Optimization and Machine Learning” Addison Wesley. 2. N.Access point control protocol.Wireless application protocol.

X.Examples . 2003. Uwe Hansmann.Case Study .Nested Transactions .card – Client Middleware-Programming APIs-Smart Card Programming . 10 Hours Unit IV Operating System Issues – II Name Services -Domain Name System . 07ZC25 DISTRIBUTED COMPUTING 4 0 0 4 Unit I Introduction Characterization of Distributed Systems .Comparison Flat and Nested Distributed Transactions .Digital Signatures .Sun Network File System .Group Communication . “Principles of Mobile Computing”.Case Studies .Cryptography Pragmatics .Interactive Advertisements – Loyalty .Java RMI .Resource Sharing and the Web .Distributed Deadlocks .Shopping . Pearson Education.500 Directory Service .Travel And Business Services – Consumer Services .System Models Architectural and Fundamental Models .Types of Networks .Protection . John Wiley and Sons Inc. “Mobile Communication”. Springer International Edition.Home Services .Networking and Internetworking . 10 Hours Unit II Processes and Distributed Objects Interprocess Communication .Distributed Objects and Remote Invocation Communication Between Distributed Objects .The Andrew File System. Events and Process States . “Distributed Systems Concepts and Design”.Network Principles Internet Protocols .Secure Socket Layer – New Services .Timestamp Ordering .Directory and Discovery Services .Distributed Debugging . Jean Dollimore and Tim Kindberg.File Service Architecture .Remote Home Health Care Services . 2002 13 . Lothar Merk.Synchronizing Physical Clocks .Cryptographic Algorithms . Yi-Bing Lin and Imrich Chlamtac.Nicklous and Thomas Stober.Communication Services .Case Study.System View..Optimistic Concurrency Control . 10 Hours Unit III Operating System Issues – I The OS Layer . Second Edition. 2001. Pearson Education.Logical Time And Logical Clocks Global States . Martin S.Security Overview . 10 Hours Unit V Distributed Transaction Processing Transactions .Concurrency Control in Distributed Transactions .The API for the Internet Protocols .Global Name Service .Remote Procedure Call .Messaging Components – Database Components-Security .Security Services . “Wireless and Mobile Network Architecture”. 2000.Cryptographic Patterns and Methods . 2.Processes and Threads . 3rd Edition.Payments Services.Clocks.Locks .Atomic Commit Protocols .Overview of Replication And Distributed Multimedia Systems.Distributed Mutual Exclusion – Elections – Multicast Communication Related Problems. 10 Hours Total: 50 Hours Textbook: George Coulouris.Transaction Recovery .Communication and Invocation – OS Architecture . References: 1.Challenges .Events and Notifications .Cryptographic tools.Distributed File Systems .Case Studies. 10 Hours Total: 50 Hours Textbook: Jochen Schiller.External Data Representation and Marshalling Client-Server Communication .Home Automation – Energy Services .

2nd Edition. 1994 3.Software Design and Implementation”. 2001 07ZC26 MULTIMEDIA SYSTEMS 4 0 0 4 Unit I Introduction and QOS Introduction-QOS Requirements and Constraints-Concepts-Resources. 2004. Pearson Education.ATM Networks-MAN-WAN. 07ZC27 XML AND WEB SERVICES 4 0 0 4 Unit I Introduction Introduction to Internet and WWW –Introduction to HTML –CSS-Creating Markup with XML-Document Type Definition (DTD). 10 Hours 14 . 10 Hours Unit V Synchronization Synchronization in Multimedia Systems-Presentation-Synchronization Types-Multimedia Synchronization MethodsCase Studies-MHEG-MODE-ACME.Niranjan G Shivaratri. I Edition 2004. Tata McGraw Hill.L. “Distributes Systems. 3. 2. References: 1.M. 10 Hours Total: 50 Hours Textbook: Ralf Steinmetz and Klara Nahrstedt. Tata McGraw Hill Edition.. Springer. “Multimedia Applications Development Using DVI Technology”. 2002 5. Sape Mullender. 1992. “Multimedia Systems”.Pearson Education. 2. R. Standards. Ze-Nian Li and Mark S. “Multimedia Communication Systems: Techniques. “Advanced Concepts in Operating Systems”.. Andrew S Tanenbaum . Milovacovic. 10 Hours Unit III File Systems and Networks Traditional and Multimedia File Systems-Caching Policy-Batching-Piggy backing-Ethernet-Gigabit Ethernet-Token Ring-100VG AnyLAN-Fiber Distributed Data Interface (FDDI).. Drew. “Maartenvan Steen. “Fundamentals of Multimedia”. McGraw Hill. Addison Wesley. “Distributed Computing Principles and Applications”. Zoran S. Liu M.Distibuted Systems –Principles and Pardigms”. 10 Hours Unit IV Communication Transport Subsystem-Protocol Support for QOS-Transport of Multimedia-Computer Supported Cooperative WorkArchitecture-Session Management-MBone Applications. “Multimedia”.References: 1. Dragorad A. Pearson. 2002 4.Establishment Phase-Run-Time PhaseManagement Architectures. 1st Edition.B. and Networks”. 2004. Sandra K. 10 Hours Unit II Operating Systems Real-Time Processing-Scheduling-Interprocess Communication-Memory and Management-Server Architecture-Disk Management. Vaughan T. “Distributed Systems”. Bojkovic.. Albert Fleishman. 4. Springer-Verlag. Prentice Hall. Mugesh Singhal. 1993. Rao K. 1999. Mark J.

Wiley Publishing Inc. O’Reilly. 2006. Ramesh Nagappan. 10 Hours Unit V XML Security Description and Discovery of Web Services-Web Services Security-XML Encryption-XML Signature –Introduction to Sun ONE.J. P. Unit IV Technologies OGSA – Sample use cases – OGSA platform components – OGSI – OGSA Basic Services. 10 Hours Unit III Web Services Evolution of Distributed Computing-Introduction to Web Services-Building Web Services Architecture 10 Hours Unit IV SOAP Developing Web Services Using SOAP –Anatomy of a SOAP message-SOAP Encoding-SOAP Message Exchange Model –SOAP Communication-SOAP Security.R. 2. High level services – OGSI .Definition . 2004. 07ZC28 GRID COMPUTING 4 0 0 4 Unit I Grid Computing Introduction . Pearson Edition. 10 Hours 10 Hours 10 Hours 10 Hours Unit V Grid Computing Tool Kits Globus Toolkit – Architecture. Building Web services with Java. 10 Hours Total: 50 Hours Textbook: 1.Nirto. 3. 10 Hours Total: 50 Hours Textbook: Joshy Joseph & Craig Fellenstein. Prentice Hall of India.Extensible Stylesheet Language Formatting Objects-Introduction to Xlink.XPointer. T..Lin.M. Robert Skoczylas and Rima Patel Sriganesh. Steve Graham and Doug Davis.M. 2001. H. “ Developing Java Web Services”. 2. Unit III Grid Computing Applications Merging the Grid sources – Architecture with the Web Devices Architecture.XInclude and XBase. 15 . Web services Essential.Scope of grid computing Unit II Grid Computing Initiatives Grid Computing Organizations and their roles – Grid Computing analog – Grid Computing road map. References: 1.Goldfarb and Paul Prescod.Net middleware Solutions. T. Pearson education 2008. Etban Carami. Programming model.Unit II XML Technology Schemas-DOM-Simple API for XML (SAX)-XML Path Language-Extensible Stylesheet Language Transformations (XSLT) . “Grid Computing”.Deitel.Deitel. XML How to Program. Charles F. 2004. The XML Handbook. Pearson education asia. -2003.

3rd Edition.Principles & Practice”. 2003. Pfleeger and Pfleeger. 07ZC30 DIGITAL IMAGING 4 0 0 4 Unit I Digital Image Fundamentals Image formation.Number Theory Concepts 10 Hours Unit III Message Authentication Authentication Requirements – Authentication Function .Mechanisms .Spatial filtering – Frequency domain filtering. Schneier.Elliptic Curve Cryptography – Triple DES – Blow Fish – Diffie Hellman Key Exchange .Elements of information theory . Pearson Education.IP Security . 10 Hours 16 . 2nd Edition.Web Security – MIME – PGP.Digest Functions .Image Restoration .Hash Functions – Security of Hash Functions & MACs – MD5 – SHA . 2003. 1996. 2.Classical And Modern Techniques – Encryption Algorithms – Confidentiality – Block Cipher Principles – Modes of Operation. Discrete cosine. References: 1.Thresholding – Region based segmentation .Morphology.Degradation Model – Noise models . 10 Hours Total: 50 Hours Textbook: Stallings. Walsh. “Grid Computing: A Practical Guide to technology and Applications”. Bruce. Prentice Hall of India. 10 Hours Unit II Public Key Encryption Principles of Public Key Cryptosystems . 10 Hours Unit V System Security Intruders – Viruses – Worms – Firewalls Design Principles – Trusted Systems.Digital Signatures .Image smoothening . Tata Mc GrawHill Ltd.Authentication Protocols. Applications . 2002. 3. 10 Hours Unit III Image Compression & Segmentation Compression Models . 3rd Edition.RSA . 10 Hours Unit IV Network Security Practice Authentication. Hotelling transforms – Image formation – File formats 10 Hours Unit II Image Enhancement & Restoration Histogram modification techniques .Message Authentication Codes . “Cryptography & Network Security . “Internet Security”. Image transforms – fourier transforms. Man Young Rhee. 4. “Security in Computing”. Atul Kahate.Error free Compression -Image segmentation –Detection of discontinuities . Toha Wiley and Sons. Charles River media – 2003.Attacks . Wiley.Reference Ahmar Abbas.Conventional Encryption .Edge linking and boundary detection . 2003.”Cryptography & Network Security”. Hadamard. 07ZC29 NETWORK SECURITY 4 0 0 4 Unit I Introduction A Model for Network Security .Services .Image Sharpening . “Applied Cryptography”.Electronic Mail Security .

Anil Jain. " Quality is Free: The Art of Making Quality Certain ". James I. Software Project Management. Pearson Education. Quality Assurance. Malcolm Baldrige Award. Sixth Edition. 2nd Edition. Benchmarking.Decision-Theoretic methods . McGraw Hill. “Handbook of Software Quality Assurance”. Inspections & Walkthroughts. Addison . References: 1. “Image Processing”. 1999. Defect Identification and prevention. QC tools .Wesley. Philip B. Schulmeyer.Unit IV Representation and Description Representation schemes. CMMI. Software Quality Assurance.Definition and implementation. PCMM.Structural methods. 10 Hours 10 Hours Total: 50 Hours Textbook: Gonzalez. 2. Prentice Hall Publication.C & Woods. 1992.Regional descriptors . Statistical Quality Assurance . Clean-room software engineering. 17 .. – Evolution – Benefits. CASE (Computer Aided Software Engineering). Software Process.Software Reliability. Reviews. References: 1. 1998.R. Mass Market. R. Crosby. 07ZC31 SOFTWARE QUALITY ASSURANCE 4 0 0 4 Unit I Concepts Introduction . Software testing -Concepts.Concepts of Quality Control. OO Methodology. 2. McManus. Risk Management. “Software Engineering ".E.Software Process . Other related topics . “Digital Image Processing”.Boundary descriptors. 10 Hours Unit IV SQA Related Topics Software Quality Assurance Metrics – Metrics Methodology .Series. “Managing Software Process ". New York.7 QC Tools and Modern Tools. SPICE. Project and Product Metrics. Software Configuration Management. 3. 1995. Quality Management . Cost of Quality. 2002. “Fundamentals of Digital image processing”. Prentice Hall of India. internal Auditing and Assessments.Total Quality Management. 10 Hours Unit III Quality Assurance Models Models for Quality Assurance-ISO-9000 . Statistical process control. Syed Ahmed. Software Testing.Business Process Re-engineering & Y2K – Zero Defect. McGraw Hill. 2005. 10 Hours Unit II Software Engineering Concepts Software Engineering Principles. Roger Pressman. 3rd Edition. Muse Model. Tools.K. 10 Hours Unit V Future Trends PSP and TSP. Quality Function Deployment. Six Sigma. 10 Hours Total: 50 Hours Textbook: Watts Humphery.Relational Descriptors Unit V Object Recognition and Interpretation Patterns and pattern classes . 1989. G. CMM. Gordon.

K.Secure Routing in Ad Hoc Wireless Networks.Components of Packet Radios – Ad hoc Wireless Networks -What Is an Ad Hoc Network? Heterogeneity in Mobile Devices .QoS Frameworks for Ad Hoc Wireless Networks Energy Management in Ad Hoc Wireless Networks –Introduction .Dynamic Source Routing (DSR) -Temporally Ordered Routing Algorithm (TORA) . “Ad Hoc Mobile Wireless Networks: Protocols and Systems”.Multicasting with Quality of Service Guarantees .Issues and Challenges in Providing QoS in Ad Hoc Wireless Networks -Classifications of QoS Solutions .Issues in Designing a Transport Layer Protocol for Ad Hoc Wireless Networks .Network Security Requirements .Technical Challenges . 2.07ZC32 AD HOC NETWORKS 4 0 0 4 Unit I Introduction Introduction-Fundamentals of Wireless Communication Technology . 2004 References: 1.System Power Management Schemes.Need for Energy Management in Ad Hoc Wireless Networks . Prentice Hall of India. Addison Wesley. “Ad Hoc Wireless Networks: Architectures and Protocols”.Signal Stability Routing (SSR) -Location-Aided Routing (LAR) . “Ad Hoc Networking”.Zone Routing Protocol (ZRP). Security Protocols Introduction .IEEE 802.Types of Mobile Host Movements .Wireless Sensor Networks Traffic Profiles .Ad Hoc OnDemand Distance Vector Routing (AODV) .. 10 Hours Unit IV Transport Layer.Power-Aware Routing (PAR) .Classification of Energy Management Schemes .Wireless Routing Protocol (WRP) . 2000.Battery Management Schemes . and Manoj B.Transmission Power Management Schemes .Architecture of PRNETs .b Standard – Origin Of Ad hoc: Packet Radio Networks . 10 Hours Unit V QoS and Energy Management Introduction .Issues in Designing a Multicast Routing Protocol .Key Management . Prentice Hall of India.Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks .Mesh-Based Multicast Routing Protocols . 10 Hours Total: 50 Hours Textbook: Siva Ram Murthy C. 10 Hours Unit II Ad Hoc Routing Protocols Introduction .Radio Propagation Mechanisms .MAC Layer Solutions .Classifications of Routing Protocols -Table-Driven Routing Protocols .Summary of Tree-and Mesh-Based Protocols .TCP Over Ad Hoc Wireless Networks -Other Transport Layer Protocols for Ad Hoc Wireless Networks .Source-Initiated On-Demand Approaches .An Architecture Reference Model for Multicast Routing Protocols -Classifications of Multicast Routing Protocols .The Electromagnetic Spectrum .TreeBased Multicast Routing Protocols. Perkins.Cluster Switch Gateway Routing (CSGR) . 18 .Characteristics of the Wireless Channel .Challenges Facing Ad Hoc Mobile Networks-Ad hoc wireless Internet.Types of Ad hoc Mobile Communications .Destination Sequenced Distance Vector (DSDV) .Security in Ad Hoc Wireless Networks . .Network Security Attacks .Operation of Multicast Routing Protocols .Energy-Efficient Multicasting .Comparisons of Multicast Routing Protocols.Network Layer Solutions .11a. 10 Hours Unit III Multicast routing in Ad Hoc Networks Introduction . Toh C. 2001.Application-Dependent Multicast Routing .Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks -Classification of Transport Layer Solutions .Issues and Challenges in Security Provisioning . Charles E.S.

Integration. Alex Berson. Reduction. 10 Hours Unit IV Data Warehousing Data Warehousing Components -Multi Dimensional Data Model. and Discretization Concept HierarchiesConcept Description: Data Generalization And Summarization Based Characterization.Hill.Other Classification Methods-PredictionClusters Analysis: Types Of Data In Cluster Analysis.Social Impacts Of Data Mining-Tools-An Introduction To DB Miner-Case Studies-Mining WWW-Mining Text Database-Mining Spatial Databases.Intelligent Agents-Problem Solving-Searching Heuristics -Constraint Satisfaction Problems . Ralph Kimball. 2002. Usama M.-Mapping the Data Warehouse to Multiprocessor Architecture. Databases.Shapiro.Resolution StrategiesKnowledge Representation-Objects-Actions-Events – Logical Recovery. 10 Hours Total: 50 Hours Textbook: Jiawei Han.History –Structure – Environment.Overview of Data Mining Techniques. Tata Mcgraw.T Press. Padhrai Smyth and Ramasamy Uthurusamy. References: 1..Data Mining Functionalities-Steps in Data Mining Process-Architecture of a Typical Data Mining Systems. 10 Hours Unit II Knowledge Representation and Reasoning Logical Agents-First order logic-First Order Inference – Reflex Agent-Unification-Chaining. 1998. John Wiley & Sons Inc. Gregory Piatetsky . Transformation. "Data Mining: Concepts and Techniques". 2004 07ZC34 AGENT BASED INTELLIGENT SYSTEMS 4 0 0 4 Unit I Introduction Definitions . 1996. "The Data Warehouse Life Cycle Toolkit". Data Mining. The M.Fayyad.Stephen J.Mining Association Rules In Large Databases – Analytical Characterization – Analysis of Attribute Relevance.Classification of Data Mining Systems . 10 Hours Unit II Data Preprocessing and Association Rules Data Preprocessing-Data Cleaning.Categorization of OLAP Tools – OLAP Operations in Multidimensional Data Model. "Advances In Knowledge Discovery And Data Mining".Categorization Of Major Clustering Methods: Partitioning Methods –Hierarchical Methods – Density Based Methods – Grid Based – Model Based – Outlier Analysis.Data Warehouse Architecture-Data Warehouse Implementation. 10 Hours 19 . Morgan Kaufmann Publishers.& OLAP”. Micheline Kamber. Smith. “Data Warehousing.07ZC33 DATA WAREHOUSING AND DATA MINING 4 0 0 4 Unit I Introduction Relation to Statistics.Foundations . 10 Hours Unit V Applications Applications of Data Mining and Trends in Data Mining .Game playing.I. 10 Hours Unit III Predictive Modeling Classification and Prediction: Issues Regarding Classification And Prediction-Classification By Decision Tree Induction-Bayesian Classification-Classification by Back Propagation .OLAP. 2.-Need. 3.

Utility Theory . III Edition. “Principles of Artificial Intelligence”.Unit III Planning Agents Representation of Planning . Nils. 2002. Prentice Hall India. 3. 10 Hours Unit V Higher Level Agents Knowledge in Learning-Relevance Information-Statistical Learning Communication-Formal Grammar-Augmented Grammars. 1992. Methods-Reinforcement Learning10 Hours Total: 50 Hours Textbook: Stuart Russell and Peter Norvig. “An Introduction to Multi Agent System”. 20 . Narosa Publishing House.J.Planning Problem -State Space Search -Partial Order Planning-Graphs-Nondeterministic Domains-Conditional Planning-Continuous Planning-MultiAgent Planning – Replanning Agents 10 Hours Unit IV Agents and Uncertainity Acting under uncertainty – Probability Notation-Bayes Rule and use . 2002 References: 1. Patrick Henry Winston.Bayesian Networks-Other Approaches-Time and Uncertainty-Temporal Models.A Modern Approach”. John Wiley. 2nd Edition.Future of AI. Michael Wooldridge.Nilsson. Addison Wesley. “Artificial Intelligence”.Decision Network – Complex Decisions. 2. 1999. “Artificial Intelligence .