curriculam M.E. Degeree - Government College Of … · Software and hardware multithreading – SMT...

21

Government College Of Technology, Coimbatore - 641 013

12CS01 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

L T P C

3 1 0 4

UNIT I LOGIC AND SET THEORY (9)

The language of logic: Propositions, Logical equivalence, Quantifiers, Arguments, Proof – Sets : Concepts, Operations,Cardinality, Recursively defined sets – Functions and matrices : Concepts, Properties and Principles – Exponential andLogarithmic functions – Multinomial theorem.

UNIT II RELATIONS, GRAPHS AND TREES (9)

Relations: Boolean matrices, Relations and Digraphs, Properties, Operations, Connectivity, Closure, Equivalence, Partialand Total Ordering- Graphs: Representation, Isomorphic graphs, paths, Cycles, Circuits, Eulerian, Hamiltonian, Planar,Coloring - Trees: Spanning, Minimal Spanning trees, Rooted, Binary, Binary search, Huffman and Decision trees.

UNIT III DIGRAPHS AND BOOLEAN ALGEBRA (9)

Digraphs: DAGs, Weighted digraphs- Formal languages and Finite state machines-Boolean Algebra and CombinatorialCircuits: Boolean algebra, Functions, Logic gates, Minimization of Combinatorial circuits, Don’t care condition.

UNIT IV NON-MARKOVIAN QUEUES AND QUEUE NETWORKS (9)

Markovian models - Birth and Death Queuing models – steady state results: Single and multiple server queuing models-queues with finite waiting rooms- Finite source- Finite source models - Little’s formula.

UNIT V QUEUEING THEORY (9)

M/G/1 queue- Pollaczek- Khintchine formula, series queues-open and networks.

LECTURE: 45 TUTORIAL: 15 TOTAL: 60

Reference Books

1. Thomos Koshy, “Discrete Mathematics with Applications”, Elsevier 2006

2. Kenneth H.Rosen,” Discrete Mathematics and its Applications”, McGraw Hill Company,2006

3. Medhi, “Stochastic Models in Queuing Theory”, Elsevier Publications, Second Edition,2006

4. Tremblay.J.P and Manohar.R, “Discrete Mathematical Structures with applications to Computer Science”, TataMcGraw Hill,Fourth reprint 2001.

5. Ng Chee Hock,”Queuing Modeling Fundamentals”,John Wiley &Sons,1996.

6. G.Haribaskaran, “Probability, Queueing theory and Reliability Engineering”, Lakshmi Publishers(P) Ltd(Universityscience press ) ,New Delhi 2006

7. T.Veerarajan ,” Probability Statistics and Random Process”, Tata McGraw Hill Publishing Company Ltd., NewDelhi -2007

22

M.E. Computer Science And Engineering

12CS02 ADVANCED COMPUTER ARCHITECTURE

L T P C3 0 0 3

UNIT I PIPELINE AND INSTRUCTION - LEVEL PARALLELISM (9)

Concepts and challenges - Data hazards and dynamic scheduling - Dynamic Hardware prediction - Compiler support forILP – Hardware support for parallelism. Studies of ILP - Power PC620.

UNIT II MULTIPLE ISSUE PROCESSORS (9)

VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism – Hardware versus softwarespeculation mechanisms – IA 64 and Itanium processors – Limits on ILP.

UNIT III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM (9)

Symmetric and distributed shared memory architectures – Performance issues –Synchronization – Models of memoryconsistency – Introduction to Multithreading.

UNIT IV MEMORY HIERARCHY ANDV I/O DESIGN (9)

Basics of caches, Reducing cache miss & hit time. Main memory. Virtual memory. Protections Examples of virtualmemory. Issues in the design of memory hierarchies. Alpha APX 21064 Memory hierarchy.

Storage Systems: Types of storage devices, Buses & their types, performance I/O performance measures. Reliability,Availability and RAID. Interfacing to an Operating system. Designing an I/O system. Unix file system performance

UNIT V MULTI-COREARCHITECTURES (9)

Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-corearchitecture – SUN CMP architecture - heterogeneous multicore Processors – case study: IBM Cell Processor.


Reference Books

1. Hennessy J.L. & Patterson D.A.”Computer Architecture: A Quantitative Approach” Second Edition HarcourtAsia.

2. Hayes J.P., “Introduction to Computer Architecture”, McGraw Hill Publications.

3. Tenanbaum A. S., “Computer Organization and Architecture”, PHI.

4. Hwang K., “Advanced Computer Architecture”, McGraw Hill.

23


12CS03 COMPUTER NETWORKS MANAGEMENT

L T P C

3 0 0 3

UNIT I INTRODUCTION TO PHYSICAL AND DATA LINK LAYER (9)

Motivation-Goals of networking –Need for a layered architecture, Network hardware - Network software, Flow anderror control: Error detection and correction -Elementary data link protocols, piggy backing - MAC protocols - Ethernet– FDDI-Bridges.

UNIT II NETWORK ARCHITECTURE (9)

Layering & Protocols - OSI & Internet Architecture – direct Link Networks : Hardware Blocks, Framing, Error Detection,Reliable transmission, Ethernet (802.3),Token Rings(802.5), Wireless (802.11) - Network Adaptors.

UNIT III NETWORK LAYER (9)

Switching and Forwarding, Bridges and LAN Switches , Cell Switching , Switching Hardware , Internetworking: ServiceModel, Global Addresses, datagram Forwarding in IP, Address Translation Protocol, DHCP, ICMP, Virtual Networksand Tunnels , Routing : Network as a Graph, Distance Vector , Link State, Metrics ,Routing for Mobile Hosts, GlobalInternet : Sub netting, Classless Routing ,Inter domain Routing , Routing Areas, IPV6, Multicast.

UNIT IV BROAD BAND NETWORK MANAGEMENT (9)

Broad band Networks and Services-ATM Technology-ATM Network management-ATM Network reference model,Integrated local Management interface, ATM Management information based role of SNMD and ILMI in ATM-ATMdigital exchange interface management.

UNIT V NETWORK MANAGEMENT APPLCATIONS (9)

Configuration Management, Fault Management, Performance Management, Event Correlation Techniques, SecurityManagement –Accounting Management, Report Management Policy based Management Service Level Management.

LECTURE: 45 TUTORIAL: 0 TOTAL:45

Reference Books

1. Andrew S. Tanenbaum, “Computer networks” , PHI, 4th edition 2008.

2. Behrouz A.Ferouzan,”Data Communications and Networking”,Tata McGrawHill,2010.

3. Larry L. Peterson and Bruce S. Davie, “Computer Networks, A Systems Approach”, Second Edition. MorganKaufmann Publishers Inc, 2000.

4. Salah Aiidarous, Thomas Plevayk,” Telecommunications Network Management Technologies andImplementations”,Eastern Economy Edition IEEE press, New Delhi,1998.

5. Mani Subramanian,”Network Management Principles and Practice”, Addison Wesly Newyork,2000.

6. Uyless Black,”Computer Networks : Protocols,standards and Interfaces”, Second Edition, 2009

24


12CS04 NETWORKS AND ELECTIVE LAB

L T P C

0 0 3 2

LIST OF EXPERIMENTS

1. Study of establishing LAN using 8/16 port Switch/Hub

2. Study of standard Network protocol headers by sniffing through Open source tools like wireshark or Ethernet

3. Simulation of ARP/RARP

4. Study of creating account and file transfer using FTP

5. Study of network simulators NS2 / Qualnet

6. Simulation of mobile IP protocol using NS2 / Qualnet

7. Three experiments based on Elective – I

8. Three experiments based on Elective – II

TOTAL : 45

25


12CS05 ADVANCED OPERATING SYSTEMS

L T P C

3 1 0 4

UNIT I DISTRIBUTED SYSTEM (9)

Introduction-Architectures of Distributed Systems-Architecture types-Distributed operating systems-Issues in Distributedoperating systems- communication primitives-Theoretical Foundations - Inherent limitations of a distributed system –Lamport’s logical clocks – vector clocks – casual ordering of messages – global state – cuts of a distributed computation– termination detection. Distributed Mutual Exclusion – introduction – the classification of mutual exclusion and associatedalgorithms.

UNIT II DISTRIBUTED DEADLOCK (9)

Distributed Deadlock Detection – Deadlock handling strategies-Issues-Control Organization-Centralized Deadlockdetection-Distributed deadlock detection-Hierarchical deadlock detection algorithms- Agreement protocols – introduction-the system model, a classification of agreement problems, solutions to the Byzantine agreement problem, applicationsof agreement algorithms-Distributed file systems-Architecture-Mechanisms-Design issues-Case studies-Log structuredfile systems.

UNIT III RESOURCE MANAGEMENT (9)

Distributed shared memory-Architecture– algorithms for implementing DSM – memory coherence and protocols –design issues-Case Studies. Distributed Scheduling – introduction – issues in load distributing – components – Stability-Load distributing algorithms-performance comparison – selecting a suitable load sharing algorithm- Requirements forload distributing-Load sharing policies-Task migration-Issues in Task migration.

UNIT IV FAILURE RECOVERY (9)

Failure Recovery: introduction– basic concepts – classification of failures – recovery in concurrent systems – consistentset of check points – synchronous and asynchronous check pointing and recovery – check pointing for distributeddatabase systems- recovery in replicated distributed databases. Fault tolerance: Issues, Atomic action and committing,Commit protocols, non blocking commit protocols, voting protocols, Failure resilient processors, reliable communication.

UNIT V MULTIPROCESSOR AND DATABASE OPERATING SYSTEM (9)

Multiprocessor system architectures-Motivations-Basic architectures-Interconnection networks –Caching-Hypercubearchitectures-Multiprocessor operating systems –Design issues-Threads-Process synchronization-Process scheduling-Memory management-Reliability-Database Operating systems: Introduction- requirements of a database operating systemConcurrency control: theoretical aspects – introduction, database systems – a concurrency control model of databasesystems- the problem of concurrency control – Serializability theory- distributed database systems, concurrency controlalgorithms-Synchronization primitives-Lock based algorithms-Timestamp based algorithms-Optimistic algorithms-datareplication.


26


Reference Books

1. Mukesh Singhal, Niranjan G.Shivaratri, “ Advanced Concepts in Operating Systems: Distributed, Database andMultiprocessor Operating Systems “, Tata McGraw Hill, 2001.

2. Andrew S.Tanenbaum, “ Modern Operating System “, Prentice Hall of India, 2003.

3. Pradeep K.Sinha, “ Distributed Operating System: Concepts and Design “, Prentice Hall of India, 2003.

4. Solomon.D & Russinovich.M. “ Inside Windows 2000 “Microsoft Press third Edition, 2000.

