CSE / Pre PhD R101

Paper I - SubjectsR10PPCSG1.1 Advanced DatabasesR10PPCSG1.2 Artificial Intelligence & Soft ComputingR10PPCSG1.3 Code OptimizationR10PPCSG1.4 Data Mining & Knowledge DiscoveryR10PPCSG1.5 Digital Image ProcessingR10PPCSG1.6 Distributed ComputingR10PPCSG1.7 Distributed DatabasesR10PPCSG1.8 Distributed Operating SystemR10PPCSG1.9 ERP & Supply Chain ManagementR10PPCSG1.10 Human Computer InteractionR10PPCSG1.11 Information RetrievalR10PPCSG1.12 Multi-Media Application DevelopmentR10PPCSG1.13 Network SecurityR10PPCSG1.14 Object Oriented Software EngineeringR10PPCSG1.15 Soft ComputingCSE / Pre PhD R102R10PPCSG1.1 ADVANCED DATABASESUNIT I: Introduction:Distributed Data Processing, Distributed Databases System, promises of DDBS, Problem areas.Overview of Relational DBMS: Relational Databases Concepts, Normalization, Integrity rules, Relationaldata languages.UNIT II: Distributed DBMS Architecture:Architectural Models for Distributed DBMS, DDMBS Architecture.Distrubuted Database Design:Alternative Design Strategies, Distribution Design issues, Fragmentation, Allocation.UNIT III: Query Processing and Decomposition:Query processing Objectives, Characterization of query processors, layers of query of query processing,query decomposition, Localization of distributed data.UNIT IV: Distributed query Optimization:Query optimization, centralized query optimization, Distributed query optimization algorithms.UNIT V: Transaction Management:Definition, properties of transaction, types of transactions. Distributed concurrency control.Serialization, concurrency control Mechanism & Algorithms. Time stamped and Optimistic concurrencycontrol Algorithms, Dead lock Management.UNIT VI: Distributed DBMS Reliability:Reliability concepts and Measures, fault-tolerance in Distributed systems, failures in Distributed DBMS,local & Distributed Reliability Protocols, site failures and Network partitioning.

Parallel Database Systems: Database Series, Parallel Architecture, Parallel DBMS Techniques, Parallelexception problems, Parallel Execution for Hierarchical architecture.UNIT VII: Distributed object Database Management Systems:Fundamental object concepts and Models, Object Distributed Design, Architectural Issues, ObjectManagement, Distributed Object storage, Object query Processing.UNIT VIII: Object Oriented Data Model:Inheritance, object identity, persistent programming languages, persistence of objects, comparingODDBMS and ORDBMS.REFERENCE BOOKS1. Principles of Distributed Database Systems, 2/e, OZSU, Valduriez, Sridhar, Pearson, 20012. Distributed Databases, Stefan Seri, Pelagatti Willipse, TMH3. Database System Concepts, 5/e, Korth, Silberschatz, Sudershan, TMH4. Database Management Systems, 3/e, Raghuramakrishnan, Johhanes Gehrke, TMH5. Data Base Principles, Programming, and Performance, 2/e, P O’ Neil, E O’Neil, ElsevierCSE / Pre PhD R103R10PPCSG1.2 ARTIFICIAL INTELLIGENCE AND SOFT COMPUTINGUNIT I :Introduction:AI problems, AI technique, Problem as state space search, problem characteristics, production systems,types of production systems, Design of Search programsHeuristic search techniques: Generate and test, Hill climbing, Best first search, Problem reduction,Constraint satisfaction, Means-Ends Analysis.UNIT II: Game Playing:Minimax search procedure, adding alpha-beta cutoffs, additional refinements, Iterative deepening,Statistical Reasoning: Probability and Bayes theorem, Certainty factors and Rules based systems,Bayesian Networks, Dempster Shafer theoremUNIT III :Knowledge Representation:Theorem proving using Predicate logic, Resolution, Natural Deduction, Knowledge representation usingRules, Forward versus Backward Reasoning, Matching, Control Artificial KnowledgeKnowledge Structures: Semantic Networks, Frames, Conceptual Dependency diagrams, ScriptsUNIT IV: Planning:Components of planning system, goal stack planning, nonlinear planning using constraint posting,Hierarchical planning, Reactive systemsNatural Language Processing: Steps in NLP, Syntactic processing, Semantic analysis, Discourse andPragmatic processing, Statistical NLP, Spell checking.UNIT V: Learning:

Rote learning, learning by taking advice, learning in problem solving, Learning from examples,Explanation based learning, Discovery, Analogy, Formal learning theory, NN learning and Geneticlearning.Genetic Algorithms: survival of the fittest principle in Biology, Genetic Algorithms, Significance ofGenetic operators, termination parameters, Evolving Neural nets, Ant AlgorithmsUNIT VI :Fuzzy Set Theory:Classical & Fuzzy set theory, Interval Arithmetics, Operations on Fuzzy setsFuzzy Logic Theory: Classical logic theory, Boolean Logic, Multivalued LogicsUNIT VII :Applications of Fuzzy Logic:PQE – Decision Making Investment – ExamplesFuzzy Rule base and Fuzzy Modeling: If-Then Rules, Fuzzy Modeling: System modeling, Static fuzzysystems, Parameter IdentificationUNIT VIII:Fuzzy Control Systems:PLC, closed loop, fuzzy controllers, examples, Fuzzy PID controllers – type1 and type 2CSE / Pre PhD R104REFERENCE BOOKS:1. Intelligence, 3/e, E.Rich, K.Knight, TMH.2. Introduction to Fuzzzy Systems, Guanrong Chen, Trung Tat Pham, Chapman & Hall/CRC, 2009.3. Artificial Intelligence , A Modern Approach, 2/e, Stuart Russel, Peter Norvig, PHI/PEA.4. Artificial Intelligence, 5/e, George F Luger, PEA.5. Artificial Intelligence, 3/e, Patrick Henry Winston, PEA.6. Artificial Intelligence and Expert Systems, Patterson, PHI .7. Artificial Intelligence,A Systems Approach, Tim Jones, Infinity Science Press .CSE / Pre PhD R105R10PPCSG1.3 CODE OPTIMIZATIONUnit I: Introduction:Review of Compiler Structure, Advanced Issues in Elementary Topics, The Importance of CodeOptimization, Structure of Optimizing Compilers, Placement of Optimizations in Aggressive OptimizingCompilersUnit II: Compiler Internal Representations and Run time support:Intermediate Representations: Issues in Designing an Intermediate Language, High-Level IntermediateLanguages, Medium-Level Intermediate Languages, Low-Level Intermediate Languages, Multi-LevelIntermediate Languages, Our Intermediate Languages: MIR, HIR, and LIR, Representing MIR, HIR, and LIRin ICAN, ICAN Naming of Data Structures and Routines that Manipulate Intermediate Code, OtherIntermediate-Language Forms

Run-Time Support: Data Representations and Instructions, Register Usage, The Local Stack Frame, TheRun-Time Stack, Parameter-Passing Disciplines, Procedure Prologues, Epilogues, Calls, and Returns, CodeSharing and Position-Independent Code, Symbolic and Polymorphic Language SupportUnit III: Control Flow Analysis:Approaches to Control-Flow Analysis, Depth-First Search, Preorder Traversal, Postorder Traversal, andBreadth-First Search, Dominators, Loops and Strongly Connected Components, Reducibility, IntervalAnalysis and Control Trees, Structural AnalysisUnit IV: Data-Flow Analysis:Reaching Definitions, Basic Concepts: Lattices, Flow Functions, and Fixed Points, Taxonomy of Data-FlowProblems and Solution Methods, Iterative Data-Flow Analysis, Lattices of Flow Functions, Control-Tree-Based Data-Flow Analysis, Structural Analysis, Interval Analysis, Other Approaches, Du-Chains, Ud-Chains, and Webs, Static Single-Assignment (SSA) Form, Dealing with Arrays, Structures, and Pointers,Automating Construction of Data-Flow AnalyzersUnit V: Dependence Analysis and Optimization:Dependence Analysis and Dependence Graph: Dependence Relations, Basic-Block Dependence DAGs,Dependences in Loops, Dependence Testing, Program-Dependence GraphsIntroduction to Optimization: Flow Sensitivity and May vs. Must Information, Importance of IndividualOptimizations, Order and Repetition of OptimizationsEarly Optimizations: Constant-Expression Evaluation, Scalar Replacement of Aggregates, AlgebraicSimplifications and Reassociation, Value Numbering, Copy Propagation, Sparse Conditional ConstantPropagationUnit VI: Register Allocation:Register Allocation and Assignment, Local Methods, Graph Coloring, Priority-Based Graph Coloring,Other Approaches to Register AllocationUnit VII: Control-Flow and Low-Level Optimizations:Unreachable-Code Elimination, Straightening, If Simplifications, Loop Simplifications, Loop Inversion,Unswitching, Branch Optimizations, Dead-Code Elimination, Branch PredictionCSE / Pre PhD R106Unit VIII: Procedural/Inter-procedural Analysis and OptimizationsTail-Call Optimization and Tail-Recursion Elimination, Procedure Integration, In-Line Expansion, Leaf-Routine Optimization and Shrink WrappingInterprocedural Control-Flow Analysis: The Call Graph, Interprocedural Data-Flow Analysis,

Interprocedural Constant Propagation, Interprocedural Alias Analysis, Interprocedural Optimizations,Interprocedural Register AllocationREFERENCE BOOKS :1. Advanced Compiler Design and Implementation, Muchnick, Elsevier, 2008.2. Engineering a Compiler, Keith D Cooper, Linda Torczon, Elsevier.3. Compiler Design in C, Allen Holub, PHI, 1990.4. Compilers Principles, Techniques and Tools, Aho, Sethi, Ullman, PEA, 2006.5. Crafting a compiler with C, Charles N. Fischer, Richard J. Leblanc, Benjamin Cummings, Wesley.CSE / Pre PhD R107R10PPCSG1.4 DATA MINING AND KNOWLEDGE DISCOVERYUnit I: Introduction to Data Mining:Types of Data, Data Quality, Data Processing, Measures of Similarity and Dissimilarity,Exploring Data : Data Set, Summary Statistics, Visualization, OLAP and multi dimensional data AnalysisUnit II: Classification:Basic Concepts, Decision Trees, and model evaluation: General approach for solving a classificationproblem, Decision Tree induction, Model over fitting: Due to presence of noise, due to lack ofrepresentation samples, Evaluating the performance of classifier.Unit III: Classification-Alternative techniques:Nearest Neighborhood classifier, Bayesian Classifier, Support Vector Machines: Linear SVM, Separableand Non Separable case.Unit IV:Association Analysis:Problem Definition, Frequent Item-set generation, Rule generation, compact representation of frequentitem sets, FP-Growth Algorithms.Unit V:Handling categorical, continuous attributes, concept hierarchy, sequential, sub-graph patternsUnit VI:Overview, K-means, Agglomerative Hierarchical clustering, DBSCANUnit VII: Cluster Evaluation:Overview, Un supervised Cluster evaluation using cohesion and separation, using the proximity matrix,Scalable clustering algorithms.Unit VIII: Web Data mining:Introduction, Web terminology and characteristics, web content mining, web usage mining, webstructure mining, Search Engines: Characteristics, Functionality, Architecture, Ranking of web pages,Enterprise searchREFERENCE BOOKS :1. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar, PEA.2. Introduction to Data Mining with Case Studies, GK Gupta , Prentice Hall.

3. Data Mining: Introductory and Advanced Topics, Margaret H Dunham, PEA, 2008.4. Fundamentals of data warehouses, 2/e, Jarke, Lenzerini, Vassiliou, Vassiliadis, Springer.5. Data Mining Theory and Practice, Soman, Diwakar, Ajay, PHI, 2006.6. Data Mining, Concepts and Techniques, 2/e, Jiawei Han , Micheline Kamber , Elsevier,2006.CSE / Pre PhD R108R10PPCSG1.5 DIGITAL IMAGE PROCESSINGUnit I: Digital Image fundaments:Introduction, An image model, sampling & quantization, basic relationships between Pixels, imaginggeometry.Unit II: Image Transforms:Properties of 2 – D Fourier transform, FFT algorithm and other separable image transforms. Walshtransforms. Hadamard, Cosine, Haar, Slant transforms, KL transforms and their properties.Unit III: Image Enhancement:Background, enhancement by point processing, histogram processing, spatial filtering and enhancementin frequency domain, color image processing.Unit IV: Image filtering and restoration :Degradation model, diagnolisation of circulant and block circulate matrices, Algebraic approach torestoration, inverse filtering, least mean squares and interactive restoration, geometric transformations.Unit V: Image compression:Fundamentals, image compression modes, error free compression, lossy compression, imagecompression standards.Unit VI: Image segmentation:Detection of discontinuities, edge linking and boundary detection thresholding, region – orientedsegmentation, use of motion in segmentation.Unit VII: Representation and description:Various schemes for representation, boundary descriptors, and regional descriptors.Unit VIII: Image Reconstruction :Image reconstruction from Projections, Radon Transforms; Convolution/Filter back – Project Algorithms.REFERENCE BOOKS1. Fundamentals of Digital Image Processing, A.K.JAIN, PHI2. Fundamentals of Digital Image Processing, Anna durai, shanmuga lakshmi, Pearson3. Introduction to Digital Image Processing, Alasdair, McAndrew, Cengage4. Digital Image Processing, 3/e, GONZALEX, WOODS, Addison Wesley5. Digital Image Processing, Castleman, Pearson6. Digital Image Processing, S Jayaraman, SEsakkirajan, T Veerakumar,TMHCSE / Pre PhD R109

