Department

of Information Technology

School of Technology North Eastern Hill University

Umshing, Shillong-22

Course Structure & Syllabus for

M.Tech. (IT) Program

Objectives

This two years M.Tech. (IT) program aims to prepare candidates for the research &

development as well as for I.T. industry. To provide the students state-of-the-art of recent

technologies and to develop their capacity to tackle unknown engineering problems, the

syllabus has balanced the core, specialized and elective subjects, integrating the practical

and field exercises with challenging research oriented project activities.

Course Structure &

Detailed Syllabus

Course Layout *Note: Number inside bracket indicates total no. of paper

Adopted Course Code (XX- αβγ) XX-α β γ

Subject number 0: Theory, 1: Practical.

Semester Number (First Sem.- 9, Second Sem.- A, Third Sem.- B and Fourth Sem.- C). For all electives it is started with E.

Teaching Subject code

Acronyms Used in Teaching Subject Code (XX):

IT - Information Technology

MA - MAthematics

Example: IT-A14 implies that Teaching subject concern is Information Technology and, it is the 4th Practical

paper of 2nd semester.

Course Structure

Year: I Semester I

Sl. No.

Course No.

SUBJECT PERIODS EVALUATION SCHEME Credits

(THEORY) L T P Sessional Work ES E SUB TOTAL

TA CT TOT

1 IT 901 Mathematical Foundations of Information Science

4 0 0 30 30 60 90 150 3

2 IT 902 Theory of Computer Science

4 0 0 30 30 60 90 150 4

3 IT 903 Computer

Architecture and Operating System

4 0 0 30 30 60 90 150 3

4 IT 904 Advanced Database System

4 0 0 30 30 60 90 150 4

5 Elective 4 0 0 30 30 60 90 150 4 PRACTICALS

6 IT 915 Software System Lab 0 0 4 20 - - 30 50 2

Total 19 0 4 - - - 800 20

TA-Teachers Assessment CT-Class Test ESE-End Semester Examination Total Marks: 800 L – Lecture T – Tutorial P – Practical Total Periods: 23 Total Credits: 20

Year: I Semester II Sl. No.

Course No. SUBJECT PERIODS EVALUATION SCHEME Credits

(THEORY) L T P Sessional Work ESE SUB TOTAL

TA CT TOT

1 IT A01 Algorithm and Complexity

4 0 0 30 30 60 90 150 4

2 IT A02 Advanced Computer Networks

4 0 0 30 30 60 90 150 4

3 Elective 4 0 0 30 30 60 90 150 4 4 Elective 4 0 0 30 30 60 90 150 4 5 Elective 4 0 0 30 30 60 90 150 4

PRACTICALS 6 IT A13 Seminar on advanced

topics 0 0 2 50 50 2

7 IT A14 Internet Technology Lab

0 0 3 20 - 20 30 50 2

Total 17 0 5 850 24 TA-Teachers Assessment CT-Class Test ESE-End Semester Examination Total Marks: 850 L – Lecture T – Tutorial P – Practical Total Periods: 22 Total Credits: 24

Year: II Semester III

Sl. No. Course No. SUBJECT PERIODS EVALUATION SCHEME Credits

(THEORY/PROJECT) L T P Sessional Work ESE SUB TOTAL

TA CT TOT

1 IT B01 M.Tech Thesis 0 0 16 60 60 90 150 8 2 Elective 4 0 0 30 30 60 90 150 4 Total 4 0 16 300 12

TA-Teachers Assessment CT-Class Test ESE-End Semester Examination Total Marks: 300 L – Lecture T – Tutorial P – Practical Total Periods: 20 Total Credits: 12

Year: II Semester IV

Sl. No. Course No. SUBJECT PERIODS EVALUATION SCHEME Credits

(THEORY/PROJECT) L T P Sessional Work ESE SUB TOTAL

TA CT TOT

1 IT C01 M.Tech Thesis 0 0 24 100 - 100 200 300 12 Total 0 0 24 - - - 300 12

TA-Teachers Assessment CT-Class Test ESE-End Semester Examination Total Marks: 300 L – Lecture T – Tutorial P – Practical Total Periods: 24 Total Credits: 12

Electives

Sl. No. Code Subject Credit

1 IT E01 Compiler Design 4

2 IT E02 Topics in Programming Languages 4

3 IT E03 Logic and Computation 4

4 IT E04 Topics in Algorithms 4

5 MA E01 Game Theory 4

6 IT E05 Quantum Computation 4

7 IT E06 Distributed Computing 4

8 IT E07 Object Oriented Modeling and Design 4

9 IT E08 Embedded Systems and Applications 4

10 IT E09 Natural Language Processing 4

11 IT E10 Computational Intelligence 4

12 IT E11 Soft Computing 4

13 IT E12 Image Processing 4

14 IT E13 Pattern Recognition 4

15 IT E14 Computational Biology 4

16 IT E15 Cryptography 4

17 IT E16 Formal Methods in Secure Computing 4

18 IT E17 Network Security 4

19 IT E18 Information Theory and Coding 4

20 IT E19 Perimeter Security 4

21 IT E20 Data Compression 4

22 IT E21 Multimedia Systems 4

23 IT E22 Computer Laws and Ethics 4

24 IT E23 Security Policies and Assurance 4

25 MA E02 Fuzzy Set Theory and Applications 4

26 MA E03 Advanced Topics in Graph Theory 4

27 IT E24 Advanced Topics in Information Security

4

28 IT E25 Robotics 4

29 IT E26 Data mining and Data warehousing 4

30 IT E27 Advanced Wireless Networks 4

Note: Electives are not semester specific and are denoted by the letter E in the three digit code.

Detailed Syllabus

IT 901: Mathematical Foundations of Information Science Divisibility, gcd, prime numbers, fundamental theorem of arithmetic,Congruences, Fermat's theorem, Euler function, primality testing, solution of congruences, Chinese remainder theorem, Wilson’s theorem. Groups and subgroups, homomorphism theorems, cosets and normal subgroups, Lagrange’s theorem, rings, finite fields, polynomial arithmetic, quadratic residues, reciprocity, discrete logarithms, elliptic curve arithmetic. Fundamental principles of counting, pigeonhole principle, countable and uncountable sets, principle of inclusion and exclusion, derangements, equivalence relations and partitions, partial order, lattices and Boolean algebra, generating functions, recurrence relations, solution of recurrences. Graphs, Euler tours, planar graphs, Hamiltonian graphs, Euler's formula, applications of Kuratowski's theorem, graph colouring, chromatic polynomials, trees, weighted trees, shortest path algorithms, spanning trees, the max-flow min-cut theorem.

Books/References

1. Niven, H.S. Zuckerman and Montgomery, An Introduction to the Theory of Numbers, 3/e, John Wiley and Sons, New York, 1992.

2. R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction,3/e, Addison-Wesley, New Delhi, 1994.

3. B. Kolman and R.C. Busby, Discrete Mathematical Structures for Computer Science, PHI, New Delhi, 1994. 4. J. Clark and D. A. Holton, A First Look at Graph Theory, Allied Publishers (World Scientific), New Delhi, 1991. 5. C. L. Liu, Elements of Discrete Mathematics, McGraw Hill, 2/e, Singapore, 1985.