27


12CS06 ALGORITHMS AND COMPLEXITY

L T P C

3 1 0 4

UNIT I INTRODUCTION (9)

Role of algorithms – growth of functions – recurrences – Dynamic programming – Greedy algorithm – amortizedanalysis.

UNIT II DATA STRUCTURES (9)

Elementary data structures – Hash tables – Binary search trees – Red Black trees.

UNIT III ADVANCED DATA STRUCTURES (9)

B tree – Binomial heaps – Fibonacci Heaps – Data structures for disjoint sets.

UNIT IV GRAPH ALGORITHMS (9)

Elementary Graph Algorithms –Minimum Spanning trees –Single source shortest paths - All Pairs shortest paths –Maximum Flow.

UNIT V ADVANCED ALGORITHMS (9)

Sorting Networks - Matrix Operations – Linear Programming - Number theoretic Algorithms –NP completeness –Approximation Algorithms.

LECTURE: 45 TUTORIAL: 15 TOTAL : 60

Reference Books

1. Cormen.T.H., Leiserson.C.E. and Rivest.R.L., “Introduction to Algorithms”, Second Edition, Prentice Hall of India,2007.

2. Aho.A.V., Hopcroft.J.E. and Ullman.J.D., “The Design and Analysis of Algorithms”, Addison-Wesley, 1974.

3. Garey.M.R. and Johnson.D.S., “Computers and Intractability: A Guide to the Theory of NP-Completeness” ,Freeman, 1979.

4. Bach. E., and Shallit .J., “Algorithmic Number Theory”, Vol. I, MIT Press, 1996.

5. Ahuja,R.K., Magnanti.T.L., and Orlin.J.B., “ Network Flows : Theory, Algorithms and Applications”, EnglewoodCliffs, NJ: Prentice Hall, 1993.

28


12CS07 ADVANCED DATABASE TECHNOLOGY

L T P C

3 0 0 3


Database system concepts and architecture –E-R model – Relational model – Relational algebra – ER to Relationalmodel mapping – Schema Refinement -Functional Dependencies –Normal forms based on primary keys – second andThird normal forms –Boyce-codd normal form –properties of decompositions –Normalization –Schema refinement indatabase design –multivalued dependencies –fourth normal form – Join Dependencies –fifth normal form- inclusiondependencies.

UNIT II DISTRIBUTED DBMS (9)

Introduction – Distributed DBMS architecture - DBMS standardization –architecture models –architecture –Distributeddatabase design – design strategies – design issues – fragmentation –allocation- semantic data control – view management–data security –semantic integrity control.

UNIT III QUERY PROCESSING AND OPTIMIZATION (9)

Query processing problem – objectives – characterization – layers of query processing – query decomposition – localizationof distributed data – query optimization – centralized query optimization –join ordering in fragment queries – distributedquery optimization algorithms.

UNIT IV PARALLEL DATABASE AND DISTRIBUTED OBJECT DATABASE SYSTEMS (9)

Database servers – parallel architecture – parallel DBMS techniques – parallel execution problems –parallel executionfor hierarchical architecture – fundamental objet concepts and object models –object distributed design – architecturalissues – object management – distributed object storage- object query processing-transaction management.

UNIT V CURRENT ISSUES (9)

Data warehousing –data mining –push-based technologies –mobile database –multimedia database- geographicinformation systems –genome data management - Peer-to-Peer Data Management-Web Data Management- StreamingData and Cloud Computing


Reference Books

1. R. Elmasri and S. Navathe, “Fundamentals of Database Systems”, Fourth Edition , Pearson Education ,2004.

2. Tamer Ozsu.M., Patrick Valduriez,” Principles of Distributed Database Systems”, Third Edition , Springer,2011.

3. Raghu Ramakrishnan,Gehrke, “Database Management Systems”, McGrawHill,2003.

29


12CS08 ALGORITHMS AND ELECTIVE LAB

L T P C0 0 3 2

LIST OF EXPERIMENTS

1. Implementation of insertion and deletion in Binary Search Tree

2. Implementation of insertion and deletion in Red-Black Trees

3. Implementation of Recursive and Iterative Greedy Algorithm

4. Implementation and correctness of Huffman’s Algorithm

5. Implementation of insertion, deletion and searching from B-Tree

6. Implement the operations of Binomial Trees and Binomial Heaps

7. Three experiments based on Elective – I

8. Three experiments based on Elective – II

TOTAL: 45

30


12CS09 PARALLEL ALGORITHMS

L T P C

3 0 0 3


Introduction to parallel computers – Shared memory multi processors – Interconnection Networks.

UNIT II FUNDAMENTAL OF PARALLEL ALGORITHMS (9)

Concurrency platforms – Ad hoc techniques for parallel algorithms – Non serial Parallel algorithms

UNIT III ALGORITHM ANALYSIS (9)

z-Transform analysis – Dependence Graph analysis – Computational Geometry analysis

UNIT IV APPLICATIONS (9)

Pattern matching – Motion estimation for video compression – Multiplication over GF (2m) – Polynomial division overGF(2)

UNIT V CASE STUDY (9)

The Fast Fourier transforms – Solving systems of Linear equations – Solving partial differential equations.

LECTURE: 45 TUTORIAL: 0 TOTAL : 45

Reference Books :

1. Fayez Gebali, “Algorithms and Parallel Computing”, Wiley publications, 2011.

2. A.Grama, A.Gupta, G.Karypis and V.Kumar, “Introduction to Parallel Computing”, Second Edition, Addison-Wesley, 2003.

3. Selim G. Akl, “Design and analysis of parallel algorithms”, Prentice Hall, 1989.

4. Barry Wilkinson and Michael Allen, “Parallel programming: techniques and applications using networkedworkstations and parallel computers”, Pearson Education, 2003.

5. Kai Hwang and aye A Briggs, “Computer Architecture and Parallel processing”, McGraw Hill Intl. edition, 1985.

31


12CS12 FUZZY LOGIC AND NEURAL NETWORKS

L T P C3 0 0 3

UNIT I (9)

Introduction: Typical Architecture, Common Activation Functions, McCulloch-Pitts Neuron, Learning Rules, SimpleNeural Nets For Pattern Classification: Architecture, Biases and Thresholds,Linear Separability,Hebb Net-Perceptron-Adaline.

UNIT II (9)

Training Algorithm for Pattern Association-Hebb rule and Delta Rule, Heteroassociative, Auto associative and IterativeAuto Associative Net, Bidirectional Associative Memory- Storage and Retrieval Algorithms-Neural Network based onCompetition: Fixed weight Competitive Nets-Kohonen Self-Organizing Maps-Linear vector Quantization

UNIT III (9)

Adaptive Resonance Neural networks:ART1 and ART2-Basic operation and Algorithm, BackPropagation Neural Net-Boltzman Machine Learning-Necognitron-Architecture, Algorithms.

UNIT IV (9)

Properties and operations on Classical and Fuzzy sets-Crisp and Fuzzy Relations-Cardinality, Properties and operations,Composition, Tolerance and Equivalence relations,-Simple Problems. Membership functions: Features of membershipfunctions-Standard forms and Boundaries- Fuzzyfication, membership value assignments, Fuzzy to Crisp Conversions,Lambda Cuts for fuzzy sets and relations, Defuzzzyfication methods.

UNIT V (9)

Applications of Neural Networks: Pattern Recognition-Image Compression-Communication-Control systems-Applicationof Fuzzy Logic: Fuzzy Clustering-Fuzzy pattern Recognition-Fuzzy Image Processing-Fuzzy Databases-Fuzzy Informationretrieval.


Reference Books

1. Laurene Fausett,”Fundamentals of Neural Networks”, Pearson Education India, New Delhi,2004

2. Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw Hill 1997.

3. J.A.Freeman and B.M.Skapura, “Neural Networks, Algorithms applications and Programming Techniques”,Pearson Wesley,1990.

4. Klir G.J., and Folger.T,”Fuzzy sets,Uncertainty and Information”,Prentice Hall,New Delhi,EnglewoodCliffs.N.J.,Fifth Indian Reprint,1991.

5. Zimmermann.H.J, “Fuzzy Set Theory and its Applications”, First Edition, Kluwer AcademicPublishers,Dordrecht,Germany,1991.

6. Zurada J.M. “Introduction to Artificial Neural Systems”,Jaico Publishing House,Bombay,1994.

7. James J.Buckley and Esfandiar Eslami,”Advances in Soft Computing-An Introduction to Fuzzy Logic and FuzzySets”, Springer International Edition, New Delhi,2011.

32


12CS13 ADVANCES IN COMPUTATIONAL INTELLIGENCEL T P C3 0 0 3

UNIT I EVOLUTIONARY COMPUTATION (9)Genetic Algorithms – Evolution Strategy- Genetic Programming – Variants in Genetic Programming. Architecture ofGene Expression Programming – Chromosome Domains- Cells and creation .Evolving Intrusion Detection Systems –Intrusion Detection – Evolving IDS using Genetic Programming – Machine Learning Techniques.

UNIT II GENETIC PROGRAMMING APPLICATIONS (9)Evolutionary Pattern Matching – Adaptive Pattern Matching –Heuristics of good Traversal orders- Genetically ProgrammedMatching Automata. Genetic Programming in Data Modeling – Genetic Programming in mathematical Modeling – DecisionModels for Classification tasks- Genetic Programming for Prediction task .Stock Market Modeling using GeneticProgramming ensembles- Modeling Stock market Prediction – Intelligent Paradigms.

UNIT III SWARM INTELLIGENCE – FUNDAMENTALS (9)Introduction - Canonical Particle Swarm Optimization - Extended Models of PSO for Discrete Problems - Applications ofParticle Swarm Optimization - Ant Colony Optimization - Ant Colony Algorithms for Optimization Problems - Ant ColonyAlgorithms for Data Mining - The Conventional Particle Swarm Algorithm - The WoSP Algorithm - The Performance ofthe WoSP Algorithm - Constraint Handling - Particle Swarm Optimization - Grammatical Swarm - Proof of ConceptExperiments and Results.

UNIT IV SWARM INTELLIGENCE SEARCHERS, CLEANERS AND HUNTERS (9)SWARMs of Self-Organizing Polymorphic Agents - SWARM Simulation of RTES/BTeV - Searchers, Cleaners andHunters- The Dynamic Cooperative Cleaners (DCC) Problem- Cleaning protocol – Dynamic cooperative cleaners -Cooperative Hunters- Physical k-clique-Physical Graphs- Physical clique finding protocol-Exploration in PhysicalEnvironments.