R10PPCSG1.6 DISTRIBUTED COMPUTINGUnit I: Introduction to distributed programming:Anatomy of a Distributed Application, Requirements for Developing Distributed Applications, WhatDoes Java Provide?Introduction to sockets programming: Sockets and Streams, URLs, URLConnections, andContentHandlers, The ClassLoaderUnit II: Distributing Objects:Why Distribute Objects?, What's So Tough About Distributing Objects?, Features of Distributed ObjectSystems, Distributed Object Schemes for Java, CORBA, Java RMI, RMI vs. CORBAThreads: Thread and Runnable, Making a Thread, Managing Threads at Runtime, Networked ThreadsUnit III: Security:Security Issues and Concerns, The java.security Package, Identities and Access Control, Keys: Public,Private, and Secret, Digital Signatures, Data Encryption, Choosing a Cryptographic AlgorithmUnit IV: Message-Passing Systems:Messages Defined, Why Do We Need Messages?, Message Processing, Fixed Protocols, AdaptableProtocols, Message Passing with Java Events, Using Remote ObjectsDatabases: An Overview of JDBC, Remote Database Applications, Multi-Database ApplicationsUnit V: RMI:The Basic Structure of RMI, The Architecture Diagram Revisited, Implementing the Basic Objects, TheRest of the Server, The Client ApplicationThe RMI Registry: Why Use a Naming Service? The RMI Registry, The RMI Registry Is an RMI Server,Examining the Registry, Limitations of the RMI Registry, Security IssuesUnit VI: Naming Services:Basic Design, Terminology, and Requirements, Requirements for Our Naming Service, Federation andThreading, The Context Interface, The Value Objects, ContextImpl, Switching Between Naming Services,The Java Naming and Directory Interface (JNDI)The RMI Runtime: Reviewing the Mechanics of a Remote Method Call, Distributed Garbage Collection,RMI's Logging Facilities, Other JVM ParametersUnit VII: Service Oriented Architecture:Introduction, Defining a Service, Defining SOA, Identifying Service Candidates, Identifying Different Kindsof Services, Modeling Services, Making a Service Composable, Supporting Your SOA Efforts, Selecting aPilot Project, Establishing GovernanceUnit VIII: Introduction to Web Services:Introduction, Using Publicly Available Web Services to Test Against, Installing Metro, Installing Oracle

WebLogic, Creating and Deploying the Simplest Web Service, Creating and Deploying a Service toWebLogic, Setting Up a Maven 2 Service and Client Project, Understanding WSDL, Using References inNetBeans to Generate Web Service Clients, Monitoring SOAP Traffic with Metro, Monitoring SOAPTraffic with TCPMonCSE / Pre PhD R1010REFERENCE BOOKS:1. Java Distributed Computing, Jim Farley, O'Reilly.2. Java RMI Designing and Building,The Basics of RMI Applications, William Grosso, O'Reilly.3. Java SOA Cookbook SOA Implementation Recipes, Tips, Techniques, Eben Hewitt, O'Reilly, 2009.4. Service Oriented Architecture With Java, Malhar Barai, Vincenzo Caselli, Binildas A. Christudas,Packt Publishing, 2008.5. Distributed Programming with Java, Qusay H. Mahmoud, Manning Publisher 2000.6. Java in Distributed Systems, Concurrency, Distribution and Persistence, Marko Boger, 2001.7. Developing Distributed and E-commerce Applications, Darrel Ince, 2/e, Wesly, 2004.8. Java Message Service (O'Reilly Java Series), Richard Monson-Haefel, David Chappell.9. Sun SL 301 Distributed Programming with Java.10. Java Tutorial, http://java.sun.com/docs/books/tutorial/index.html.CSE / Pre PhD R1011R10PPCSG1.7 DISTRIBUTED DATABASESUnit I: Introduction :Features of distributed databases, features of Centralized databases, level of distributed transparency -Reference Architecture, types of Data Fragmentation, distribution Transparency, Access primitives, andIntegrity constraints.Unit II: Distributed Database design :A frame work, the design of database fragmentation, the allocation of fragments.Unit III: Query Processing :Translation of global queries into fragment queries, query optimization.Unit IV: Distributed Transaction Management :A framework, transaction atomicity, 2-phase commit.Unit V: Concurrency control:Foundations, distributed deadlocks, timestamps.Unit VI : Reliability:Basic concepts, commit protocols, consistent view of Network, Detection and Resolution ofInconsistencies, check points and cold restart.Unit VII: Commercial Systems:

Tranclem’s ENCOMPASS Distributed database systems, IBM’s Inter system communication, feature ofdistributed ingress and Oracle.Unit VIII: Heterogeneous databases:General problems – brief study of multi base.REFERENCE BOOKS:1. Distributed Database systems Principles and Systems, Ceri S. Pelagatti. G, MGH.2. Principles of Distributed Database Systems, 2/e, M. Tamer Ozsu, Sridhar, PEA.3. Database system Concepts, 5/e,Silberschatz, F.Korth, Sundrashan,MGH,2006.4. Modern database Management, 7/e, Hoffer, Prescott, McFadden, PEA,2007.CSE / Pre PhD R1012R10PPCSG1.8 DISTRIBUTED OPERATING SYSTEMSUnit I: ProcessesTHREADS: Introduction to Threads, Threads in Distributed Systems; CLIENTS: User Interfaces, Client-SideSoftware for Distribution Transparency SERVERS: General Design Issues, Object Servers; CODEMIGRATION: Approaches to Code Migration, Migration and Local Resources, Migration inHeterogeneous Systems, Example: D'AgentsSOFTWARE AGENTS: Software Agents in Distributed Systems, Agent Technology.Unit II: Naming SystemsNAMING ENTITIES: Names, Identifiers, and Addresses, Name Resolution, The Implementation of a NameSpace, Example: DNS, X.500LOCATING MOBILE ENTITIES: Naming versus Locating Entities, Simple Solutions, Home-BasedApproaches, Hierarchical ApproachesREMOVING UNREFERENCED ENTITIES: The Problem of Unreferenced Objects, Reference Counting,Reference Listing, Identifying Unreachable Entities.Unit III: SynchronizationClock synchronization, logical clocks, global state, election algorithms, mutual exclusion, distributedtransactions.Unit IV: Consistency and ReplicationIntroduction, Data-Centric Consistency Models, Client-Centric Consistency Models, DistributionProtocols, Consistency Protocols, Examples: Orca and Causally-Consistent Lazy Replication.Unit V: Fault ToleranceIntroduction to Fault Tolerance, Process Resilience, Reliable Client-Server Communication, ReliableGroup Communication, Distributed Commit, Recovery.Unit VI: Distributed Object-Based SystemsCORBA, Distributed Com, Globe and Comparison of CORBA, DCOM, and Globe.Unit VII: Distributed File SystemsSun Network File System, Coda File System, Plan~9, XFS and SFS, Scalable Security, Comparison of

Distributed File Systems.Unit VIII: Distributed Document-Based Systems and Coordination-Based SystemsDistributed Document-Based Systems: The World Wide Web, Lotus Notes, Comparison of WWW andLotus Notes.Distributed Coordination-Based Systems: Introduction to Coordination Models, TIB/Rendezvous, JINI,Comparison of TIB/Rendezvous and JINI.CSE / Pre PhD R1013REFERENCE BOOKS:1. Distributed Systems , Principles and Paradigms, 2/e, Tanenbaum, Maarten Van Steen, PHI.2. Advanced concepts in Operating Systems, Mukesh Singhal, Niranjan G. Shivaratri, TMH, 2005.3. Distributed Operating Systems and Algorithm Analysis, Chow, Johnson, PEA4. Distributed Systems Concepts and Design, 4/e, George Coulouris, Dollimore, Kindberg, PEA.5. Distributed Operating Systems, Pradeep K. Sinha, PHI,2009.6. Operating Systems, Internals & Design Principles, 6/e, William Stallings, PEA.7. Distributed Systems Computing over Networks, Joel M.Crichlow, PHI.CSE / Pre PhD R1014R10PPCSG1.9 ERP & SUPPLY CHAIN MANAGEMENTUnit I: Introduction to ERPOverview – Benefits of ERP – ERP and Related Technologies – Business Process Reengineering – DataWarehousing – Data Mining – On–line Analytical Processing – Supply Chain Management.Unit II: ERP ImplementationImplementation Life Cycle – Implementation Methodology – Hidden Costs – Organizing Implementation– Vendors, Consultants and Users – Contracts – Project Management and Monitoring.Unit III: Business ModulesBusiness Modules in an ERP Package – Finance – Manufacturing – Human Resource – Plant Maintanance– Materials Management – Quality Management – Sales and Distribution.Unit IV: Fundamentals of Supply Chain ManagementSupply chain networks, Integrated supply chain planning, Decision phases in s supply chain, process viewof a supply chain, supply chain flows, Overview of supply chain models and modeling systems, Supplychain planning: Strategic, operational and tactical, Understanding supply chain through process mappingand process flow chart.Unit V: SCM Strategies, PerformanceSupply chain strategies, achieving strategic fit, value chain, Supply chain drivers and obstacles, StrategicAlliances and Outsourcing, purchasing aspects of supply chain, Supply chain performance measurement:

The balanced score card approach, Performance Metrics. Planning demand and supply: Demandforecasting in supply chain, Aggregate planning in supply chain, Predictable variability.Unit VI: Planning and Managing InventoriesIntroduction to Supply Chain Inventory Management. Inventory theory models: Economic OrderQuantity Models, Reorder Point Models and Multiechelon Inventory Systems, Relevant deterministic andstochastic inventory models and Vendor managed inventory models.Unit VII: Distribution ManagementRole of transportation in a supply chain - direct shipment, warehousing, cross-docking; push vs. pullsystems; transportation decisions (mode selection, fleet size), market channel structure, vehicle routingproblem. Facilities decisions in a supply chain. Mathematical foundations of distribution management,Supply chain facility layout and capacity planning.Unit VIII: Strategic Cost Management in Supply ChainThe financial impacts, Volume leveraging and cross docking, global logistics and material positioning,global supplier development, target pricing, cost management enablers, Measuring service levels insupply chains, Customer Satisfaction/Value/Profitability/Differential Advantage.CSE / Pre PhD R1015REFERENCE BOOKS:1. ERP Demystified, 2/e, Alexis Leon, TMH, 2007.2. Supply Chain Management: Strategy, Planning, Operation, Sunil Chopra, Peter Meindel, PEA,2002.3. Enterprise Resource Planning, Concepts and Planning, Vinod Kumar, Venkata Krishnan, PHI.4. Enterprise wide Resource Planning Theory and Practice, Altekar, PHI.5. Enterprise Resource Planning Concepts and Practice, 7/e, Vinod Kumar, PHI.6. Enterprise Resource Planning,Mary Sumner, PEA.7. Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies, 2/e, DavidSimchi-evi, Philip Kaminsky, Edith Simchi-Levi, TMH/Irwin, New York, 2003.8. Supply Chain Management Based on SAP Systems, Knolmayer, Mertens, Zeier, Springer.9. Supply Chain Management with APO, Thomas Dickerssbach,Springer.10. Supply Chain Management on Demand, An Fromm, Springer.11. Supply Chain Management and Advanced Planning, 2/e, Stadtler,Kilger, Springer.CSE / Pre PhD R1016R10PPCSG1.10 HUMAN COMPUTER INTERACTIONUNIT I: Introduction:

Importance of user Interface – definition, importance of good design. Benefits of good design. A briefhistory of Screen designUNIT II: The graphical user interface:Popularity of graphics, the concept of direct manipulation, graphical system, Characteristics, Web user –interface popularity, characteristics- Principles of user interface.UNIT III: Design process:Human interaction with computers, importance of human characteristics human consideration, Humaninteraction speeds, understanding business junctions.UNIT IV: Screen Designing :Design goals, Screen planning and purpose, organizing screen elements, ordering of screen data andcontent, screen navigation and flow, Visually pleasing composition, amount of information, focus andemphasis, presentation information simply and meaningfully, information retrieval on web, statisticalgraphics, Technological consideration in interface design.UNIT V: Windows:Windows new and Navigation schemes selection of window, selection of devices based and screenbased controls.UNIT VI: Components :Components text and messages, Icons and increases, Multimedia, colors, uses problems, choosingcolors.UNIT VII: Software tools :Specification methods, interface, Building Tools.UNIT VIII: Interaction Devices:Keyboard and function keys, pointing devices, speech recognition digitization and generation, imageand video displays, drivers.REFERENCE BOOKS :1. The Essential guide to user interface design, Wilbert O Galitz, Wiley DreamaTech.2. Designing the user interface. 3/e, Ben Shneidermann , PEA.3. Human Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, PEA.4. Interaction Design PRECE, ROGERS, SHARPS, Wiley Dreamtech.5. User Interface Design, Soren Lauesen , PEA.CSE / Pre PhD R1017R10PPCSG1.11 INFORMATION RETRIEVALUnit I : Introduction to Information storage and retrieval systems:Domain Analysis of IR systems, IR and other types of Information Systems, IR System EvaluationIntroduction to Data structures and algorithms related to Information Retrieval: Basic Concepts, Datastructures, Algorithms.Unit II: Inverted Files:

Introduction, Structures used in Inverted Files, Building an Inverted file using a sorted array,Modifications to the Basic Techniques.Unit III: Signature Files :Introduction, Concepts of Signature files, Compression, Vertical Partitioning, Horizontal Partitioning.Unit IV: New Indices for Text:PAT Trees and PAT Arrays: Introduction, PAT Tree structure, Algorithms on the PAT Trees, Building PATTrees as PATRICA Trees, PAT representation as Arrays.Unit V: Lexical Analysis and Stoplists:Introduction, Lexical Analysis, Stoplists.Unit VI: Stemming Algorithms:Introduction, Types of Stemming algorithms, Experimental Evaluations of Stemming, Stemming toCompress Inverted Files.Unit VII: Thesaurus Construction:Introduction, Features of Thesauri, Thesaurus Construction, Thesaurus construction from Texts, Mergingexisting Thesauri.Unit VIII: String Searching Algorithms:Introduction, Preliminaries, The Naive Algorithm, The Knutt-Morris-Pratt Algorithm, The Boyer-MooreAlgorithm, The Shift-Or Algorithm, The Karp-Rabin Algorithm.REFERENCE BOOKS1. Modern Information Retrieval,Ricardo Baeza-Yates, Neto, PEA,2007.2. Information Storage and Retrieval Systems: Theory and Implementation, Kowalski, Gerald, MarkAcademic Press, 2000.3. Information Retrieval: Algorithms and Heuristics , Grossman, Ophir Frieder, 2/e, Springer, 2004.4. Information Retrieval Data Structures and Algorithms , Frakes, Ricardo Baeza-Yates, PEA5. Information Storage and Retieval, Robert Korfhage, John Wiley & Sons.6. Introduction to Information Retrieval, Manning, Raghavan, Cambridge University Press.CSE / Pre PhD R1018R10PPCSG1.12 MULTIMEDIA AND APPLICATION DEVELOPMENTUNIT I : Fundamental concepts in Text and Image:Multimedia and hypermedia, world wide web, overview of multimedia software tools. Graphics andimage data representation graphics/image data types, file formats, Color in image and video: colorscience, color models in images, color models in video.UNIT II: Fundamental Concepts in Cideo and Digital Audio:Types of video signals, analog video, digital video, digitization of sound, MIDI, quantization andtransmission of audio.UNIT III: Action Script I:

ActionScript Features, Object-Oriented ActionScript, Datatypes and Type Checking, Classes, Authoring anActionScript Class.UNIT IV: Action Script II :Inheritance, Authoring an ActionScript 2.0 Subclass, Interfaces, Packages, Exceptions.UNIT IV: Application Development:An OOP Application Frame work, Using Components with ActionScript MovieClip Subclasses.UNIT VI: Multimedia Data Compression:Lossless compression algorithm: Run-Length Coding, Variable Length Coding, Dictionary Based Coding,Arithmetic Coding, Lossless Image Compression, Lossy compression algorithm: Quantization, TransformCoding, Wavelet-Based Coding, Embedded Zerotree of Wavelet Coefficients Set Partitioning inHierarchical Trees (SPIHT).UNIT VII: Basic Video Compression Techniques:Introduction to video compression, video compression based on motion compensation, search formotion vectors, MPEG, Basic Audio Compression Techniques.UNIT VIII: Multimedia Networks:Basics of Multimedia Networks, Multimedia Network Communications and Applications: Quality ofMultimedia Data Transmission, Multimedia over IP, Multimedia over ATM Networks, Transport ofMPEG-4, Media-on-Demand (MOD).REFERENCE BOOKS :1. Fundamentals of Multimedia , Ze-Nian Li , Mark S. Drew, PHI/PEA.2. Essentials ActionScript 2.0, Colin Moock, SPD O,REILLY.3. Digital Multimedia, Nigel chapman & jenny chapman, Wiley-Dreamtech.4. Macromedia Flash MX Professional 2004 Unleashed, PEA.5. Multimedia & Communications Technology, Steve Heath, Elsevier (Focal Press).6. Multimedia Applications, Steinmetz, Nahrstedt, Springer.CSE / Pre PhD R10197. Multimedia Basics, Weixel Thomson.8. Multimedia Technology & Applications, David Hilman , Galgotia.9. Multimedia Technologies, Banerji, Mohan Ghosh, MGH.CSE / Pre PhD R1020R10PPCSG1.13 NETWORK SECURITYUnit I: Introduction to Network Security:Attacks, services, Security. A model of Inter network Security, Steganography, One time PADS.Unit II: Basic and ESOTERIC Cryptographic Protocols:Key Exchange, Authentication, Formal Analysis of Authentication and key Exchange Protocols, Multiple& Public Key Cryptography, Secret Splitting & Sharing Secure elections, Secure multiparty,

Communication, Digital Cash.Unit III: Crypto Graphic Algorithms (Block Cipher):RC2, GOST, CAST, BLOW FISH, SAFEER, RC5, NEWDES, CRAB, Theory of Block Cipher design.Unit IV: Key Management:Key lengths, Generating Keys, Transferring, Verification, Updating, Storing, Backup, Compromised,Lifetime of, Destroying Keys, Public key Management.Unit V: Digital Signature Algorithms:Digital Signature, DSA, DSA variants, Gost, Discrete Lagorithm, One – Schnorr – Shamir digital Signatures,Esign, Cellular Automata.Unit VI: Mails:Electronic Mail & IO Security good Privacy, SIMIME, IP Security Architecture, Authentication Header,Encapsulating Security, Pay load Key Management Issues.Unit VII: Security:Web Security Web Security requirements, Secure Sockets Layer and Transport Layer Security, SecureElectronic Transaction.Unit VIII: Virus es and Threats:Intruders, Viruses, Worms and Firewalls Intruders, Viruses and Related Threats, Firewall DesignPrinciples, Trusted Systems.REFERENCE BOOKS:1. Applied Cryptography, 7/e, Bruce SCHNEIER John Wiley & Sons Inc.2. Cryptography and Network Security, William Stallings, PHI.3. Introduction to cryptography with coding Theory, 7/e, Wade Trappe, C. Washington, PEA.4. Cryptography and Information Security, V.K. Pachghare, PHI.5. Cryptography and Network Security, Forouzan, TMH, 2007.6. Cryptography and Network Security, 2/e, Kahate , TMH.7. Modern Cryptography, Wenbo Mao, PEACSE / Pre PhD R1021R10PPCSG1.14 OBJECT ORIENTED SOFTWARE ENGINEERINGUnit I: Introduction to Classical Software Engineering :Historical, Economic and Maintenance aspects. Introduction to OO Paradigm. Different phases instructured paradigm and OO Paradigm. Software Process and different life cycle models andcorresponding strengths and weaknesses.Unit II: Planning and Estimation :Estimation of Duration and Cost – COCOMO components of software. Project Management plan –one case Study.Unit III : Tools for step wised refinement :Cost - Benefit analysis, Introduction to software metrics and CASE tools. Taxonomy and scope of CASE

tools. Introduction to testing, with focus on Utility, Reliability, Robustness, Performance, Correctness.Unit IV: Modules to objects:Cohesion and Coupling, Data Encapsulation and Information hiding aspects of Objects. Inheritance,polymorphism and Dynamic Binding aspects. Cohesion and coupling of objects. Reusability, Portabilityand Interoperability aspects.Unit V: Requiement phase:Rapid Prototyping method, Specification phase - Specification Document- Formal methods of developingspecification document- Examples of other semi - formal methods of using Finite-State- Machines, Petrinets and E- Language.Unit VI: Analysis phase:Use case Modeling - Class Modeling - Dynamic Modeling, Testing during OO Analysis.Unit VII: Design phase:Data oriented design – Object Oriented design – Formal techniques for detailed design. One case study.Challenges in design phase.Unit VIII: IIM Phases:Implementation , Integration and maintenance phases- OOSE aspects in these phases.REFERENCE BOOKS1. Object oriented and Classical Software Engineering, 7/e, Stephen R. Schach, TMH2. Object oriented and classical software Engineering, Timothy Lethbridge, Robert Laganiere, TMHCSE / Pre PhD R1022R10PPCSG1.15 SOFT COMPUTINGUnit I: Introduction:Uncertainty and Evidence, Shafer Dumpster belief and possibility Theory, Random sets and massassignments, Dumpsters Rule, Fuzzy Measures and aggregation operators, Bayesian Networks. Graphicalmethods.Unit II: Automated Learning-1:Supervise vs unsupervised learning, Decision Tree induction, rule induction algorithms.Unit III: Automated Learning-2:Bayesian network learning algorithms, Evolutionary algorithms.Unit IV: Fuzzy Methods:Fuzzy set theory, fuzzy control (including model based control), Fuzzy Decision trees.Unit V: Neural Networks:Adaptive Networks, Supervised Learning NN, Reinforcement Learning, Unsupervised Learning.Unit VI: Hybrid systems:

Neuro Fuzzy Systems, Backpropagation Network supported by Fuzzy, GA based weight determinationapplications.Unit VII: Genetic Algorithms :Encoding, Fitness functions, reproduction,Fuzzy Genetic Algorithms.Unit VIII: Applications:Practical Examples from areas such as Medical, Management, and control, GA in fuzzy logic controllerdesign.REFERENCE BOOKS1. Neuro Fuzzy and Soft Computing, A Computational approach to learning and Machine, Jyh-ShingRoger Jang, Cuen Tsai Sun, Eiji Mizurani, PEA.2. Machine Learning, Tom Mitchell, MGH, 1997.3. Soft Computing Techniques and Applications, Robert John, R. Birkenhead, Ralph Birkenhead.4. Neural Networks, Fuzzy logic and genetic algorithms, S Rakasekharan, GA Vijayalakshmi, PHI.5. Principles of Soft Computing, Sivanandam, Deepa, Wiley India, 2008.6. Soft Computing and Intelligent Systems Design, Karry, De Silva, PEA, 2004.-----------------------------------CSE / Pre PhD R1023Paper II – SubjectsR10PPCSG2.1 Advanced Computer ArchitectureR10PPCSG2.2 Advanced Data Structures and AlgorithmsR10PPCSG2.3 Advanced Unix ProgrammingR10PPCSG2.4 Advances in ComputingR10PPCSG2.5 Bio-InformaticsR10PPCSG2.6 Computational GeometryR10PPCSG2.7 Computer CommunicationR10PPCSG2.8 Fault Tolerant SystemsR10PPCSG2.9 Machine LearningR10PPCSG2.10 Mobile ComputingR10PPCSG2.11 Parallel Computing and AlgorithmsR10PPCSG2.12 Pattern RecognitionR10PPCSG2.13 Scalable Parallel Computing ArchitecturesR10PPCSG2.14 Secured Data Base Application DevelopmentR10PPCSG2.15 Wireless Networks and Mobile ComputingCSE / Pre PhD R1024R10PPCSG2.1 ADVANCED COMPUTER ARCHITECTUREUnit I: Parallel Computer Models, Program and Network Properties:Parallel Computer Models: Multiprocessors and Multicomputers, Multivector and SIMD Computers,PRAM and VLSI Models, Architectural Development TracksProgram and Network Properties: Conditions of Parallelism, Program Partitioning and Scheduling,Program Flow Mechanisms, System Interconnect Architectures

Unit II: Principles of Scalable Performance:Performance Metrics and Measures, Parallel Processing Applications, Speedup Performance Laws,Scalability Analysis and ApproachesUnit III: Processors and Memory Hierarchy:Advanced Processor Technology, Superscalar and Vector Processors, Memory Hierarchy Technology,Virtual Memory TechnologyUnit IV: Bus, Cache, and Shared Memory:Backplane Bus Systems, Cache Memory Organizations, Shared-Memory Organizations, Sequential andWeak Consistency ModelsUnit V: Pipelining and Superscalar Techniques:Linear Pipeline Processors, Nonlinear Pipeline Processors, Instruction Pipeline Design, ArithmeticPipeline Design, Superscalar and Super pipeline DesignUnit VI: Multiprocessors and Multicomputers:Multiprocessor System Interconnects, Cache Coherence and Synchronization Mechanisms, ThreeGenerations of Multicomputers, Message-Passing MechanismsUnit VII: Multivector and SIMD Computers:Vector Processing Principles, Multivector Multiprocessors, Compound Vector Processing, SIMDComputer Organizations: BSP and CM2 Architectures, The Connection Machine CM-5: CM5 Architectureand Inter process communicationUnit VIII: Parallel Models, Languages, and Compilers:Parallel Programming Models, Parallel Languages and Compilers, Dependence Analysis of Data Arrays,Code Optimization and Scheduling, Loop Parallelization and PipeliningREFERENCE BOOKS1. Kai Hwang, Advanced computer Architecture: Parallelism, Scalability, Programmability, TMH,2000.2. Computer Architecture – A quantitative approach, 4/e, John L. Hennessey , David A. Patterson,Morgan Kaufmann / Elsevier, 2007.CSE / Pre PhD R10253. Parallel Computing Architecture: A hardware/ software approach , David E. Culler, Jaswinder PalSingh, Morgan Kaufmann / Elsevier, 1997.4. Computer Organization and Architecture – Designing for Performance, 7/e, William Stallings,PEa, 2006.5. Computer Organization and Design, 4/e, Patterson , Elsevier, 2008.6. Computer Architecture & Parallel Processing, Kai Hwang, Faye A. Briggs, TMHCSE / Pre PhD R1026R10PPCSG2.2 ADVANCED DATA STRUCTURES AND ALGORITHMS

Unit I: Lists, Stacks, Queues and Trees:Lists, Stacks and Queues: Abstract Data Types (ADTs), The List ADT, vector and list in the STL,Implementation of vector, Implementation of list, The Stack ADT, The Queue ADT.Trees: The Search Tree ADT - Binary Search Trees, AVL Trees, Splay Trees, B-Trees.Unit II: Hashing and Priority Queues:Hashing: General Idea, Hash Function, Separate Chaining, Hash Tables Without Linked Lists, Rehashing,Extendible HashingPriority Queues: Implementations, Binary Heap, Applications of Priority Queues, d-Heaps, Leftist Heaps,Skew Heaps, Binomial Queues.Unit III: Sorting:Sorting: A Lower Bound for Simple Sorting Algorithms, Shellsort, Heapsort, Mergesort, Quicksort,Indirect Sorting, A General Lower Bound for Sorting, Bucket Sort, External Sorting.Unit IV: The Disjoint Set Class:Equivalence Relations, the Dynamic Equivalence Problem, Basic Data Structure, Smart Union Algorithms,Path Compression, Worst Case for Union-by-Rank and Path Compression, an Application.Unit V: Graph Algorithms:Definitions, Topological Sort, Shortest-Path Algorithms, Network Flow Problems, Minimum SpanningTree, Applications of Depth-First Search, Introduction to NP-Completeness.Unit VI: Algorithm Design Techniques:Greedy Algorithms, Divide and Conquer, Dynamic Programming, Randomized Algorithms, BacktrackingAlgorithms.Unit VII: Amortized Analysis:An Unrelated Puzzle, Binomial Queues, Skew Heaps, Fibonacci Heaps, Splay Trees.Unit VIII: Advanced Data Structures and Implementation:Top-Down Splay Trees, Red-Black Trees, Deterministic Skip Lists, AA-Trees, Treaps, k-d Trees, PairingHeaps.REFERENCE BOOKS1. C & Data structures, N.B. Venkateswarulu, EV Prasad, S.Chand.2. Data Structures and Algorithm Analysis in C++, 3/e, Mark Allen Weiss, PEA , 2007.3. Data Structures Algorithms and Applications, 2/e, Sartaj Sahni, Universities Press, 2007.4. Fundamentals of computer Algorithms, 2/e, Ellis Horowitz, Sartaj Sahni, Rajasekharan,Universities Press, 2008.CSE / Pre PhD R10275. Data Structures and Algorithms, Aho, Ullman, PEA.6. Data Structures and Algorithms in JAVA, Adam drozdek, Cengage .7. Data Structures with JAVATM, Hubbard, Huray, PHI,2009.8. Data Structures, Gilberg, Forouzan, Thomson.

