IT 701: DATA MINING & DATA WAREHOUSING Teaching Scheme Lect 3 Prac 2 Total 3 Int Ass 30 Theory Sem

End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 100

Data Mining Introduction: Basics of data mining, related concepts, Data mining techniques. Data Mining Algorithms: Classification, Clustering, Association rules. Knowledge Discovery : KDD Process Visualisation : Data generalization and summarization-based characterization, Analytical characterization: analysis of attribute relevance. Mining Class Comparisons: Discriminating between different classes, Mining descriptive statistical measures in large databases Data Mining Primitives, Languages, And System Architectures: Data mining primitives, Query language, Designing GUI based on a data mining query language, Architectures of data mining systems Application And Trends In Data Mining: Applications, Systems products and research prototypes, Additional themes in data mining, Trends in data mining Overview And Concepts: Need for data warehousing, Basic elements of data warehousing, Trends in data warehousing. Architecture And Infrastructure: Architectural components, Infrastructure and metadata. Data Design And Data Representation: Principles of dimensional modeling, Dimensional modeling advanced topics, data extraction, transformation and loading, data quality. Information Access And Delivery: Matching information to classes of users, OLAP in data warehouse, Data warehousing and the web. Implementation And Maintenance: Physical design process, data warehouse deployment, growth and maintenance.

Reference Books: 1. 2. 3. 4. 5. 6. Data Warehousing Fundamentals By Paulraj Ponniah, John Wiley. Data Mining Introductory and Advanced Topics By M.H. Dunham, Pearson Education. Data Mining Concepts and Techniques By Han, Kamber, Morgan Kaufmann The Data Warehouse Lifecycle toolkit By Ralph Kimball ,John Wiley. Mastering Data Mining By M Berry and G. Linoff, John Wiley. Building the Data Warehouses, By W.H. InmonWiley ,Dreamtech

702: ARTIFICIAL INTELLIGENCE Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 150

ARTIFICIAL INTELLIGENCE Overview Of Artificial Intelligence: What is AI, Importance of AI, Fields of AI Problems And Problem Spaces & Search: AI Problems, Underlying Assumptions, The Level Of the Model, Criteria for success, Defining the Problem as State Space Search, Production Systems, Problem Characteristics, Issues in the Design of Search Programs, Problems. Heuristic Search Techniques: Generate & Test, Hill Climbing, Best First Search, Problem Reduction, Constraint Satisfaction, Means-Ends Analysis. Knowledge Representation: Knowledge Representation Issues, Predicate Logic, Representing Facts in Logic, Isa Instance Relation, Computable functions and predicates, Resolution, Natural Deduction. Languages For AI Problems: prolog, LISP Symbolic Reasoning Under Uncertainty: Nonmonotonic Reasoning, Logics for Nonmonotonic Reasoning, Implementation Issues. Probabilistic Reasoning: Probability and Bayes Theorem, Certainty Factors and Rule Based System, Bayesian Network, Dempster-Safer Theory, Fuzzy Logic. Structured Knowledge: Semantic Nets, Frames, Conceptual Dependency and Scripts. Expert System Architecture & Tools: Introduction, Rule Based System Architecture, Nonoproduction System Architecture, Dealing with Uncertainty, Knowledge Acquisition & Validation, System Building Tools.

Reference Books: 1. Principles Of Artificial Intelligence. By N.J.Nilsson, Kaufmann. 2. Artificial Intelligence, By Rich E. & Kevin Knight ,Tata McGraw Hill.

3. Introduction To AI and Expert Systems. By Dan .W. Patterson Prentice Hall India 4. Introduction To AI. By Charmiak and M.Dermalt , Addision-Wesley. 5. The Engineering of Knowledge Based Systems Theory and Practice. By A.J.Gongalez & D.D. Dankel ,Prentice Hall. 6. Fundamentals of Artificial Neural Networks By Mohamad H. Hassoun

IT ELECTIVE: IMAGE PROCESSING Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 150