UNIT V SWARM INTELLIGENCE - APPLICATIONS (9)Ant Colony Optimization for fast modular Exponentiation using sliding window method: Window based methods-additionalchains and additional sequences –Ant Systems and Algorithms-Chain Sequence Minimization using Ant System. ParticleSwarm for fuzzy Models Identification; Fuzzy Models .Methodology for fuzzy Models Identification through PSO.

LECTURE: 45 TUTORIAL: 0 TOTAL: 45Reference Books1. Nadia Nedja, Ajith Abraham, Luiza de Macedo Mourelle, “Genetic Systems Programming”, Springer

Publication- 2005.2. Nadia Nedjiah, Luiza de Macedo Mourelle, “Swarm Intelligent Systems”, Springer – 2006.3. Amit Konar, “Computational Intelligence, Principles, Techniques and Applications”, Springer publications,

Second edition, 2010.4. Gregory Levitin, “Computational Intelligence in Reliability Engineering”, Springer publications 2007.5. H.P.Schwefel, I. Wegener, K.Weinert, “Advances in Computational Intelligence”, Springer publication 2003.

33


12CS14 SOFT COMPUTING

L T P C

3 0 0 3

UNIT I NEURAL NETWORKS (9)

Supervised Learning Neural Networks-Perceptrons-Adaline-Back propagation-Multilayer perceptrons-Radial BasisFunction Networks- Unsupervised Learning and Other Neural Networks-Competitive Learning Networks-KohonenSelf- Organizing Networks-Learning Vector Quantization-Hebbian Learning.

UNIT II FUZZY SET THEORY (9)

Fuzzy Sets-Basic Definition and Terminology- Set-theoretic operations-Member Function-Fuzzy Rules and FuzzyReasoning-Extension principle and Fuzzy Relations- Fuzzy If-Then Rules- Fuzzy Reasoning- Fuzzy Inference Systems-Mamdani Fuzzy Models-Sugeno Fuzzy Models-Defuzzification.

III NEURO FUZZY MODELING (9)

Adaptive Neuro-Fuzzy Inference Systems-Architecture-Hybrid Learning Algorithm-learning Methods that Cross-fertilizeANFIS and RBFN-Coactive Neuro-Fuzzy Modeling-Framework- Neuron Functions for Adaptive Networks-Neuro FuzzySpectrum.

UNIT IV GENETIC ALGORITHMS(9)

Traditional optimization and search methods-Simple Genetic Algorithm-Reproduction-Crossover-Mutation-Schemata-Schema Theorem-Two and K-arm Bandit Problem-Improvements in basic Techniques-Selection Schemes-ScalingMechanisms-Ranking Procedures.

UNIT V RTIFICIAL INTELLIGENCE SYSTEMS (9)

AI search algorithms-Hill Climbing-Best first search-Breath first search-Depth First search-Predicate calculus-Predicatelogic-Resolution in predicate logic-Semantic networks-The Frame problem.


Reference Books

1. Jang J.S.R., Sun C.T. and Mizutani E, “Neuro - Fuzzy and Soft Computing “, PHI,Pearson Education, 2004

2. Timothy J.Ross, “Fuzzy Logic with Engineering Applications “, Mc-Graw Hill, 1997.

3. Davis E. Goldberg,”Genetic Algorithms: Search, Optimization and Machine Learning” Addison Wesley, N.Y.,1989.

4. S.Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI, 2003.

5. Elaine Rich, Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill, New Delhi, Third Edition 1992.

34


12CS15 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEM

L T P C

3 0 0 3


Intelligent agents-Environments-Structure of agents-Problem solving: Solving problems by searching- problem solvingagents-Searching for solutions-Uninformed search strategies-Avoiding repeated states-Searching with partial information.

UNIT II SEARCHING TECHNIQUES (9)

Informed search and exploration-Heuristic functions-Local search algorithms and optimization problems-Local search incontinuous phases-Online search agents and unknown environments-Constraint satisfaction problems-Back trackingsearch for CSPs-Local search for CSPs-Adversial search.

UNIT III KNOWLEDGE REPRESENTATION (9)

First order logic- syntax and semantics-Knowledge engineering in first order logic-Inference in first order logic-Propositionalvs First order inference-Unification and lifting-Forward chaining-Backward chaining-Resolution-Knowledge representation

UNIT IV LEARNING (9)

Learning from observations-Inductive learning-Learning decision trees-Knowledge in learning: Logical formulation oflearning-Explanation based learning-Learning using relevance information-Inductive logic programming-Statistical learningmethods: Learning with hidden variables-Instance based learning-Neural networks-Kernel machines-Reinforcementlearning-Passive-Active learning-Generalization in reinforcement learning-Policy search.

UNIT V EXPERT SYSTEMS (9)

Introduction to expert system-Expert system tools: Knowledge representation-Nature of expert system tools-Stages indevelopment of expert system tools-Examples-Building an expert system: Choosing tools, acquiring knowledge-Expertsystem building process.


Reference Books

1. Stuart Russell, Peter Norvig, “Artificial Intelligence, A Modern Approach”, Pearson education, second edition,2007.

2. Donald A. Waterman,” A Guide to Expert Systems”, Pearson education, 2009

3. Elaine rich, Kevin knight, Shivashankar B Nair,” Artificial Intelligence”, Tata McGraw Hill, Third edition,2009

4. Nilsson, N. J., “Artificial Intelligence: A New Synthesis”, Morgan Kaufmann. 1998.

5. Bratko, I., “Prolog Programming for Artificial Intelligence”, Third edition., Pearson Education. 2001.

35


12CS16 ADVANCED COMPILER DESIGN

L T P C

3 0 0 3

UNIT I OVERVIEW (9)

Language processors-Structure of compiler-Syntax definition-Syntax directed translation-Parsing-A translator for simpleexpressions-Lexical analysis-Symbol tables-Intermediate code generation.

UNIT II CODE GENERATION (9)

Issues in design of a code generator- Target language- Addresses in the target code-Basic blocks and flow graphs-Optimization of basic blocks-A simple code generator-Peep hole optimization-Register allocation and assignment-Instructionselection by tree rewriting- Optimal code generation for expressions-Dynamic programming code generation.

UNIT III MACHINE INDEPENDENT OPTIMIZATIONS (9)

The principal sources of optimization-Introduction to Data flow analysis-Foundations of data flow analysis-Constantpropagation-Partial redundancy elimination-Loops in flow graphs-Region based analysis-Symbolic analysis

UNIT IV INSTRUCTION LEVEL PARALLELISM (9)

Processor Architectures-Code scheduling constraints - Basic block scheduling-Global code scheduling- Software pipelining.

UNIT V OPTIMIZING FOR PARALLELISM AND LOCALITY (9)

Basic concepts - Matrix multiply- Iteration spaces-Affine array indexes - Data reuse-Array data dependence analysis-Finding synchronizations – Free parallelism – Synchronization between parallel loops – pipelining – Locality optimizations– Other uses of affine transforms.


Reference Books

1. Alfred V. Aho, Monica S.Lam, Ravi Sethi, Jeffrey D.Ullman, “Compilers: Principles, Techniques and Tools”,Second Edition, Dorling Kindersley(India) Pvt Ltd., 2011.

2. Steven S. Muchnick, “Advanced Compiler Design and Implementation”, Morgan Kaufmann Publishers -Elsevier Science, India, Indian Reprint 2003.

3. Allen I. Holub, “Compiler Design in C”, Prentice-Hall software series, 2012

4. Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern Architectures: A Dependence-basedApproach”, Morgan Kaufmann Publishers, 2002.

5. Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers Elsevier Science,2004.

6. V. Raghavan, “Principles of Compiler Design”, Tata McGraw-Hill Education Publishers, 2010.

36


12CS17 COMPUTER NETWORK AND SECURITY

L T P C

3 0 0 3

UNIT I INTRODUCTION AND SYMMETRIC CIPHERS (9)

Overview: Services, Mechanisms and Attacks – The OSI Security Model Architecture –A model of Network Security.Classical Encryption Techniques: Symmetric Cipher Model- Substitution Techniques – Transposition Techniques – RotorMachines – Steganography. Block ciphers and Data Encryption Standard: Simplified DES – Block Cipher Principles –The Data Encryption Standard – The Strength of DES- Differential and Linear Cryptanalysis – Block Cipher DesignPrinciples - Block Cipher Modes of Operation.

UNIT II NUMBER THEORY (9)

Groups, Rings and Fields- Modular Arithmetic – Euclid’s Algorithm – Finite fields of the Form GF(p) – Finite fields of theForm GF(2n) – Polynomial Arithmetic – Congruence and residue Classes – Euler’s phi Function – Theorems of Fermatand Lagrange – Compute Square root Modulo Integer - Compute Square root Modulo Integer –Blum Integers.

UNIT III PUBLIC KEY ENCRYPTION AND HASH FUNCTIONS (9)

Public Key Cryptography: Principles of Public Key Cryptosystem- RSA Algorithm- Diffie Hellman Key Exchange –Elliptic Curve Cryptography - Cryptographic Hash Functions - Message Authentication Codes – Kerberos – X.509Authentication Service and Protocols - Digital Signatures - Key Management and Distribution -User AuthenticationProtocols

UNIT IV NETWORK SECURITY (9)

Electronic Mail Security: PGP, S/MIME. IP Security: Architecture –Authentication Header- Encapsulating SecurityPayload – Web Security: SSL /TLS , SET

UNIT – V LEGAL AND ETHICAL ISSUES AND ADVANCED TOPICS (9)

Legal and Ethical Issues: Cybercrime and Computer Crime - Intellectual Property – Privacy - Ethical Issues. Viruses andRelated Threats – Firewall.


Reference Books

1. William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall of India,FifthEdition.

2. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, “Handbook of Applied Cryptography”, CRCPress

3. Neal Koblitz,”A course in number theory and cryptography”, Springer.

4. Bruce Schneier , “ Applied Cryptography “, Second Edition, Toha Wiley & Sons 1996.

37


12CS18 CRYPTOGRAPHY AND CRYPTANALYSIS

L T P C

3 0 0 3

UNIT I INTRODUCTION TO CRYPTOGRAPHY (9)

Basic cryptographic Techniques: Classical encryption techniques, Stream Cipher, Block Ciphers Shannon’s Theory:Elementary probability theory, Entropy, Product Cryptosystems. Finite fields: Euclidean Algorithm, Finite fields of theform GF(p) and GF(2n), Fermat’s and Euler’s theorem, Chinese remainder theorem, Discrete Logarithms.

UNIT II SYMMETRIC ENCRYPTION (9)