9. Fundamentals of Data structures algorithms and application Sartaj Sahni, University Press.CSE / Pre PhD R1028R10PPCSG2.3 ADVANCED UNIX PROGRAMMINGUNIT I: Review of Unix Utilities and Shell Programming:File handling utilities, security by file permissions, process utilities, disk utilities, networking commands,backup utilities, text processing utilities, Working with the Bourne shell, What is a shell, shellresponsibilities, pipes and input redirection, output redirection, here documents, the shell as aprogramming language, shell meta characters, shell variables, shell commands, the environment, controlstructures, shell script examples.UNIT II: Unix Files:Unix file structure, directories, files and devices, System calls, library functions, low level file access,usage of open, creat, read, write, close, lseek, stat, fstat, octl, umask, dup, dup2. The standard I/O(fopen, fclose, fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets, gets), formatted I/O, streamerrors, streams and file descriptors, file and directory maintenance (chmod, chown, unlink, link, symlink,mkdir, rmdir, chdir, getcwd), Directory handling system calls (opendir, readdir, closedir, rewinddir,seekdir, telldir)UNIT III: Unix Process:Threads and Signals: What is process, process structure, starting new process, waiting for a process,zombie process, process control, process identifiers, system call interface for process management, fork,vfork, exit, wait, waitpid, exec, system, Threads, Thread creation, waiting for a thread to terminate,thread synchronization, condition variables, cancelling a thread, threads vs. processes, Signals, Signalfunctions, unreliable signals, interrupted system calls, kill and raise functions, alarm, pause functions,abort, sleep functions.UNIT IV: Data Management:Management Memory ( simple memory allocation, freeing memory) file and record locking ( creatinglock files, locking regions, use of read/ write locking, competing locks, other commands, deadlocks).Interprocess Communication: Introduction to IPC, IPC between processes on a single computer system,IPC between processes on different systems, pipes, FIFOs, streams and messages, namespaces,introduction to three types of IPC (systemV) message queues, semaphores and shared memory.

UNIT V: Message Queues:IPC, permission issues, Access permission modes, message structure, working message queues, UnixsystemV messages, Unix kernel support for messages, Unix APIs for messages, client/server example.UNIT VI: Semaphores:Unix systemV semaphores, Unix kernel support for semaphores, Unix APIs for semaphores, file lockingwith semaphores.Shared Memory: Unix systemV shared memory, working with a shared memory segment, Unix kernelsupport for shared memory, Unix APIs for shared memory, semaphore and shared memory example.UNIT VII: Sockets:Berkeley sockets, socket system calls for connection oriented protocol and connectionless protocol,example client/server program, advanced socket system calls, socket options.CSE / Pre PhD R1029UNIT VIII: Remote Procedure Calls:RPC Model, transparency issues, sun RPC: Sun's portmap/rpcbind, RPC Authentication, Secure RPC:Secure RPC Authentication, Setting Up Secure RPC with NIS, Using Secure RPC, Limitations of RPCREFERENCE BOOKS1. Advanced Programming in the UNIX Environment, Stevens , PEA/PHI.2. Unix Network Programming, Stevens PEA/PHI.3. Advanced Unix programming, N.B. Venkateswarlu, BSP.4. Unix Concepts and Applications, 3/e, Sumitabha Das, TMH.5. Practical UNIX and Internet Security, 2/e, Simson Garfinkel, Gene Spafford, O'Reilly.CSE / Pre PhD R1030R10PPCSG2.4 ADVANCES IN COMPUTINGUNIT I: Grid Computing:Data & Computational Grids, Grid Architectures and its relations to various Distributed TechnologiesUNIT II:Autonomic Computing, Examples of the Grid Computing Efforts (IBM)UNIT III: Cluster Computing 1:Cluster setup & its Administration, Performance Models & Simulations; Networking, Protocols & I/O,Lightweight Messaging systems, Active MessagesUNIT IV: Cluster Computing 2:Distributed shared memory, parallel I/O Clusters, Jib and Resource management system, schedulingparallel jobs on clustersUNIT V:Cluster Computing 3:Load sharing and Fault tolerance manager, parallel programming scheduling techniques, Dynamic load

balancingExample Cluster System – Beowlf, COMPaS and NanOSUNIT VI: Pervasive Computing :Pervasive Computing concepts & Scenarios, Hardware & Software, Human - machine interfaceDevice connectivity, Java for Pervasive devices, Application examplesUNIT VII: Cloud Computing:History, Working of cloud computers, pros and cons of cloud computing, developing cloud services,cloud computer web based applicationsUNIT VIII: Quantum Computing :Introduction to Quantum Computing, QUbits, Quantum Mechanics, Quantum gates, Applications ofquantum computing.REFERENCE BOOKS:1. J. Joseph & C. Fellenstein, Grid Computing, PEA.2. Raj Kumar Buyya, High performance cluster computing, PEA.3. J.Burkhardt et .al, Pervasive computing, PEA.4. Vishal Sahni, Quantum computing, TMH.5. Marivesar, Approaching quantum computing, PEA.6. Neilsen & Chung L, Quantum computing and Quantum Information, Cambridge University Press.7. A networking approach to Grid Computing , Minoli, Wiley.CSE / Pre PhD R1031R10PPCSG2.5 BIO-INFORMATICSUNIT I: INTRODUCTION:The Central Dogma, The Killer Application, Parallel Universes – Watson’s Definition – Top Down VersusBottom up – Information Flow , Convergence Databases , Data Management , Data Life Cycle , DatabaseTechnology , Interfaces , ImplementationUNIT II: NETWORKS:Networks , Geographical Scope , Communication Models , Transmissions Technology , Protocols ,Bandwidth , Topology , Hardware , Contents , Security , Ownership , Implementation , ManagementUNIT III: SEARCH ENGINES:The search process , Search Engine Technology , Searching and Information Theory , Computationalmethods , Search Engines and Knowledge ManagementUNIT IV: DATA VISUALIZATION:Data Visualization , sequence visualization , structure visualization , user Interface , Animation Versussimulation , General Purpose Technologies.UNIT V: STATISTICS:Statistical concepts , Microarrays , Imperfect Data , Randomness , Variability , Approximation , InterfaceNoise , Assumptions , Sampling and Distributions , Hypothesis Testing , Quantifying Randomness , Data

Analysis , Tool selection statistics of AlignmentUNIT , VI: DATA MINING:Clustering and Classification , Data Mining , Methods , Selection and Sampling , Preprocessing andCleaning , Transformation and Reduction , Data Mining Methods , Evaluation , Visualization , Designingnew queries , Pattern Recognition and Discovery , Machine Learning , Text Mining , Tools.UNIT , VII: PATTERN MATCHING:Pairwise sequence alignment , Local versus global alignment , Multiple sequence alignment ,Computational methods , Dot Matrix analysis , Substitution matrices , Dynamic Programming , Wordmethods , Bayesian methods , Multiple sequence alignment , Dynamic Programming , Progressivestrategies , Iterative strategies , Tools , Nucleotide Pattern Matching , Polypeptide pattern matching ,Utilities , Sequence Databases.UNIT - VIII: MODELING AND SIMULATION:Drug Discovery , components , process , Perspectives , Numeric considerations , Algorithms , Hardware ,Issues , Protein structure , AbInitio Methods , Heuristic methods , Systems Biology , Tools , Collaborationand Communications , standards , Issues , Security , Intellectual property.REFERENCE BOOKS1. Bio Informatics Computing, Bryan Bergeron, PHI, 2003.2. Introduction to Bio Informatics, Attwood, Smith, Longman, 1999.CSE / Pre PhD R10323. Bio-Informatics, D Srinivasa Rao, Biotech.4. Bio Informatics Computing, Bergeron, PHI5. Bio Informatics, Managing scientific Data, Lacroix, Terence Critchlow, Elsevier6. Bio Informatics Methods and Applications, Rastogi, Mendiratta, Rastogi, PHICSE / Pre PhD R1033R10PPCSG2.6 COMPUTATIONAL GEOMETRYUnit I: Basic Geometric Concepts:Points, lines, polygons; subdivisions; arrangements; polytopes; cell complexes.Unit II: Projective Geometry :Projective Geometry-geometric transformationsUnit III: Geometric Searching:Fractional cascading; segment tree; interval tree, range tree; priority search tree. Non-orthogonal rangesearching , k-d trees - applicationsUnit IV: Point Location:Slab method; trapezoid method; chain method; bridged chain method.Unit V: Plane-Sweep Algorithms:Intersection of segments; intersection of rectangles; trapezoidation.Unit VI: Proximity:

Closest pair; furthest pair; Voronoi diagrams; triangulations. Voronoi diagrams and DelaunayTriangulations - Constructing voronoi diagram- Applications.Unit VII: Graph Drawing:Planar drawings; straight-line drawings; orthogonal drawings; polyline drawings; upward drawings;hierarchical drawings; visibility representations.UNIT VIII: Convex hulls :Preliminaries, algorithms for convex hulls-grahams scan-Jarvis march, quick hull techniques, divide andconquer methods, dynamic convex hull algorithms, convex hulls in multi-dimensions, applicationsApplications of computational geometry in web applications.REFERENCE BOOKS:1. Computational Geometry, an Introduction", 2/e, Franco P. Preparata, Michael Ian Shamos,Springer-Verlag 1988 (ISBN: 0-387-96131-3)2. Computational Geometry Algorithms and Applications, 2/e., de Berg, van Kreveld, Overmars,and Schwarzkopf (Springer-Verlag, 2000).3. Graph Drawing, Algorithms for the Visualization of Graphs, Giuseppe Di Battista, Peter Eades,Roberto Tamassia, Ioannis G. Tollis, Prentice-Hall 1999 (ISBN: 0-13-301615-3)4. Computational Geometry in C , 2/e, Joseph O'Rourke, Cambridge University PressCSE / Pre PhD R1034R10PPCSG2.7 COMPUTER COMMUNICATIONSUnit I: Introduction :Network Hardware reference model – Transmission media – Narrowband ISDN – Broad band ISDN –ATM.Unit II: Data Link Layer :The data Link layer – Design Issues – Error detection and correction – Elementary Data Link Protocols –Sliding window protocols – Data link layer in HDLC, Internet and ATM.Unit III: Channel Allocation Methods and Standards:Channel allocation methods – TDM, FDM, ALOHA, Carrier sense Multiple access protocols, Collision Freeprotocols – IEEE standard BO2 for LANS – Ethernet, Token Bus, Token ring – Bridges.Unit IV: Network Layer :NETWORK LAYER Routing Algorithms – Shortest path, Flooding, Flow based Distance vector, Link state,Hierarchical, Broadcast routing, Congestion Control algorithms-General principles of congestion control,Congestion prevention polices, Choke packets and Load shedding.Unit V: INTERNETWORKING :Tunneling, internetworking, Fragmentation, network layer in the internet – IP protocols, IP address,Subnets, Internet control protocols, DSPF, BOP, Internet multicasting, Mobile IP. Network layer in the

ATM Networks – cell formats, connection setup, routing and switching, service categories, and quality ofservice, ATM LANs.Unit VI: Transport Layer :The Transport Layer Elements of transport protocols – addressing, establishing a connection, releasingconnection, flow control and buffering and crash recovery, END TO END PROTOCOLS – UDP, reliable ByteStream (TCP) end to end format, segment format, connection establishment and termination, slidingwindow revisited, adaptive retransmission, TCP extension, Remote Procedure Call – BLAST, CHAN,SELECT, DCE.Unit VII: Application Layer :Application Layer – Network Security – Cryptographic Algorithms – DES, RSA. Security Mechanisms –Authentication Protocols, Firewalls.Unit VIII: Application Layer (contd) :Application Layer – Name service (DNS) Domains Hierarchy, Name servers. Traditional Applications –SMTP, MIME, World Wide Web – HTTP, Network Management – SNMP.REFERENCE BOOKS1. COMPUTER NETWORKS, Andrew Tanenbaum, 3/e, PHI.CSE / Pre PhD R10352. COMPUTER NETWORKS – A SYSTEM APPROACH – Larry L. Peterson, Bruce S. Davie, 2/e,Harcourt Asia PTE LTD.3. Data Communication and Networking, 4/e, Forouzan, TMH4. An engineering approach to computer networking, Kesav, PEA5. Data and Computer Communications, 8/e, Stallings, PHI6. Computer communication and networking technologies, Gallo, Hancock, Cengage7. Understanding data communications, 7/e, Held, PEA8. Communication Networks, 2/e, Leon-Garcia, TMHCSE / Pre PhD R1036R10PPCSG2.8 FAULT TOLERANT SYSTEMSUnit I: Preliminaries:Fault Classification, Types of Redundancy, Basic Measures of Fault Tolerance, Hardware Fault Tolerance,The Rate of Hardware Failures, Failure Rate, Reliability, and Mean Time to Failure, Canonical andResilient Structures , Other Reliability Evaluation TechniquesUnit II: Information Redundancy :Information Redundancy, Coding, Resilient Disk Systems, Data Replication, Voting: HierarchicalOrganization, Primary-Backup Approach, Algorithm-Based Fault ToleranceUnit III: Fault-Tolerant Networks:Measures of Resilience, Common Network Topologies and Their Resilience, Fault-Tolerant Routing

Unit IV: Software Fault Tolerance:Acceptance Tests, Single-Version Fault Tolerance, N-Version Programming, Recovery Block Approach,Preconditions, Postconditions, and Assertions, Exception-Handling, Software Reliability Models, Fault-Tolerant Remote Procedure CallsUnit V: Checkpointing:What is Checkpointing? , Checkpoint Level, Optimal Checkpointing-An Analytical Model, Cache-AidedRollback Error Recovery (CARER), Checkpointing in Distributed Systems, Checkpointing in Shared-Memory Systems, Checkpointing in Real-Time SystemsUnit VI: Case Studies:NonStop Systems, Stratus Systems, Cassini Command and Data Subsystem, IBM G5, IBM Sysplex,ItaniumUnit VII:Fault Detection in Cryptographic Systems: Overview of Ciphers, Security Attacks Through Fault Injection,CountermeasuresUnit VIII: Simulation Techniques:Writing a Simulation Program, Parameter Estimation, Variance Reduction Methods, Random NumberGeneration, Fault InjectionREFERENCE BOOK:1. Fault Tolerant Systems, Israel koren, Mani Krishna, Elsevier, 20072. Fault Tolerant and Fault testable hardware design, Lala, BSP3. Reliablity of Computer systems and networks( Fault Tolerance, analysis and Design), Martin LShooman, Willey4. FaultTolerant computer system Design, DK Pradhan(Ed), PHI, 19965. Software Fault tolerance Techniques and implementation, LL Pullam, Architect House6. Reliable computer systems: Design and evaluation, siewiorek, swarz,AK Peters7. Probability and statistics with reliability queuing and computer science applications, John wiley.8. An Introduction to reliability and maintainability Engineering, Ebeling, MGHCSE / Pre PhD R1037R10PPCSG2.9 MACHINE LEARNINGUNIT I: Introduction :Well-posed learning problems, Designing a learning system, Perspectives and issues in machine learningConcept learning and the general to specific ordering – Introduction, A concept learning task, Conceptlearning as search, Find-S: finding a maximally specific hypothesis, Version spaces and the candidateelimination algorithm, Remarks on version spaces and candidate elimination, Inductive bias.UNIT II: Decision Tree learning:

Introduction, Decision tree representation, Appropriate problems for decision tree learning, The basicdecision tree learning algorithm, Hypothesis space search in decision tree learning, Inductive bias indecision tree learning, Issues in decision tree learningUNIT III: Artificial Neural Networks:Introduction, Neural network representation, Appropriate problems for neural network learning,Perceptions, Multilayer networks and the back propagation algorithm, Remarks on the back propagationalgorithm, An illustrative example face recognitionAdvanced topics in artificial neural networksEvaluation Hypotheses : Motivation, Estimation hypothesis accuracy, Basics of sampling theory, Ageneral approach for deriving confidence intervals, Difference in error of two hypotheses, Comparinglearning algorithmsUNIT IV: Bayesian learning:Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum likelihood and leastsquared error hypotheses, Maximum likelihood hypotheses for predicting probabilities, Minimumdescription length principle, Bayes optimal classifier, Gibs algorithm, Naïve bayes classifier, An examplelearning to classify text, Bayesian belief networks The EM algorithmUNIT V: Computational learning theory :Introduction, Probability learning an approximately correct hypothesis, Sample complexity for FiniteHypothesis Space, Sample Complexity for infinite Hypothesis Spaces, The mistake bound model oflearning - Instance-Based Learning- Introduction, k -Nearest Neighbor Learning, Locally WeightedRegression, Radial Basis Functions, Case-Based Reasoning, Remarks on Lazy and Eager LearningUNIT VI: Genetic Algorithms :Motivation, Genetic Algorithms, An Illustrative Example, Hypothesis Space Search, GeneticProgramming, Models of Evolution and Learning, Parallelizing Genetic AlgorithmsUNIT VII: Learning Sets of Rules:Introduction, Sequential Covering Algorithms, Learning Rule Sets: Summary, Learning First Order Rules,Learning Sets of First Order Rules: FOIL, Induction as Inverted Deduction, Inverting ResolutionAnalytical Learning : Introduction, Learning with Perfect Domain Theories: Prolog-EBG Remarks onExplanation-Based Learning, Explanation-Based Learning of Search Control KnowledgeCSE / Pre PhD R1038UNIT VIII : Combining Inductive and Analytical Learning:

Motivation, Inductive-Analytical Approaches to Learning, Using Prior Knowledge to Initialize theHypothesis, Using Prior Knowledge to Alter the Search Objective, Using Prior Knowledge to AugmentSearch Operators,Reinforcement Learning : Introduction, The Learning Task, Q Learning, Non-Deterministic, Rewards andActions, Temporal Difference Learning, Generalizing from Examples, Relationship to DynamicProgrammingREFERENCE BOOK:1. Machine Learning ,Tom M. Mitchell, MGH2. Machine Learning, An Algorithmic Perspective, Stephen Marsland, Taylor & Francis(CRC)3. Introduction to Machine Learning, Ethem Alpaydin, PHI, 2004CSE / Pre PhD R1039R10PPCSG2.10 MOBILE COMPUTINGUnit 1: Introduction to Mobile Communications and Computing:Mobile Computing (MC): Introduction to MC, novel applications, limitations, and architecture GSM:Mobile services, System architecture, Radio interface, Protocols, Localization and calling, Handover,Security, and New data services.Unit II: (Wireless) Medium Access Control:Motivation for a specialized MAC (Hidden and exposed terminals, Near and far terminals), SDMA, FDMA,TDMA, CDMA.Unit III: Mobile Network Layer:Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement anddiscovery, registration, tunneling and encapsulation, optimizations), Dynamic Host ConfigurationProtocol (DHCP).Unit IV: Mobile Transport Layer:Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery, Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP.Unit V: Database Issues:Hoarding techniques, caching invalidation mechanisms, client server computing with adaptation, powerawareand context-aware computing, transactional models, query processing, recovery, and quality ofservice issues.Unit VI: Data Dissemination:Communications asymmetry, classification of new data delivery mechanisms, push-based mechanisms,pull-based mechanisms, hybrid mechanisms, selective tuning (indexing) techniques.Unit VII: Mobile Ad hoc Networks (MANETs):

Overview, Properties of a MANET, spectrum of MANET applications, routing and various routingalgorithms, security in MANETs.Unit VIII: Protocols and Tools:Wireless Application Protocol-WAP. (Introduction, protocol architecture, and treatment of protocols ofall layers), Bluetooth (User scenarios, physical layer, MAC layer, networking, security, link management)and J2ME.CSE / Pre PhD R1040REFERENCE BOOKS:1. Mobile Communications, 2/e, Jochen Schiller, 2004, Addison-Wesley.2. Handbook of Wireless Networks and Mobile Computing, Stojmenovic , Cacute, Wiley, 20023. Mobile Computing Principles, Designing and Developing Mobile Applications with UML and XML,Reza Behravanfar, Cambridge, University Press, 2004.4. Fundamentals of Mobile and Pervasive Computing, Adelstein, Frank, Gupta, Sandeep KS.Richard Golden , Schwiebert, Loren, TMH , 2005.5. Principles of Mobile Computing, 2/e, Hansmann, Merk, Nicklous, Stober, Springer, 2003.6. Mobile and Wireless Design Essentials, Martyn Mallick, Wiley DreamTech, 20037. Mobile Computing, Rajkamal, Oxford, 20088. Adhoc Wireless Networks, 2/e, Sivaram murthy, manoj, PEA, 2009CSE / Pre PhD R1041R10PPCSG2.11 PARALLEL COMPUTING & ALGORITHMSUNIT I: Introduction:Computational demand in various application areas, advent of parallel processing,terminologypipelining,Data parallelism and control parallelism-Amdahl’s law. Basic parallel random access MachineAlgorithms-definitions of P, NP and NP-Hard, NP-complete classes of sequential algorithms-NC –class forparallel algorithms.UNIT II:Organizational features of Processor Arrays,Multi processors and multicomputers.Mapping andscheduling aspects of algorithms. Mapping into meshes and hyper cubes-Load balancing-List schedulingalgorithm Coffman-graham scheduling algorithm for parallel processors.UNIT III:Elementory Parallel algorithms on SIMD and MIMD machines, Analysis of these algorithms. MatrixMultiplication algorithms on SIMD and MIMD models.UNIT IV:Fast Fourier Transform algorithms. Implementation on Hyper cube architectures. Solving linear file -

system of equations, parallelizing aspects of sequential methods back substitution and Tri diagonal.UNIT V:Parallel sorting methods---Odd-even transposition Sorting on processor arrays.Biotonic –merge sort onshuffle –exchange ID –Array processor,2D-Mesh processor and Hypercube Processor Array.UNIT VI:Parallel Quick-sort on Multi processors. Hyper Quick sort on hypercube multi computers. Parallel searchoperations. Ellis algorithm and Manber and ladner’s Algorithms for dictionary operations.UNIT VII:Parallel algorithms for Graph searching—All Pairs shortest paths and minimum cost spanning tree.UNIT VIII:Parallelization aspects of combinatorial search algorithms with Focus on Branch and Bound Methods andAlpha-beta Search methods.REFERENCE BOOKS:CSE / Pre PhD R10421. Parallel computing theory and practice, MICHAEL J.QUINN2. Programming Parallel Algorithms, Guy E. Blelloch, Communications of the ACM3. Algorithms for Parallel processing, Michael T Heath, Abhiram Ranade, Schreiber(Ed), Springer.4. Handbook of Parallel Computing Models, algorithms and applications, SamgithevarRajasekharan, John Reif(Ed), Taylor and Franics group.5. Parallel Processing and Parallel Algorithms: Theory and Computation, Seyed H. Roosta, SpringerCSE / Pre PhD R1043R10PPCSG2.12 PATTERN RECOGNITIONUNIT I : Introduction:Basic concepts, Applications, Fundamental problems in pattern Recognition system design, Designconcepts and methodologies, Examples of Automatic Pattern recognition systems, Simple patternrecognition model.UNIT II: Decisions and Distance Functions:Linear and generalized decision functions, Pattern space and weight space, Geometrical properties,implementations of decision functions, Minimum-distance pattern classifications.UNIT III: Probability - Probability of events:Random variables, Joint distributions and densities, Movements of random variables, Estimation ofparameter from samples. STATISTICAL UNIT - IV: DECISION MAKING - Introduction, Baye’s theorem,

Multiple features, Conditionally independent features, Decision boundaries, Unequal cost of error,estimation of error rates, the leaving-one-out-techniques, characteristic curves, estimating thecomposition of populations. Baye’s classifier for normal patterns.UNIT V: Non Parametric Decision Making:Introduction, histogram, kernel and window estimation, nearest neighbour classification techniques.Adaptive decision boundaries, adaptive discriminant functions, Minimum squared error discriminantfunctions, choosing a decision making techniques.UNIT VI: Clustering and Partitioning:Hierarchical Clustering: Introduction, agglomerative clustering algorithm, the single-linkage, completelinkageand average-linkage algorithm. Ward’s method Partition clustering-Forg’s algorithm, K-means’salgorithm, Isodata algorithm.UNIT VII: Pattern Preprocessing and Feature selection:Introduction, distance measures, clustering transformation and feature ordering, clustering in featureselection through entropy minimization, features selection through orthogonal expansion, binaryfeature selection.UNIT VIII: Syntactic Pattern Recognition and Application of Pattern Recognition:Concepts from formal language theory, formulation of syntactic pattern recognition problem, syntacticpattern description, recognition grammars, automata as pattern recognizers, Application of patternrecognition techniques in bio-metric, facial recognition, IRIS scon, Finger prints, etc.,REFERENCES BOOKS:1. Pattern recognition and Image Analysis, Gose. Johnsonbaugh Jost, PHI.2. Pattern Recognition Principle, Tou. Rafael. Gonzalez, Pea.3. Pattern Classification, Richard duda, Hart., David Strok, Wiley.CSE / Pre PhD R1044R10PPCSG2.13 SCALABLE PARALLEL COMPUTING ARCHITECTURESUnit I: Parallel Computer Models, Program and Network Properties:Parallel Computer Models: Multiprocessors and Multicomputers, Multivector and SIMD Computers,PRAM and VLSI Models, Architectural Development TracksProgram and Network Properties: Conditions of Parallelism, Program Partitioning and Scheduling,Program Flow Mechanisms, System Interconnect Architectures.Unit II: Principles of Scalable Performance:Performance Metrics and Measures, Parallel Processing Applications, Speedup Performance Laws,Scalability Analysis and Approaches.Unit III: Processors and Memory Hierarchy:Advanced Processor Technology, Superscalar and Vector Processors, Memory Hierarchy Technology,

Virtual Memory Technology.Unit IV: Bus, Cache, and Shared Memory:Backplane Bus Systems, Cache Memory Organizations, Shared-Memory Organizations, Sequential andWeak Consistency Models.Unit V: Pipelining and Superscalar Techniques:Linear Pipeline Processors, Nonlinear Pipeline Processors, Instruction Pipeline Design, ArithmeticPipeline DesignSuperscalar and Superpipeline DesignUnit VI: Multiprocessors and Multicomputers:Multiprocessor System Interconnects, Cache Coherence and Synchronization Mechanisms, ThreeGenerations of Multicomputers, Message-Passing Mechanisms.Unit VII: Multivector and SIMD Computers:Vector Processing Principles, Multivector Multiprocessors, Compound Vector Processing, SIMDComputer Organizations: BSP and CM2 Architectures, The Connection Machine CM-5: CM5 Architectureand Inter process communication.Unit VIII: Parallel Models, Languages, and Compilers:Parallel Programming Models, Parallel Languages and Compilers, Dependence Analysis of Data Arrays,Code Optimization and Scheduling, Loop Parallelization and Pipelining.REFERENCE BOOKS:1. Advanced computer Architecture,Parallelism, Scalability, Programmability. Kai Hwang, TMH2. Computer Architecture,A quantitative approach, 4/e, John L. Hennessey , David A. Patterson,Morgan Kaufmann / Elsevier, 2007.CSE / Pre PhD R10453. Parallel Computing Architecture, A hardware/ software approach , David E. Culler, JaswinderPal Singh, Morgan Kaufmann / Elsevier, 1997.4. Computer Organization and Architecture, Designing for Performance, 7/e, William Stallings,Pearson, 2006.5. Computer Organization and Design, 4/e, Patterson , Hennessy Elsevier India, 2008.6. Computer Architecture & Parallel Processing, Kai Hwang, Faye A. Briggs, TMH.7. Parallel programming, 2/e, Wikinson, Allen, Pea.CSE / Pre PhD R1046R10PPCSG2.14 SECURED DATABASE APPLICATIONS DEVELOPMENTUnit I: Security Architecture:Introduction, Security, Information Systems, Database management systems, Information security,Information security Architecture, database security, Asset types and their value, Security methods.