IT 902 Theory of Computer Science

Machines: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and non-deterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of finite automata, Two-way finite automata. Regular Sets and Regular Grammars: Alphabet, words, Operations, Regular sets, Finite automata and regular expression, Pumping lemma and regular sets, Application of pumping lemma, closure properties of regular sets. Formal Grammars & Languages: Basic definitions and examples of languages, Chomsky hierarchy, Regular grammars, context free & context sensitive grammars, context free languages, non-context free languages, Chomskey normal forms, binary operations on languages. Turing Machines & Pushdown Automata: TM model, representation and languages acceptability of TM Design of TM, Universal TM & Other modification, composite & iterated TM, Pushdown automata , Acceptance by PDA. Computability: Basic concepts, primitive & partial recursive function, Recursive function, Decidability, Kleen’s theorem. Undecidibility: Properties of recursive & recursively enumerable languages, Universal Turing machine and an undecidable problem, Rice’s theorem & some more un decidable problems. Computational complexity Theory: Definition, linear speed-up, tape compression & reduction in number of tapes, Hierarchy Theorem, Relation among complexity measures, Transition lemmas & non deterministic hierarchies, properties of general complexity measures, the gap, speed-up, union theorem, Automatic complexity theorem.

Book/ References 1. John E. Hopcroft, Jeffery Ullman, Introduction to Automata theory, Langauges & computation, Narosa publishers. 2. E.V. Krishnamurthy, Introductory Theory of computer science. 3. K.L.P. Mishra, Theory of computer Science, Prentice Hall of India Pvt. Ltd.

L T P C 3 0 0 3

L T P C 4 0 0 4

IT 903 Computer Architecture and Operating System

Introduction: quantitative techniques in computer design, measuring and reporting performance. CISC and RISC processors. Compiler techniques for improving performance. Hierarchical memory technology: inclusion, Coherence and locality properties; Cache memory organizations, Techniques for reducing cache misses: virtual memory organization, mapping and management techniques, memory replacement policies. Instruction – level parallelism: basic concepts, techniques for increasing ILP, superscalar super pipelined and VLIW processor architectures. Parallel Architectures. Distributed Cluster computers. Non von Neumann architectures: data flow computers, reduction Computer architecture, systolic architectures. Evolution of Operating Systems, Structural overview, Concept of Process and Process synchronization, Process Management and Scheduling, Hardware requirements: protection, context switching, privileged mode; Threads and their Management; Tools and Constructs for Concurrency, Detection and Prevention of deadlocks, Dynamic Resource Allocation, Design of IO systems, File Management, Memory Management: paging, virtual memory management, Distributed and Multiprocessor Systems.

Book/References: 1. Hwang & Briggs—Computer Architecture & Parallel Processing, TMH 2. Stone, Computer Architecture, Galgotia Publication 3. Hennessy Patterson, Computer Architecture: A Quantitative Approach, Elsevier Publication. 4. Galvin, Operating Systems Concepts, Addison Wesley 5. Andrew S. Tanenbaum , Modern Operating System. 6. Andrew S. Tanenbaum, Distributed Operating System. 7. M. Milankovis, Operating System Concept & Design. 8. William Stallings, Operating System. 9. H. N. Deitel, An Introduction to Operating System. 10. Hayes-- Computer Architecture & Organization,3/e ,MH 11. Hamacher—Computer Organization, 5/e, MH

IT 904: Advanced Database Management Systems

Review of ER/EER and other semantic data models; Network, Hierarchical and Relational Data Models. Query Processing: Various Operations such as Join, Selection, sorting, expression evaluation, etc. Concurrency Control Mechanism: Protocols, Multiple Granularity, Multi-version schemes, Deadlock handling, Recovery: Recovery and atomicity, various techniques, buffer management, Advanced Recovery Techniques; Database Security: Authentication, Various Access Control Mechanisms, etc. Distributed Databases: Distributed Query Processing, Transaction Model, deadlock handling, multi-database systems; Object Oriented Database: OO Data Model e.g. UML, OO DBMS architectures, Client-Server Approach, Query Processing, Object Relational Databases, Spatial Databases: Data Models, various representation schemes, architectures, Query Processing, Storage Structures; Image and Multimedia Databases.

Books/References: 1. Silberschatz and Korth, Database system concepts, McGraw Hill. 2. Elmasri and Navathe, Fundamentals of database systems; Narosa Publishing Co. 3. John G Hughes, Object Oriented Databases; Prentice Hall Int nl Series in Computer Science 4. Andleigh and Thakrar, Multimedia Systems Design, Prentice Hall PTR 5. R Raghuramakrishnan & J Gehrke, Database Management System 6. Alhir, UML: In A Nutshell, O Reilly

L T P C 3 0 0 3

L T P C 4 0 0 4

IT 915: Software Systems Lab

General purpose programming tools(e.g. Java, C++, use of GUI tools like QT), Web programming tools(e.g. TML, Java with applets/servelets/JSP/J2EE, CGI, Perl). Tools for good software development process. Make/gmake, source code control systems, debuggers and memory allocation debuggers, Introduction to Integrated Development Environments (e.g. Visual Studio or Netbeans) Scripting languages (e.g. Python, Perl). Tools for text processing (e.g. LaTeX, Python, Lex, Yacc) Exposure to document creation tools (e.g. Latex, dia, xfig), plotting tools (e.g. gnuplot, xgraph, matlab), Mathematical computation & scripting (MATLAB and m-file). (Note: The contents may be adapted to software practices and trends at the time of offering the course. Hence the contents in parenthesis are simply examples and not strict requirements.)

References: 1. Larry Wall,Tom Christiansen & Randal L. Schwartz . Programming Perl. O Reilly Media, Third Edition, 2000. 2. Scott Guelich, Shishir Gundavaram and Gunther Birznieks, CGI Programming with Perl. O'Reilly Media, Third Edition, June 2000. 3. Mark Summerfield, Programming in Python 3. Addison Wesley Professional, Second Edition, November 2009. 4. Mark Summerfield, Rapid GUI Programming with Python and Qt, Prentice Hall, 2009. 5. GNU Operating System. links from http://www.gnu.org/software/ last accessed 28/3/2010 6. Wikibook Contributors LaTeX, Wikibooks, 2006 available at http://upload.wikimedia.org/wikibooks/en/2/2d/LaTeX.pdf last accessed 28/4/2010 7. John Levine, flex & bison, O'Reilly Media, 1st Edition, 2009. 8. Bruce Eckel, Thinking in Java, 3/ed, Prentice Hall, 2002, Available online at www.bruceeckel.com last accessed

IT A01: Algorithms and Complexity Fundamentals of Algorithms: Classification of Problems, Complexity, Asymptotic Notations. Recurrences: Master Theorem Probabilistic Analysis: Sort, Search, Random Binary Search trees, Red-black trees, Priority Queues, Bipartite Matching, Common Subsequence Problem, Flow Networks, Ford-Fulkerson Method, Fast Fourier Transforms, Knuth-Morris-Pratt Algorithm, Convex Hull, Point Location. Combinatorial Algorithms: Generating Permutations, Generating Partitions. Approximation Algorithms: Concept, Design, Applications. In approximability. Number -Theoretic Algorithms. Randomized Algorithms, Primality Testing, Constrained and Unconstrained Optimization, Evolutionary Algorithms.

