ACADEMIC REGULATIONS COURSE STRUCTURE AND DETAILED SYLLABUS M.Tech. Computer Science (Effective for the students admitted from the Academic Year 2005-06) a Jawaharlal Nehru Technological University Hyderabad — 500 072JAWAHARLAL NI M. Tech. (Computer Science) }HRU TECHNOLOGICAL UNIVERSITY, HYDERABAD w.e.f, 2005-06 COURSE STRUCTURE AND SYLLABUS T-Semester___ [Code - itle Design and Analysis of Algorithi Computer Organization 4 - ‘Computer Communications i 4 [ | Operating Systems ee [ees Mathematical Foundations of Computer Science [4 - Database Management Sys! 4 - Practical Design and Analysis of Algorithms Lab (Through C++) > 4 11-Semester 7 Code "Title DTP Compiler Design Re Data Warehousing and Mining 4_[- Software Engineering 4 |- Object Oriented Analysis and Design Al oe [ Elective -I 4_[- ee Elective - If Siilotot Hat weet sila reba |oe| Practical | UML Lab af =| 4 Ul-Semester 7 - - Internal External_[ Total Project Seminar = [sis - Satisfactory/Not-Satisfactory 1V-Semester ‘8 eg __| Internal“ External Total | Project Seminar - _ Dissertation/Thesis cellent good/Satisfactory/Not-Satisfactory | lL Note: Eligibility for admission to this course is B.E./B.Tech. in any branch of Engineering. Elective -I 1. Pattern Recognition and Image Processing 2 Web Technologies 3. Network Security and Cryptography Elective - 01 1, Middleware Technologies 2. Embedded Systems 3. Neural NetworksJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Seience) wef, 2005-06 [Semester DESIGN AND ANALYSIS OF ALGORITHMS UNIT Overview of OOP Principles: Encapsulation, Inheritance, and Polymorphism. Review of C+-Classes and Objects, Class members, Access control, class scope. constructors and destructors, dynamic memory allocation and de-allocation (new and delete), Polymorphism- Function overloading, operator overloading, generic programming-function and class templates, Inheritance, run time polymorphism using virtual functions, abstract classes, File VO and Exception handling, UNET-IL Algorithm Analysis and Review of Data Structures: Algorithms, Psuedo code for expressing algorithms, Performance Analysis-time complexity and space complexity notation, Omega notation and Theta notation, little o notation, Probabilistic analysis, Amortized analysis, Review of Data Structures-The List ADT, Stack ADT, Queue ADT, Implementations using template class, Hash Functions, Collision Resolution in hashing, Priority queues-Definition, Priority queues-ADT, Heaps-Definition, Insertion and Deletion, Applications-Heap sort, Disjoint sets-Disjoint set ADI, Union and Find algorithms. UNIT-I Divide and conquer: Genera! method, applications-Binary search, Quick sort, Merge sort, Strassen’s Matrix Multiplication UNIT-IV Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem. UNIT-V Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Traveling sales person problem, Reliability design. UNIT-VI Searching and Traversal Techniques: Efficient non-recursive Tree Traversal algorithms, DFS, BFS of Graphs, AND/OR graphs, game trees, Bi-Connected components, Search Trees- Balanced search trees- AVL trees. representation, Operations-insertion, deletion and searching, B-Trees-B-Tree of order m, Operations- insertion, deletion and searching. UNET-VIL Backtracking and Branch and Bound: General method (Backtracking), Applications-n- queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles. General method (Branch and Bound), Applications - ‘Traveling sales person problem, 0/1 knapsack probiem-LC Branch and Bound solution, FIFO Branch and Bound solution.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-06 UNIT-VUL NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard and NP- Complete classes, Cook’s theorem. Text Books: 1, Computer Algorithms/C++, E.Horowitz, S.Sahani and S.Rajasekharan, Galgota Publishers pvt. Limited. 2. Data Structures and Algorithm Analysis in C++, 2nd Edition, Mark Allen Weiss, Pearson Education. 3. Introduction to Algorithms, 2nd Edition, T.H.Cormen, C.E.Leiserson, R.LRivest, and C Stein, PHI Pvt.Ltd./ Pearson Education. Reference Books: 1. Design and Analysis of algorithms, Aho, Ullman and Hoperoft, Pearson Education, 2. Introduction to the Design and Analy 3. Data structures, Algorithms and App (india) pvt Itd, 2nd edition, Orient Longman pvt.ttd Object Oriented Programming Using C++, 2 Edition, I.Pohl, Pearson Education, Fundamentals of Sequential and Parallel! Algorithms, K.A.Berman, J. L.Paul, Thomson Data Structures And Algorithms in C++, 3 Edition, Adam Drozdek, Thomson. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia, John Wiley and sons. of Algorithms, A.Levitin, Pearson Education. ations in C++, S.Sahni, University press NousJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M, Tech. (Computer Science) wet. 2005-06 [-Semester COMPUTER ORGANIZATION UNIT-E: BASIC STRUCTURE OF COMPUTERS: Computer Types, Functional unit, Basic OPERATIONAL concepts, Bus structures, Software, Performance, multiprocessors and mult computers. Data Representation, Fixed Point Representation. Floating — Point Representation. Error Detection codes. COMPUTER ARITHMETIC: Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating — point Arithmetic operations. Decimal Arithmetic unit Decimal Arithmetic operations UNIT-E: REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS: Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic Mircrooperatiaons, logic micro operations, shift micro operations, Arithmetic logic shift unit. Instruction codes. Computer Registers Computer instructions ~ Instruction cycle. Memory ~ Reference Instructions. Input ~ Output and Interrupt, STACK organization Instruction formats. Addressing modes. DATA Transfer and manipulation. Program control Reduce Instruction set computer. UNUT-HE: MICRO. PROGRAMMED CONTROL: Control memory, Address sequencing, microp:ogram example, design of control unit Hard wired control. Microprogrammed control UNIT-EV: PROGRAM AND NETWORK PROPERTIES, Conditions of Parallelism. Program Paritioning and Scheduling, Program flow Mechanism, System Interconnect Archcitectures. SCALABILITY AND PERFORMANCE Poricipels of Scalable Performance, Performance Metrics and Measures, Parallel Processing Applicotions. Speedup Performance Laws. Scalability Analysis and Approaches. UNIT-V: THE MEMORY SYSTEM: Basic concepts semiconductor RAM memories. Read-only memories Cache memories performance considerations, Virtual memories secondary storage. Introdustion to RAID. UNIT-VIE INPUT-OUTPUT ORGANIZATION: Peripheral Devices, Input-Output Interface, Asynchronous data transfer Modes of Transfer, Priority Interrupt Direct memory Access, Input ~Output Processor (IOP) Seria] communication; Introduction to peripheral component, Interconnect (PCI) bus, Introduction to standard serial communication protocols like RS232, USB, IFEEI394. UNIT-VIL: PIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector Processing, Array Processors.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M, Tech. (Computer Science) weet. 2005-06 UNIT-VIII: MULTI PROCESSORS:Characteristics or Multiprocessors, Interconnection Structures, Interprocessor Arbitration. InterProcessor Communication and Synchronization Cache Coherance. Shared Memory Multiprocessors. MULTIPROCESSING Multiprocessor System Interconnects. Cache Coherence and Synchronization Mechanisms. Vector Processing Principles. SIMD Computer Implementation Models. Larency Hiding Techniques. Principles of Multi Threading. Data Flow Architecture Evaluation TEXT BOOKS: 1. Computer Systems Architecture - M.Moris Mano, Iilrd Edition, Pearson/PHI 2, Computer Organization — Car Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition, McGraw Hill REFERENCE: 1. Computer Organization and Architecture — William Stallings Sixth Edition, Pearson/PHI 2. Structured Computer Organization ~ Andrew S. Tanenbaum, 4" Edition PHI/Pearson 3. Fundamentals or Computer Organization and Design, - Sivaraama Dandamud) Springer Int. Edition. Computer Organization, Anjaneyulu, Himalaya Pub house.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech, (Computer Science) wae.f, 2005-06 [Semester COMPUTER COMUNICATIONS UNIT-T Introduction: Uses of computer Networks, Network H/w, Network S/W, Reference Models, Example Networks , Network Standardization. UNIT-L Physical Layer: Guided transmission media ~ Magnetic media, Twisted Pair, coaxial cable, fiber optics . yer: Design Issues, Error detection and correction , Elementary Data Link 1 Window Protocols, Protocol Verification, Example Data Link protocols. UNITE The Medium Access Sub Layer : The channel allocation problem, Multiple access Protocols, Ethemet , Wireless LANs , Broadband Wireless, Bluetooth ,Data Link Layer Switching UNITY The Network Layer ; Network Layer Design Issues. Routing Algorithms ,Congestion Control Algorithms Quality Of Service, Internet Working Network Layer in Internet. UNIT-V The Transport Protocol: The Transport Service, Elements of transport protocol . A simple Transport Protocol , Internet Transport Protocols UDP, Internet Transport Protocols ‘TCP, Performance Issues. UNIT-VI ‘The Application Layer: DNS-(Domain Name System), Electronic Mail, World Wide Web Multimedia, UNIT-VIL Network Security: Cryptography , Symmetric key Algorithms, Public-Key Algorithms, Digital Signatures, Management of public keys. UNIT-VIIE Communication Security, Authentications Protocols, B-mail Securit Issues, Web security, Soci TEXT BOOKS: 1. Computer Networks -- Andrew S Tanenbaum,4" Edition. Pearson Education/PHI REFERENCE BOOK! 1. Computer Communications and Networking Technologies ~Michael A.Gatlo, William Hancock - Thomson Publication 2. Data Communications and Networking ~ Behrouz A. Forouzan. Third Edition TMH.ee JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-06 L-Semester OPERATING SYSTEMS . UNIT I: Operating System Introduction, Structures - Simple Batch, Multi programmed, time- shared, Personal Computer, Parallel, Distributed Systems Real-Time Systems , System components, Operating-System services, System Calls, Virtual Machines, System Design and Implementation. UNIT I: Process and CPU Scheduling - Process concepts and scheduling, Operation on processes, Cooperating Processes, Threads, and Interposes Communication Scheduling Criteria, Scheduling Algorithm, Multiple -Processor Scheduling, Real-Time Scheduling. UNIT OT Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation, Segmentation with Paging Demand Paging . Performance of Demanding Paging . Page Replacement Page Replacement Algorithm, Allocation of Frames, ‘Thrashing, UNIT IV: File System Interface and Implementation -Access methods, Dircetory Structure, Protection, File System Structure, Allocation methods, Free-space Management, Directory Management, Directory Implementation, Efficiency and Performance. Deadlocks - System Model, Dead locks Characterization, Methods for Handling Dead locks Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock, UNIT V: Process Management and Synchronization - The Critical Section Problem. Synchronization Hardware, Semaphores, and Classical Problems of Synchronization, Critica’ Regions, Monitors. UNIT! Introduction to Distributed systems : Goals of distributed system, hardware and software concepts, design issues Communication in Distributed systems : Layered protocols, ATM networks , the Client « Server model, remote procedure call and group communication. UNIT VIL: Synchronization in Distributed systems ; Clock synchronization, Mutual exclusion, E> tech algorithms, the Bully algorithm, a ring algorithm, atomic transactions UNIT VILE: Deadlocks: deadlock in distributed systems, Distributed deadlock prevention, and distributed dead lock detection ‘TEXT BOOKS: 1 Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7” Edition, John Wiley 2. Distributed Operat .g System - Andrew. S. Tanenbaum, PHT REFERENCE BOOKS: Operating System A Design Approach-Crowley,TMH. Operating Systems ~ Internals and Design Principles Stallings, Fifth Edition~2005, Pearson Education/PHI Modern Operating Systems, Andrew S ‘Tanenbaum 2" edition Pearson/PHI Operating Systems, Dhamdhere, TMH vaepeJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech, (Computer Science) wef, 2005-06 [-Semester MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE UNIT: Fundamentals : Strings, Alphabet, Language. Operations. Finite state machine, definitions, Fare sromaten model, acceptance of strings, and languages, deterministic finite automaton san on deterministic finite automaton, transition diagrams and Language recognizers Fi Automat: NFA with € transitions- Significance. acceptance of languages. Equivalence: Equivalence between NFA with and without ¢ \anstici, NFA to DFA caversion, minimisation of FSM, equivalence between two FSM’s, Finite Auomaa with ‘output: Moore and Melay machines. Conversions and UNITE Regular Languages Regulat sets, regular expressions, identity rules, Constructing finite Automata for a given regular expressions, Conversion of Finite Antomata to Regular expressions UNIT-ITE: Push Dowa Automata Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence, ‘Turing Machine Turing, Machine, definition, model, design of TM, Computable functions, recursively qnumerable languages. Church’s hypothesis, counter machine, types of Turing machines UNIT-AV: Computability Theory Chomsky hierarchy of languages, linear bounded automata and context sensitive language, LR(O} grammar, decidability of, problems, Universal Turing Machine, undecidability of posts, Correspondence problem, Turing reduciblity, Definition of P and NP problems, NP complete and NP hard problems UNIT-V: Elementary Combinatorie repetitions, Constrained repetitions, Binomial Coefficients, Binonial the principles of Inclusion ~ Exclusion. asis of counting, Combinations & Permutations, with {| Multinomial theorems, UNIT-VI: Recurrence Relation: Generating Functions, Function of Sequences Calculating Coeffici of generating function, Recurrence relations, Solving recurrence relation by substitution Generating funds. Characteristics roots solution of In homogeneous Recurrence Relation. UNIT-Vi Graph Theory: Representation of Graph, DFS. BFS, Spanning ‘Trees, planar Graphs UNIT-VILE: Graph Theory and Applications, Basie Concepts Isomorphism and Sub graphs, Multi grapl and Euler circuits, Hamiltonian graphs, Chromatic NumbersJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wee, 2005-06 TEXT BOOKS: 1. Discrete and Combinational Mathematics- An Applied Introduction-Sth Edition — Ralph. P.Grimaldi. Pearson Education 2.Discrete Mathematical Structures with applications to computer science Trembly J.P. & Manohar .P, TMH 3. Discrete Mathematics for Computer Scientists & Mathematicians, J.L. Mott, A. Kande', T.P. Baker Prentice Hall. Reference Books: 1 Discrete Mathematical Structures, Bernand Kolman, Roberty C. Busby, Sharn Cutter Ross, Pearson Education/PHI 2. Mathematical Foundations of computer science Dr D.S.Chandrasckharaiaha Prism books Pvt Ltd. 3. Discrete Mathematics, Lovasz, Springer. 4. Discrete Mathematics for Computer science, Garry Haggard and others, Thomson.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wae.f. 2005-06 I-Semester DATABASE MANAGEMENT SYSTEMS UMT-E Data base System Applications, data base System VS file System © View of Data ~ Data Da barien Instances and Schemas ~ data Models ~ the ER Model Relational Model ~ Other Models ~ Database Languages - DDL ~ DML ~ database Access for applications Programs ~ data base Users and Administrator ~ Transaction Management — data base System Structure ~ Storage Manager ~ the Query Processor = History of Data base Systems Pte base design and ER diagrams ~ Beyond ER Design Entities, Attributes and Entity sets ~ Relationships and Relationship sets ~ Additional features of ER Mode! ~ Concept Design with the ER Model ~ Conceptual Design for Large enterprises. UNIT: Relational Model: Introduction to the Relational Model ~ Integrity Constraint Over relations = Bnforcing Integrity constraints ~ Querying relational data — Logical data base Design ~ Introduction to Views — Destroying Jaltering Tables and Views. Relational Algebra and Calculus: Relational Algebra — Selection and projection set operations — renaming ~ Joins ~ Division ~ Examples of Algebra overviews ~ Relational cutis Tuple relational Calculus ~ Domain relational calculus Expressive Power of Algebra and calculus. UNIT - HI Four of Basic SQL Query - Examples of Basic SQL, Queries ~ Introduction to Nested Queries ~ Correlated Nested Queries Set — Comparison Operators = Aggregative Operators ~ NULL values — Comparison using Null values ~ Logical connectivity’s — AND, OR and NOTR ~ Impact on SQL Constructs ~ Outer Joins ~ Disallowing NULL values ~ Complex integrity Constraints in SQL Triggers and Active Data bases. Schema refinement — Problems Caused by redundancy — Decompositions — Problem related to decomposition - reasoning about FDS ~ FIRST. SECOND, THIRD Normal forms = BCE. Lossless join Decomposition ~ Dependency preserving Decomposition ~ Schema arcment in Data base Design ~ Multi valued Dependencies ~ forth Normal Form. | ACID Properties ~ Transactions and Schedules = Concurrent Execution of transaction — Lock Based Concurrency Control — Performance Locking -'Transaction Support in SQL ~ Introduction to Crash recovery UNIT- Vi: Concurrency Control: Serializability, and recoverability - Introduction to Lod Management ~ Lock Conversions ~ Dealing with Dead Loc! Specialized Locki Techniques - Concurrency without Locking, Crash recovery: Introduction to ARIES ~ the Log ~ Other Recovery related Structures ~ Write-Ahead Log Protocol - Check pointing ~ re3covering from a System Crash ~ Media recovery ~ Other approaches and Interaction with Concurrency controlJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef. 2005-06 UNIT - VI: Overview of Storage and Indexing: Data on External Storage — File Organization and Indexing — Cluster Indexes, Primary and Secondary Indexes ~ Index data Structures — Hash Based Indexing ~ Tree base Indexing ~ Comparison of File Organizations - Indexes and Performance Tuning. UNIT ~ VIII: Storing data: Disks and Files: - The Memory Hierarchy — Redundant Arrays of Indepencent - Disks - Disk Space Management ~ Buffer Manager ~ Files of records ~ Page Formats ~ record formats Tree Structured Indexing: Intuitions for tree Indexes ~ Indexed Sequential Access Methods (ISAM) - B+ Trees: A Dynamic Index Structure. Hash Based Indexing: Static Hashing — Extendable hashing ~ Linear Hashing — Exendble vs. Liner hashing, TEXT BOOKS: 1, Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3° Edition 2. Data base System Concepts, Silberschatz, Korth, McGraw hill, IV edition. 3. Database Management Systems ?. Radha Krishna HI-TECH Publications 2005 REFERENCE BOOK: L Introduction to Database Systems, C.J.Date Pearson Education 2. Data base Systems design, Implementation, and Management, Rob & Coronel 5” Edition. Thomson 3. Data base Management System, Elmasri Navrate Pearson Education 4. Data base Management System Mathew Leon, Leon Vikas. 5. Data base Systems, Connoley Pearson education iJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Seience) wef, 2005-06 I-Semester DESIGN AND ANALYSIS OF ALGORITHMS LAB (Through C++) 1, Write C++ programs to implement the following using an array. a) Stack ADT b) Queue ADT 2. Write C++ programs to implement the following using a singly linked list. a) Stack ADT. b) Queue ADT 3. Write C++ program to implement the deque (double ended queue) ADT using a doubly linked li 4, Write a C++ program to perform the following operations: a) Insert an clement into a binary search tree. b) Delete an element from a binary search tree. ©) Search for a key element in a binary search tree. 5. Write a C++ program to implement circular queue ADT using an array. 6. Write a C++ program to implement all the functions of a dictionary (ADT) using, hashing. 7. Write a C++ program to perform the following operations on B-Trees and AVL-ttees: a) Insertion. b) Deletion. 8. Write C+ programs for the implementation of bfs and dfs for a given graph. 9. Write C++ programs to implement the following to generate a minimum cost spanning tree: a) Prim’s algorithm. b) Kruskal’s algorithm. 10. Write a C+ program to solve the single source shortest path problem. (Note: Use Dijksira’s algorithm). 11. Write C++ program that uses non-recursive functions to traverse a binary tree in a) Pre-order. b) In-order. ©) Post-order. d) 12. Write C++ programs for sorting a given list of elements in a following sorting methods: a) Quick sort b) Merge sort 13.Write a C++ program to find optimal ordering of matrix. multiplication, (Note: Dynamic programming method), ding order using tARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD ter Science) wef 2005-06 problem of eight queens on an (8x8) chessboard. Two queens are said t0 if they are on the same row, column, or diagonal. Write a C++ program that racking algorithm to solve the problem i.e. place eight non-attacking queens Et program to find the strongly connected components in a digraph. program to implement file compression (and uncompression) using king algorithm. “program that uses dynamic programming algorithm to solve the optimel problem. program for solving traveling seles persons problem using the following: dynamic programming algorithm. he back tracking algorithm. anch and Bound. ks for lab: 1. Data Structures, A Pseudocode Approach with C++, Richard F.Gilberg, Behrouz A.Forouzan, Thomson. 2, Data Structures Using C++, D.S.Malik, Thomson,JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech, (Computer Science) wef, 2005-06 [Semester COMPILER DESIGN Unit Overview of Compilation: Phases of Compilation ~ Lexical Analysis, Regular Grammar and regular expression for common programming language features, pass and Phases of translation, interpretation, bootstrapping, data structures in compilation ~ LEX lexical analyzei generator, Unit— Mt Parsing: Context free grammars, Top down parsing — Backtracking, LL (1), recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing, Unit — HW: Bottom up parsing: - Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handling ambiguous grammar. YACC — automatic parser generator. UNIT IV Semantic analysis:_Intermediate forms of source Programs ~ abstract syntax tree, Attributed grammars, Syntax directed translation, Conversion of popular Programming languages language Constructs into Intermediate code forms, Type checker. Unit ~1V: Symbol Tables: Symbol table format, organization for block structures languages, hashing, tice sirvctures representation of scope information. Block structures and non block structure storage allocation; static, Runtime stack and heap storage allocation, storage allocation for arrays, strings and records. Unit VIE Code Generation- Processing the intermediate Code- Interpretation, Code generation, Simple code generation, code generation for basic blocks, BURS Code generation and dynamic programming, Register allocation by graph coloring, Evaluation of code generation techniques Preprocessing the intermediate code, post processing the target code, machine code generation, Unit ~ VII: Code optimization: Consideration for Optimization, Machine dependent and machine independent code optimization, Scope of — Optimization, local optimization, loop optimization, frequency reduction, folding, DAG representation. Unit — VIE: Data flow analysis:_ Dataflow Analysis, Intermediate representation for flow analysis , Various dataflow analyses , Transformations using dataflow analysis Speeding up dataflow analysis , Alias analysis. Loop Optimizations ~Dominators, Loop-invariant computations, Induction variables, Array bounds checks, Loop unrollingJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-06 ‘Text Books: 1 Principles of compiler design -A.V. Aho . J.D.Utlman; Pearson Education Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley 2. dreamtech. References: 1. tex &yace ~ John R. Levine, Tony Mason, Doug Brown, O’reilly 2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge University Press. 3. Engineering a Compiler-Cooper & Linda, Elsevier. 4, Compiler Construction, Louden, Thomson.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef. 2005-06 IL-Semester DATA WAREHOUSING AND MINING UNIT-L Introduction: Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining systems, Major issues in Data Mining, Data Warehouse and OLAP Technology for Data Mining Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse Implementation, Further Development of Data Cube Technology, From Data Warehousing to Data Mining, UNIT-1 Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation, Online Data Storage. UNIT-II Data Mining Primitives, Languages, and System Architectures: Data Mining Primitives, Data Mining Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures of Data Mining Systems, UNIT-IV, Concepts Description: Characterization and Comparison: Data Gener Summarization-Based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class Comparisons: Discriminating between Different Classes, Mining Descriptive Statistical Measures in Large Databases. jon_and UNIT-V Mining Association Rules in Large Databases: Association Rule Mining, Mining Single- Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from Transaction Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-Based Association Mining UNIT-VE Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Classification by Back propagation, Classification Based on Concepts from Association Rule Mining, Other Classification Methods, Prediction, Classifier Accuracy UNIT-V Cluster Analysis Introduction :Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering Methods, Outlier Analysis. UNIT-VUT Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex, Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining ‘Time-Series and Sequence Data, Mining Text Databases, Mining the World Wide Web.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) w.e.f. 2005-06 TEXT BOOKS: 1. Data Mining — Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER Harcourt India. 2. Data Mining Techniques ~ ARUN K PUJARI, University Press 3. Building the DataWarehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.. REFERENCE BOOKS: 1. Data Warehousing in the Real World SAM ANAHORY & DENNIS MURRAY. Pearson Edn Asia. 2. Data Warehousing Fundamentals ~ PAULRAJ PONNAIAH WILEY STUDENT EDITION 3. The Data Warehouse Life cycle Too! kit ~ RALPH KIMBALL WILEY STUDENT EDITION 4, Data Mining Introductory and advanced topics MARGARET H DUNHAM, PEARSON EDUCATIONJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef. 2005-06 U-Semester SOFTWARE ENGINEERING UNIT. {ntroduetion to Software Engineering: The evolving role of software, Changing Nature of Software, Software myths. A Generic view of process: Software engineering- A layered technology, a process framework, The Capability Maturity Model Integration (CMMI), Process patterns, process assessment, personal and team process models UNIT-I: Process models: The waterfall model, Incremental process models, Evolutionary process models, The Unified process Software Requirements: Functional and non-functional requirements, User requirements, System requirements, Interface specification, the software requirements document. UNIT-I: Requirements engineering process: Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirements management. System models: Context Models, Behavioral models, Data models, Object models, structured methods. UNIT-IV: Design Engineering: Design process and Design quality, Design concepts, the design model Creating an architectural design: software architecture, Data design, Architectural styles and patterns, Architectural Design. UNIT-V: Object-Oriented Design: Objects and object classes, An Object-Oriented design process, Design evolution. Performing User interface design: Golden rules, User interface analysis and design, interface analysis, interface design steps, Design evaluation. UNIT-VE Testing Strategies: A strategic approach to software testing, test strategies for conventional software, Black-Box and White-Box testing, Validation testing, System testing, the art of Debugging Product metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for maintenance UNIT-VIE: Plans for testing: Snooping for information, Coping with complexity through teaming, Testing plan focus areas . Testing for recoverability , Planning for troubles. UNIT-VII: Preparing for the tests: Software Reuse, Developing good test programs , Data corruption, Tools, Test Execution ,Testing with a virtual computer. Simulation and Prototypes, Managing the Test, Customer's role in testingJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-05 TEXT BOOKS: 1. Software Engineering, A practitioner's Approach- Roger S. Pressman, 6" edition. McGrawHill International Edition. 2. Software Engineering- Sommerville , 7" edition, Pearson education. 3 Software Testing Techniques ~ Loveland, Miller, Prewitt, Shannon, Shroff Publishers & Distribution Pvt Ltd... REFERENCE BOOKS: 1. Software Engineering- K.K. Agarwal & Yogesh Singh,New Age International Publish 2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedryez, John Wiely 3. Systems Analysis and Design- Shely Cashman Rosenblatt, Thomson Publications 4, Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill Companies. vJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) w.e.f. 2005-06 U-Semester OBJECT ORIENTED ANALYSIS AND DESIGN UNIT-E: Introduction to UML: Importance of modeling, principles of modeling, object oriented modeling. conceptual model of the UML, Architecture, Software Development Life Cycle. UNIT-II: Basie Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams. Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and Roles, Packages, UNTT-HI Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams. UNIT- IV: Basie Behavioral Modeling-1: Interactions, Interaction diagrams. UNIT-V: Basie Behavioral Modeling-II: Use cases, Use case Diagrams, Activity Diagrams. UNIT-VI: Advanced Behavioral Modeling: Events and signals, state machines, processes and ‘Threads, time and space, state chart diagrams, UNIT-VI: Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams. UNIT-VI Case Study: he Unified Library application TEXT BOOKS: |. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide, Pearson Education. 2, Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, WILEY- Dreartech India Pvt. Ltd REFPRENCE BOOK: |. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education. 2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dreamtech India Pvt Ltd. 3. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill Companies. 4. Mark Priestley: Practical Object-Oriented Design with UML,TATA McGrawHill 5. Appling UML and Patterns: An introduction to Object ~ Oriented Analysis and Design and Unified Process, Craig Larman, Pearson Education 20JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) we, 2005-06 I-Semester PATTERN RECOGNITION AND IMAGE PROCESSING (Elective- 1) UNIT-1 Introduction: Machine perception, pattem recognition example, pattern recognition systems, the design cycle, learning and adaptation (Text book-1, p.nos: I-17). Bayesian Decision Theory : Introduction, continuous features — two categories classifications, minimum error-rate ation- zero~one loss function, classifiers, discriminant functions, and decision surfaces (Text book-1, p.nos: 20-27, 29-31). UNIT-IL Normal density: Univariate and multivariate density, discriminant functions for the norma’ density-different cases, Bayes decision theory ~ discrete features, compound Bayesiati decision theory and context (Text book-1, p.nos: 31-45,51-54,62-63). UNIT Maximum likelihood and Bayesian parameter estimation: introduction, maximum likelihood estimation, Bayesian estimation, Bayesian parameter estimation—Gaussian case (Text book-1, p.nos: 84-97). UNIT-IV Un-supervised learning and clustering: Introduction. mixture densities and identifiability, maximum likelihood estimates, application to normal mixtures, _ K-means clustering. Date description and clustering ~ similarity measures, criteria function for clustering (Text book-1, panos: 517-526, $37 ~ 546). UNIT-V Pattern recognition using discrete hidden Markoy models: Discrete-time Markov process, Extensions to hidden Markov models, three basic problems of HMMs, types of HMMs UNIT-VI Continuous hidden Markov models : Continuous observation densities, mu! applications. iple mixtures per state, speech recognition UNIT-VII Digital image fundamentals : Introduction, an image model, sampling and quantization, basic relationships between pixels, image geometry Image enhancement: Back ground, enhancement by point processing histogram processing, spatial fi introduction to image transforms, image enhancement in frequency domain. 21JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-06 UNIT Vit Image Segmentation and Edge Detection: Region Operations, Crack Edge Detection, Edge Fotiowing, Gradient operators, Compass and laplace operators. Threshold detection methods, optimal thresholding, multispectral thresholding, thresholding in hierarchical data structures; edge based image segmentation- edge image thresholding, edge relaxation, border tracing, border detection, Text Books: 1. Pattern classifications, Richard O. Duda, Peter E. Hart, David G. Stroke. Wiley student edition, Second Edition. 2. Fundamentals of speech Recognition, Lawerence Rabiner, Biing — Hwang Juang Pearson education. 3 R.C Gonzalez and R.E. Woods, “ igital Image Processing”, Addison Wesley, 1992. Reference Books: 1. A.KJain, “Fundamentals of Digital Image Processing”, Prentice Hall of India. 2. Digital Image Processing - M. Anji Reddy, BS Publications. 3. Pattern Recognition and Image Analysis ~ Earl Gose, Richard John baugh, Steve Jost PHI 2004JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef. 2005-06 I-Semester WEB TECHNOLOGIES (Elective - 1) UNIT-I: HTML Common tags- List, Tables, images, forms, Frames; Cascading Style sheets; UNIT-D Introduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java Script UNIT-IL: XML: Document type definition, XML Schemas, Document Object model, Presenting XML, Using XML Processors: DOM and SAX UNIT-IV: Jaya Beans: Introduction to Java Bears, Advantages of Java Beans, BDK Introspection, Using Bound properties, Bean info Interface, Constrained properties Persistence. Customizes, Java Beans API, Introduction to E1B’s : Introduction to Servelets: Lifecycle of a Serverlet, JSDK, ‘The Servelet API. ‘The javax.servelet Package, Reading Servelet parameters, Reading Initialization parameters. ‘The javax.servelet HTTP package, Handling Http Request & Responses, Using Cookies- Session Tracking, Security Issues, UNIT-VI: Introduction to JSP: The Problem with Servelet. The Anatomy of a JSP Page, JS? Processing. SP Application Design with MVC Setting Up and JSP Environment: Installing the Java Software Development Kit, Tomeat Server & Testing Tomcat jon Development: Generating Dynamic Content, Using Scripting Elements Implicit JSP Objects, Conditional Processing ~ Displaying Values Using an Expression to Sct an Attribute, Declaring Variables and Methods Error Handling and Debugging Sharing Data Between JSP pages, Requests, and Users Passing Control and Date between Pages ~ Sharing Session and Application Data ~ Memory Usage Considerations UNIT VIL: Database Access : Database Programming using JDBC, Studying Javax.sql.* packageAccessing 2 Database from a JSP Page, Application — Specific Database Actions,Deploying JAVA Beans in a JSP Page, Introduction to struts framework, ‘Text Books: 1, Web Programming, building internet applications, Chris Bates 2” edition, WILEY Dreamtech 2. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schilet. TMH 3. Java Server Pages ~Hans Bergsten, SPD O'Reilly 23JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef, 2005-06 Reference Books: Linternet and World Wide Web — How to program by Dietel and Nieto PHI/Pearson Education Asia. 2. Jakarta Struts Cookbook , Bill Siggelkow, $ P D O’Reilly for chap 8. 3. Murach’s beginning JAVA JDK 5, Murach, SPD 4. An Introduction to web Design and Programming —Wang-Thomson 5. Web Applications Technologies Concepts-Kauckles,John Wiley 6. Programming world wide web-Sebesta,Pearson 7. Building Web Applications-NIIT,PHI 8. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas 9. Beginning Web Programming-Jon Duckett WROX. 10, Java Server Pages, Pekowsky, Pearson.JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wie-f. 2005-(16 Ti-Semester NETWORK SECURITY AND CRYPTOGRAPHY (Elective-1) UNIT-I Introduction: ‘Attacks, Services and Mechanisms, Security attacks, Security services, A Model for Internetwork security. Classical Techniques: Conventional Encryption model, Steganography, Classical Encryption Techniques. UNITAL Modern Techniques: Symplified DES, Block Cipher Principles, Data Encryption standard, Strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of operations. Algorithms: Triple DES, International Data Encryption algorithm, Blowfish, RCS, CAST-128, RC2, Characteristics of Advanced Symmetric block cifers. UNIT-I Conventional Encryption: Placement of Encryption function, Traffic confidentiality, Key distribution, Random Number Generation. Public Key Cryptography: Principles, RSA Algorithm, Key Management, Diffie-Hellman Key exchange, Ellipt Curve Cryptograpy. UNIT-IV Number theory: Prime and Relatively prime numbers, Modular arithmetic, Fermat’s and Euler's theorems, Testing for primality, Euclid’s Algorithm, the Chinese remainder theorem, Discrete logarithms. Message authentication and Hash functions: Authentication requirements and functions, Message Authentication, Hash functions, Security of Hash functions and MACs UNIT-V Hash and Mac Algorithms: MD File, Message digest Algorithm, Secure Hash Algorithm, RIPEMD-160, HMAC. Digital signatures and Authentication protocols: Digital signatures, Authentication Protocols, Digital signature standards. UNIT-VI Authentication Applications: Kerberos, X.509 directory Authentication service. Electronic Mail Security: Pretty Good Privacy, IME. 25JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) w.e.f. 2005-06 UNIT-VIT IP Security: Overview, Architecture, Authentication, Encapsulating Security Payload, Combining security Associations, Key Management. Web Security: Web Security requirements, Secure sockets layer and Transport layer security, Secure Flectronic Transaction, UNIT-VIIL Intruders, Viruses and Worms: Intruders. Viruses and Related threats. Fire Walls: Fire wall Design Principles, Trusted systems. Text Books: 1. Cryptography and Network Security: Principles and Practice - William Stallings, Pearson Education. 2. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education. Reference Books: 1. Fundamentals of Network Security by Eric Maiwald (Dreamtech press) 2. Network Security. - Private Communication in a Public World by Charlie Kaufman, Radia Perlman and Mike Speciner, Pearson/PHI. 3. Principles of Information Security, Whitman, Thomson. 4. Network Security: The complete reference, Robert Bragg, Mark Rhodes, TMH 5. Introduction to Cryptography, Buchmann, Springer, 26JAWAHARLAL NEHRU TECHNOLOGICAL BNIVERSITY, HYDERABAD M. Tech. (Computer Science) wieL, 2005-06 U-Semester MIDDLEWARE TECHNOLOGIES (Elective - 11) UNIT-1 Introduction to client server computing: Evolution of corporate computing models from centralized to distributed computing, client server models. Benefits of client server computing, pitfalls of client server programming. UNIT-H: CORBA with Java: Review of Java concept like RMI, RMI API, JDBC. Client/Server CORBA-style, The object web: CORBA with Java. UNIT IIE: Introducing C# and the .NET Platform; Understanding NET Assemblies; Object - Oriented Programming with C#; Callback Interfaces, Delegates, and Events. UNIT IV: Building c# applications: Type Reflection, Late Binding, and Attribute-Based Programming; Object Serialization and the .NET Remoting Layer; Data Access with ADO.NET: XML Web Services. UNIT-V: Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first CORBA program, ORBlets with Applets, Dynamic CORBA-The portable count, the dynamic count multi count. UNIT-VI: Existential CORBA: CORBA initialization protocol, CORBa activation services, CORBAIDL mapping CORBA jave- to- IDL mapping, The introspective CORBA/Java object. UNIT-VI: Jaya Bean Component Model: Events, properties, persistency, Intrespection of beans, CORBA Beans UNIT-VID: EJBs and CORBA: Object transaction monitors CORBA OTM’s, EJB and CORBA OTM’s, EJB container frame work, Session and Entity Beans, The EJB client/server development Process The EJB container protocol, support for transaction EJB packaging EJB design Guidelines. Text Books: 1 Client/Server programming with Java and CORBA Robert Orfali and Dan Harkey, John Wiley & Sons SPD 2" Edition 2. Java programming with CORBA 3° Edition, G.Brose, A Vogel and K.Duddy, Wiley-dreamtech, India John wiley and sons 3. Cand the .NET Platform Andrew Troelsen, Apress Wiley-dreamtech, India Pvt LtdJAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wef. 2005-06 Reference: Books: Distributed Computing, Principles and applications, M.L.Liu, Pearson Education Client/Server Survival Guide 3° edition Robert Orfali Dan Harkey and Jeri Edwards, John Wiley & Sons Client/Server Computing DT Dewire, TMH. IBM Webspere Starter Kit Ron Ben Natan Ori Sasson, TM, New Dethi Programming C#, Jesse Liberty, SPD-O'Reilly. Cx Preciesely Peter Sestoft and Henrik I. Hansen, Prentice Hall of India Intoduction to C# Using NET Pearson Education C# How to program, Pearson Education 28JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M, Tech. (Computer Science) wel, 2005-06 I-Semester EMBEDDED SYSTEMS (Elective — 11) Unit Embedded Computing: Introduction, Complex Systems and Microprocessor, The Embedded System Design Process, Formalisms for System Design, Design Examples. Unit The 8051 Architecture : Introduction, 8051 Micro controller Hardware, Inpul/Output Ports and Circuits, External Memory, Counter and Timers, Serial data Input/Output, Interrupts. Unit BI Basic Assembly Language Programming Concepts : The Assembly Language Programming Process, Programming Tools and Techniques. Programming the 8051. Data Transfer and Logical Instructions. Unit IV Arithmetic Operations, Decimal Arithmetic. Jump and Call Instructions, Further Details 07 Interrupts. Unit-V Applications: Interfacing with Keyboards, Displays, D/A and A/D Conversions, Multiple Interrupts, Serial Data Communication. Unit VI Introduction to Real - Time Operating Systems: Tasks and Task States, Tasks and Data, Semaphores, and Shared Data; Message Queues, Mailboxes and Pipes, Timer Functions, Events, Memory Management, Interrupt Routines in an RTOS Environment Unit VIL Basic Design Using a Real-Time Operating System: Principles, Semaphores and Queues. Hard Real-Time Scheduling Considerations, Saving Memory and Power, An example RTOS like uC-OS (Open Source); Embedded Software Development Tools: Host and Target machines, Linker/Locators for Embedded Software, Getting Embedded Software into the Target System; Debugging Techniques: Testing on Host Machine, Using Laboratory Tools. An Example System. Unit VOL Introduction to advanced architectures: ARM and SHARC, Processor and memory organization and Instruction level parallelism; Networked embedded systems: Bus protocols. PC bus and CAN bus; Internet-Enabled Systems, Design Example-Blevator Controller. Text Books: 1. Computers and Components, Wayne Wolf, Elseveir. ‘The 8051 Microcontroller, Third Edition, Kenneth J.Ayala, Thomson. ‘An Embedded Software Primer, David E. Simona, Pearson Education. 29JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) wel. 2005-06 Reference Books: 1. Embedding system building blocks, Labrosse, via CMP publishers. Embedded Systems, Raj Kamal, TMH. Micro Controllers, Ajay V Deshmukhi, TMH. Embedded System Design, Frank Vahid, Tony Givargis, John Wiley. Microcontrollers, Raj kamal. Pearson Education. ween 30JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) w.e.f, 2005-06 Il-Semester NEURAL NETWORKS (Elective- 1) UNITI INTRODUCTION - what is a neural network? Human Brain, Models of a Neuron, Neural networks viewed as Directed Graphs, Network Architectures, Knowledge Representation, Artificial Intelligence and Neural Networks (p. no's | 49) UNIT LEARNING PROCESS — Error Correction learning, Memory based learning, Hebbian learing, Competitive, Boltzmann learning, Credit Asssignment Problem, Memory, Adaption, Statistical nature of the learning process, (p. no’s 50 ~116) UNIT HL SINGLE LAYER PERCEPTRONS - Adaptive filtering problem, Unconstrained Organization Techniques, Linear least square filters, least mean square algorithm, learning curves, Learning rate annealing techniques, perceptron -convergence theorem, Relation between perceptron and Bayes classifier for a Gaussian Environment (p. no’s 117 ~155) UNITIV MULTILAYER PERCEPTRON — Rack propagation algorithm XOR problem, Heuristics, Output representation and decision rule, Comuter experiment, feature detection, (p. no’s 156 -201) UNIT V BACK PROPAGATION - back propagation and differentiation, Hessian matrix, Generalization, Cross validation, Network pruning Techniques, Virtues and limitations of back propagation learning, Accelerated convergence, supervised learning, (p. no’s 202 -234) UNIT VI SELF ORGANIZATION MAPS — Two basic feature mapping models, Self organization map, SOM algorithm, properties of featare map, computer simulations, learning vector quantization, Adaptive patter classification (p. no's 443 -469, 9.1 -9.8) UNIT VIL NEURO DYNAMICS ~ Dynamical systems, stavility of equilibrium states, attractors, neurodynamical models , manipulation of attarctors as a recurrent network paradigm {p. no’s 664 ~680, 14.1 -14.6 ) UNIT Vii HOPFIELD MODELS — Hopfield models, computer experiment I (p. no’s 680- 701, 14.7 - 14.8) TEXT BOOKS: 1. Neural networks A comprehensive foundations, Simon Hhaykin, Pearson Education 2 edition 2004 REFERENCE BOOKS i 2. Artificial neurat networks - B. Vegnanarayana Prentice Hall of India P Ltd 2005 3. Neural networks in Computer intelligence, Li Min Fu TMH 2003 4. Neural networks James A Freeman David M S kapura Pearson education 2004 31JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD M. Tech. (Computer Science) weet, 2005-06 ILSemester UML LAB 1. The student should take up the case study of Unified Library application which is mentioned in the theory, and Model it in different views i.e. Use case view, logical view, component view, Deployment view, Database design, forward and Reverse Engineering, and Generation of documentation of the project. Student has to take up another case study of his/her own interest and do the same what ever mentioned in first problem. Some of the ideas regarding case studies are given in reference books, which were mentioned in theory syllabus, can be referred for some idea. 32