Unit II: Operating System Security Fundamentals:Introduction, operating systems overview, security environment, components, Authentication methods,user administration, password policies, Vulnerabilities of operating systems, E- Mail security.Unit III: Administration of Users :Introduction, user authentication, operating system authentication, creating/removing/modifying users,default/remote users, Database links, Linked servers, remote servers.Unit IV: Profiles, Password Policies, Privileges, and Roles:Introduction, Defining and using profiles, Designing and implementing password policies, Granting andrevoking user privileges, creating, Assigning and revoking user roles.Unit V: Database Application Security Models :Introduction, Types of users, security models, application types, application security models and Dataencryption.Unit VI: Virtual Private Databases (VPD):Introduction, Overview, implementing a VPD using views and application context. Implementing oracleVPD, Viewing VPD policies and application context using: data dictionary, policy manager, implementingrow and column level security with SQL server.Unit VII: Database Auditing Models, Application Data Auditing:Database Auditing Models: Introduction, Auditing overview, environment, process, objectives,classification and types, benefits and side effects of auditing.Application Data Auditing: Introduction, DML auction auditing architecture. Triggers, fine grainedauditing, DML statement audit trail and auditing application errors with Oracle.Unit VIII: Auditing Database Activities, Security and Auditing Project Cases:Auditing Database Activities: Introduction, usage of database activities, creating DLL triggers, auditingdatabase activities with oracleSecurity and Auditing project cases: Introduction, case study for developing an online database, takingcare of payroll, tracking database changes and developing a secured authentication repositoryCSE / Pre PhD R1047REFERENCE BOOKS:1. Database Security and Auditing, Hassan Afyouni, Cengage Learning, 20072. Database Security, S. Castano, M. Fugini, G. Martella, P. Samarati, Addison-Wesley, 19943. Implementing Database Security and Auditing, RonBen Natan: Elsevier, Indian reprint, 20064. Principles of Distributed Database Systems, Prentice Hall,2/e, M.TamerÖzsu, Patrick Valdureiz5. Database Security, Castano, Fugini, Addison Wesley6. The security Audit and control of Databases, Clark, Holloway, List, UK:Ashgate.

7. Security and Audit of Database System, Douglas, Blackwell(UK)8. Database security and Integrity, Fernandez, Summers, Wood, Addison WesleyCSE / Pre PhD R1048R10PPCSG2.15 WIRELESS NETWORKS AND MOBILE COMPUTINGUNIT I : INTRODUCTION TO MOBILE AND WIRELESS LANDSCAPE:Definition of Mobile and Wireless, Components of Wireless Environment, Challenges, Overview ofWireless Networks, Categories of Wireless Networks, Wireless LAN : Infra red Vs radio transmission,Infrastructure and Ad-hoc Network, IEEE 802.11, HIPERLAN, Bluetooth.UNIT II: GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS (GSM):GSM Architecture, GSM Entities, Call Routing in GSM, PLMN Interfaces, GSM Addresses and Identifiers,Network Aspects in GSM, GSM Frequency Allocation, Authentication and Security.UNIT III: MOBILE NETWORK LAYER:Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement anddiscovery, registration, tunneling and encapsulation, optimizations), Dynamic Host ConfigurationProtocol (DHCP), Mobile Ad-hoc networks : Routing, destination Sequence Distance Vector, DynamicSource Routing.UNIT IV: MOBILE TRANSPORT LAYER:Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery,Transmission/time-out freezing, Selective retransmission, Transaction oriented TCP.UNIT V: BROADCAST SYSTEMS:Overview, Cyclical repetition of data, Digital audio broadcasting: Multimedia object transfer protocol,Digital video broadcasting: DVB data broadcasting, DVB for high-speed internet access, Convergence ofbroadcasting and mobile communications.UNIT VI : PROTOCOLS AND TOOLS:Wireless Application Protocol-WAP. (Introduction, protocol architecture, and treatment of protocols ofall layers), Bluetooth (User scenarios, physical layer, MAC layer, networking, security, link management)and J2ME.UNIT - VII: WIRELESS LANGUAGE AND CONTENT – GENERATION TECHNOLOGIES:Wireless Content Types, Markup Languages: HDML, WML, HTML, cHTML, XHTML, VoiceXML.Content- Generation Technologies: CGI with Perl, Java Servlets, Java Server Pages, Active Server Pages,XML with XSL Stylesheets, XML Document, XSL StylesheetUNIT - VIII: MOBILE AND WIRELESS SECURITY:Creating a Secure Environment, Security Threats, Security Technologies, Other Security Measures, WAPSecurity, Smart Client SecurityCSE / Pre PhD R10

49REFERENCE BOOKS:1. Mobile Communications, 2/e, Jochen Schiller, PEA, 2008.2. Mobile and Wireless Design Essentials, Martyn Mallick, Wiley, 2008.3. Mobile Computing, Asoke K Talukder, et al,, MGH, 2008.4. Mobile Computing,Raj Kamal,Oxford .5. Wireless Communications & Networks, 2/e, William Stallings, PEA, 2007.6. Fundamentals of Mobile and Pervasive Computing, Frank Adelstein et al, TMH, 2005.7. Wireless Networks first-step, Jim Geier, PEA, 2005.8. 2.5G Mobile Networks: GPRS and EDGE, Sumit Kasera et al, TMH, 2008.9. 802.11 Wireless Networks,2/e, Matthew S.Gast, O’Reilly, 2006.10. Handbook of Wireless Networks and Mobile Computing, Ivan Stojmenovic , Wiley, 2007.CSE / Pre PhD R1050Subjects for other branches(Two Subjects from this list is Compulsoryfor students of Non- Computer Science and Engineering background)R10PPCSG3.1 Neural NetworksR10PPCSG3.2 Advanced Problem SolvingR10PPCSG3.3 Artificial IntelligenceR10PPCSG3.4 Compiler DesignR10PPCSG3.5 Computer GraphicsR10PPCSG3.6 Computer System DesignR10PPCSG3.7 Data base management systemsR10PPCSG3.8 Formal Languages and Automata TheoryR10PPCSG3.9 Design and Analysis of AlgorithmsR10PPCSG3.10 Mathematical Foundation for Computer ScienceR10PPCSG3.11 Object Oriented Analysis and DesignR10PPCSG3.12 Operating systemsR10PPCSG3.13 Programming LanguagesR10PPCSG3.14 Software EngineeringR10PPCSG3.15 Java & Web TechnologiesCSE / Pre PhD R1051R10PPCSG3.1 NEURAL NETWORKSUNIT I: INTRODUCTION:- what is a neural network? Human Brain, Models of a Neuron, Neural networks viewed as DirectedGraphs, Network Architectures, Knowledge Representation, Artificial Intelligence and Neural NetworksUNIT II : LEARNING PROCESS 1:Error Correction learning, Memory based learning, Hebbian learingUNIT III: LEARNING PROCESS 2:Competitive, Boltzmann learning, Credit Asssignment Problem, Memory, Adaption, Statistical nature ofthe learning processUNIT IV :SINGLE LAYER PERCEPTRONS:

Adaptive filtering problem, Unconstrained Organization Techniques, Linear least square filters, leastmean square algorithm, learning curves, Learning rate annealing techniques, perceptron –convergencetheorem, Relation between perceptron and Bayes classifier for a Gaussian EnvironmentUNIT V: MULTILAYER PERCEPTRON:Back propagation algorithm XOR problem, Heuristics, Output representation and decision rule,Comuter experiment, feature detectionUNIT VI :BACK PROPAGATION:Back propagation and differentiation, Hessian matrix, Generalization, Cross validation, Network pruningTechniques, Virtues and limitations of back propagation learning, Accelerated convergence, supervisedlearning.UNIT VII:SELF ORGANIZATION MAPS:Two basic feature mapping models, Self organization map, SOM algorithm, properties of feature map,computer simulations, learning vector quantization, Adaptive patter classification, Hierechel Vectorquantilizer, contexmel MapsUNIT VIII:NEURO DYNAMICS:Dynamical systems, stavility of equilibrium states, attractors, neurodynamical models , manipulation ofattarctors as a recurrent network paradigm, Hopfield modelsREFERENCE BOOKS:1. Neural networks A comprehensive foundations,2/e, Simon Haykin, PEA.2. Artifical neural networks , Yegnanarayana, P HI3. Neural networks in Computer intelligence, Li Min Fu, TMH4. Neural networks, James ,A Freeman, David M S kapura, PEA5. Neural Networks A Classroom Approach, Satish Kumar, TMH6. Neural Networks and Fuzzy Systems, Bart Kosko, PHICSE / Pre PhD R1052R10PPCSG3.2 Advanced Problem SolvingUnit I: Introduction:Basic concepts, Abstact Data Types, Data structures, Algorithms, Characteristics of Algorithms,Performance analysis, Time complexity and Space complexity, Asymptotic Analysis, Big O, Omega andTheta notations.Unit II: Linear data structures :The List ADT, Array and Linked Implementations, Singly Linked Lists-Operations-Insertion,Deletion,Traversals,DoublyLinkedLists-Operations-Insertion,Deletion,SkipLists-implementation,StackADT, definitions, operations, Array and Linked implementations, applications-infix to postfixconversion, recursion implementation, tail recursion, nontail recursion, indirect recursion, QueueADT,

definitions and operations ,Array and Linked Implementations, Priority Queue ADT, Deque ADT,Implementation using doubly linked listsUnit III: Non Linear data structures:Trees-Basic Terminology, Binary tree ADT,array and linked representations,iterative traversals,threadedbinary trees,Applications-Disjoint-Sets,Union and Find algorithms,Huffman coding,General tree to binarytree conversion, Realizing a Priority Queue using Heap.Unit IV : Search TreesBinary Search Tree ADT, Implementation, Operations- Searching, Insertion and Deletion, BalancedSearch trees-AVL Trees, Operations – Insertion and Searching,B-Trees, B-Tree of order m,Operations-Insertion,Deletion and Searching,Introduction to Red-BlackTrees, Splay Trees,B*-Trees,B+-Trees(Elementary treatement), Comparison of Search Trees,TreesUnit V: Searching:Linear Search,Binary Search, Hashing-Hash functions,Collision-Handling schemes,Hashing injava.util,Dictionary ADT,Linear list representation,Skip list representation,Hash tablerepresentation,Comparison of Searching methods.Unit VI: Sorting:Sorting- Bubble Sort,Insertion Sort,Shell sort,Heap Sort,Radix Sort,Quick sort,Merge sort, Comparison ofSorting methods,Sorting in java.util.Unit VII: Graphs:Basic Terminology, Graph Representations- Adjacency matrix,Adjacency lists,Adjacency multilists,Graphtraversals- DFS and BFS, Spanning trees-Minimum cost spanning trees,Kruskal’s Algorithm for Minimumcost Spanning trees, Shortest paths- Single Source Shortest Path Problem,All Pairs Shortest PathProblem.Unit VII: Pattern Matching:Text Processing - Pattern matching algorithms- The Knuth-Morris-Pratt algorithm,The Boyer-Moorealgorithm,Tries- Standard Tries, Compressed Tries, Suffix tries.REFERENCE BOOKS :CSE / Pre PhD R10531. Data structures , Algorithms and Applications in Java,S.Sahani, Universities Press.2. Data structures and Algorithms in Java,Adam Drozdek,Cengage Learning.3. Data structures and Algorithms in Java,Michael T.Goodrich and R.Tomassia , Wiley.4. Data structures and algorithms in Java,Robert Lafore,PEA.5. Data structures with Java,W.H.Ford and W.R.Topp,PEA.6. Classic Data structures in Java,T.Budd,PEA.7. Data Structures using Java,D.S. Malik and P.S.Nair, Cengage .8. An Introduction to Data structures and Algorithms,J.A.Storer,Springer.

9. Data structures and Java Collections Frame Work,W.J.Collins,MGH.10. Data structures with Java,J.R.Hubbard and A.Huray,PHI.11. Data Structures using Java,Y.Langsam,M.Augenstein,A.Tanenbaum, PEA.12. Data structures with Java,J.R.Hubbard,Schaum’s Outlines,TMH13. Problem solving with C, A. Jones, Harrow, Cengage14. Problem solving and Program Design in C, 5/e, Hanly, Koffman, PEA,15. Problem solving and Programming concepts, 7/e, Maureen Sprankle, PEA16. Problem solving With C++, 6/e, Walter Savitch, PEACSE / Pre PhD R1054R10PPCSG3.3 ARTIFICIAL INTELLIGENCEUNIT I:Introduction :AI problems, foundation of AI and history of AI intelligent agents: Agents and Environments, the conceptof rationality, the nature of environments, structure of agents, problem solving agents, problemformulation.UNIT II : Searching: Searching for solutions, uniformed search strategies – Breadth first search, depthfirst search, Depth limited search, Iterative deepening depth first search bi-direction search -comparison. Search with partial information (Heuristic search) Greedy best first search, A* search,Memory bounded heuristic search, Heuristic functions.UNIT III: Searching(Contd.) :Local search Algorithms, Hill climbing, simulated, annealing search, local beam search, geneticalalgorithms. Constrain satisfaction problems: Backtracking search for CSPs local search for constraintsatisfaction problems.UNIT IV :Game Playing: Adversial search, Games, minimax, algorithm, optimal decisions in multiplayergames, Alpha-Beta pruning, Evaluation functions, cutting of search.UNIT V: Knowledge Representation:Knowledge – Based Agents, the Wumpus world, logic, propositional logic, Resolution patterns in proposional logic, Resolution, Forward & Backward. Chaining.UNIT VI: Reasoning :First order logic. Inference in first order logic, propositional Vs. first order inference, unification & liftsforward chaining, Backward chaining, Resolution.UNIT VII: Planning :Classical planning problem, Language of planning problems, Expressiveness and extension, planning withstate – space search, Forward states spare search, Backward states space search, Heuristics for statsspace search. Planning search, planning with state space search, partial order planning Graphs.UNIT VIII: Learning