Books/References: 1. Dexter Kozen, The Design and Analysis of Algorithms, Springer, 1992. 2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall India, 1990. 3. S. Basse, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1998. 4. U. Manber, Introduction to Algorithms: A creative approach, Addison Wesley, 1989. 5. V. Aho, J. E. Hopcraft, J. D. Ullman, The design and Analysis of Computer Algorithms, Addison Wesley, 1974. 6. R. Motwani and P. Raghavan, Randomized Algorithms, Cambrdige University Press, 1995. 7. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994 8. Leonard Adleman, Two theorems on random polynomial time. In Proceedings of the 19th IEEE Symposium on

Foundations of Computer Science, pages 75–83, 1978. 9. J. Gill, Computational complexity of probabilistic Turing machines. SIAM Journal of Computing, 6:675–695, 1977. 10. C. Lautemann, BPP and the Polynomial Hierarchy. Information Processing Letters, 17:215–217, 1983. 11. M. Sipser, A complexity theoretic appraoch to randomness. In Proceedings of the 15th ACM Symposium on Theory

of Computing, pages 330–335, 1983. 12. L.G. Valiant and V.V. Vazirani, NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85–93,

1986.

L T P C 0 0 4 2

L T P C 4 0 0 4

IT A02: Advanced Computer Networks Introduction: Overview of computer networks, seven-layer architecture, TCP/IP suite of protocols, etc. MAC protocols for high-speed LANS, MANs, and wireless LANs. (For example, FDDI, DQDB, HIPPI, Gigabit Ethernet, Wireless ethernet, etc.) Fast access technologies. (For example, ADSL, Cable Modem, etc.) IPv6: Why IPv6, basic protcol, extensions and options, support for QoS, security, etc., neighbour discovery, auto-configuration, routing. Changes to other protocols. Application Programming Interface for IPv6. 6bone. Mobility in networks. Mobile IP. Security related issues. IP Multicasting. Multicast routing protocols, adderss assignments, session discovery, etc. TCP extensions for high-speed networks, transaction-oriented applications. Other new options in TCP. Network security at various layers. Secure-HTTP, SSL, ESP, Authentication header, Key distribution protocols. Digital signatures, digital certificates.

Books /References: 1. W. R. Stevens._TCP/IP Illustrated, Volume 1: The protocols,_Addison Wesley, 1994. 2. G. R. Wright._TCP/IP Illustrated, Volume 2: The Implementation,_Addison Wesley, 1995. 3. W. R. Stevens._TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the Unix Domain

Protocols,_Addison Wesley, 1996. 4. R. Handel, M. N. Huber, and S. Schroeder._ATM Networks: Concepts, Protocols, Applications,_Addison Wesley,

1998. 5. W. Stallings.Cryptography and Network Security: Principles and Practice, 2nd Edition, Prentice Hall, 1998. 6. C. E. Perkins, B. Woolf, and S. R. Alpert._Mobile IP: Design Principles and Practices,_Addison Wesley, 1997. 7. Peter Loshin._IPv6 Clearly Explained,_Morgan Kauffman, 1999. 8. M. Gonsalves and K. Niles._IPv6 Networks,_McGraw Hill, 1998. 9. RFCs and Internet Drafts, available from Internet Engineering Task Force. 10. Articles in various journals and conference proceedings

IT A14 Internet Technology Lab

Implementation of cryptographic algorithms, Programs for cryptanalysis. Implementing ICMPv4 for ping and trace route. IPv6 trace route implementation. Implementation of packet filters. Design of a standard File transfer protocol using RFCs. Voice transmission over IP network implementation.

References: 1. TCP/IP Illustrated, Vol 1 & 2, Addition Wesley 2. W Stallings , Cryptography & Network Security: Principles & Practices, PHI

3. R Bragg, M Phodes-Ousley, K Strassberg, Network Security: The Complete Reference, Tata Mcgraw-Hill

L T P C 4 0 0 4

L T P C 0 0 4 2

Electives

IT E01: Compiler Design Review of compiler phases –Symbol Table Structure – Intermediate Representations. Control Flow Analysis: Basic Blocks and CFG, Dominators and Loops. Data Flow Analysis: Reaching Definitions, Available Expressions, and Live Variable Analysis. Optimizations: Redundancy Elimination – Loop Optimizations –Value Numbering. Static Single Assignment Form (SSA): SSA Construction – Optimizations on SSA Form. Register Allocation –Graph Colouring Algorithm. Machine Code Generation: Instruction Selection - Maximal munch and Dynamic programming Algorithm. Code Generation – Target Machine – Code Generation for Run- time Stage Management. Code Generation Algorithms. Book/References: 1. Aho A.V., Lam M.S., Sethi R., and Ullman J.D., Compilers: Principles, Techniques, and Tools. Pearson Education, 2007. 2. Steven Muchnick., Advanced Compiler Implementation. Morgan Kauffman Publishers, 1997. 3. Appel A.W and Palsberg J., Modern Compiler Implementation in Java. Cambridge University Press, 2002. 4. Srikant Y.N and Shankar P., The Compiler Design Handbook: Optimization and Machine Code Generation. CRC Press, 2003.

IT E02: Topics in Programming Languages Introduction to Programming Languages. Untyped Arithmetic Expressions: Syntax and Semantics - Properties of the language of Untyped Arithmetic Expressions. Untyped Lambda Calculus: Syntax, Operational Semantics, Evaluation strategies – Programming in Lambda Calculus. Typed arithmetic Expressions: Typing relation – Type safety. Simply Typed lambda Calculus: Typing relation – Properties of the Language – Type safety. Extensions: Basic Types, Derived Forms, Let Bindings. Extensions to Lambda Calculus: Pairs, Tuples, Records, Sums, Variants, References, Exceptions. Subtyping, Recursive Types, Polymorphism. Books/References:

1. Benjamin C Pierce. Types and Programming Languages. MIT Press, 2002. 2. Luca Cardelli. Type Systems. In Allen B Tucker (Ed.), Handbook of Computer Science and Engineering. CRC Press, 1996. 3. Michael L Scott. Programming Languages Pragmatics Elsevier, 2004

IT E03: Logic and Computation Temporal Logic based verification, Buchi automata, Linear Temporal Logic (LTL), Relational product , Modelling systems Computation Tree Logic (CTL), Concept of fairness, Symbolic model checking Tools: Spin, SMV Verification of infinite-state systems, Verification of real-time systems, Timed automata, Modelling real-time systems, RTCTL. Complexity Consideration, Tools: Uppaal, Kronos Verification of pushdown systems, Verification of security protocols, Formal Methods, Abstract Interpretation Model Books/References

1. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999. 2. B. Berard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, P. Schnoebelen, and P.McKenzie. Systems and

Software Verification: Model-Checking Techniques and Tools. Springer Verlag, 2001.

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C4 0 0 4

3. Jean A. Gallier, Logic for Computer Science Foundations of Automatic Theorem Proving, Wiley, 1986