Data encryption standard, strength of DES, Avalanche effect, Modes of operation. Symmetric Ciphers: advanced Encryptionstandard, Triple DES, Blowfish, RC4, RC5, Confidentiality using Symmetric encryption.

UNIT III ASYMMETRIC ENCRYPTION (9)

Asymmetric techniques: Public key cryptography and RSA, Cryptographic hash functions, RSA Cryptosystem andFactoring Integers. Public key Cryptosystem based on the Discrete Logarithm Problem: Algorithms for the DiscreteLogarithm Problem Elliptic curves arithmetic and cryptography, Security of ElGamal System Signature Schemes: SecurityRequirements, ElGamal signature Scheme, Provably Secure Signature Schemes;Undeniable, Fail- stops Signatures.

UNIT IV CRYPTANALYSIS TECHNIQUES (9)

Introduction to zero knowledge protocols, Brute Force Attack, Cryptanalysis of Monoalphabetic and Polyalphabeticsubstitution ciphers – Linear and Differential cryptanalysis of DES, Factoring Algorithms, Attack on RSA, Timing andreplay attacks- Birthday attacks.

UNIT V COMPLEXITY ANALYSIS (9)

Complexity analysis of Brute force and other cryptanalysis techniques. Reducing search space and complexity ofcryptanalysis using Genetic algorithms


Reference Books

1. Douglas R. Stinson, Chapman & Hall, “Cryptography Theory and Practice”, CRC Press, 2002.

2. Wenbo Mao, “ Modern Cryptography Theory and practice”, Pearson Education, 2004.

3. William Stallings, “ Cryptography and Network Security Principles and Practices “, Fourth Edition, PrenticeHall of India, 2006.

38


12CS19 NETWORK OPTIMIZATION TECHNIQUES

L T P C

3 0 0 3

UNIT 1 SHORTEST PATH PROBLEMS (9)

Introduction -Graphs and Flows - Network Flow Models- Network Flow Algorithms- Problem Formulation and Applications-Shortest Path Algorithm- Label Setting (Dijkstra) Methods- Label Correcting Methods- Comparison of Label Setting andLabel Correcting -Single Origin/Single Destination Methods- Auction Algorithms- Multiple Origin/Multiple DestinationMethods.

UNIT II MAX-FLOW AND MIN-COST FLOW PROBLEM (9)

The Max-Flow and Min-Cut Problems - The Ford-Fulkerson Algorithm- Price-Based Augmenting Path Algorithms-Transformations and Equivalences- Duality.

UNIT III SIMPLEX METHODS, DUAL ASCENT METHODS AND AUCTION ALGORITHMS FORMIN-COST FLOW (9)

Main Ideas in Simplex Methods- The Basic Simplex Algorithm- Extension to Problems with Upper and Lower Bounds-Dual Ascent- Primal-Dual Method -Relaxation Method -Implementation Issues-Auction Algorithm for the AssignmentProblem-Extensions of the Auction Algorithm-Preflow-Push Algorithm for Max-Flow- Relaxation Method -Auction/Sequential Shortest Path Algorithm.

UNIT IV NONLINEAR NETWORK (9)

Convex and Separable Problems -Problems with Side Constraints-Multicommodity Flow Problems-Integer Constraints -Networks with Gains-Optimality Conditions-Duality-Algorithms and Approximations.

UNIT V CONVEX SEPARABLE AND INTEGER CONSTRAINTS NETWORK PROBLEMS (9)

Convex Functions of a Single Variable -Optimality Conditions -Dual Function Differentiability-Algorithms for DifferentiableDual Problems - Auction Algorithms - Monotropic Programming-Integer-Constrained Problems -Branch-and-Bound -Lagrangian Relaxation-Local Search Methods-Rollout Algorithms.


Reference Books

1. Dimitri P. Bertsekas “Network optimization: Continuous & Discrete Models”, Hardcover Athena Scientific,Belmont, Massachusetts May-19982. Ahuja.R.K.

2. Magnanti.T.L., Orlin.J.B., “Network Flows: Theory, Algorithm and Applications”, Prentice Hall,19933.

3. Cook.W.J., Cunningham.W.H., Pulleyblank.W.R., and Schrijver.A,” Combinatorial Optimization”, John Wiley&Sons,1998.

39


12CS20 NETWORK RECOVERY

L T P C

3 0 0 3

UNIT 1 INTRODUCTION (9)

Communications Networks Today -Network Reliability -Phases in a Recovery Process-Performance of RecoveryMechanisms-Characteristics of Single-Layer Recovery Mechanisms-Multilayer Recovery -SDH and SONET Networks-Operational Aspects -Ring Protection- Linear Protection – Restoration

UNIT II OPTICAL NETWORK (9)

Evolution of optical network layer – The optical Transport Network – Fault detection and Propagation - Recovery inOptical Network – Recovery Mechanism in ring based optical Network & Mesh based optical Network – Availability –Recent trends.

UNIT III IP ROUTING (9)

Routing protocols – Analysis of IP routing recovery cycle – Failure profile and Fault detection – Dampening algorithms –FIS propagation – Route Computation – Temporary loop during network state changes – Load balancing – QOS duringfailure – Non stop forwarding.

UNIT IV MPLS TRAFFIC ENGINEERING AND MULTILAYER NETWORKS (9)

MPLS traffic engineering refresher – Analysis of recovery cycle – MPLS traffic engineering global default restoration –Global path protection – local protection – Recovery alternative – Load balancing – Comparison of Global and LocalProtection – Revertive Vs non – revertive mode – Failure profile and fault detection- ASON/G - MPLS networks –Generic Multilayer Recovery approaches

UNIT V PREVENTING DISASTER (9)

Fire –Human Resources –Backups –Virus Containment – Healthy and Safety –Terrorism


Reference Books

1. Jean Philippe Vasseur, Mario Pickavet, Piet Demeester, “Network Recovery Protection and Restoration ofOptical, SONET-SDH, IP and MPLS”, Elsevier, 2005.

2. Michael Wallace, Lawrence Webber, “The Disaster Recovery Handbook: A Step-by-Step Plan to Ensure BusinessConnectivity”, Business & Economics, 2004.

3. Walrand J. Varaiya, “High Performance Communication Networks”, Elsevier, Second Edition, 2000.

40


12CS21 HIGH SPEED NETWORKS

L T P C

3 0 0 3

UNIT I HIGH SPEED NETWORKS (9)

Frame Relay Networks – Asynchronous Transfer Mode – ATM Protocol Architecture, ATM logical Connection, ATMCell – ATM Service Categories – ATM Adaptation Layer AAL. High Speed LANs: Fast Ethernet, Gigabit Ethernet,Fiber Channel – Wireless LANs: Applications, Requirements–Architecture of 802.11

UNIT II CONGESTION AND TRAFFIC MANAGEMENT (9)

Queuing Analysis-Queuing Models–Single Server Queues–Effects of Congestion–Congestion Control – TrafficManagement –Congestion Control in Packet Switching Networks–Frame Relay Congestion control.

UNIT III TCP AND ATM CONGESTION CONTROL (9)

TCP Flow control–TCP Congestion Control–Retransmission–Timer Management –Exponential RTO back off–KARN’sAlgorithm–Window management–Performance of TCP over ATM . Traffic and Congestion control in ATM–Requirements–Attributes–Traffic Management Frame work, Control – ABR traffic Management–ABR rate control,RM cell formats, ABR Capacity allocations– GFR traffic management.

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES (9)

Integrated Services Architecture – Approach, Components, Services- Queuing Discipline , FQ, PS, BRFQ,GPS,WFQ–Random Early Detection, Differentiated Services.

UNIT V PROTOCOLS FOR QOS SUPPORT (9)

RSVP – Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms – Multiprotocol Label Switching– Operations, Label Stacking, Protocol details – RTP – Protocol Architecture, Data Transfer Protocol, RTCP.


Reference Books

1. William Stallings, “High Speed Networks And Internet”, Pearson Education, SecondEdition,2002.

2. Warland & Pravin Varaiya, “High Performance Communication Networks”, Jean Harcourt Asia Pvt. Ltd.,SecondEdition , 2001.

3. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press,Volume1and2,2003.

41


12CS22 DIGITAL IMAGE PROCESSING AND APPLICATIONS

L T P C

3 0 0 3

UNIT I FUNDAMENTALS OF IMAGE PROCESSING (9)

Introduction – Image Processing System - Steps In Image Processing Systems –Sampling And Quantization – ColorFundamentals And Models, File Formats. Image Transforms: DFT, FFT, DCT, Walsh, Hadamard, Haar, Slant, KL AndRadon Transforms.

UNIT II IMAGE ENHANCEMENT AND RESTORATION (9)

Histogram processing – Fundamentals of Spatial Filtering – Histogram Processing– Smoothing and Sharpening SpatialFilters. Filtering in Frequency Domain: Image Smoothing and Sharpening using Frequency Domain Filters. Noise Models– Inverse Filtering – Geometric Spatial transformation – image rest ration technique.

UNIT III IMAGE SEGMENTATION AND FEATURE ANALYSIS (9)

Detection of Isolated Points – Line Detection – Edge Models – Edge Linking and Boundary Detection – Thresholding –Region based Segmentation – The use of motion in Segmentation – Feature analysis and Extraction.

UNIT IV MULTI RESOLUTION ANALYSIS AND COMPRESSIONS (9)

Multi Resolution processing: Image pyramids - Subband Coding – Multiresolution Expansions – Wavelet Transform inone dimension and two dimension – Wavelet Packets. Image Compression: Fundamentals – Models – Elements ofInformation Theory – Lossy compression – Compression Standards – JPEG/MPEG.

UNIT V APPLICATIONS OF IMAGE PROCESSING (9)

Representation and Description, Image Recognition – Image Understanding – Image Classification – Video MotionAnalysis – Image Fusion – Image Steganography – Color Image Processing.


Reference Books

1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Third Edition, Pearson Education,2008.

2. Anil K. Jain, “Fundamental of Digital Image Processing”, Prentice Hall , 1989.

3. B.Chanda, D.Dutta majumder, “ Digital Image Processing and Analysis”, Second Edition,PHI,2011

4. Annadurai. S, Shanmugalakshmi. R, “Fundamentals of Digital Image Processing”, Pearson Education(Singapore) Pvt. Ltd., 2007.

5. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and Machine Vision”, ThirdEdition, Brooks Cole, 2008.

6. S. Sridhar, “Digital Image Processing”, OXFORD University press, 2011.

7. S. Jayaraman, S.Esakkirajan, T.Veerakumar, “Digital Image Processing”, Tata McGraw Hill Education Pvt.Ltd., 2009.

42


12CS23 DATA COMPRESSION

L T P C