Forms of learning, Induction learning, Learning Decision Tree, Statistical learning methods, learning withcomplex data, learning with Hidden variables – The EM Algorithm, Instance Based learning, NeuralNetworks.REFERENCE BOOKS:1. Artificial Intelligence – A Modern Approach. 2/e, Stuart Russel, Peter Norvig, PHI/PEA.2. Artificial Intelligence, 3/e, Patrick Henry Winston., PEA.3. Artificial Intelligence , E.Rich , K.Knight, 2/e, TMH.4. Artificial Intelligence and Expert Systems , Patterson PHI.5. Expert Systems: Principles and Programming, 4/e, Giarrantana/ Riley, Thomson.6. PROLOG Programming for Artificial Intelligence. Ivan Bratka, 3/e, PEA.7. Artificial Inteligence , Lugar, 5/e, PEA.8. Artificial Inteligence, Winston, 3/e, PEA.9. Artificial Inteligence ,Negnevitsky, 2nd ed, PEA.10. Artificial Inteligence, Nelson, ElsevierCSE / Pre PhD R1055R10PPCSG3.4 COMPILER DESIGNUNIT I : Overview of Compilation:Phases of Compilation – Lexical Analysis, Regular Grammar and regular expression for commonprogramming language features, pass and Phases of translation, interpretation, bootstrapping, datastructures in compilation – LEX lexical analyzer generator.UNIT II : Parsing:Context free grammars, Top down parsing – Backtracking, LL (1), recursive descent parsing, Predictiveparsing, Preprocessing steps required for predictive parsing.Bottom up parsing: - Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handlingambiguous grammar, YACC – automatic parser generator.UNIT III : Semantic analysis:Intermediate forms of source Programs – abstract syntax tree, Attributed grammars, Syntax directedtranslation, Conversion of popular Programming languages language Constructs into Intermediate codeforms, Type checker.UNIT IV : Symbol Tables:Symbol table format, organization for block structured languages, hashing, tree structuresrepresentation 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 V : 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 bygraph coloring, Evaluation of code generation techniques Preprocessing the intermediate code, postprocessing the target code, machine code generation.UNIT VI : Code optimization:Consideration for Optimization, Machine dependent and machine independent code optimization, Scopeof Optimization, local optimization, loop optimization, frequency reduction, folding, DAGrepresentation.UNIT VII : Data flow analysis:Dataflow Analysis, Intermediate representation for flow analysis , Various dataflow analyses ,Transformations using dataflow analysis Speeding up dataflow analysis , Alias analysis.UNIT VIII : Loop Optimizations:Dominators, Loop-invariant computations, Induction variables, Array bounds checks, Loop unrollingREFERENCE BOOKS :1. Principles of compiler design -A.V. Aho . J.D.Ullman; Pearson Education2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley dreamtech.3. Advanced Compiler Design Implementation, S.S.Muchnick,Elsevier.4. Compilers principles ,techniques and tools A.V.Aho,Ravi Sethi& J.D. Ullman; Pearson ed.,5. lex &yacc – John R. Levine, Tony Mason, Doug Brown, O’reillyCSE / Pre PhD R10566. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge University Press.7. Engineering a Compiler-Cooper & Linda, Elsevier.8. Compiler Construction, Louden, Thomson..CSE / Pre PhD R1057R10PPCSG3.5 COMPUTER GRAPHICSUNIT I : Introduction :Application areas of Computer Graphics, overview of graphics systems, video-display devices, raster-scansystems, random scan systems, graphics monitors and work stations and input devicesUNIT II : Output primitives :Points and lines, line drawing algorithms, mid-point circle and ellipse algorithms.Filled area primitives:Scan line polygon fill algorithm, boundary-fill and flood-fill algorithmsUNIT III : 2-D geometrical transforms : Translation, scaling, rotation, reflection and sheartransformations, matrix representations and homogeneous coordinates, composite transforms,transformations between coordinate systems.

UNIT IV : 2-D viewing :The viewing pipeline, viewing coordinate reference frame, window to view-port coordinatetransformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland–Hodgeman polygon clipping algorithmUNIT V : 3-D object representation :Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Splinecurves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods.UNIT VI : 3-D Geometric transformations :Translation, rotation, scaling, reflection and shear transformations, composite transformations.3-D viewing : Viewing pipeline, viewing coordinates, view volume and general projection transforms andclippingUNIT VII : Visible surface detection methods :Classification, back-face detection, depth-buffer, scan-line, depth sorting, BSP-tree methods, area subdivisionand octree methodsUNIT VIII : Computer animation :Design of animation sequence, general computer animation functions, raster animation, computeranimation languages, key frame systems, motion specificationsReference Books:1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson.2. Computer Graphics Principles & practice, 2/ed, Foley, VanDam, Feiner, Hughes, Pearson.3. Computer Graphics, second Edition, Donald Hearn and M.Pauline Baker, PHI.4. Computer Graphics Second edition, Zhigand xiang, Roy Plastock, Schaum’s outlines, TMH.5. Procedural elements for Computer Graphics, 2/e, David F Rogers, TMH.6. Principles of Interactive Computer Graphics, Neuman , Sproul, TMH.7. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.8. Computer Graphics, Steven Harrington, TMH.9. Advanced Graphics programming using OpenGL, Mc Reynoldsm, Blythe, Elsevier.CSE / Pre PhD R1058R10PPCSG3.6 COMPUTER SYSTEMS DESIGNUNIT I : Computer structure:Hardware, software, system software, Von-neumann architecture – case study. IA -32 Pentium: registersand addressing, instructions, assembly language, program flow control, logic and shift/rotateinstructions, multiply, divide MMX,SIMD instructions, I/O operations, subroutines.UNIT II : Input/Output organizaton :Input/Output organizaton, interrupts, DMA, Buses, Interface circuits, I/O interfaces, device drivers inwindows, interrupt handlers

UNIT III : Processing Unit:Execution of a complete instruction, multiple bus organization, hardwired control, micro programmedcontrol.Unit IV :Pipelining:Data hazards, instruction hazards, influence on instruction sets, data path & control consideration, RISCarchitecture introduction.UNIT V : Memory:Types and hierarchy, model level organization, cache memory, performance considerations, mapping,virtual memory, swapping, paging, segmentation, replacement policies.UNIT VI: Processes and Threads:Processes, threads, inter process communication, classical IPC problems, Deadlocks.UNIT VII : File system:Files, directories, Implementation, Unix file systemUnit VIII : Security:Threats, intruders, accident data loss, basics of cryptography, user authentication.REFERENCE BOOKS:1. Computer Organization , 5/e, Carl Hamacher, Zvonks Vranesic, SafeaZaky, , MGH.2. Modern Operating Systems, 2/e, Andrew S Tanenbaum, PEA/PHI3. Computer Organization and Architecture , 6/e, William Stallings, PEA/PHI4. Computer System Architecture , 3/e, Morris Mano ,PEA .5. Operating System Principles, 7/e, Silberchatz, B. Galvin, Gagne, John Wiley6. Operating Systems , Internals and Design Principles , 5/e, Stallings ,PEA/PHI7. Computer System Architecture, Rao, PHI8. Computer Systems Organisation and Structure, Carpinelle, PEA9. Computer Architecture, Joseph, Dumas II,Tailor & FrancisCSE / Pre PhD R1059R10PPCSG3.7 DATABASE MANAGEMENT SYSTEMSUnit I: Introduction:Data base System Applications, data base System VS file System – View of Data – Data Abstraction –Instances and Schemas , data Models , the ER Model , Relational Model , Other Models , DatabaseLanguages , DDL , DML , database Access for applications Programs , data base Users and Administrator ,Transaction Management , data base System Structure , Storage Manager , the Query Processor , Historyof Data base Systems. Data base design and ER diagrams , Beyond ER Design Entities, Attributes andEntity sets , Relationships and Relationship sets , Additional features of ER Model , Concept Design withthe ER Model , Conceptual Design for Large enterprises.Unit II: Relational Model:Introduction to the Relational Model , Integrity Constraint Over relations , Enforcing Integrityconstraints, Querying relational data , Logical data base Design , Introduction to Views , Destroying

/altering Tables and Views.Relational Algebra and Calculus: Relational Algebra , Selection and projection set operations , renaming, Joins , Division , Examples of Algebra overviews , Relational calculus , Tuple relational Calculus , Domainrelational calculus , Expressive Power of Algebra and calculus.Unit III: SQL :Form of Basic SQL Query , Examples of Basic SQL Queries , Introduction to Nested Queries , CorrelatedNested Queries Set , Comparison Operators , Aggregative Operators , NULL values , Comparison usingNull 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.Unit IV: Database Design :Schema refinement , Problems Caused by redundancy , Decompositions , Problem related todecomposition , reasoning about FDS , FIRST, SECOND, THIRD Normal forms , BCNF , Lossless joinDecomposition , Dependency preserving Decomposition , Schema refinement in Data base Design , Multivalued Dependencies , forth Normal Form.Unit V: Transaction Management :Overview of Transaction Management: ACID Properties , Transactions and Schedules , ConcurrentExecution of transaction , Lock Based Concurrency Control , Performance Locking , Transaction Supportin SQL , Introduction to Crash recovery.Unit VI: Concurrency Control:Serializability, and recoverability , Introduction to Lock Management , Lock Conversions , Dealing withDead Locks , Specialized Locking Techniques , Concurrency without Locking. Crash recovery: Introductionto ARIES , the Log , Other Recovery related Structures , the Write-Ahead Log Protocol , Check pointing ,re3covering from a System Crash , Media recovery , Other approaches and Interaction with Concurrencycontrol.CSE / Pre PhD R1060Unit VII: Storage and Indexing :Overview of Storage and Indexing: Data on External Storage , File Organization and Indexing , ClusterIndexes, Primary and Secondary Indexes , Index data Structures , Hash Based Indexing , Tree baseIndexing , Comparison of File Organizations , Indexes and Performance Tuning.Unit VIII: Query Evaluation :Overview of Query Evaluation: The System Catalogue , Introduction to Operator Evaluation , Algorithm

for Relational Operations. Tree Structured Indexing: Intuitions for tree Indexes , Indexed SequentialAccess Methods (ISAM) , B+ Trees: A Dynamic Index Structure. Hash Based Indexing: Static Hashing ,Extendable hashing , Linear Hashing , Extendable vs. Liner hashing.Reference Books:1. Data base Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, TMH2. Data base System Concepts, 4/e, Silberschatz, Korth, TMH3. Introduction to Database Systems, 8/e, C.J.Date, PEA4. Database systems Concepts desing and applications, Singh, PEA5. Data base Systems design, Implementation, and Management,5/e, Rob , Coronel, Thomson6. Data base Management System, 5/e, Elmasri Navathe, PEA,7. Database Management System, Connolly Begg, PEA8. Database Management systems, Farcia-Molina Ullman Widom, PEA9. Database Management Systems, Majumdr, Bhattacharyya, TMH ,9610. Database System Concepts, Peter ROB,Coronel, Ceneage.CSE / Pre PhD R1061R10PPCSG3.8 FORMAL LANGUAGES AND AUTOMATA THEORYUNIT I : Fundamentals :Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton model,acceptance of strings, and languages, deterministic finite automaton and non deterministic finiteautomaton, transition diagrams and Language recognizers.UNIT II: Finite Automata :NFA with Î transitions - Significance, acceptance of languages. Conversions and Equivalence : Equivalencebetween NFA with and without Î transitions, NFA to DFA conversion, minimisation of FSM, equivalencebetween two FSM’s, Finite Automata with output- Moore and Melay machines.UNIT III: Regular Languages:Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regularexpressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular sets,closure properties of regular sets (proofs not required).UNIT IV: Grammar Formalism :Regular grammars-right linear and left linear grammars, equivalence between regular linear grammarand FA, inter conversion, Context free grammar, derivation trees, sentential forms. Right most andleftmost derivation of strings.UNIT V: Context Free Grammars :Ambiguity in context free grammars. Minimisation of Context Free Grammars. Chomsky normal form,Greibach normal form, Pumping Lemma for Context Free Languages. Enumeration of properties of CFL

(proofs omitted).UNIT VI: Push Down Automata :Push down automata, definition, model, acceptance of CFL, Acceptance by final state and acceptance byempty state and its equivalence. Equivalence of CFL and PDA, inter conversion. (Proofs not required).Introduction to DCFL and DPDA.UNIT VII:Turing Machine : Turing Machine, definition, model, design of TM, Computable functions, recursivelyenumerable languages. Church’s hypothesis, counter machine, types of Turing machines (proofs notrequired).UNIT VIII:Computability Theory : Chomsky hierarchy of languages, linear bounded automata and context sensitivelanguage, LR(0) grammar, decidability of, problems, Universal Turing Machine, undecidability of posts.Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NPhard problems.CSE / Pre PhD R1062Reference Books:1. Introduction to Automata Theory Languages & Computation, 3/e, Hopcroft, Ullman, PEA2. Introduction to Theory of Computation, 2/e, Sipser, Thomson3. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.4. Introduction to languages & the Theory of Computation ,John C Martin, TMH5. Elements of Theory of Computation, Lewis H.P, Papadimition C.H., PEA6. Theory of Computer Science, Automata languages and computation , 2/e, Mishra, Chandrashekaran, PHI7. Introduction to Languages & Machines,3/e,Thomas A.Sudkamp,Pearson, 20078. Theory of Computation, Sivanandam, IKI9. Formal Languages Automata theory and Computation ,PEA10. Fundamental of theory of Computation, Greenlaw, Hoover, ElsvierCSE / Pre PhD R1063R10PPCSG3.9 DESIGN AND ANALYSIS OF ALGORITHMSUNIT I : Introduction: Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Spacecomplexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation andLittle oh notation,Probabilistic analysis, Amortized analysis.UNIT II :Disjoint Sets:Disjoint set operations, union and find algorithms, spanning trees, connected components andbiconnected components.UNIT III : Divide and conquer:

General 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 knapsackproblem, 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 knapsackproblem, All pairs shortest path problem,Travelling sales person problem, Reliability design.UNIT VI : Backtracking:General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltoniancycles.UNIT VII : Branch and Bound:General method, applications - Travelling sales person problem,0/1 knapsack problem- LC Branch andBound solution, FIFO Branch and Bound solution.UNIT VIII : NP-Hard and NP-Complete problems:Basic concepts, non deterministic algorithms, NP - Hard and NPComplete classes, Cook’s theorem.REFERENCES BOOKS :1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni,Rajasekharam,Galgotia.2. Algorithm Design: Foundations, Analysis and Internet examples, Goodrich, Tomassia,John wiley3. An Introduction to data structures and algorithms, James Storer, Springer4. Introduction to Algorithms, 2/e, T.H.Cormen,C.E.Leiserson, R.L.Rivest,and C.Stein,PHI /PEA5. Introduction to Design and Analysis of Algorithms A strategic approach, Lee, S.S.Tseng,R.C.Chang, T.Tsai, Mc Graw Hill.6. Data structures and Algorithm Analysis in C++, 2/e, Allen Weiss, , PEA .7. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,PEA8. Algorithms, Richard Johnson baugh, Marcus Schaefer, PEA9. Design and analysis of algorithms, Panner Selvan, PHI10. Algorithms, Johnsonbaugh, Schaefer, PEACSE / Pre PhD R1064R10PPCSG3.10 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCEUnit I: Mathematical Logic:Statements and notations, Connectives, Well formed formulas, Truth Tables, tautology, equivalenceimplication, Normal forms, Theory of inference for the statement calculusUnit II:Inference and Predicate Calculus :Rules of inference, Consistency of premises and indirect method of proof, Automatic Theorem ProvingPredicate calculus: Predicates, statement functions, variables and quantifiers, predicate formulas, free &bound variables, universe of discourse, inference theory of predicate calculus