IT E04: Topics in Algorithms Discrete Probability Probability, Expectations, Tail Bounds, Chernoff Bound, Markov Chains and Random Walks, Martingales Randomized Algorithms Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods, Probabilistic Primality Testing, De-Randomization Complexity Probabilistic Complexity Classes, Probabilistic Proof Theory and Certificates, Interactive and Zero Knowledge Proof Systems, Arthur Merlin Games. Kolmogorv Complexity Definition of Randomness, Unsolvability results, Chatin’s Proof for Gödel’s Theorem. Books/References 1. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995. 2. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994 3. Journal of Algorithms, Elsevier. MA E01: Game Theory Introduction to Non Co-operative Game Theory: Extensive Form Games, Strategic Form Games, Pure Strategy Nash Equilibrium Nonco-operative Game Theory (in detail), Mixed Strategies, Existence of Nash Equilibrium, Computation of Nash Equilibrium, Two Player Zero-Sum Games, Bayesian Games Mechanism Design : An Introduction, Dominant Strategy Implementation of Mechanisms, Vickrey-Clorke-Groves Mechanisms, Bayesian Implementation of Mechanisms, Revenue Equivalence Theorem, Design of Optimal Mechanisms Cooperative Game Theory, Correlated Strategies, Correlated Equilibria, The Two Person Bargaining Problem, Games in Coalitional Form, The Core Shapley Value, Other Solution Concepts for Co-operative Games . Books/References

1. Roger B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, September 1997. 2. Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green. Microeconomic Theory. Oxford University Press, New

York, 1995. 3. Martin J. Osborne, Ariel Rubinstein. A Course in Game Theory. The MIT Press, August 1994. 4. Philip D. Straffin, Jr. Game Theory and Strategy. The Mathematical Association of America, January 1993. 5. Ken Binmore, Fun and Games : A Text On Game Theory, D. C. Heath & Company, 1992. 6. Paul Klemperer, Auctions: Theory and Practice, The Toulouse Lectures in Economics, Princeton University Press, 2004

IT E05: Quantum Computation Foundations: Finite Dimensional Hilbert Spaces – Tensor Products and Operators on Hilbert Space – Hermitian and Trace Operators - Basic Quantum Mechanics necessary for the course. Model of Computation: Quantum Gates and operators and Measurement – Quantum Computational Model – Quantum Complexity – Schemes for Physical realization (Only peripheral treatment expected). Algorithms and Complexity Shor's Algorithm – Application to Integer Factorization – Grover's Algorithm –Quantum Complexity Classes and their relationship with classical complexity classes.

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C 4 0 0 4

Coding Theory Quantum Noise – Introduction to the theory of Quantum Error Correction –Quantum Hamming Bound – Coding Schemes – Calderbank-Shor-Steane codes –Stabilizer Codes. Books/References 1. Nielsen M. A. and I. L. Chauang, Quantum Computation and Quantum Information, Cambridge University Press, 2002. 2. Gruska J. Quantum Computing, McGraw Hill, 1999. 3. Halmos, P. R. Finite Dimensional Vector Spaces, Van Nostrand, 1958. 4. Julian Brown, Minds, Machines and the Multiverse: The Quest for the Quantum Computer by Julian Brown. Simon and

Schuster IT E06: Distributed Computing Characterization of Distributed Systems, System Models, Networking and Internetworking, Inter Process communication Logical clocks, verifying clock algorithms, Mutual Exclusion, Mutual exclusion using timestamps, tokens ad Quorums. Name Services and Domain Name System, Directory and Discovery Systems, Drinking philosophers problem, leader elections, Global state, Termination Detection Transactions and Concurrency Control, Distributed Transactions, Distributed Deadlocks, Transaction Recovery, Fault-tolerant Services, Distributed Shared Memory, Distributed consensus. Books/References 1. Vijay K. Garg. Elements of Distributed Computing, Wiley Interscience, 2002 2. Nancy Lynch, Distributed Algorithms, Morgan Kaufmann Publishers Inc., 1996. 3. Coulouris G., Dollimore J. & Kindberg T., Distributed Systems Concepts And Design, 3/e, Addison Wesley 2004 4. Tanenbaum S, Maarten V.S., Distributed Systems Principles and Paradigms, Pearson Education 2004 5. Chow R. & Johnson T., Distributed Operating Systems and Algorithms, Addison Wesley 2003 6. Tanenbaum S., Distributed Operating Systems, Pearson Education 2005 IT E07 :Object Oriented Modeling & Design Structural Modeling: Object Oriented Fundamentals, Basic structural Modeling, UML Model , Class Diagrams, Object Diagrams, Packages and Interfaces, Case Studies. Behavioral and architectural Modeling: Use Case Diagrams, Interaction Diagrams, State Chart Diagrams, Collaborations, Design Patterns, Component Diagrams, Deployment Diagrams, Case Studies Object oriented Testing Methodologies: Implications of Inheritance on Testing, State Based Testing, Adequacy and Coverage, Scenario Based Testing, Testing Workflow, Case Studies , Object Oriented Metrics Components: Abuses of inheritance, danger of polymorphism, mix-in classes,rings of operations, class cohesion and support of states and behavior, components and objects, design of a component, lightweight and heavyweight components, advantages and disadvantages of using components. Books/References 1. Page Jones M., Fundamentals of Object Oriented Design in UML, Pearson Education, 2002 2. Booch G., Rumbaugh J. & Jacobsons I., The Unified Modeling Language User Guide, Addison Wesley, 2002. 3. Bahrami A., Object Oriented System Development, McGraw Hill, 2003. 4. Baugh J., Jacobson I. & Booch G., The unified Modeling Language Reference Manual, Addison Wesley, 1999. 5. Man C., Applying UML & Patterns: An Introduction to Object – Oriented Analysis & Design, Addison Wesley, 2002. 6. Ooley R. & Stevens P., Using UML: Software Engineering with Objects & Components, Addison Wesley, 2000. IT E08 :Embedded System Introduction to embedded systems: classification, characteristics and requirements. Timing and Clocks in Embedded Systems. Task modeling and management. Real-time operating system issues. Signals: frequency spectrum, and sampling, digitization (ADC, DAC), signal conditioning and processing. Modeling and characterization of embedded computing systems. Communication strategies for embedded systems: encoding, and flow control. Fault Tolerance. Formal Verification

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C 4 0 0 4

Books/References 1. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes, 2. 1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-Hill, First reprint Oct. 2003 3. David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000. 4. Wayne Wolf, Computers as Components; Principles of Embedded Computing System Design – Harcourt India, Morgan

Kaufman Publishers, First Indian Reprint 2001 5. Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware /Software Introduction, John Wiley,

2002.

IT E09: Natural Language Processing Introduction to Natural Language Understanding: The study of Language, Applications of NLP, Evaluating Language Understanding Systems, Different levels of Language Analysis, Representations and Understanding, Organization of Natural language Understanding Systems, Linguistic Background: An outline of English syntax. Grammars and Parsing: Grammars and sentence Structure, Top-Down and Bottom-Up Parsers, Transition Network Grammars, Top-Down Chart Parsing. Feature Systems and Augmented Grammars: Basic Feature system for English, Morphological Analysis and the Lexicon, Parsing with Features, Augmented Transition Networks Grammars for Natural Language: Auxiliary Verbs and Verb Phrases, Movement Phenomenon in Language, Handling questions in Context-Free Grammars, Hold mechanisms in ATNs. Human preferences in Parsing, Encoding uncertainty, Deterministic Parser Ambiguity Resolution: Statistical Methods, Estimating Probabilities, Part-of-Speech tagging, Obtaining Lexical Probabilities, Probabilistic Context-Free Grammars, Best First Parsing. Semantics and Logical Form, Word senses and Ambiguity, Encoding Ambiguity in Logical Form. Books/References 1. James Allen, Natural Language Understanding, 2/e, Pearson Education, 2003. 2. D. Jurafsky, J. H. Martin, Speech and Language Processing, Pearson Education, 2002. 3. Christpher G. Manning, Hinrich Schütze, Foundations of Statistical Natural Language Processing, The MIT Press,