Introduction : Background ,Digital Image Processing,Fundamental Steps in Image Processing,Elements of Digital Image Processing Systems Digital Image Fundamentals : Elements of Visual Perception,A Simple Image Model,Sampling and Quantization,Some Basic Relationship Between Pixels,Imaging Geometry,Photographic Film, Image Enhancement: Background,Enhancement by Point Processing,Spatial Filtering,Enhancement in the Frequency Domain,Generation of Spatial Masks from Frequency Domain Specifications,Color Image Processing. Image Restoration : Degradation Model,Diagonalization of Circulant and Block- Circulant Matrics,Algebraic Approach to Restoration,Inverse Filtering,Least Mean Square(Wiener) Filter,Conatrained Least Squares Restoration,Interactive Restoration,Restoration in the Spatial Domain,Geometric Transformations. Image Compression : Fundamentals,Image Compression Models,Elements of Information Theory,Error-Free Compression,Image Compression Standards. Image Segmentation : Deletion of Discontinuities,Edge Linking and Boundary Detection,Threshollding,Region-Oriented Segmentation,The Use of Motion in Segmentation. Reference Books: 1. Digital Image Processing By Rafael C. Gonzalez and Richard E. Woods.

IT ELECTIVE: DIGITAL SIGNAL PROCESSING Teaching Scheme Lect 3 Prac 2 Total 3 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 100

The Discrete Fourier Transform - Its Properties And Applications: Frequency Domain Sampling: The DFT domain sampling and reconstruction of DiscreteTime Signals, DFT, DFT as a linear Transformation, Relationship of the DFT to other Transforms, Properties of the DFT: Periodicity, Linearity, and Symmetry propertiesMultiplication of two DFTs and Circulation Convolution, Frequency analysis of signals using the DFT Efficient Computation Of DFT: FFT Algorithms: Efficient Computation of DFT: FFT Algorithms, Direct Computation of the DFT Radix-2 FFT algorithms, Decimation in time FFT algorithms and in-place computations Decimation in frequency FFT algorithms and in-place computations, ChirpZ Transform Gortezel Algorithm Frequency Transformations: Frequency Transformations in the Analog domain, Frequency Transformations in the digital domain Design Of Digital Filters: FIR filter Design: Properties of FIR digital filters, Different types of windows: Rectangular, Bartlett, Hanning, Hamming, Blackman and Kaiser window, Design of FIR filers using above windows, frequency sampling design, Equiripple filter design, A Comparison of IIR and FIR filters Symmetrical and Anti-symmetrical FIR filters: Design of Linear-Phase FIR filters using windows, Design of Linear-Phase FIR filters by the frequency sampling method, Design of FIR Differentiators, Design of Hilbert Transforms Design of IIR filters from Analog Filters:IIR filter design by Approximation of Derivatives, IIR filter design by Impulse Invariance, IIR filter design by the Bilinear Transformation, The Matched Transformation, Characteristics of commonly used analog filters, Application of above technique to the design of Butterworth and Chebyshev filters. Digital Filter Structures Basic IIR filter structures: Direct forms (I and II),Cascade and parallel realizations, Signal flow graph, Transposed structure, Basic FIR filter structures, Direct form structure, Frequency ampling structure, Lattice structure, Linear phase FIR structure, FIR structures Reference Books: 1. Digital Signal Processing- Principles, algorithms and applications : 3rd Edition By Proakis and Manolakis, PHI 2. Discrete Time Signal Processing , By Oppenheim and Schaffer ,2003 PHI 3. Digital Signal Processing : 2ndEdition 2001 By Sanjit K. Mitra , TMH

IT ELECTIVE: BIOINFORMATICS Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 150