3 0 0 3

UNIT I INFORMATION THEORETIC FOUNDATION (9)

Lossy and Lossless compression – Modeling and Coding. Entropy, conditional entropy, information, channels. Data models:static and adaptive Coding: Fano, Huffman, Golomb, Rice, Tunstall – Applications of Huffman Coding.

UNIT II CODING TECHNIQUES (9)

Histogram processing – Fundamentals of Spatial Filtering – Histogram Processing– Smoothing and Sharpening SpatialFilters. Filtering in Frequency Domain: Image Smoothing and Sharpening using Frequency Domain Filters. Noise Models– Inverse Filtering – Geometric Spatial transformation – image rest ration technique.

UNIT III LOSSLESS LOSSY IMAGE COMPRESSION (9)

Multi resolution – CCITT Group 3 and 4 – JBIG, JBIG2. Lossy coding – Distortion- Rate distortion- Linear systemmodels. Image Compression Standards: JGEG, JPEG 2000 and MPEG.

UNIT IV SCALAR AND VECTOR QUANTIZATION (9)

Uniform and Nonuniform quantizers : Adaptive quantization: Forward Adaptive Quantization – Backward AdaptiveQuantization. Entropy coded quantiztion: Lloyd-Max quantizer .Vector Quantization: LBG quantizer – Tree Structuredquantizer – Trellis coded quantization.

UNIT V DIFFERENTIAL AND TRANSFORM ENCODING (9)

Predictive DPCM – Adaptive DPCM – Delta modulation. Transform coding – Basis- inner products – orthogonality andorthonormality .Karhunen- Loeve Transform –DCT-Walsh and Hadamard Transform.


Reference Books

1. Sayood, Khalid, “Introduction to Data Compression “, Third Edition, Morgan Kaufmann Publishers, 2006.

2. Anderson, J.B. and Mohan, S., “Source and Channel Coding “, Kluwer, 1991.

3. Gersho, A. and Gray, R.M., “ Vector Quantization and Signal Compression “, Kluwer, 1992.

4. Netravali.A.N., “ Digital Pictures: Representation and Compression “, Plenum, 1989.

5. Rao.K.R., and Yip.P., “ Discrete Cosine Transform “, Academic Press, 1990.

6. Storer.J.A., “ Data Compression Methods and Theory “, Computer Science Press, 1988.

7. Williams.R.N.,” Adaptive Data Compression “, Kluwer, 1991.

43


12CS24 PATTERN RECOGNITION

L T P C

3 0 0 3

UNIT I LINEAR MODELS FOR REGRESSION AND CLASSIFICATION (9)