Cambridge, Massachusetts.1999. IT E10: Computational Intelligence Artificial Intelligence: History and Applications, Production Systems,Structures and Strategies for state space search- Data driven and goal driven search, Depth First and Breadth First Search, DFS with Iterative Deepening, Heuristic Search- Best First Search, A* Algorithm, AO* Algorithm, Constraint Satisfaction, Using heuristics in games- Minimax Search, Alpha Beta Procedure. Knowledge representation - Propositional calculus, Predicate Calculus,Theorem proving by Resolution, Answer Extraction, AI Representational Schemes- Semantic Nets, Conceptual Dependency, Scripts, Frames, Introduction to Agent based problem solving. Machine Learning- Symbol based and Connectionist, Social and Emergent models of learning, The Genetic Algorithm- Genetic Programming, Overview of Expert System Technology- Rule based Expert Systems, Introduction to Natural Language Processing. Languages and Programming Techniques for AI- Introduction to PROLOG and LISP, Search strategies and Logic Programming in LISP, Production System examples in PROLOG. Books/References 1. George.F.Luger, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, 4/e, 2002, Pearson Education. 2. E. Rich, K.Khight, Artificial Intelligence, 2/e, Tata McGraw Hill 3. Winston. P. H, LISP, Addison Wesley 4. Ivan Bratko, Prolog Programming for Artificial Intelligence, 3/e, Addison Wesley, 2000

L T P C 4 0 0 4

L T P C 4 0 0 4

IT E11 Soft Computing

Soft Computing: Introduction, requirement, different tools and techniques, usefulness and applications. Fuzzy sets and Fuzzy logic: Introduction, Fuzzy sets versus crisp sets, operations on fuzzy sets, Extension principle, Fuzzy relations and relation equations, Fuzzy numbers, Linguistic variables, Fuzzy logic, Linguistic hedges, Applications, fuzzy controllers, fuzzy pattern recognition, fuzzy image processing, fuzzy database. Artificial Neural Network: Introduction, basic models, Hebb's learning, Adaline, Perceptron, Multilayer feed forward network, Back propagation, Different issues regarding convergence of Multilayer Perceptron, Competitive learning, Self-Organizing Feature Maps, Adaptive Resonance Theory, Associative Memories, Applications. Evolutionary and Stochastic techniques: Genetic Algorithm (GA), different operators of GA, analysis of selection operations, Hypothesis of building blocks, Schema theorem and convergence of Genetic Algorithm, Simulated annealing and Stochastic models, Boltzmann Machine, Applications. Rough Set: Introduction, Imprecise Categories Approximations and Rough Sets, Reduction of Knowledge, Decision Tables, and Applications. Hybrid Systems: Neural-Network-Based Fuzzy Systems, Fuzzy Logic-Based Neural Networks, Genetic Algorithm for Neural Network Design and Learning, Fuzzy Logic and Genetic Algorithm for Optimization, Applications. Books/References 1. Neural Fuzzy Systems, Chin-Teng Lin & C. S. George Lee, Prentice Hall PTR. 2. Fuzzy Sets and Fuzzy Logic, Klir & Yuan, PHI, 1997. 3. Neural Networks, S. Haykin, Pearson Education, 2ed, 2001. 4. Genetic Algorithms in Search and Optimization, and Machine Learning, D. E. Goldberg, Addison-Wesley, 1989. 5. Neural Networks, Fuzzy logic, and Genetic Algorithms, S. Rajasekaran & G. A. V. Pai, PHI. 6. Neuro-Fuzzy and Soft Computing, Jang, Sun, & Mizutani, PHI. 7. Learning and Soft Computing, V. Kecman, MIT Press, 2001. 8. Rough Sets, Z. Pawlak, Kluwer Academic Publisher, 1991. 9. Intelligent Hybrid Systems, D. Ruan, Kluwer Academic Publisher, 1997.

IT E11: Image Processing Introduction, digital image representation, 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 - basic relationship between pixels - imagegeometry - image transforms - introduction to Fourier transform – discrete Fourier transform - some properties of 2d-fourier transform (DFT)- other separable image transforms - hotelling transform Image enhancement - point processing - spatial filtering - frequency domain - image restoration - degradation model - diagonalization of circulant and block circulant matrices - inverse filtering - least mean square filter Image compression - image compression models - elements of information theory - error-free compression - lossy compression - image compression standards Image reconstruction from projections - basics of projection - parallel beam and fan beam projection - method of generating projections - Fourier slice theorem - filtered back projection algorithms - testing back projection algorithms. Books/Reference 1. Rafael C., Gonzalez & Woods R.E., Digital Image Processing, Addison Wesley, 1999. 2. Rosenfeld A. & Kak A.C., Digital Picture Processing, Academic Press, 1998 3. Jain A.K, Fundamentals of Digital Image Processing, Prentice Hall, Englewood Cliffs, 2002. 4. Schalkoff R. J., Digital Image Processing and Computer Vision, John Wiley, 2004. 5. Pratt W.K., Digital Image Processing, John Wiley, 2002.

L T P C 4 0 0 4

L T P C 4 0 0 4

IT E12: Pattern Recognition Bayesian decision theory: Bayes Decision Rules for two Class problem, Bayes maximum likelihood rule, minimum distance classifier, error probabilities for classifier, Mahalanobis distance, Bound for error probabilities, Estimation of parameters, Learning. Single and multi layer perceptron Clustering: Minimum within cluster distance criterion, k-means algorithm single linkage, complete linkage and average linkage algorithms etc. Feature Selection: Algorithms for feature selection such as Branch and Bound, Sequential forward and backward selections, GSFS and GSBS, (L, R) algorithm. Criterion function: Probabilistic Separability criterion, error probability based criterion, entropy based criterion, minimum within class distance bas ed criterion, probabilistic independence. Principal Component Analysis Fuzzy Set-theoretic Pattern Recognition: Usual Fuzzy set theoretic operations union, intersection etc. Fuzzy C-means algorithm, Fuzzy set theoretic based feature selection criteria. Discrete Hidden Morkov Models : Introduction, Discrete–time markov process, extensions to hidden Markov models, three basic problems for HMMs. Books/References:

1. Duda and Hart, Pattern Classification, John Willey, Student Ed., 2nd Ed. 2. Earl Gose, Richard John baugh, Steve Jost ,Pattern Recognition and Image Analysis ,PHI 3. K. Fukunga, Introduction to Statistical Pattern Recognition , Academic Press 4. S.K. Pal and Dutta Mazumdar, Fuzzy Set Theroetic Methods for Patern Recognition , John Willey, 1998.