Molecular Biology And Biological Chemistry: The genetic material: Nucleotides, Orientation, Base Pairing, The central dogma of molecular biology. Gene structure and information concept: promoter sequences, the genetic code, open reading frames, introns and exons. Protein structure and function: primary structure, secondary, tertiary and quaternary structure. The nature of chemical bonds: anatomy of an atom, valance electonegativity, hydrophilicity and hydrophobicity. Molecular biology tools: restriction enzyme digests, gel electrophoresis, blotting and hybridization, cloning, polymerase chain reaction, DNA sequencing.Genomic information content: C-value paradox, reassociation kinetics Data Searches And Pairwise Alignments: Dot plots, simple alignments. Gaps: simple gap penalties, origination and length penalties. Dynamic programming: The Needleman and Wunsch algorithm. Global and local alignments: semiglobal alignments, the Smith-Waterman algorithm. Database searches: BLAST and its relatives, FASTA and related algorithms, alignment scores and statistical significance of database searches. Multiple sequence alignments. Substitution Patterns: Patterns of substitutions within genes: mutation rates, functional constraint, synonymous vs. nonsynonymous substitutions, indels and pseudogenes, substitutions vs. mutations, fixation. Estimating substitutin numbers: jukes-cantor model, transitions and transversions, kimuras twoparameter model, models with even more parameters, substitutions between protein sequenes. Variations in evolutionary rates between genes. Molecular clocks: relative rate test, causes of rate variation in lineages. Evolution in organelles. Distance-Based Methods Of Phylogenetics: History of molecular phylogenetics. Advantages to molecular phylogenies. Phylogenetic trees: terminology of tree reconstruction, rooted and unrooted trees, gene vs. species trees, character and distance data. Distance matrix methods: UPGMA, estimation of branch lengths, transformed distance method, neighbors relation method, neighbor-joining methods. Maximum likelihood approaches. Multiple sequence alignments. Character-based Methods Of Phylogenetics: Parsimony: informative and uninformative sites, unweighted parsimony, weighted parsimony. Inferred ancestral sequences. Strategies for faster searches: branch and bound, heuristic searches. Consensus trees. Tree confidence: bootstrapping, parametric tests. Comparison of phylogenetic methods. Molecular phylogenies: the tree of life, human origins. Protein And RNA Structure Prediction: Amino acids, polypeptide composition, secondary structure: backbone flexibility, and , accuracy of predictions, the Chou-Fasman and GOR methods. Tertiary and quaternary structure: hydrophobicity, disulfide bonds, active structures vs. most stable structures. Algorithms for modeling protein folding: lattice models, off-lattice models, energy functions and optimization. Structure prediction: comparative modeling, threading: reverse protein folding, predicting RNA secondary structure.

Reference Books: 1. Fundamental Concepts of Bioinformatics BY Dan E. Krane, Michael L. Raymer

IT ELECTIVE: PARALLEL PROCESSING AND ARCHITECTURE Teaching Scheme Lect Prac Total Int Ass 30 Examination Scheme Practical Total Int Ass Sem End 100 25 25

Theory Sem End Marks Hrs 70 3

Total 50

Grand Total 150

Introduction: Von Neumann architecture, Why do we need high speed computing?, How do we increase the speed of computers?, Some interesting features of parallel computers. Solving Problems In Parallel: Temporal parallelism, Data Parallelism, Combined temporal and data parallelism, Data parallelism with dynamic assignment, Data parallelism with quasi-dynamic assignment, Comparison of Temporal and Data Parallel Processing. Instruction level Parallel Processing: Pipelining of Processing Elements, Delays in Pipeline Execution, Delay due to resource constraints, Delay due to data dependency, Pipeline delay due to branch instructions, Hardware modification to reduce delay due to branches, software modification to reduce delay due to branches, Difficulties in Pipelining, Parallel Algorithms: Models of Computation, random access machine, parallel random access machine, Interconnection networks, combinational circuits, Analysis of Parallel Algorithms, Running time, Number of processors and cost, Introduction To Parallel Processing: Architectural Classification schemes, Multiplicity of instruction data stream, Serial versus parallel processing, Parallelism versus pipelining, Parallel Processing Applications, Principles Of Pipelining And Vector Processing: Principles of designing Pipeline Processors, Instruction prefetch and branch handling, Data buffering and busing structures, Internal forwarding and register tagging, Hazard detection and resolution. Pipeline Computers And Vectorization Methods: The space of Pipeline Processors, Vector supercomputers, Scientific attached processors, Early Vector Processors, Architectures of Star-100 and TI-ASC. Structures And Algorithms For Array Processors: SIMD Array Processors, SIMD computer organization, Masking and data routing mechanisms, Inter PE communications, SIMD Interconnection Networks, Static versus dynamic networks, Mesh connected Illiac network SIMD Computers & Performance Enhancement: The Space of SIMD Computers, Array and associative processors, SIMD computer perspectives, The Illiac-IV System architecture

Multiprocessor Architecture And Programming: Multiprocessor Operating Systems, Classification of Multiprocessor operating systems, Software requirements for Multiprocessors, Operating system requirements.