Linear basics function models-The Bias-Variance Decomposition-Bayesian Linear Regression-Bayesian model comparison-The Evidence Approximation-Limitations-Fixed Basis Functions-Linear Models For Classification :Discriminant Functions-[2 and multiple classes-Least squares-Fishers –Linear Discriminant -Probabilistic Generative models-probabilisticDiscriminant models-The Laplace approximation-Bayesian logistic regression.

UNIT II NEURAL NETWORK AND KERNEL METHODS (9)

Feed Forward Network Functions-Network Training-Error Back Propagation-The Hessian Matrix-Regularization InNeural Networks-Mixture Density Networks-Bayesian Neural Networks-Kernal Methods :Dual Representations-Constructing Kernels-Radial Basis Function Networks-Gaussian Processes.

UNIT III SPARSE KERNEL MACHINES AND GRAPHICAL MODELS (9)

Maximum Margin Classifiers-Relevance Vector Machines-Graphical Models: Bayesian Networks-ConditionalIndependence-Markov Random Fields- Inference in Graphical Models.

UNIT IV MIXTURE MODELS, EM AND APPROXIMATE INFERENCE (9)

K-Means Clustering-Mixtures Of Gaussian-Alternate View Of EM-Approximate Inference: Variational Inference-Variational Mixture Of Gaussian-Variational Linear Regression-Exponential Family Distribution-Local Variational Models-Variational Logistic Regression-Expectation Propagation.

UNIT V SAMPLING METHODS AND CONTINUOUS LATENT VARIABLES SEQUENCE DATA ANDCOMBINING MODELS (9)

Basic Sampling Algorithms – Markov Chain Monte Carlo-Gibbs Sampling-Slice Sampling-Hybrid Montecarlo Algoirhtm-Estimating The Partition Function-Continuous Latent Variables: Principal Component Analysis- Probabilistic PCA- KernelPCA-Non Linear Latent Variable Models- Sequential Data :Markov Models- Hidden MM -HMM Dynamical System-Combining Models:Bayesian Models:Bayesian Model Averaging-Committees-Boosting- Tree Based Model – ConditionalMixture Model.


Reference Books

1. Bishop, “ Pattern recognition & machine learning”, Springer Second printing edition, 2007.

2. Dud, Hart ,”Pattern Classification”, Second Edition, Wiley 2001.

3. Sergios Theodoridis,Konstantious kourtroumlas, “ Pattern recognition” Fourth Edition Elsevier Inc AcademicPress, 2009.

4. Sergios Theodoridis, Aggelos Pikrakis,Konstantious kourtroumlas and Dioriris cavmras,”Introduction topattern recognition , A malloch Approach”, Elsevier Inc Academic Press, 2010.

44


12CS25 BIOMETRICS

L T P C

3 0 0 3

UNIT I (9)

Introduction – Benefits of biometric security – Verification and identification – Basic working of biometric matching –Accuracy – False match rate – False non-match rate – Failure to enroll rate – Derived metrics – Layered biometricsolutions.

UNIT II (9)

Finger scan – Features – Components – Operation (Steps) – Competing finger Scan technologies – Strength and weakness.Types of algorithms used for interpretation - Facial Scan - Features – Components – Operation (Steps) – Competingfacial Scan technologies – Strength and weakness.

UNIT III (9)

Iris Scan - Features – Components – Operation (Steps) – Competing iris Scan technologies – Strength and weakness.Voice Scan - Features – Components – Operation (Steps) – Competing voice Scan (facial) technologies – Strength andweakness.

UNIT IV (9)

Other physiological biometrics – Hand scan – Retina scan – AFIS (Automatic Finger Print Identification Systems) –Behavioral Biometrics – Signature scan- keystroke scan.

Biometrics Application – Biometric Solution Matrix – Bio privacy – Comparison of privacy factor in different biometricstechnologies – Designing privacy sympathetic biometric systems. Biometric standards – (BioAPI , BAPI) – Biometricmiddleware.

UNIT V (9)

Biometrics for Network Security. Statistical measures of Biometrics. Biometric Transactions.


Reference Books

1. SamirNanavati, Michael Thieme, Raj Nanavati,”Biometrics – Identity Verification in a Networked World”,WILEY Dream Tech.

2. Paul Reid , “Biometrics for Network Security”, Pearson Education.

3. John D. Woodward., “Biometrics- The Ultimate Reference”,Wiley Dreamtech.

45


12CS26 MULTIMEDIA SYSTEMS

L T P C

3 0 0 3

UNIT I INTRODUCTION TO MULTIMEDIA (9)

Media and Data Streams – Sounds/Audio – Images and Graphics – Video and Animation – Multimedia software Tools.

UNIT II MULTIMEDIA AUTHORING AND TOOLS (9)

Multimedia Authoring – Useful Editing and Authoring Tools – VRML. Multimedia Operating Systems: Real time andMultimedia – Resource management – Process management – File Systems – Operating Systems Issues – MultimediaDatabase Systems.

UNIT III MULTIMEDIA COMMUNICATION (9)

Basics of Computer and Multimedia Networks – Multiplexing Technologies- LAN and WAN – Access Networks –Common peripheral interfaces. Multimedia Network Communications: Quality of Multimedia Data Transmission –Multimedia over IP – Multimedia over ATM Networks.

UNIT IV SYNCHRONIZATION (9)

Introduction – Notion of Synchronization – Presentation Requirements – A reference model for Multimedia Synchronization– Synchronization Specification – Case Studies. Multimedia Applications: Media Entertainment – Virtual Reality –Interactive Video – Interactive Audio – Implementation of Conversational Services – Implementation of Retrieval Services.

UNIT V MULTIMEDIA DATA COMPRESSION (9)

Lossless Compression algorithms – Lossy Compression algorithms – Image Compression Standards –JPEG, JPEG-LS,JBIG – Basic Video Compression techniques – H.261, H.263, MPEG Video Coding – Basic Audio Compression techniques– MPEG Audio Compression.


Reference Books

1. Ralf Steinmetz and Klara Nahrstedt, “Multimedia:Computing, Communications & Applications”, InnovativeTechnology Series, Pearson Education, 2003.

2. Ze-Nian Li, Mark S. Drew, “Fundamentals of Multimedia”, International edition, Pearson Prentice Hall,2004.

3. Prabhat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003.

46


12CS27 MOBILE COMMUNICATION TECHNIQUES

L T P C

3 0 0 3

UNIT I BASIC CONCEPTS (9)

Introduction – Modern Wireless Communication Systems: 2G and 3G Wireless networks, WLL and LMDS,WLAN,Bluetooth and PANs – Cellular concepts: System Design Fundamentals: Frequency reuse, Channel assignmentStrategies, Interference and System capacity, Trunking and Grade of service, Improving coverage and Capacity.

UNIT II MOBILE RADIO PROPAGATION (9)

Large scale path loss – Introduction, Reflection, Ground reflection, Diffraction, Scattering, Link budget design Outdoorand Indoor propagation models, Signal penetration - small scale fading and Multipath: Impulse response model,parameters,Types of small-scale fading, Statistical models, Multipath shape factors.

UNIT III MODULATION EQUALIZATION DIVERSITY AND CHANNEL CODING (9)

Digital modulation, Line coding, Pulse shaping, Geometric representation, Linear modulation, Constant envelope modulation,Combined linear and Constant envelope, Spread spectrum modulation, Modulation performance, Survey of equalization,Linear and Non-Linear equalization, Adaptive equalization, Diversity, RAKE receiver, Interleaving, Channel coding, Blockand convolution codes, Coding gain, Trellis and Turbo Codes.

UNIT IV SPEECH CODING AND MULTI ACCESS TECHNIQUES (9)

Characteristics, Quantization, ADPCM, Vocoders, LPC, Choosing speech codecs, GSM and USDC Codecs, PerformanceEvaluation, FDMA, TDMA, Spread Spectrum Multiple Access, SDMA, Packet Radio, Capacity of Cellular Systems.

UNIT V WIRELESS NETWORKING AND STANDARDS (9)

Development, Traffic routing, Data services, CCS, ISDN, SS7, PCS/PCNs, Protocols for Network access, NetworkDatabases, UMTS – AMPS and ETACS, United states Digital cellular, GSM, CDMA, CT2, DECT, PACS, PDC, PHS,US PCS and ISM bands, US wireless cable television.


Reference Books

1. Rappaport.T.S. “Wireless Communication principles and Practice”, Pearson Education, 2002.

2. Fehar. K., “Wireless Digital Communications”, Prentice Hall of India, New Delhi, 1995.

3. Schiller, “Mobile Communications”, Pearson Education Asia Ltd, 2000.

4. Roy Blake, “Wireless Communication Technology”, Thomas Delmar, 2004

47


12CS28 WIRELESS NETWORK TECHNOLOGIES

L T P C

3 0 0 3

UNIT I WIRELESS MEDIUM (9)

Introduction – Radio Propagation Mechanism – Path Loss Modeling and Signal Coverage – Effect of Multipath andDoppler – Channel Measurement and Modeling – Simulation of Radio Channel.

UNIT II WIRELESS MEDIUM ACCESS (9)

Introduction – Fixed Assignment Access for Voice Networks and Performance – Random Access Methods; for MobileData Service, for Wireless LANs –Handoff and Roaming Support– Integration of Voice and Data Traffic; Data Integrationin Voice-Oriented Networks, Voice Integration into Data-Oriented Networks.

UNIT III WIRELESS NETWORK OPERATION (9)

Cellular Topology: Concept, Hierarchy – Cell Fundamentals – Signal to Interference Ratio Calculation – Capacity ExpansionTechniques: Architectural Methods, Channel Allocation Techniques, Digital Systems – Mobility Management: LocationManagement, Handoff Management – Radio Resources and Power Management.

UNIT IV WIRELESS LAN (9)

GSM; Services, Reference Architecture, Handover, Security, Protocol Architecture – CDMA Technology – IS95 CDMAForward Channel – IS95 CDMA Reverse Channel – IMT2000 – Data Oriented CDPD Networks; Services, ReferenceArchitecture, Mobility Management, Protocol Architecture – Wireless Application Protocol (WAP).

UNIT V WIRELESS LAN (9)

IEEE 802.11 WLANs; Overview, Reference Architecture, Layered Protocol Architecture – Wireless Home Networking–Wireless PANs-Architecture of Bluetooth systems–security and privacy concepts-Wimax Standard,HIPERLAN.


Reference Books

1. Kaveth Pahlavan, Prasanth Krishnamurthy.K., “Principles of Wireless Networks”, Pearson Education Asia,2002.

2. William Stallings, “Wireless Communication and Networks”, Prentice Hall, 2002.

48


12CS29 WIRELESS SENSOR NETWORKS

L T P C

3 0 0 3

UNIT I INTRODUCTION AND PHYSICAL LAYER (9)

Overview of Wireless Sensor Networks – Applications and Motivation – Network Performance Objectives – Developmentof Wireless Sensor Networks – Challenges – Wireless Data Networks – Wireless Sensor and Related Networks –Physical Layer – Example Physical Layers – Bluetooth – IEEE 802.11b – Practical Physical Layer for Wireless SensorNetworks.

UNIT II DATA LINK LAYER (9)

Introduction – Medium Access Control – ALOHA – Carrier Sense Multiple Access (CSMA) – Polling – Access Techniquesin Wireless Sensor Networks – WINS – PicoRadio – Mediation Device (MD) – The MD Protocol –The Distributed MDProtocol – “Emergency Mode” – Channel Access.

UNIT III NETWORK LAYER (9)

Network Design Examples – Structure and Routing – Wireless Sensor Network Design Employing a Cluster TreeArchitecture – Network Design – Network Association – Network Maintenance – Routing.

UNIT IV LOCALIZATION AND TRACKING (9)

Tracking Scenario – Tracking Multiple Objects – Networking Sensors – General Issues –Geographic, Energy AwareRouting – Unicast Geographic Routing – Routing on a Curve – Energy Minimizing Broadcast Energy Aware Routing toa Region – Attribute Based Routing – Directed Diffusion – Rumour Routing – Geographic Hash Tables.

UNIT V SENSOR NETWORK PLATFORMS AND TOOLS (9)

Sensor Node Hardware – Berkeley Motes, Programming Challenges, Node-level software platforms, Node-level Simulators,State-centric programming.


Reference Books

1. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-Technology, Protocols, AndApplications”, John Wiley, 2007.

2. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003

3. Edgar H.Callaway, Jr., “Wireless Sensor Networks: Architecture and Protocols”, Auerbach , Publications,2004.

4. Fang Zhao and Leonidas Guibas, “Wireless Sensor Networks: An Information Processing Approach”,Morgan Kaufman Publishers, 2004.

49


12CS30 ADHOC NETWORKS

L T P C

3 0 0 3

UNIT – I FUNDAMENTALS (9)

Introduction – Fundamentals of Wireless Communication Technology – The Electromagnetic Spectrum – Radio PropagationMechanisms – Characteristics of the Wireless Channel – IEEE 802.11a–b Standard – Origin of Ad hoc Packet RadioNetworks – Technical Challenges – Architecture of PRNETs – Components of Packet Radios – Ad hoc WirelessNetworks – What is an Ad Hoc Network? Heterogeneity in Mobile Devices – Wireless Sensor Networks – TrafficProfiles – Types of Ad hoc Mobile Communications – Types of Mobile Host Movements – Challenges Facing Ad hocMobile Networks – Ad hoc wireless Internet.

UNIT II AD HOC ROUTING PROTOCOLS (9)

Introduction – Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks – Classifications of RoutingProtocols – Table–Driven Routing Protocols – Destination Sequenced Distance Vector (DSDV) – Wireless RoutingProtocol (WRP) – Cluster Switch Gateway Routing (CSGR) – Source–Initiated On–Demand Approaches – Ad hocOn–Demand Distance Vector Routing (AODV) – Dynamic Source Routing (DSR) –Temporally Ordered Routing Algorithm(TORA) – Signal Stability Routing (SSR) –Location–Aided Routing (LAR) – Power–Aware Routing (PAR) – ZoneRouting Protocol (ZRP).

UNIT III MULTICASTROUTING IN ADHOC NETWORKS (9)

Introduction – Issues in Designing a Multicast Routing Protocol – Operation of Multicast Routing Protocols – An ArchitectureReference Model for Multicast Routing Protocols –Classifications of Multicast Routing Protocols – Tree–Based MulticastRouting Protocols– Mesh–Based Multicast Routing Protocols – Summary of Tree and Mesh based Protocols – Energy–Efficient Multicasting – Multicasting with Quality of Service Guarantees – Application – Dependent Multicast Routing –Comparisons of Multicast Routing Protocols.

UNIT IV TRANSPORT LAYER– SECURITY PROTOCOLS (9)

Introduction – Issues in Designing a Transport Layer Protocol for Ad hoc Wireless Networks – Design Goals of aTransport Layer Protocol for Ad hoc Wireless Networks –Classification of Transport Layer Solutions – TCP over Ad hocWireless Networks – Other Transport Layer Protocols for Ad hoc Wireless Networks – Security in Ad Hoc WirelessNetworks – Network Security Requirements – Issues and Challenges in Security Provisioning – Network SecurityAttacks – Key Management – Secure Routing in Ad hoc Wireless Networks.

UNIT V QOS AND ENERGY MANAGEMENT (9)

Introduction – Issues and Challenges in Providing QoS in Ad hoc Wireless Networks –Classifications of QoS Solutions –MAC Layer Solutions – Network Layer Solutions – QoS Frameworks for Ad hoc Wireless Networks Energy Managementin Ad hoc Wireless Networks –

Introduction – Need for Energy Management in Ad hoc Wireless Networks – Classification of Energy ManagementSchemes – Battery Management Schemes – Transmission Power Management Schemes – System Power ManagementSchemes.


50


Reference Books

1. C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks Architectures and Protocols”, PrenticeHall, PTR, 2004.

2. C. K. Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall, PTR, 2001.

3. Charles E. Perkins, “Ad Hoc Networking”, Addison Wesley, 2000

51


12CS31 PERVASIVE COMPUTING

L T P C

3 0 0 3

UNIT I PERVASIVE ARCHITECTURE (9)

Local area networks – Wireless LANS – Relationship of wireless, internet and ubiquitous computing – Pervasive computingand ubiquitous computing – Ambient computing – Pervasive web application architecture – Requirements of computationalinfrastructure – Failure management – Security – Performance – Dependability.

UNIT II MOBILE DEVICE TECHNOLOGIES (9)

Mobile computing devices characteristics – Adaptation – Data dissemination and management – Heterogeneity –Interoperability – Context awareness – Language localization issues – User interface design issues – Difference betweenUI design for mobile devices and conventional systems – Mobile agents – Mobile device technology overview – WindowsCE – Symbian – 2ME – Pocket PC – BREW.

UNIT III SENSOR NETWORKS AND RFIDS (9)

Introduction to sensor networks – Sensor node architecture – Sensor network architecture – Types of sensor networks– Platforms for wireless sensor networks – Applications of wireless sensor networks – Introduction to RFID – Transponderand reader architecture – Types of tags and readers – Frequencies of operation – Application of RFID technologies.

UNIT IV LOCAL AREA AND WIDE AREA WIRELESS TECHNOLOGIES (9)

IEEE 802.11 technologies – Infrared technologies – Bluetooth networks (OBEX Protocol) – Personal area networks –Mobility management – Mobile IP – Establishing wide area wireless networks – Concept and structure of “Cell” – Callestablishment and maintenance – Channel management – Frequency assignment techniques.

UNIT V PROTOCOLS AND APPLICATIONS (9)

Networking protocols – Packet switched protocols – Routing protocols for sensor networks – Data centric protocols –Hierarchical protocols – Location – Based protocols – Multimedia Messaging Service (MMS) protocols – WirelessApplication Protocol (WAP) – Applications of pervasive computing – Retail – Healthcare – Sales force automation –Tracking applications.


Reference Books

1. Burkhardt, Henn, Hepper, Rintdorff and Schaeck, “Pervasive Computing”, Addison Wesley,2002.

2. Adelstein, F. and Gupta, S.K.S., “Fundamentals of Mobile and Pervasive Computing”, TataMcGraw Hill,2005.

3. Ashoke Talukdar and Roopa Yavagal, “Mobile Computing”, Tata McGraw Hill, 2005.

52


12CS32 GRID COMPUTING

L T P C

3 0 0 3

UNIT - I INTRODUCTION TO GRID COMPUTING (9)

Introduction – History – High performance Computing – Cluster Computing – Peer – to – Peer Computing – InternetComputing – Grid Computing – Grid Computing Model – Types of Grid - Grid Applications.

UNIT – II GRID COMPUTING ARCHITECTURE (9)

Virtual organizations and the Grid. – Grid Architecture – Implementing Grid Architecture – Open Grid Service Architecture– OGSA Plat form - Open Grid Service Infrastructure – OGSA Interfaces – Implementing OGSA based Grid.

UNIT III GRID PROGRAMMING MODELS (9)

Introduction – Grid Programming Issues – Grid Programming Tools – Advanced Programming Support – GT 3 Programmingmodel – Building Grid Computing Portals(Grid Port).

UNIT IV GRID COMPUTING ENVIRONMENTS (9)

Condor Grid – Introduction – Planning and Scheduling – Problem Solvers – Split execution – Case Studies Legion –Principles and philosophy – Creating and administering Legion Grid – Distributed Processing – Security – automaticFailure detection and recovery. Unicore – Introduction – Infrastructure and Architecture – Supported Grid Services –Security.

UNIT V GRID APPLICATIONS FUTURE TRENDS (9)

Case Studies : eDiamond, Sneha-Samuham, Parset Moset


Reference Books

1. Fran Berman, Geoffrey Fox and Tony Hey , “Grid Computing – Making the Global Infrastructure a Reality”,.Wiley India, Ninth Edition, 2010

2. Ian Foster and Carl Kesselman, “The Grid 2 – Blue Print for a New Computing Infrastructure”, Elsevier,Second Edition, 2006

3. Joshy Joseph and Craig Fellenstein ,” Grid Computing” , Pearson PHI, 2003

4. Ahmar Abbas , “Grid Computing: A Practical Guide to Technology and Applications”, Firewall Media, 2008

5. D Janakiram, Grid Comptuing, “A research Monograph” , TMH, 2009

53


12CS33 CLOUD COMPUTING

L T P C

3 0 0 3

UNIT- I INTRODUCTION TO CLOUD COMPUTING AND SERVICES (9)

Cloud Computing – History of Cloud Computing – Cloud Architecture – Cloud Storage –Advantages and Disadvantagesof Cloud Computing – Companies in the Cloud Today – Cloud Services- Developing Cloud Services

UNIT- II CLOUD COMPUTING APPLICATIONS (9)

Centralizing Email Communications – Collaborating on Schedules – Collaborating on To-Do Lists –Collaborating ContactLists – Cloud Computing for the Community – Collaborating on Group Projects and Events – Cloud Computing for theCorporation

UNIT- III CLOUD SERVICES (9)

Collaborating on Calendars, Schedules and Task Management –Collaborating on Event Management – Collaborating onContact Management –Collaborating on Databases – Storing and Sharing Files

UNIT- IV WEB BASED CLOUD COMPUTING (9)

Collaborating via Web-Based Communication Tools – Evaluating Web Mail Services – Evaluating Web ConferenceTools – Collaborating via Social Networks and Groupware – Collaborating via Blogs and Wikis

UNIT- V SECURITY IN CLOUD AND CASE STUDIES (9)

Infrastructure Security – Data Security – Security management in cloud – The impact of cloud computing on the role ofcorporate IT – Case Studies - Aneka – Cometcloud.


Reference Books

1. Michael Miller,”Cloud Computing: Web-Based Applications, That Change the Way You Work and CollaborateOnline”. Que Publishing, August 2008.

2. Tim Mather, Subra Kumaraswamy, Shahed Latif, “Cloud Security & Privacy” , O’Reilly Media, September2009.

3. Haley Beard,”Cloud Computing Best Practices for Managing and Measuring Processes for On demandComputing, Applications and Data Centers in the Cloud with SLAS”. Emereo Pvt Limited ,July 2008.

54


12CS34 VIRTUALIZATION TECHNIQUES

L T P C

3 0 0 3

UNIT I INTRODUCTION TO VIRTUALIZATION (9)

Basics of Virtualization – Virtualization Types – Model of Virtualization – Layers of Virtualization – Server MachineVirtualization - Application Virtualization – Goals of Virtualization – Taxonomy of Virtual Machines.

UNIT II VIRTUALIZATION INFRASTRUCTURE (9)

Hardware Virtualization- Virtual Hardware Overview – Virtual Machine Products - Sever Consolidation – Server Pooling- Types of Server Virtualization – Business cases for Sever-Virtualization –Selecting server Virtualization Platform

UNIT III NETWORK VIRTUALIZATION (9)

Virtual File Systems – Process Virtualization – Layers in Virtualization – Players in Virtualization - Virtualizing theCampus WAN Design – - Routing Protocols- Virtualization Aware Routing - Multi-Topology Routing – Case Studies ofNetwork Virtualization.

UNIT IV DESKTOP VIRTUALIZATION AND STORAGE VIRTUALIZATION (9)

Desktop Virtualization- Preparing a Virtualization Machine Host- Storage Virtualization - iSCSI Architecture – SecuringiSCSI – SAN backup and recovery techniques – RAID – SNIA Shared Storage Model – Classical Storage Model –Virtual Information Systems.

UNIT V SECURITY (9)

Secure Virtual Infrastructure- Protect Virtual Infrastructure-Prepare Business Continuity -Update Management Structure


Reference Books

1. Dan Kusnetzky ,”Virtualization : A Manager’s Guide”, O’Reily Publications, 2011.

2. Danielle Ruest, Nelson Ruest, “Virtualization : A Beginner’s Guide”,Mc-Graw Hill, 2009

3. Chris Wolf, Erick M. Halter ,”Virtualization : From Desktop to the Enterprise”, A Press, 2006

55


12CS35 SEMANTIC WEB

L T P C

3 0 0 3

UNIT- I INTRODUCTION (9)

History – Semantic Web Layers –Semantic Web technologies – Semantics in Semantic Web – XML:Structuring –Namespaces – Addressing – Querying – Processing.

UNIT- II RDF (9)

RDF and Semantic Web – Basic Ideas - RDF Specification – RDF Syntax: XML and Non- XML – RDF elements –RDF relationship: Reification, Container, and collaboration – RDF Schema – Editing, Parsing, and Browsing RDF/XML-RQL-RDQL.

UNIT-III ONTOLOGY (9)

Why Ontology – Ontology movement – OWL – OWL Specification - OWL Elements – OWL constructs: Simple andComplex – Ontology Engineering : Introduction – Constructing ontologies – Reusing ontologies – On-To-KnowledgeSemantic Web architecture.

UNIT-IV LOGIC AND INFERENCE (9)

Logic – Description Logics - Rules – Monotonic Rules: Syntax, Semantics and examples – Non-Monotonic Rules –Motivation, Syntax, and Examples – Rule Markup in XML: Monotonic Rules, and Non-Monotonic Rules.

UNIT – V APPLICATIONS OF SEMANTIC WEB TECHNOLOGIES (9)

RDF Uses: Commercial and Non-Commercial use – Sample Ontology – e-Learning – Web Services – Web mining –Horizontal information – Data Integration – Future of Semantic Web.


Reference Books

1. Grigorous Antoniou and Van Hermelen, “A Semantic Web Primer”, New Delhi: The MIT Press,2004.

2. James Hendler, Henry Lieberman and Wolfgang Wahlster, “Spinning the Semantic Web: Bringing the worldwide web to its full potential”, New Delhi: The MIT Press, 2004.

3. Shelley Powers, “Practical RDF”. Mumbai: O’Rreilly Publishers, 2003.

56


12CS36 WEB SERVICES AND SERVICE ORIENTED ARCHITECTURE

L T P C

3 0 0 3

UNIT I SOA AND WEB SERVICES FUNDAMENTALS (9)

Introduction – Evolution of SOA – Web services and primitive SOA: Web services framework, services as web services,service description, messaging.

UNIT II SOA AND WS EXTENSIONS (9)

Activity management and Composition: message exchange patterns, service activity coordination, atomic transaction,business activities, orchestration, Choreography- Advanced messaging, meta data and security.

UNIT III SOA AND SERVICE ORIENTATION (9)

Principles of service orientation: SO and enterprise, Anatomy, principles, SO and object orientation, native web servicesand support for SO – Service layers: SOA and contemporary SOA, service layer abstraction, application, business,orchestration service layers, agnostic services, service layer configuration scenarios.

UNIT IV BUILDING SOA: PLANNING AND ANALYSIS (9)

SOA delivery strategies – Introduction to SO analysis, benefits of business centric SOA, deriving business services –SOA service modeling: guidelines, logic, approaches.

UNIT V BUILDING SOA: TECHNOLOGY AND DESIGN (9)

Introduction – SOA composition guideline – Service Design – Business Process Design – SOA platforms.


Reference Books

1. Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”, Pearson Education, 2005.

2. Thomas Erl, “SOA Principles of Service Design “(The Prentice Hall Service-Oriented Computing Series fromThomas Erl), 2005.

3. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education, 2005.

4. Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services, An Architect’s Guide”, PearsonEducation, 2005.

5. Dan Woods and Thomas Mattern, “Enterprise SOA Designing IT for Business Innovation” O’REILLY, FirstEdition, 2006

57


12CS37 DATA WAREHOUSING AND DATA MINING

L T P C

3 0 0 3

UNIT I INTRODUCTION TO DATA WAREHOUSE (9)

Data warehouse environment – Data warehouse design – Granularity – Data warehouse and technology.

UNIT II DATA WAREHOUSE ENVIRONMENT (9)

Distributed data warehouse - External data and data warehouse - Migration to architectural environment – Data warehouseand web - Unstructured data and data warehouse –Relational and Multi dimensional models.

UNIT III INTRODUCTION TO DATA MINING AND ASSOCIATION RULE MINING (9)

Data Mining – functionalities-Major issues - Data cleaning-Data Integration and Transformation-Data Reduction-Discretization and concept hierarchy generation- Efficient and scalable frequent item set mining methods-Mining variouskinds of association rules-Association mining to correlation analysis-Constraint based association mining.

UNIT IV CLASSIFICATION AND CLUSTER ANALYSIS (9)

Classification introduction-Issues-Classification by decision tree induction-Bayesian Classification-Rule based classification-Classification by back propagation-other classification methods-Prediction- Cluster analysis-Types of data in clusteranalysis-Categorization of major clustering methods- Partitioning methods-Hierarchical Methods-Density Based Methods-outlier analysis.

UNIT V GRAPH MINING AND MULTIMEDIA MINING (9)

Graph mining- Multirelational data mining-Multidimensional analysis and descriptive mining of complex data objects-Spatial data mining-Multimedia data mining-Text mining-Mining the world wide web-Data mining applications


Reference Books

1. Jiewei Han, Micheline Kamber, “Data mining concepts and techniques”, Morgan Kaufman Pub, 2006.

2. William H. Inmon, “Building the data ware house”, Wiley Dreamtech (p) Ltd., Fourth Edition, 2005.

3. Ian H.Witten, Eibe Frank, “Data Mining: Practical M/c Learning tools and techniques with Javaimplementation”, Third Edition, Morgan Kaufman, 2000.

4. G.K.Gupta,” Introduction to Data Mining with case studies”, PHI Learning Private Limited, Second edition,2011.

5. Ronen Feldman, James Sangee, “The Text Mining Handbook: Advanced Approaches in analyzing unstructureddata”, Cambridge University Press, 2007.

58


12CS38 REAL-TIME SYSTEMS

L T P C

3 0 0 3

UNIT-I (9)

Typical Real-time applications, Hard versus Soft Real-time systems: Jobs and Processors, Release Times, Deadlines andTiming Constraints, Hard and Soft Timing Constraints, Hard Real-time systems, Soft Real-time systems. A ReferenceModel of Real-time system: Processors and Resources, Temporal Parameters of Real-time Workload, Periodic TaskModel, Precedence Constraints and Data Dependency, Other types of Dependencies, Functional Parameters, ResourceParameters of Jobs and Parameters of Resources, Scheduling Hierarchy.

UNIT II (9)

Commonly used approaches to Real-time Scheduling: Clock driven Approach, Weighted Round-Robin Approach, PriorityDriven Approach, Dynamic versus Static Systems, Effective Release Times and Deadlines, Optimality of the EDF andLST Algorithms, Non optimality of the EDF and LST Algorithms, Challenging in Validating Timing Constraints in Priority-Driven Systems, Off-Line versus On-Line Scheduling.

UNIT III (9)

Clock-Driven Scheduling: Notation and Assumptions, Static, Timer Driven Scheduler, General Structure of Cyclic Schedules,Cyclic Executives, Improving the Average Response Time of Aperiodic Jobs, Scheduling Sporadic Jobs, PracticalConsideration and Generalizations,Algorithms for Constructing Static Schedules, Pros and Cons of Clock-Driven Scheduling.

UNIT IV (9)

Priority-Driven Scheduling of Periodic Tasks: Static Assumption, Fixed-Priority versus Dynamic-Priority Algorithms,Maximum Schedulable Utilization, Optimality of the RM and DM Algorithms, A Schedulability Test for Fixed-PriorityTasks with Short Response Times, Schedulability Test for Fixed-Priority Tasks with Arbitrary Response Times, SufficientSchedulability Conditions for the RM and DM Algorithms. Scheduling Aperiodic and Sporadic Jobs in Priority-DrivenSystems Assumption and Approaches, Deferrable Servers, Sporadic Servers, Constant Utilization, Total Bandwidth, andWeighted Fair Queuing Servers, Scheduling of Sporadic Jobs, Real-time Performance for Jobs with Soft Timing Constraints.

UNIT V (9)

Resources and Resource Access Control: Effects of Resource Contention and Resource Access Control, NonpreemptiveCritical Sections, Basic Priority-Inheritance Protocol, Basic Priority-Ceiling Protocol, Stack-Based Priority-Ceiling (Ceiling-Priority) Protocol, Use of Priority-Ceiling Protocol in Dynamic-Priority Systems, Preemption-Ceiling Protocol, ControllingAccesses to Multiple-Unit Resources.


Reference Books

1. Jane W.S. Liu,”Real-Time Systems”, Pearson Education.

2. R Buhr and D Bailey “Introduction to Real-Time Systems” Addison Wesley

3. C. M. Krishna and K. G. Shin:,”Real-Time Systems”McGraw-Hill,1997.

4. Phillip A. Laplante, “Real-Time Systems Design and Analysis” ,Wiley India..

5. K.V.K. Prasad “Embedded Real –Time Systems” ,Wiley- India/ Dreamtech

59


12CS39 SOFTWARE PROJECT MANAGEMENT

L T P C

3 0 0 3


Conventional Software management – Evolution of software economics – Improving software economics: reducing theproduct size, improving software process and team effectiveness, improving automation, achieving required quality, peerinspection – Old way and the new.

UNIT II SOFTWARE PROCESS MANAGEMENT FRAMEWORK (9)

Life cycle phases - artifacts of the process – Model based software architecture – workflows of the process – checkpointsof the process.

UNIT III SOFTWARE MANAGEMENT DISCIPLINES (9)

Iterative process planning: workflow break down structures, guidelines, the cost and schedule estimating process, iterationplanning, pragmatic planning – project organizations and responsibilities: line of business and project organizations, evolutionof organizations – Process automation: tools, environment.

UNIT IV PROCESS INSTRMENTATION AND TAILORING (09)

Seven core metrics – management indicators – quality indicators – life cycle expectations – pragmatic software metrics– metric automation – process discriminants – example – modern project profiles – next generation software economics–modern process transitions.

UNIT V SOFTWARE MANAGEMENT (9)

State of practice in software management – Change metrics – Case study: CCPDS-R – Process improvement andmapping to the CMM.

LECTURE: 45, TUTORIAL: 0, TOTAL: 45

Reference Books

1. Walker Royce, “Software Project Management: A unified framework”, Pearson education 2005.

2. Bob Hughes, Mikecotterell, “Software Project Management”, Third Edition,Tata McGraw Hill, 2004.

3. Ramesh, Gopalaswamy, “Managing Global Projects”, Tata McGraw Hill, 2001.

4. Royce, “Software Project Management”, Pearson Education, 1999.

5. Jalote, “Software Project Management in Practice”, Pearson Education, 2002.

6. Robert T. Futrell, Donald F. Shefer and Linda I. Shefer, “Quality Software Project Management”, PearsonEducation, 2003.

60


12CS40 QUANTUM COMPUTING

L T P C

3 0 0 3

UNIT 1 FOUNDATION (9)

Overview of traditional computing – Church-Turing thesis – circuit model of computation – reversible computation –quantum physics – quantum physics and computation – Dirac notation and Hilbert Spaces – dual vectors – operators –the spectral theorem – functions of operators – tensor products – Schmidt decomposition theorem

UNIT II QUBITS AND QUANTUM MODEL OF COMPUTATION (9)

State of a quantum system – time evolution of a closed system – composite systems – measurement – mixed states andgeneral quantum operations – quantum circuit model – quantum gates – universal sets of quantum gates – unitarytransformations – quantum circuits- Cryptography, classical cryptography, introduction to quantum cryptography. BB84,B92 protocols. Introduction to security proofs for these protocols.

UNIT III QUANTUM ALGORITHMS – I (9)

Superdense coding – quantum teleportation – applications of teleportation – probabilistic versus quantum algorithms –phase kick-back – the Deutsch algorithm – the Deutsch- Jozsa algorithm – Simon’s algorithm – Quantum phase estimationand quantum Fourier Transform – eigenvalue estimation

UNIT – IV QUANTUM ALGORITHMS – II (9)

Order-finding problem – Eigenvalue estimation approach to order finding – Shor’s algorithm for order finding – findingdiscrete logarithms – hidden subgroups – Grover’s quantum search algorithm – amplitude amplification – quantum amplitudeestimation – quantum counting – searching without knowing the success probability

UNIT V QUANTUM COMPUTATIONAL COMPLEXITY AND ERROR CORRECTION (9)

Computational complexity – black-box model – lower bounds for searching – general black-box lower bounds – polynomialmethod – block sensitivity – adversary methods – classical error correction – classical three-bit code – fault tolerance –quantum error correction – three- and nine-qubit quantum codes – fault-tolerant quantum computation

LECTURE: 45, TUTORIAL: 0, TOTAL: 45

Reference Books

1. P. Kaye, R. Laflamme, and M. Mosca, “An introduction to Quantum Computing”, Oxford University Press,1999.

2. V. Sahni, “Quantum Computing”, Tata McGraw-Hill Publishing Company, 2007.

3. Micheal A. Nielsen. & Issac L. Chiang, “Quantum Computation and Quantum Information”, CambridgeUniversity Press, Fint South Asian edition, 2002.

4. Richard Hughes, D.M.Alde,P.Dyer, G.G.Luther, G.L.Morgan and M.Schayer “Quantum Cryptography”, CornellUniversity Library, 1995.

61


12CS41 OPEN SOURCE SYSTEMSL T P C3 0 0 3

UNIT- I INTRODUCTION (9)Introduction to Open sources – Need of Open Sources – Advantages of Open Sources– Application of Open Sources.GNU and linux installation – Boot process, Commands Using bash features, The man pages, files and file systems, Filesecurity, Partitions, Processes, Managing processes, I/O redirection, Graphical environment, Installing software, Backuptechniques

UNIT- II MYSQL DATABASE (9)MySQL: Introduction – Setting up account – Starting, terminating and writing your own SQL programs – Record selectionTechnology – Working with strings – Date and Time– Sorting Query Results – Generating Summary – Working withmetadata – Using sequences – MySQL and Web.

UNIT - III PHP PROGRAMMING (9)

PHP: Introduction – Programming in web environment – variables – constants – data types – operators – Statements –Functions – Arrays – OOP – String Manipulation and regular expression – File handling and data storage – PHP and SQLdatabase – PHP and LDAP – PHP Connectivity – Sending and receiving E-mails – Debugging and error handling –Security – Templates.

UNIT- IV PYTHON PROGRAMMING (9)Syntax and Style – Python Objects – Numbers – Sequences – Strings – Lists and Tuples – Dictionaries –Conditionals and Loops – Files – Input and Output – Errors and Exceptions – Functions – Modules – Classes and OOP– Execution Environment.

UNIT -V OPEN SOURCE TOOLS AND TECHNOLOGIES (9)Web Server: Apache Web server – Working with Web Server – Configuring and Using apache web services Basics ofthe X Windows server architecture - Qt Programming - Gtk+ Programming.

LECTURE: 45, TUTORIAL: 0, TOTAL:45Reference Books1. Machtelt Garrels, “.Introduction to Linux- A Hands-On Guide “,Third Edition,Fultus Corporation.2. Steve Suchring, “MySQL Bible”, John Wiley, 20023. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 20024. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 20015. Peter Wainwright, “Professional Apache”, Wrox Press, 2002.6. GTK+/GNOME , “ Application Development”, Havoc Pennington.7. http://developer.gnome.org/doc/GGAD

Date post:	04-Aug-2018
Category:	Documents
Upload:	doanlien
View:	219 times
Download:	0 times

curriculam M.E. Degeree - Government College Of … · Software and hardware multithreading – SMT...

Documents