IT E13: Bioinformatics Introduction to Molecular biology, Gene structure and information content, Molecular biology tools, Algorithms for sequence alignment, Sequence databases and tools. Molecular Phylogenetics, Phylogenetic trees, Algorithms for Phylogenetic tree construction, Introduction to Perl programming for Bioinformatics. Introduction to Protein structure, Algorithms for Protein structure prediction, Gene expression analysis, Micro Arrays, Pathway analysis. Pattern Matching algorithms, Bio-data analysis, Data Mining in Bioinformatics, Algorithms and data structures for efficient analysis of biological data. Books/References 1. D. E. Krane and M. L. Raymer, Fundamental Concepts of Bioinformatics, Pearson Education, 2003. 2. D.W. Mount, “Bioinformatics: Sequence and Genome Analysis”, 2nd ed., CBS, 2004. 3. Arthur M Lesk, Introduction to Bioinformatics, Oxford University Press, 2002 4. Jean Michel Claverie and Cedric Notredame, Bioinformatics – A Beginner’s guide, Wiley-Dreamtech India Pvt. Ltd., 2003 5. Neil C Jones and Pavel A Pevzner, An Introduction to Bioinformatics Algorithms, MIT Press, 2004 6. Current literature.

L T P C 4 0 0 4

L T P C 4 0 0 4

IT E16 : Cryptography Review of number theory and algebra, computational complexity, probability and information theory, primality testing. Cryptography and cryptanalysis, symmetric key encryption, DES, Triple DES, AES, RC4, modes of operation. public key encryption, RSA cryptosystem, Diffie-Hellman, elliptic curve cryptography, Rabin, ElGamal, Goldwasser-Micali, Blum-Goldwasser cryptosystems. Message authentication, digital signature algorithms. Security handshake pitfalls, Strong password protocols. References 1. W. Mao, Modern Cryptography: Theory & Practice, Pearson Education, 2004. 2. C. Kaufman, R. Perlman and M. Speciner, Network Security: Private Communication in a public World, 2/e, Prentice Hall,

2002. 3. W. Stallings, Cryptography and Network Security Principles and practice, 3/e, Pearson Education Asia, 2003. 4. H. Delfs and H. Knebl, Introduction to Cryptography: Principles and Applications, Springer-Verlag, 2002. IT E17: Formal Methods in Secure Computing Decidability of security, Access control, take grant model, SPM, Expressive power of models, typed access control models Authentication and key establishment, Freshness, general design principles, common attacks, forward secrecy, multiparty authentication, Anonymity Protocol Verification and Correctness, Logic based Models, BAN Logic, Spi calculus Strand space based analysis, Applicability to group protocols Books/References

1. Willis H Ware, Charles P Pfleeger, Shari Lawrence Pfleeger, Security in Computing , Prentice Hall, Third Edition, 2003 2. Theo Dimitrakos, Fabio Martinelli Formal Aspects In Security And Trust: Ifip TN Wg1.7 Workshop on Formal Aspects

in Security, Springer, 2005 3. Computer Security Handbook, 4th Edition. Seymour Bosworth, M E Kabay (Editors). John Wiley, 2002. 4. M. Bishop and S. S. Venkatramanayya, Introduction to Computer Security, Pearson Education Asia, 2005.

5. M. Abadi and A. D. Gordon, A Calculus for Cryptographic Protocols — The Spi Calculus, Research report SRC 149, 1998.

6. L. Buttyán and J. P. Hubaux, A Formal Analysis of Syverson’s Rational Exchange Protocol. IEEE Computer Security Foundations Workshop, 2002.

7. C. Caleiro, L. Viganò, and D. Basin, On the Semantics of Alice&Bob Specifications of Security Protocols. Theoretical Computer Science, vol. 367, no. 1–2, 2006, pp. 88-122.

8. C. Haack and A. Jeffrey, Pattern-matching Spi-calculus, Proc. FAST’04, IFIP series 173, 2004, pp. 193-205.

9. A. Huima, Efficient Infinite-State Analysis of Security Protocols, Workshop on Formal Methods and Security Protocols, 1999.

10. C. Meadows, A formal framework and evaluation method for network denial of service, In Proc. of the 12th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, vol. 9, no. 1, 2001, pp. 47–74.

11. J. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, in 8th ACM Conference on Computer and Communication Security, Nov. 2001, pp. 166–175.

12. N. Nisan and A. Ronen, Algorithmic Mechanism Design. in Proc. 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 129-140.

L T P C 4 0 0 4

L T P C4 0 0 4

IT E18 : Network Security Review of wired/wireless network protocols, intrusion detection systems, malicious software. Review of cryptographic algorithms and protocols, cryptanalysis, authentication and signature protocols. Kerberos, PKI, real-time communication security, IPSec: AH, ESP, IKE. SSL/TLS, e-mail security, PEM and S/MIMIE, PGP, web security, network management security, wireless security. Books/References

1. C. Kaufman, R. Perlman and M. Speciner, Network Security: Private Communication in a public World, 2/e, Prentice Hall, 2002.

2. Kurose J. F. & Ross K. W., Computer Networking: A Top-Down Approach Featuring the Internet, Pearson Education Asia, 3/e, 2005.

3. Schiller J., Mobile Communications, Pearson Education Asia,2/e, 2004.

4. W. Stallings, Cryptography and Network Security Principles and practice, 3/e, Pearson Education Asia, 2003.

IT E19: Information Theory and Coding Introduction to probability, information, noiseless coding, noisy coding, cyclic redundancy checks Permutation of sets, finite fields, linear codes, bounds for codes Hamming (Sphere-Packing) Bound. Gilbert-Varshamov Bound. Singleton Bound. Primitive polynomials, Testing for Primitivity. Periods of LFSR's. Vandermonde Determinants. Check Matrices for Cyclic Codes. RS Codes. Hamming Codes (Again). BCH Codes. Decoding BCH Codes. Concatenated codes, curves and codes. Plane Curves. Curves in Higher Dimensions. Geometric Goppa Codes.

Books/References: 1. P. Garrett, The Mathematics of Coding Theory: Information, Compression, Error Correction and Finite Fields, Pearson

Education, 2004. 2. Shu Lin, Daniel J Costello, Error Control Coding - Fundamentals and Applications, Prentice Hall Inc. Englewood Cliffs. 3. San Ling, Coding Theory – A First Course. Cambridge Press, 2004. IT E20 : Perimeter Security Computer security, attacks, methods of defense. Intrusion detection, audit records, statistical, rule-based and distributed intrusion detection, responses to intrusion detection, honeypots, password management, malicious software, viruses and related threats, virus countermeasures Firewalls, design of firewalls, trusted systems, Trojan horse defense Security planning, risk analysis, security policies, physical security, covert communication, steganography tools, digital watermarking. Books/References 1. E. Cole, R. Krutz, and J. Conley, Network Security Bible, Wiley-Dreamtech, 2005. 2. W. Stallings, Cryptography and Network Security Principles and practice, 3/e, Pearson Education Asia, 2003. 3. C. P. Pfleeger and S. L. Pfleeger, Security in Computing, 3/e, Pearson Education, 2003. 4. M. Bishop, Computer Security: Art and Science, Pearson Education, 2003.

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C4 0 0 4