Hardware And Operating System Models: Introduction, Hardware, Time-sharing with a single processor, Time-sharing with a single processor, Brief description of tightly coupled Multiprocessing. Processes, Shared Memory And Simple Parallel Programs: Introduction, Processes and processors, Shared memory1, Forking-Creating Processes, Shared memory-2, Processes are randomly scheduled Contention. Basic Parallel Programming Techniques: Introduction, Loop splitting, Ideal speedup, Spin-locks, Contention and Self-scheduling, Histogram. Barriers And Race Conditions: Introduction, The Barrier Calls, Expression splitting. Introduction To scheduling Nested loops: Introduction, Variations on loop splitting, Variation on self scheduling, Indirect scheduling. Overcoming Data Dependencies: Introduction, Induction variable, Forward dependency, Block scheduling and forward dependency, Backward dependency, Splittable loops, Special scheduling Assign based on condition. Scheduling Summary: Introduction, Loop splitting, Expression splitting, Self scheduling, Indirect scheduling, Block scheduling, Special scheduling. Reference Books : 1. Parallel Computers Architecture and Programming By V. Rajaraman and C. Siva Ram Murthy 2.Computer Architecture and Parallel Processing By Kai Hwang 3.Introduction to Parallel Programming By Steven Braver

IT ELECTIVE: ADVANCED OPERATING SYSTEMS Teaching Scheme Theory Lect Prac Total Int Ass 4 2 6 30 Sem End Marks 70 Hrs 3 Total 100 Int Ass 25 Examination Scheme Practical Sem End 25 Total 50 Grand Total 150

Multiprocessor Operating Systems Threads Process synchronization Processor scheduling Memory management Reliability Fault tolerance. Network Operating Systems (NOS) Types of NOS NOS to LANs Choosing and NOS Multiple NOS on a single Network NOS and Network management Future Trends. Distributed Operating Systems Issues - Communication Primitives Remote procedure call Logical clocks Vector clocks Distributed mutual exclusion Non token based algorithms Token based algorithms Issues in deadlock detection and resolution Centralized and distributed deadlock detection algorithms Election algorithms, Classification of agreement problems Solutions to the Byzantine agreement problem Impossibility result. Issues in load distributing Load distributing algorithms Performance comparison. Distributed File System design issues Mechanisms for building DFS Case studies. Database Operating Systems Requirements - Concurrency control model Serializability theory Distributed database systems Synchronisation primitives Lock based and timestamp based algorithms Fully replicated database systems. Real Time Operating Systems Architecture of Real Time Systems Operating Systems Issues Performance Measures Estimating Program runtimes Uniprocessor Scheduling IRIS Tasks Task Assignment Mode changes Fault tolerant scheduling. Reference Books: 1. Advanced Concepts in Operating Systems By Mukesh Singhal, Niranjan G.Shivaratri, McGraw-Hill, New York, 1994. 2. Real Time Systems By C.M.Krishna, Kang G.Shin , McGraw-Hill, 1997.Philip Hunter 3. Network Operating Systems Making Right Choices By Addison Wesley 3. Modern Operating Systems By Andrew S. Tanenbaum, Prentice Hall, NJ (Section 9 13 only). 4. Distributed Operating Systems Concepts and Design By Pradeep K. Sinha, PHI. 5. Operating Systems A Modern Perspective By Gary Nutt

IT-ELECTIVE COMPILER DESIGN Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 150

Introduction: Programs, interpreters, and translators; Analysis-Synthesis model of translation; Examples of translators; study of compilers. Issues in compiler design The Structure Of a Compiler : Lexical Analyzer, LEX, Design of Lex . Parsing : Top down Parsing, LL(1) Parsers, Bootom up Parsing, YACC, LR parsers, Syntax Directed Translation : Type Checking , Run-Time Storage Administration and Symbol Table Management. Semantics And Semantic Analysis : Static vs. dynamic semantics; Names, scopes and bindings; Object lifetimes; Run-time system organization (the stack, the heap, garbage collection); Classification of semantic objects for an intermediate representation; Symbol tables and their relationship to semantic objects; Symbol table implementation: binary trees vs. hashing; Attribute Grammars. Implementing a Semantic Analyzer : Compilation techniques for control flow (expressions, assignment, sequencing, selection, iteration, recursion), declarations, types (arrays, records, strings, pointers) and type checking, subroutine calls and parameter passing, heap management. Code Generation : Intermediate Code and Code Generation, Data-Flow Analysis , Code Optimizations. Code Optimization : Overview of optimization; Data Flow Analysis; Peephole Optimizations; Constant Folding, Common Subexpression Elimination,Copy Propagation, Strength Reduction. Global Optimization: Loop optimizations; Induction Variable elimination, Optimizing procedure calls - inline and closed procedures. Machine-Dependent Optimization: Pipelining and Scheduling; Pentium and PentiumPro specifics. References Books: 1. A Retargetable C Compiler: Design and Implementation By Fraser and Hansen, Benjamin-Cummings, 1995. 2. Compilers: Principles, Techniques and Tools By Aho, Sethi, and Ullman, Addison-Wesley, 1986 3. Advanced Compiler Design and Implementation By Muchnick, Morgan and Kaufmann, 1998. 4. Introduction to Compiler Construction with UNIX By Schreiner and Friedman, Prentice-Hall, 1985. 5. Compiler Design in C By Holub, Prentice-Hall, 1990.