Unit III: Set theory & Relations:Introduction, Relations and ordering, Properties of binary Relations, Equivalence, CompatibilityRelations, Partial ordering, Hasse diagram.Functions: composition of functions, Inverse Function, Recursive Functions, Lattice and its Properties,Pigeon hole Principles and its application.Unit IV: Algebraic structures:Algebraic systems, Examples and general properties, Semi groups and monoids, groups, sub groups,Definitions, Examples, homomorphism, Isomorphism and related problems.Unit V: Elementary Combinatorics:Basis of counting, Enumeration of Combinations & Permutations, Enumerating of Combinations &Permutations with repetitions and constrained repetitions, Binomial Coefficients, Binomial Multinomialtheorems, principles of Inclusion , Exclusion.Unit VI: Recurrence Relations:Generating Function of Sequences, Calculating Coefficient of generating functions, Recurrence relations,Solving recurrence relation by substitution and Generating functions, The method of Characteristicroots, Solution of Inhomogeneous Recurrence Relation.Unit VII: Tree:Basic Concepts, Spanning Trees, BFS, DFS, Kruskals Algorithm, Binary trees, Planar GraphsUnit VIII: Graph Theory and Applications:Representation of Graph, Isomorphism and Sub graphs, Multi graphs and Euler circuits, Hamiltoniangraphs, Chromatic NumbersReference Books:1. Discrete Mathematical Structures with Applications to computer science, Tremblery, Manohar,TMH.2. Discrete Mathematical for computer Scientists & Mathematicians, Molt, Kandel , Baker, PHI.3. Elements of Discrete Mathematics, 3/e, C L Liu, D P Mohanpatra, TMH.CSE / Pre PhD R10654. Discrete Mathematics, 2/e, JK Sharma, Macmillan5. Discrete Mathematics, Schaum’s Outlines, Lipschutz, Lipson TMH.6. Discrete Mathematical Structures, 6 /e, Kolman, Busby, Ross, PHI, 2009.7. Discrete Mathematics, 6 /e, Johnsonbaugh, Pearson, 2005.8. Discrete Mathematics, 6 / e, Malik, Sen, Cengage Learning, 2004.9. Discrete Mathematics for computer science, Bogart, Stein , Drysdale, Springer, 2005.10. Discrete Mathematics and Combinatorics, Sengadir, Pearson, 2009.11. Discrete and Combinatorial Mathematics, 5 /e, Grimaldi, Ramana, Pearson, 2006.12. Discrete Mathematics, 2 /e, J K Sharma, Macmillan, 2005.

13. Discrete Mathematics with Graph Theory, 3/e, Edgar G. Goodaire, Michael M.Parmenter, PHI.14. Discrete Mathematics, Veerarajan, TMHCSE / Pre PhD R1066R10PPCSG3.11 OBJECT ORIENTED ANALYSIS AND DESIGN USING UMLUnit I: Introduction to UML:The meaning of Object-Orientation, object identity, encapsulation, information hiding, polymorphism,genericity, importance of modeling, principles of modeling, object oriented modeling, conceptual modelof the UML, Architecture.Unit II: Basic structural Modeling:Classes, relationships, common mechanisms, diagrams, Advanced structural modeling: advancedrelationships, interfaces, types & roles, packages, instances.Unit III: Class & object diagrams:Terms, concepts, examples, modeling techniques, class & Object diagrams.Unit IV: Collaboration diagrams:Terms, Concepts, depicting a message, polymorphism in collaboration diagrams, iterated messages, useof self in messages.Unit V: Sequence diagrams:Terms, concepts, differences between collaboration and sequence diagrams, depicting synchronousmessages with/without priority call back mechanism broadcast message.Unit VI: Behavioral Modeling:Interactions, use cases, use case diagrams, activity diagrams.Unit VII: Advanced Behavioral Modeling:Events and signals, state machines, processes & threads, time and space, state chart diagrams.Unit VIII: Architectural Modeling:Terms, concepts, examples, modeling techniques for component diagrams and deployment diagrams.Reference books:1. The Unified Modeling Language User Guide, Grady Booch, Rambaugh, Ivar Jacobson, PEA2. Fundamentals of Object Oriented Design in UML, Meilir Page-Jones, Addison Wesley3. Object oriented Analysis& Design Using UML, Mahesh ,PHI4. The Unified Modeling Language Reference Manual, 2/e, Rambaugh, Grady Booch,etc., PEA5. Head First Object Oriented analysis & Design, Mclaughlin,SPD OReilly6. Object Oriented analysis & Design, Satzinger, Jackson, Thomson7. Object Oriented analysis Design & implementation, Dathan.,Ramnath, University Press8. Object Oriented analysis & Design, John Deacon, PEA9. Fundamentals of Object Oriented analysis and Design in UML, M Pages-Jones, PEA10. Object-Oriented Design with UML, Barclay,Savage,Elsevier,2008CSE / Pre PhD R10

67R10PPCSG3.12 OPERATING SYSTEMSUnit I: Introduction:Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage Management, Protection andSecurity, Distributed Systems, Special-Purpose Systems, Computing EnvironmentsOperating System Structure: Operating-System Services, User Operating-System Interface, System Calls,System Programs, Operating-System Design and Implementation, Operating-System Structure, VirtualMachinesUnit - II: Process Management - 1Processes: Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication,Examples of IPC Systems, Communication in Client-Server SystemsThreads: Overview, Multithreading Models, Thread Libraries, Java Threads, Threading Issues, OSExamplesUnit - III: Process Management - 2CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple-ProcessorScheduling, Thread Scheduling, Operating System ExamplesProcess Synchronization: Background, The Critical-Section Problem, Peterson’s Solution,Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors, AtomicTransactionsUnit - IV: DeadlocksSystem Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock.Unit - V: Memory ManagementMain Memory: Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table,SegmentationVirtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement, Allocation of Frames,Thrashing, Memory-Mapped FilesUnit - VI: Storage Management - 1File-System Interface:Concept, Access Methods, Directory Structure, File-System Mounting, File Sharing,ProtectionFile-System Implementation: File-System Structure, Implementation, Directory Implementation,Allocation Methods, Free-Space Management, Efficiency and Performance, Recovery, Log-Structured FileSystems, NFSUnit - VII: Storage Management - 2

Mass-Storage Structure: Overview, Disk Structure, Disk Attachment, Disk Scheduling, Disk and Swap-Space Management, RAID Structure, Stable-Storage Implementation, Tertiary-Storage StructureCSE / Pre PhD R1068I/O Systems: Overview, I/O Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/ORequests to Hardware Operations, STREAMS, PerformanceUnit - VIII: Protection and SecurityProtection: Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix,Implementation of Access Matrix, Access Control, Revocation of Access Rights, Capability-Based Systems,Language-Based ProtectionSecurity: The Security Problem, Program Threats, System and Network Threats, Cryptography as aSecurity Tool, User Authentication, Implementing Security Defenses, Firewalling to Protect Systems andNetworks.Reference Books:1. Operating System Concepts, 7/e, Abraham Silberschatz, Galvin, John Wiley .2. Operating systems, 6/e, William Stallings, PHI/PEA.3. Operating Systems, 3/e, Dietal, Dietal, PEA4. Operating Systems, 2/e, Dhamdhere, TMH.5. An introduction to Operating Systems, Concepts and practice, Pramod Chandra P. Bhat, PHI.6. Operating systems, Elmasri, Carrick, Levine, TMH.7. Operating Systems, 3/e, Nutt, Chaki, Neogy, PEA.8. Operating systems, Brian L.Stuart, Cengage.9. Operating systems, Haldar, Aravind, PEA.CSE / Pre PhD R1069R10PPCSG3.13 PROGRAMMING LANGUAGESUnit I: Introduction:The Art of Language Design, Programming Language Spectrum, Why Study Programming Languages?Compilation and Interpretation, Programming Environments, Overview of CompilationProgramming Language Syntax: Specifying Syntax: Regular Expressions and Context-Free Grammars,Scanning, Parsing, Theoretical FoundationsUnit II: Names, Scopes, and Bindings:The Notion of Binding Time, Object Lifetime and Storage Management, Scope Rules, ImplementingScope, The Meaning of Names within a Scope, The Binding of Referencing Environments, MacroExpansion, Separate CompilationUnit III: Semantic Analysis:

The Role of the Semantic Analyzer, Attribute Grammars, Evaluating Attributes, Action Routines, SpaceManagement for Attributes, Decorating a Syntax TreeUnit IV: Control Flow:Expression Evaluation, Structured and Unstructured Flow, Sequencing, Selection, Iteration, Recursion,Non determinacyUnit V: Data Types:Type Systems, Type Checking, Records (Structures) and Variants (Unions), Arrays, Strings, Sets, Pointersand Recursive Types, Lists, Files and Input/ Output, Equality Testing and AssignmentUnit VI: Subroutines and Control Abstraction:Review of Stack Layout, Calling Sequences, Parameter Passing, Generic Subroutines and Modules,Exception Handling, Coroutines, EventsConcurrency: Concurrent Programming Fundamentals, Implementing Synchronization, Language-LevelMechanisms, Message PassingRun-time Program Management: Late Binding of Machine Code, Inspection/IntrospectionUnit VII: Data Abstraction and Object Orientation:Object-Oriented Programming, Encapsulation and Inheritance, Initialization and Finalization, DynamicMethod Binding, Multiple InheritanceUnit VIII: Functional Languages: Functional Programming Concepts, A Review/Overview of Scheme,Evaluation Order Revisited, Higher-Order Functions, Theoretical FoundationsLogic Languages: Logic Programming Concepts, Prolog, Theoretical Foundations, Logic Programming inPerspectiveCSE / Pre PhD R1070REFERENCE BOOKS:1. Programming Language Pragmatics, 3/ e, Michael Scott, Morgan Kaufmann2. Essentials of Programming Languages, FriedMan, Wand, 3/ e, PHI3. Concepts of Programming languages, Sebesta, 8/ e, PEA4. Programming language design concepts, David A Watt, Wiley5. Fundamentals of Programming languages, Horowitz, Galgotia6. Programming Languages ,Louden, 2 /e, Thomson.7. Programming languages ,Ghezzi, 3/e, John Wiley8. Programming Languages Design and Implementation , 4/e Pratt , Zelkowitz, PHICSE / Pre PhD R1071R10PPCSG3.14 SOFTWARE ENGINEERINGUNIT I : Introduction 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 teamprocess models.UNIT II : Process models :The waterfall model, Incremental process models, Evolutionary process models, The Unified process.Software Requirements : Functional and non-functional requirements, User requirements, Systemrequirements, Interface specification, the software requirements document.UNIT III : Requirements engineering process :Feasibility studies, Requirements elicitation and analysis, Requirements validation, Requirementsmanagement.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 VI : Testing Strategies : A strategic approach to software testing, test strategies for conventionalsoftware, 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 forsource code, Metrics for testing, Metrics for maintenance.UNIT VII : Metrics for Process and Products :Software Measurement, Metrics for software quality.Risk management : Reactive vs. Proactive Risk strategies, software risks, Risk identification, Riskprojection, Risk refinement, RMMM, RMMM Plan.UNIT VIII : Quality Management :Quality concepts, Software quality assurance, Software Reviews, Formal technical reviews, StatisticalSoftware quality Assurance, Software reliability, The ISO 9000 quality standards.Reference Books:1. Software Engineering, Roger S.Pressman , 7/e, MGH.2. Software Engineering ,8/e, Sommerville, PEA,3. Software Engineering, A Precise approach, Pankaj Jalote, Wiley4. Software Engineering, Kassem A. Saleh, Cengage.CSE / Pre PhD R10725. Software Engineering, Kelkar, PHI6. Software Engineering, Sanjan Mathew, S. Chand

7. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill Companies8. Software Engineering- K.K. Agarwal & Yogesh Singh, New Age International Publishers9. Software Engineering, James ,PHI10. Software Engineering concepts, R Fairley, TMHCSE / Pre PhD R1073R10PPCSG3.15 WEB TECHNOLOGIESUnit I: IntroductionIntroduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java ScriptUnit II: XML:Document type definition, XML Schemas, Document Object model, Presenting XML, Using XMLProcessors: DOM and SAXUnit III: Java Beans:Introduction to Java Beans, Advantages of Java Beans, BDK; Introspection, Using Bound properties, BeanInfo Interface, Constrained properties; Persistence, Customizes, Java Beans API, Introduction to EJB’sUnit IV: Web Servers: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 V: Introduction to JSP:The Problem with Servelet. The Anatomy of a JSP Page, JSP Processing. JSP Application Design with MVCSetting Up and JSP Environment: Installing the Java Software Development Kit, Tomcat Server & TestingTomcatUnit VI: JSP Application Development:Generating Dynamic Content, Using Scripting Elements Implicit JSP Objects, Conditional Processing –Displaying Values Using an Expression to Set an Attribute, Declaring Variables and Methods ErrorHandling and Debugging Sharing Data Between JSP pages, Requests, and Users Passing Control and Datebetween Pages – Sharing Session and Application Data – Memory Usage ConsiderationsUnit VII: Database Access:Database Programming using JDBC, Studying Javax.sql.* package,Accessing a Database from a JSP Page,Application – Specific Database Actions, Deploying JAVA Beans in a JSP Page, Introduction to strutsframework.Unit VIII: Online Applications:

Simple applications – On–line Databases – Monitoring User Events – Plug–ins – Database connectivity –Internet Information Systems – EDI application in business – Internet commerce – Customization ofInternet commerce.Reference Books1. Web Programming, building internet applications, 2/e, Chris Bates, Wiley Dreamtech2. The complete Reference Java 2 ,5/e, Patrick Naughton , Herbert Schildt. TMH3. Java Server Pages,Hans Bergsten, SPD O’Reilly4. Internet , World Wide Web , How to program, Dietel , Nieto, PHI/PEA5. Jakarta Struts Cookbook , Bill Siggelkow, S P D O’Reilly6. Web Tehnologies, 2/e, Godbole, kahate, TMH,202,7. An Introduction to web Design , Programming ,Wang,Thomson8. Web Applications Technologies Concepts-Knuckles, John Wiley9. Programming world wide web-Sebesta, PEACSE / Pre PhD R107410. Building Web Applications-NIIT, PHI11. Web Warrior Guide to Web Programmming,Bai/Ekedaw,Thomas12. Beginning Web Programming,Jon Duckett,WROX.13. Java Server Pages, Pekowsky, PEA.14. Web programming by Bai, Ekedahl, Farrell,Cengage.