IT E21: Data Compression Introduction to data compression-Basic Techniques- Runlength encoding, RLe Text compression, RLE image compression, Move-to-front coding, Scalar quantization.Statistical Methods- Information theory concepts, variable sixe codes, prefix codes, Shanon fanon coding, Huffman coding, Adaptive Huffman, Arithmetic coding. Dictionary methods- string compression, LZ77 sliding window, MZW, Gif images. Image Compression- Approaches to image compression, intuitive methods, image transform, test images, JPEG, Progressive image compression, Vector quantization, Wavelet Methods- Fourier transform, frequency domain, Fourier image compression, CWT and inverse CWT, Haar transform, filter bank, DWT, JPEG 2000. Video compression- analog video, Composite and component video, digital video, video compression, MPEG. Audio Compression- Sound, digital audio, human auditory system, MPEG-1 audio layer. Fractal based compression- IFS. Comparison of compression algorithms. Implementation of compression algorithms. Books/References

1. David Solomon, Data compression: The Complete Reference, 2nd edition, Springer-Verlag, New York. 2000. 2. Stephen Welstead, Fractal and Wavelet Image Compression Techniques, PHI, NewDelhi-1, 1999. 3. Khalid Sayood, Introduction to Data compression, Morgan Kaufmann Publishers, 2003 reprint.

IT E21 Multimedia Systems Concept of Multimedia Data; Various File Formats; Multimedia data Model e.g. RMDM, Compression & Decompression. Binary Image compression: Various CCITT standards Color Image compression : JPEG Methodology, DCT, MPEG Methodology Storage & Retrieval Merthods: Magnetic Media Technology, RAID Technology, Optical Media, Hierarchical Strage Management; Cache Management; Architectural Issues: Specialized processor, Memory System, LAN-WAN connectivity, Client-Server approach; Distributed Multimedia System: various components; Multimedia Authoring; Authoring Tools and their design issues, Hypermedia Application Design issues; User Interface: Hypermedia Interface Design Issues; Books/References: 1. Andleigh and Thakrar, Multimedia Systems Design, Prentice Hall PTR

IT E22: Computer Law and Ethics Intellectual property rights, computer software copyrights, copyright in databases and electronic publishing, law of confidence, patent laws, trademarks, product designs, international law . Computer contracts, liability for defective hardware and software, software contracts, web and hardware contracts, electronic contracts and torts, liabilities. Computer crime, computer fraud, hacking, unauthorized modification of information, piracy, computer pornography and harassment. Cyber laws in India, IT Act 2000, data subjects’ rights, ethical issues in computer security, case studies. Books/References

1. D. Bainbridge, Introduction to Computer Law, 5/e, Pearson Education, 2004. 2. P. Duggal, Cyber law: the Indian Perspective, 2005.

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C 4 0 0 4

3. C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/e, Pearson Education, 2003. IT E23: Security Policies and Assurance Security policies, policy languages, confidentiality policies, Bell-LaPadula model, controversies over the model. Integrity policies, Biba model, Lipner’s model, Clark-Wilson models, Chinese wall model, clinical information systems security policy, noninterference and policy composition. Assurance and trust, building secure and trusted systems, waterfall model, other models of development. Assurance in requirements definition and analysis, assurance during system and software design, assurance during implementation and integration. Books/References

1. M. Bishop, Computer Security: Art and Science, Pearson Education, 2003. 2. W. Mao, Modern Cryptography: Theory & Practice, Pearson Education, 2004. 3. C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/e, Pearson Education, 2003.

IT E24: Advanced Topics in Information Security Cryptography - Practical considerations on cryptographic algorithms - Performance and Robustness.Time complexity of DES and RSA. Attacks on DES and RSA. Public Key Cryptography Standard (PKCS). Linear cryptanalysis. Birthday attack on hash schemes. ECC and AES, Identity based encryption. Network Security - DNS attacks and DNSSEC. Cross-site scripting XSS worm, SQL injection attacks. Intrusion Detection Systems (IDS). DDoS detection and prevention in a network, IP Traceback. Security in current domains - Wireless LAN security - WEP details. wireless LAN vulnerabilities - frame spoofing. Cellphone security - GSM and UMTS security. Mobile malware - bluetooth security issues. Security in current applications Cases from any two of the three topics: Online banking or Credit Card Payment Systems, Web Services Security, RFIDs. Books/References

1. Bernard Menezes, Network security and Cryptography, Cengage Learning India, 2010. 2. Dieter Gollmann. Computer Security, John Wiley and Sons Ltd., 2006. 3. Charles P Pfleeger, Shari Lawrence Pfleeger. Security in Computing, Education, 2005. 4. Furnell, Katsikas, Lopez, Patel. Securing Information and Communication Systems: Principles, Technologies and

Applications,Artech House Inc., 2008. 5. H. Delfs and H. Knebl. Introduction to Cryptography: Principles and Applications, Springer-Verlag, 2002. 6. Goldwasser and Bellare. Lecture Notes on Cryptography. Available online from

http://cseweb.ucsd.edu/~mihir/papers/gb.pdf . Last Accessed March 26, 2010. 7. Whitman and Mattord. Principles of Information Security, Cengage Learning, 2006.

MA E02 Fuzzy Set Theory and Applications Crisp sets and Fuzzy sets : Introduction – crisp sets an overview – the notion of fuzzy sets –basic concepts of fuzzy sets – membership functions – methods of generating membership functions – defuzzification methods- operations on fuzzy sets - fuzzy complement – fuzzy union – fuzzy intersection – combinations of operations – General aggregation operations. Fuzzy arithmetic and Fuzzy relations: Fuzzy numbers- arithmetic operations on intervals- arithmetic operations on fuzzy numbers- fuzzy equations- crisp and fuzzy relations – binary relations – binary relations on a single set – equivalence and similarity relations – compatibility or tolerance relations.

L T P C 4 0 0 4

L T P C 4 0 0 4

L T P C 4 0 0 4

Fuzzy measures – belief and plausibility measures – probability measures – possibility and necessity measures – possibility distribution - relationship among classes of fuzzy measures. Fuzzy Logic and Applications : Classical logic : an overview – fuzzy logic – approximate reasoning - other forms of implication operations - other forms of the composition operations – fuzzy decision making –fuzzy logic in database and information systems - fuzzy pattern recognition – fuzzy control systems. Books/References:

1. George J Klir and Tina A Folger , Fuzzy sets, Uncertainty and Information, Prentice Hall of India, 1988. 2. H.J. Zimmerman, Fuzzy Set theory and its Applications, 4

th Edition, Kluwer Academic Publishers, 2001.

3. Goerge J Klir and Bo Yuan , Fuzzy sets and Fuzzy logic: Theory and Applications. Prentice Hall of India, 1997. 4. Hung T Nguyen and Elbert A Walker, First Course in Fuzzy Logic, 2

nd Edition , Chapman & Hall/CRC, 1999.

5. Jerry M Mendel, Uncertain Rule – Based Fuzzy Logic Systems ; Introduction and New Directions, PH PTR, 2000. 6. John Yen and Reza Langari, Fuzzy Logic : Intelligence Control and Information, Pearson Education, 1999. 7. Timothy J Ross, Fuzzy Logic with Engineering Applications, McGraw Hill International Editions, 1997.