IT ELECTIVE: SOFTWARE TESTING Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks 70 Hrs 3 Examination Scheme Practical Total 100 Int Ass 25 Sem End 25 Total 50 Grand Total 150

Introduction: Activities of a Test Engineer, Testing Levels Based on Software Activity, Automation of Test Activities, Software Testing Limitations and Terminology, Coverage Criteria for Testing, Infeasibility and Subsumption, Characteristics of a Good Coverage Criterion, Older Software Testing Terminology Coverage Criteria : Graph Testing , Graph Coverage Criteria Structural Coverage Criteria Data Flow Criteria, Testing Sequencing Constraints, Testing State Behavior of Software Logic Testing: Overview-Logic Predicates and Clauses, Logic Expression Coverage Criteria, Structural Logic Coverage of Programs, Specification-based Logic Coverage Input Space Partitioning : Input Domain Modeling, Combination Strategies Criteria , Constraints Among Partitions Syntax-based Testing: Syntax-based Coverage Criteria , BNF Grammars for Languages Integration and Object-Oriented Testing, BNF Grammars Applying Criteria In Practice: Regression Testing, Integration and Testing ,Stubs and Drivers , Test Process, Requirements Analysis and Specification, System and Software Design, Test Plans, Identifying Correct Outputs Engineering Criteria For Technologies: Testing Object-Oriented Software, Unique Issues with Testing OO Software, Testing Web Applications and Web Services, Testing Graphical User Interfaces, Real-time Software and Embedded Software Reference Books: 1. Software Testing: A Craftsman's Approach : Second Edition By Paul C Jorgensen, CRC Press. 2. The Art of Software Testing,: 2nd Edition ByGlenford J. Myers, John Wiley & Sons, Inc., Hoboken, New Jersey, 2004. 3. Lessons Learned in Software Testing: a Context-Driven Approach By Cem Kaner, James Bach, and Bret Pettichord, John Wiley & Sons, Inc., New York, 2002. 4. Introduction to Software Testing By Paul Ammann and Jeff Offutt

IT ELECTIVE : MOBILE COMPUTING Teaching Scheme Lect 3 Prac 2 Total 5 Int Ass 30 Theory Sem End Marks Hrs 70 3 Examination Scheme Practical Sem Total Int Ass End 100 25 25

Total 50

Grand Total 150

Introduction: Challenges in mobile computing, coping with uncertainities, resource poorness, banwidth, etc. Cellular architecture, co-channel interference, frequency reuse, capacity increase by cell splitting. Evolution of mobile system: CDMA, FDMA, TDMA, GSM. Mobility Management: Cellular architecture, Co-channel interference, Mobility: handoff, types of handoffs; location management, HLR-VLR scheme, hierarchical scheme, predictive location management schemes. Mobile IP, cellular IP. Publishing & Accessing Data In Air: Pull and push based data delivery models, data dissemination by broadcast, broadcast disks, directory service in air, energy efficient indexing scheme for push based data delivery. File System Support For Mobility: Distributed file sharing for mobility support, Coda and other storage manager for mobility support Ad hoc Network Routing Protocols: Ad hoc network routing protocols, destination sequenced distance vector algorithm, cluster based gateway switch routing, global state routing, fish-eye state routing, dynamic source routing, ad hoc on-demand routing, location aided routing, zonal routing algorithm. Mobile Transaction and Commerce: Models for mobile transaction. Kangaroo and joey transactions, team transaction. Recovery model for mobile transactions. Electronic payment and protocols for mobile commerce Reference Book: 1. Mobile Computing By Talukder and Yavagal, Tata McGraw Hill. 2. Mobile Communication By J.Schiller