MA E03: Advanced Topics in Graph Theory

Graphs, Connectivity and Traversability Graphs: review of basics in graphs - -Trees- Blocks- Matrices-Operations on graphs. Connectivity: Vertex Connectivity and edge connectivity – n- connected graphs-Menger’s Theorem. Traversability: Euler graphs-Hamiltonian Graphs-Planar and Nonplanar graphs. Metric in graph, Distance Sequences ,Convexity and Symmetry. Metric in graph: Centre, Median, eccentric vertex, Eccentric graph, boundary vertex, complete vertex, interior vertex. Convexity: Closure Invariants-gin(G) –gn(G)-Hull number- Geodetic Graphs- Distance Hereditary Graphs Symmetry: Graphs and groups-- Symmetric Graphs - Distance Symmetry-Distance transitive graphs-distance regular graphs Distance Sequences :Degree sequence, Eccentric Sequence - Distance Sequences - The Distance Distribution, Mean distance. Matchings, Factorization and Domination Matchings :Maximum matching-Perfect matching-Matching in bipartite graphs Factorization :Coverings and independence-1-fcatorization-2-factorization-Arboricity Domination: Dominating set-Domination number-total dominating set –total domination number. Digraphs, Networks and Algorithms Digraphs: Digraphs and connectedness- Tournaments- directed trees-binary trees- weighted trees and prefix codes Networks: Flows-cuts- The Max- Flow Min-Cut Theorem Graph Algorithms: Polynomial Algorithms and NP completeness ,Complexity, Search algorithms, Shortest path algorithms. Books/References

1. Gary Chartrand, Ping Zhang, Introduction to Graph Theory, McGraw Hill International Edition, 2005. 2. J.A.Bondy, U.S.R.Murty, Graph Theory, Springer, 2008. 3. Distance in Graphs, Fred Buckley and Frank Harary, Addison - Wesley (1990). 4. C. R. Foulds: Graph Theory Applications, Narosa Publishing House, 1994. 5. Harary F: Graph Theory, Addison-Wesley pub. 1972. 6. R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Addison Wesley, 1994. 7. C. Vasudev, Graph Theory with Applications, New Age international publishers, 2006.

IT E25: Robotics Introduction: Definition, Classification of Robots, Geometric classification and control classification. Robot Elements: Drive systems, Control systems, sensors, End effectors, Gripper actuators and gripper design. Robot Coordinate Systems and Manipulator Kinematics: Robot co-ordinate system representation, Transformation, Homogeneous transforms and its inverse, Relating the robot to its world.

L T P C 4 0 0 4

L T P C 4 0 0 4

Manipulators Kinematics, Parameters of links and joints, Kinematic chains, Dynamics of kinematic chains, Trajectory planning and control, Advanced techniques of kinematics and dynamics of mechanical systems, Parallel actuated and closed loop manipulators. Robot Control: Fundamental principles, Classification, Position, path and speed control systems, adaptive control. Robot Programming: Level of robot programming, Language based programming, task level programming, Robot programming synthesis, robot programming for foundry, press work and heat treatment, welding, machine tools, material handling, warehousing assembly, etc., automatic storage and retrieval system, Robot economics and safety, Robot integration with CAD/CAM/CIM, Collision free motion planning Books/ Refences: 1. Robotic Technology (Vol. I-V) Phillipe Collet Prentice Hall 2. An Introduction to Robot Technology Coiffet and Chirooza Kogan Page 3. Robotics for Engineers Y. Koren McGraw Hill 4. Robotics K.S. Fu, R.C. Gonzalez & CSG Lee McGraw Hill International 5. Robotics J.J. Craig Addison-Wesley 6. Industrial Robots Groover, Mitchell Weiss, Nagel Octrey McGraw Hill 7. Robots & Manufacturing Automation Asfahl Wiley Eastern IT E26: Data Mining & Data Warehousing Data Warehousing: Concept of Data Warehouse, Differences between Operational Databases and Date Warehouse, Multi-dimensional Data Model, Schemas for Multi-dimensional Databases, Data Cube Representations, Data Warehouse Architecture, OLTP vs OLAP, Efficient Query Processing in data Warehouses, Indexing of OLAP data, Meterialization concept; Data Mining: Data Clustering: Partitioning, Hierarchical, Density-based, Grod Based and Model Based Methods; Classification & Prediction: Decision Tree Techniques, Back-Propagation Method, Bayesian Method Association Rule Mining Techniques: Frequent Itemset Generation, Apriori, Horizontal Method, Sampling Approach, Hashing Approach; Dynamic Association Rule Mining; Mining of Complex Types of Data: Mining of Spatial Databases, Multimedia Databases, Time-series and sequence Data, Text Databases, WWW Data; Books/References: 1. J. Han and M. Kamber. Data Mining: Concepts and Techniques. 2nd ed. Elsiver-2006. 2. M. H. Dunham. Data Mining: Introductory and Advanced Topics. Pearson Education. 2001. 3. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann. 2000. 4. D. Hand, H. Mannila and P. Smyth. Principles of Data Mining. Prentice-Hall. 2001. 5. A K Pujari. Data Mining Techniques, University Press. IT E27 Advanced Wireless Networks Cellular and Ad hoc wireless networks: Issues of MAC layer and Routing – Proactive, Reactive and Hybrid Routing protocols – Multicast Routing – Tree based and Mesh based protocols – Multicast with Quality of Service Provision. Quality of Service Issues: Real-time traffic support – Issues and challenges in providing QoS – Classification of QoS Solutions – MAC layer classifications – QoS Aware Routing Protocols – Ticket based and Predictive location based Qos Routing Protocols Energy management ad hoc networks: Need for Energy Management – Classification of Energy Management Schemes – Battery Management and Transmission Power Management Schemes – Network Layer and Data Link Layer Solutions – System power Management schemes Mesh networks: Necessity for Mesh Networks – MAC enhancements – IEEE 802.11s Architecture –Opportunistic Routing – Self Configuration and Auto Configuration - Capacity Models –Fairness – Heterogeneous Mesh Networks – Vehicular Mesh

L T P C4 0 0 4

L T P C 4 0 0 4

Networks Sensor networks: Introduction, Sensor Network architecture, Data Dissemination, Data Gathering –MAC Protocols for sensor Networks – Location discovery – Quality of Sensor Networks– Evolving Standards – Other Issues – Recent trends in Infrastructure less Networks. Rural Wireless Network: Possible unique requirements for developing country users: Low-cost , Low-power, Intermittent connectivity, Alternative network architectures, Co-design of infrastructure and device, advantages for cost and functionality, Intermittent connectivity, Use of 802.11 in developing world, leapfrog opportunities, Current approaches such as Simputer, System-on-chip, Novel, low-cost, low-power devices – how low can we go? Novel, low-cost displays Books/References:

1. C. Siva Ram Murthy and B.S.Manoj, “Ad hoc Wireless Networks – Architectures and Protocols’, Pearson Education, 2004

2. Feng Zhao and Leonidas Guibas, “Wireless Sensor Networks”, Morgan Kaufman Publishers, 2004. 3. C.K.Toh, “Adhoc Mobile Wireless Networks”, Pearson Education, 2002. 4. Research papers