National Institute of Technology Calicut Department of Computer Engineering

Curriculum for M Tech in Computer Science and Engineering CSA

Semester 1
1 2 3 4 5 6 Code CSA601 CSA602 CSA691 Elective Elective Elective Title Mathematical Foundations of Computer Science Compiler Design Mini Project L 3 3 0 3 3 3 P 0 2 3 0 0 0 Cr 3 4 1 3 3 3 17

Total credits

Semester 2
1 2 3 4 5 6 Code CSA611 CSA612 CSA692 Elective Elective Elective Title Algorithms and Complexity Operating System Design Seminar L 3 3 0 3 3 3 P 2 2 2 0 0 0 Cr 4 4 1 3 3 3 18

Total credits

Semester 3
1 2 Code Elective CSA798 Title Project Total credits L 3 P 0 Cr 3 8 11

Semester 4
1 Code CSA799 Title Project Total credits L P Cr 12 12

Minimum Requirements 1. A Candidate should have earned a total of at least 58 credits. 2. Six courses are suggested as soft core from which a minimum of 3 may be taken. 3. Generally, fourth semester is exclusively for the project work.

Soft- core courses:

Code CSA621 CSA622 CSA623 CSA624 CSA625 CSB601 Title Computability Theory Computer Architecture Database Design Topics in Programming Languages Computer Networking Cryptography L 3 3 3 3 3 3 P 0 2 2 0 2 2 Cr 3 4 4 3 4 4

1. 2. 3. 4. 5. 6.

Elective courses:
Code 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. CSA631 CSA632 CSA633 CSA634 CSA635 CSA636 CSA641 CSA642 CSA643 CSA651 CSA652 CSA653 CSA654 CSA661 Title Logic and Computation Topics in Algorithms Game Theory Quantum Computation Logic for Computer Science Topics in Combinatorial Algorithms Distributed Computing Topics in Computer Architecture Trends in Middleware Systems Software Engineering Object Oriented Modeling and Design Topics in Compiler Design Topics in Database Design Embedded Systems and Applications L 3 3 3 3 3 3 3 3 3 3 3 3 3 3 P 0 0 0 0 0 0 0 0 0 2 2 0 0 2 Cr 3 3 3 3 3 3 3 3 3 4 4 3 3 4

15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34.

CSA671 CSA672 CSA673 CSA674 CSB621 CSB631 CSB632 CSB633 CSB634 CSB611 CSB651 CSB661 CSB612 CSB671 CSB681 CSB682 CSB683 CSB684 MAG622 MAG652

Natural Language Processing Computational Intelligence Image Processing Pattern Recognition Security in Computing Theoretical aspects of cryptographic algorithms Cryptocomplexity Information Theory and Coding Mathematical Models of Internet Formal Methods in Secure Computing Language Based Security Perimeter Security Network Security Data Compression Bioinformatics Pragmatics of Information Security Computer Laws and Ethics Security Policies and Assurance Fuzzy Set Theory and Applications Advanced Topics in Graph Theory

3 3 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3

0 0 0 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0 0 0

3 3 4 4 3 3 3 3 3 3 3 3 4 4 3 3 3 3 3 3

Curriculum for M Tech in Computer Science and Engineering (Information Security) - CSB
Semester 1
Code Title L P Cr

National Institute of Technology Calicut Department of Computer Engineering

1 2 3 4 5 6

CSA60 1 CSB60 1 CSB69 1 Electiv e Electiv e Electiv e

Mathematical Foundations of Computer Science Cryptography Mini Project

3 3 0 3 3 3

0 2 3 0 0 0

3 4 1 3 3 3 17

Total credits

Semester 2
Code CSB61 1 CSB61 2 CSB69 2 Electiv e Electiv e Electiv e Title Formal Methods in Secure Computing Network Security Seminar L 3 3 0 3 3 3 Total credits P 0 2 2 2 0 0 Cr 3 4 1 4 3 3 18

1 2 3 4 5 6

Semester 3
1 2 Code Electiv e CSB79 8 Title Project Total credits L 3 P 0 Cr 3 8 11

Semester 4
1 Code CSB79 9 Title Project Total credits L P Cr 12 12

Minimum Requirements 1. A Candidate should have earned a total of at least 58 credits. 2. Six courses are suggested as soft core from which a minimum of 3 may be taken. 3. Generally, fourth semester is exclusively for the project work.

Soft- core courses:

Code 1. 2. 3. 4. 5. 6. CSA611 CSB683 CSA623 CSB621 CSA625 CSA612 Title Algorithms and Complexity Computer Law and Ethics Database Design Security in Computing Computer Networking Operating System Design L 3 3 3 3 3 3 P 2 0 2 2 2 2 Cr 4 3 4 4 4 4

Elective courses:
Code 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. CSA631 CSA621 CSA632 CSA633 CSA634 CSA635 CSA636 CSA641 CSA622 CSA642 CSA643 CSA651 CSA624 CSA652 CSA602 Title Logic and Computation Computability Theory Topics in Algorithms Game Theory Quantum Computation Logic for Computer Science Topics in Combinatorial Algorithms Distributed Computing Computer Architecture Topics in Computer Architecture Trends in Middleware Systems Software Engineering Topics in Programming Languages Object Oriented Modeling and Design Compiler Design L 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 P 0 0 0 0 0 0 0 0 2 0 0 2 0 2 2 Cr 3 3 3 3 3 3 3 3 4 3 3 4 3 4 4

16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34.

CSA653 CSA654 CSA661 CSA671 CSA672 CSA673 CSA674 CSB631 CSB632 CSB633 CSB634 CSB651 CSB661 CSB671 CSB681 CSB682 CSB684 MAG622 MAG652

Topics in Compiler Design Topics in Database Design Embedded Systems and Applications Natural Language Processing Computational Intelligence Image Processing Pattern Recognition Theoretical aspects of cryptographic algorithms Cryptocomplexity Information Theory and Coding Mathematical Models of Internet Language Based Security Perimeter Security Data Compression Bioinformatics Pragmatics of Information Security Security Policies and Assurance Fuzzy Set Theory and Applications Advanced Topics in Graph Theory

3 3 3 3 3 4 4 3 3 3 3 3 3 3 3 3 3 3 3

0 0 2 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0 0

3 3 4 3 3 4 4 3 3 3 3 3 4 4 3 3 3 3 3

National Institute of Technology Calicut

Department of Computer Engineering

M Tech in Computer Science and Engineering - CSA M. Tech in Computer Science and Engineering (Information Security) - CSB

Detailed Syllabus
CSA601: Mathematical Foundations of Computer Science Prerequisite: Discrete Computational Structures L 3 T P C 0 0 3

Module1: 10Hrs Divisibility, gcd, prime numbers, fundamental theorem of arithmetic,Congruences, Fermat's theorem, Euler function, primality testing, solution of congruences, Chinese remainder theorem, Wilsons theorem. Module 2 : 10 Hrs Groups and subgroups, homomorphism theorems, cosets and normal subgroups, Lagranges theorem, rings, finite fields, polynomial arithmetic, quadratic residues, reciprocity, discrete logarithms, elliptic curve arithmetic. Module 3 : 10 Hrs 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. Module 4 : 12 Hrs 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. References

4. Niven, H.S. Zuckerman and Montgomery, An Introduction to the Theory of Numbers,

3/e, John Wiley and Sons, New York, 1992. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction,3/e, Addison-Wesley, New Delhi, 1994. 6. B. Kolman and R.C. Busby, Discrete Mathematical Structures for Computer Science, PHI, New Delhi, 1994. 7. J. Clark and D. A. Holton, A First Look at Graph Theory, Allied Publishers (World Scientific), New Delhi, 1991. 8. C. L. Liu, Elements of Discrete Mathematics, McGraw Hill, 2/e, Singapore, 1985.

5. R.

CSA602: Compiler Design Prerequisite: Compiler Construction L 3 T P C 0 2 4

Module I: Introduction to Advanced Topics (11 +7 Hours) Review of compiler phases Introduction to Advanced Topics Informal Compiler Algorithm Notation Symbol Table Structure Intermediate Representations Run Time Issues Support for Polymorphic and Symbolic Languages. Module II: Analysis (12 +7 hours) Control Flow Analysis Data Flow Analysis Dependency analysis Alias analysis Module III: Optimization (10 +7 hours) Introduction Review of Early Optimizations Redundancy Elimination Loop Optimizations Procedure Optimization Module IV: Machine Dependent tasks (9+7 hours) Register Allocation Local and Global Instruction Scheduling Advanced Topics in Code Scheduling Low Level Optimizations Introduction to interprocedural analysis and scheduling. References 1. STEVEN MUCHNICK. Advanced Compiler Design Implementation, Morgan Kauffmann Publishers, 1997 2. AHO, A. V, SETHI, R. and ULLMAN, J. D. Compilers: Principles, Techniques and Tools, Addison Wesley, 1986 3. APPEL, A. W. Modern Compiler Implementation in Java, Cambridge University Press, 2000. 4. KENNETH. C. LOUDEN, Compiler Construction. Principles and Practice. Thomson, 2003. CSA611: Algorithms and Complexity Prerequisite: Design and Analysis of Algorithms L 3 T P C 0 2 4

Module I: (11 +7 hours) Analysis: RAM model Notations, Recurrence analysis - Master's theorem and its proof - Amortized analysis - Advanced Data Structures: B-Trees, Binomial Heaps, Fibonacci Heaps, Disjoint Sets, Union by Rank and Path Compression Module II: (11 +7 hours) Graph Algorithms and complexity: Matroid Theory, All-Pairs Shortest Paths, Maximum Flow and Bipartite Matching. Module III: (10+7 hours) Randomized Algorithms : Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods, Probabilistic Primality Testing, De-Randomization Module IV: (10 +7 hrs) Complexity classes - NP-Hard and NP-complete Problems - Cook's theorem NP completeness reductions. Approximation algorithms Polynomial Time and Fully Polynomial time Approximation Schemes. Probabilistic Complexity Classes, Probabilistic Proof Theory and Certificates. References 9. Dexter Kozen, The Design and Analysis of Algorithms, Springer, 1992. 10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall

India, 1990.

11. S. Basse, Computer Algorithms: Introduction to Design and Analysis, Addison

Wesley, 1998.

12. U. Manber, Introduction to Algorithms: A creative approach, Addison Wesley, 1989. 13. V. Aho, J. E. Hopcraft, J. D. Ullman, The design and Analysis of Computer
Algorithms, Addison Wesley, 1974.

14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambrdige University Press,

1995. 15. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994 16. Leonard Adleman. Two theorems on random polynomial time. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 7583, 1978. 17. J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal of Computing, 6:675695, 1977. 18. C. Lautemann. BPP and the Polynomial Hierarchy. Information Processing Letters, 17:215217, 1983. 19. M. Sipser. A complexity theoretic appraoch to randomness. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 330335, 1983. 20. L.G. Valiant and V.V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:8593, 1986.

CSA612: Operating System Design Prerequisite: Operating Systems L 3 T P C 0 2 4

Module1: (11 +7 Hours) Introduction- Introduction, Hardware interface, Operating system interface. design problems, Operating System design techniques. Implementing processes The system call interface, system initialization, process switching, system call interrupt handling, program error interrupts, disk driver system, implementing waiting, flow of control through OS, signaling and interrupts, event table managers, process implementation. Parallel systems- Parallel hardware, OS for two processor systems, race conditions with shared processes, atomic actions, multiprocessor OS, threads. Module 2: ( 11 +7 Hours) Interprocess communication patterns- competing and co-operating, problems, race conditions and atomic actions, new message passing system calls, IPC pattern: mutual exclusion, signalling and rendezvous models, producer-consumer and client server models. Deadlocks- Conditions for deadlock, dealing with deadlocks, two-phase locking, message variations, synchronization, semaphores. Design techniques- some example design techniques. Memory management- levels of memory management, linking and loading process, memory management design, dynamic memory allocation, keeping track allocation of blocks, multiprogramming issues, memory protection, memory management system calls. Module 3: ( 10 +7 Hours) Virtual memory- Fragmentation and compaction, dealing with fragmentation- paging, swapping, overlay, page replacement- global and local page replacement algorithms,

thrashing and load control, dealing with large page tables, sharing memory. Design techniques- examples of multiplexing and late binding. I/O devices- devices and controllers, terminal devices, communication devices, disk devices, disk controllers, SCSI interfaces, tape devices, CD devices. I/O subsystemsI/O system software, disk device driver access strategies, modelling disks, unification of files and device, generalized disk device drivers, disk caching. File systems- File abstraction, naming, filesystem objects and operations. Module 4: (10 +7Hours) File system organization- organization, file descriptors, locating file blockson disks, implementation of logical to physical block mapping, file sizes, Booting the OS, file system reliability, file security and protection. Resource management and protection- resources in an OS, resource management issues, types of resources, integrated scheduling, queuing models of scheduling, real-time OS, protection of resources, user authentication, mechanism for protecting hardware resources, representation of protection information, mechanisms for software protection, Design techniquesCaching, hierarchical names and naming of objects. References 1. Charles Crowley, Operating systems- a design oriented approach, Tata Mcgraw-hill edition, New Delhi, 1998. 2. Silberschatz and Galvin, Operating system concepts, Addison Wesley, 1998. 3. Tanenbaum Andrew S, Modern Operating system , Eaglewood Cliffs, NJ: Prentice Hall, 1992 4. Gary J.Nutt, Operating systems- A modern perspective, 2nd edition, Addison wesley, 2000. 5. Stallings William, Operating systems- Internals and design principles, 4 th Edn, PHI, 2002 CSA621: Computability Theory Prerequisite: Theory of Computation L 3 T P C 0 0 3

Module I: Automata Theory (10 Hours) Review of Induction and Diagonalization - Finite Automata Myhill-Nerode Theorem, Pumping Lemma. Turing Machines Turing Acceptable, Decidable and Enumerable languages. Module II: Computability (10 hours) Closure Properties of RE and R sets - Undecidability Reductions RE Completeness Non-RE languages - Rice Theorems. Module III: Introduction to Complexity (11 hours) Time and Space complexity classes Relations between deterministic and NonDeterministic time and Space complexity classes Hierarchy Theorems, Savitch's Theorem - Immerman Szelepscenyi Theorem. Module IV: Machine Independent Complexity Theory (11 hours) NP Completeness Cook's Theorem Reductions PSPACE completeness, NLCompleteness.

References 1. SIPSER, M. Introduction to the Theory of Computation, PWS Publishing Company, 1997 2. PAPADIMITRIOU, C. H. Computational Complexity, Addison Wesley, 1994 3. HOPCROFT, J. E. and ULLMAN, J. D. Introduction to Automata Theory, Languages and Computation, Addison Wesley, 1979 4. Jon Barwise and John Etchemendy, Turing's World 3.0, Center for the study of Language and Information, 1995. CSA622: Computer Architecture Prerequisite: Computer Organization L 3 T P C 0 2 4

Module I: (9+7Hours) Performance evaluation, Processor architecture, pipelining, pipeline hazards, issues in pipelined processor implementation. Module II: (12 +7 Hours) Instruction level parallelism, hardware and compiler support for branch prediction, out-oforder Instruction issue, speculative execution and other techniques for high-performance Module III: (9+7 Hours) Instruction and data cache organizations, multilevel caches, parallel memory systems, Support for virtual memory. Module IV: (12 +7 Hours) Multiple processor systems, Interconnection networks, shared memory system, memory models, cache coherence. References 1. Hennessy J. L., D. Patterson, Computer Architecture A quantitative Approach, Morgan Koffman (3/e), 2003 2. John Paul Shen, Mikko Lipasti. Modern Processor Design Fundamentals of Superscalar Processors. McGraw Hill International Edition, 2005. 3. Dezso Sima, Terence Fountain, Peter Kacsuk. Advanced Computer Architecture A Design Space Approach, Addison Wesley, 2000.

CSA623: Database Design Prerequisite: Database Management Systems L 3 Module I (11 +7 hours) Database System concepts and applications, Data modeling using EntityRelationship model, Record Storage and File organization. Module II (11+7 hours) T P C 0 2 4

The Relational Data Model, Relational constraints and the Relational Algebra, SQL, ER to Relational mapping, Examples of RDBMS. Module III (11 +7hours) Database Design Theory and Methodology- Functional Dependencies and Normalization for Relational Databases, Relational Database design algorithms, Practical Database Design and Tuning. Module IV (10 +7hours) Object Oriented Database concepts, Object Relational and Extended Relational Database Systems, Data Warehousing and Data Mining, Emerging Database Technologies and Applications. References 1. Elmasri, Navathe. Fundamentals of Database Systems, Third Edition, Pearson Education, 2000. 2. T. CONNOLLY, C. BEGG, Database Systems, 3/e, Pearson Education, 2003. 3. Silberschatz A., Korth H. F., & Sudarshan S., Database System Concepts, Tata McGraw Hill, 2003 4. Ullman J. D., Principles of Database Systems, Galgotia Publications,1996. CSA624: Topics in Programming Languages L T P C 3 0 0 3 Module I: (6 hrs) Formal Semantics. Module II: (10 hrs) Untyped Lambda Calculus, Simply Typed Lambda Calculus. Module III: (13 hrs) Extensions to Simply Types Lambda Calculus: Basic Types, Derived Forms, Bindings, Pairs, Tuples, Records, Sums, Variants, General Recursion. Module IV: (13 hrs) Sub-typing, Recursive Types, Polymorphism. References

21. Benjamin C Pierce. Types and Programming Languages. MIT Press, 2002. 22. Luca Cardelli. Type Systems. In Allen B Tucker(Ed.), Handbook of Computer
Science and Engineering. CRC Press, 1996. 3. ACM SIGPLAN. CSA625 : Computer Networking L 3 T P C 0 2 4

Module I (9 +7 Hrs) Computer networks and Internet, the network edge, the network core, network access, delay and loss, protocol layers and services, Application layer protocols, socket

programming, content distribution. Module II (13+7 Hrs) Transport layer services, UDP and TCP, congestion control, Network layer services, routing, IP, routing in Internet, router, IPV6, multicast routing, mobility. Module III (9+7 Hrs) Link layer services, error detection and correction, multiple access protocols, ARP, Ethernet, hubs, bridges, switches, wireless links, PPP, ATM. Module IV (11+7 Hrs) Multimedia networking, streaming stored audio and video, real-time protocols, security, Cryptography, authentication, integrity, key distribution, network management. References 23. J. F. Kurose and K . W. Ross, Computer Networking: A Top-Down Approach Featuring Internet, 3/e, Perason Education, 2005. 24. Peterson L.L. & Davie B.S., Computer Networks, A systems approach, 3/E, Harcourt Asia, 2003. 25. Keshav S., An Engineering Approach to Computer Networking, Pearson Education, 2000. 26. Andrew S. Tanenbaum, Computer Networks, 3/E, PHI, 1996. 27. IEEE/ACM Trans on Networking 28. Computer Networks (Elsevier)

CSA672: Computational Intelligence L 3 T P C 0 0 3

Module I (10 hours) 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. Module II (11 hours) 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. Module III (10 hours) 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. Module IV (11 hours) Languages and Programming Techniques for AI- Introduction to PROLOG and LISP, Search strategies and Logic Programming in LISP, Production System examples in PROLOG.

References 1. GEORGE.F.LUGER, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, 4/e, 2002, Pearson Education. 2. E. RICH, K.KNIGHT, 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

CSA634: Quantum Computation Prerequisites: Theory of Computation L 3 T P C 0 0 3

Module I: Foundations (12 Hours) Finite Dimensional Hilbert Spaces Tensor Products and Operators on Hilbert Space Hermitian and Trace Operators - Basic Quantum Mechanics necessary for the course. Module II: Model of Computation (9 hours) Quantum Gates and operators and Measurement Quantum Computational Model Quantum Complexity Schemes for Physical realization (Only peripheral treatment expected). Module III: Algorithms and Complexity (10 hours) Shor's Algorithm Application to Integer Factorization Grover's Algorithm Quantum Complexity Classes and their relationship with classical complexity classes. Module IV: Coding Theory (11 hours) Quantum Noise Introduction to the theory of Quantum Error Correction Quantum Hamming Bound Coding Schemes Calderbank-Shor-Steane codes Stabilizer Codes. References 29. NIELSEN M. A. and I. L. CHAUANG, Quantum Computation and Quantum Information, Cambridge University Press, 2002. 30. GRUSKA, J. Quantum Computing, McGraw Hill, 1999. 31. HALMOS, P. R. Finite Dimensional Vector Spaces, Van Nostrand, 1958. 32. JULIAN BROWN. Minds, Machines and the Multiverse: The Quest for the Quantum Computer by Julian Brown. Simon and Schuster, 2000. CSA671: Natural Language Processing L 3 T P C 0 0 3

Module I (11 hours) 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. Module II (11 hours) 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 Module III (11 hours) 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 Module IV (9 hours) Ambiguity Resolution: Statistical Methods, Estimating Probabilities, Part-ofSpeech tagging, Obtaining Lexical Probabilities, Probabilistic Context-Free Grammars, Best First Parsing. Semantics and Logical Form, Word senses and Ambiguity, Encoding Ambiguity in Logical Form. References 33. JAMES ALLEN, Natural Language Understanding, 2/e, Pearson Education, 2003. 34. D. JURAFSKY, J. H. MARTIN, Speech and Language Processing, Pearson Education, 2002. 35. CHRISTOPHER D. MANNING, HINRICH SCHTZE, Foundations of Statistical Natural Language Processing, The MIT Press, Cambridge, Massachusetts.1999.

CSA632: Topics in Algorithms Prerequisite: Design and Analysis of Algorithms L 3 T P C 0 0 3

Module I: Discrete Probability (10 Hours) Probability, Expectations, Tail Bounds, Chernoff Bound, Markov Chains and Random Walks, Martingales Module II: Randomized Algorithms (11 hours) Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods, Probabilistic Primality Testing, De-Randomization Module III: Complexity (10 hours) Probabilistic Complexity Classes, Probabilistic Proof Theory and Certificates, Interactive and Zero Knowledge Proof Systems, Arthur Merlin Games. Module IV: Kolmogorv Complexity (11 hours) Definition of Randomness, Unsolvability results, Chatins Proof for Gdels Theorem. References

36. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press,

1995.

37. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994

38. Journal of Algorithms, Elsevier. CSA642 : Topics in Computer Architecture Prerequisite: Computer Architecture L 3 Module I: Advanced ILP Exploitation Techniques (10 Hours) Hardware and software techniques for ILP extraction, speculative execution, studies on ILP. Module II: CMPs and Polymorphic processors (10 hours) Concept, Studies and Analysis Module III: Simulators in Computer Architecture (12 hours) Introduction methods, ADLs, traces, dynamic compilation. Module IV: Multithreaded processors (10 hours) Concept, methodologies and analysis. Speculative multithreading. References 39. ACM SIGARCH Computer Architecture News. 40. The WWW Computer Architecture page. http://www.cs.wisc.edu/arch/www/ 41. Hennessy J. L., D. Patterson, Computer Architecture A quantitative Approach, Morgan Kuffman (3/e), 2003 CSA653: Topics in Compiler Design Prerequisite: Compiler Design L 3 T P C 0 0 3 T P C 0 0 3

Module I: Attribute grammars (10 hours) Analysis, use, tests, circularity. Issues in type systems. Module II: Analysis and Optimizations (10 hours) Advanced topics in Data Flow, Control Flow and Dependency analysis, Loop optimizations. Module III: ILP Compilation (11 hours) Issues in compilation for ILP based processors. Effect of VLIW, Speculative, Predicated instructions, multithreaded processors. Module IV: Dynamic Compilation (11 hours) Introduction, methods, case studies, implementation. References 42. ACM SIGPLAN. 43. ACM Transactions on Programming languages and Systems.

44. STEVEN MUCHNICK. Advanced Compiler Design Implementation, Morgan

Kauffmann Publishers, 1997

45. AHO, A. V, SETHI, R. and ULLMAN, J. D. Compilers: Principles, Techniques and

Tools, Addison Wesley, 1986 CSA654: Topics in Database Design Prerequisite: Database Design L 3 T P C 0 0 3

Module I : ( 11 hours) Parallel and Distributed Databases: Architecture of Parallel Databases, Parallel Query Optimization, Distributed DBMS Architectures, Distributed Query Processing, Distributed Concurrency Control, Distributed recovery. Module II : ( 10 hours ) Internet Databases and Data Mining : XML QL, Ranked Keyword searches on the Web, Data Mining, Clustering, Similarity Search over Sequences. Module III : (10 hours) Object Oriented Database Systems: User Defined ADTs, Objects, Object Identity and Reference types, Database Design for ORDBMS, OODBMS, Comparison of RDBMS with OODBMS and ORDBMS. Module IV: ( 12 hours) Spatial and Deductive Databases: Spatial and Temporal Databases, Temporal Logic, Spatial Indexes, Introduction to Recursive Queries, Introduction to Mobile Databases, Main Memory and Multimedia Databases References 1. Elmasri & Navathe, Fundamentals of Database Systems, 3rd Edition, Addison Wesley 2. O'neil P. & O'neil E., Database Principles, Programming, and Performance, 2/e, Harcourt Asia, Morgan Kaufman 3. Silberschatz A., Korth H. F., & Sudarshan S., Database System Concepts, Tata McGraw Hill, 2003 4. Ullman J. D., Principles of Database Systems, Galgotia Publications,1996. 5. Date C. J., An Introduction to Database Systems, Addison Wesley, 2000. 6. Ramakrishnan R. & Gehrke J., Database Management Systems, 3/e, McGraw Hill, 2004 CSA641: Distributed Computing Prerequisite: Operating Systems L 3 Module I : ( 10 hours) Characterization of Distributed Systems, Internetworking, Inter Process communication System Models, Networking T P C 0 0 3 and

Module II : ( 10 hours ) Distributed Objects and Remote Invocation, RPC, Processes and threads, Security, Digital Signatures, Cryptography pragmatics, Distributed File systems Module III : (10 hours) Name Services and Domain Name System, Directory and Discovery Systems, Synchronizing physical clocks, logical time and logical clocks, Distributed Mutual Exclusion, Elections Module IV: ( 12 hours) Transactions and Concurrency Control, Distributed Transactions, Distributed Deadlocks, Transaction Recovery, Fault-tolerant Services, Distributed Shared Memory, CORBA Case Study. References 46. Coulouris G., Dollimore J. & Kindberg T., "Distributed Systems Concepts And Design", 3/e, Addison Wesley 2004 47. Tanenbaum S, Maarten V.S., Distributed Systems Principles and Paradigms, Pearson Education 2004 48. Chow R. & Johnson T., "Distributed Operating Systems and Algorithms", Addison Wesley 2003 49. Tanenbaum S., "Distributed Operating Systems", Pearson Education 2005 CSA652 :Object Oriented Modeling & Design L 3 T P C 0 2 4

Module I : ( 10+7 hours) Structural Modeling: Object Oriented Fundamentals, Basic structural Modeling, UML Model , Class Diagrams, Object Diagrams, Packages and Interfaces, Case Studies. Module II : ( 12+7 hours ) Behavioral and architectural Modeling: Use Case Diagrams, Interaction Diagrams, State Chart Diagrams, Collaborations, Design Patterns, Component Diagrams, Deployment Diagrams, Case Studies Module III : (9 +7 hours) 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 Module IV: ( 11 +7 hours) 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. 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. CSA651: Software Engineering L 3 T P C 0 2 4

Module 1(9 Hours) The Software Process: Life cycle models, from specification to maintenance. Critical systems, Requirements Engineering: Functional and non-functional requirements, preparing and validating feasibility studies Module 2(11 Hours) Software Design: Architectural, Object Oriented, Real-time, and Reusable Designs. Object Oriented design with UML Module 3 (10 Hours) Software Project Management: Managing Process, People, Product and Quality, Reliability Module 4 (12 Hours) Formal specification and verification of programs and software. Project Delays - The symptoms, reasons, and solutions. Performance concerns - Improving design methods and programming styles for producing better software References: 1. Ian Sommerville, Software Engineering, 6/e, Pearson Education Asia, 2001. 2. Oestereich, Developing Software with UML, Addison Wesley. 3. Steve McConnell, Code Complete, Microsoft Press, 1993. 4. F P Brooks, Jr., Mythical Man-Month, 2/E,Addison Wesley. 5. J L Bentley, Programming Pearls, 2/E, Addison Wesley, 1999.

CSA635: Logic for Computer Science Prerequisite: Theory of Computation L 3 T P C 0 0 3

Module I: Propositional Logic (6 Hours) Review of undecidability and Complexity classes, Formal Systems, Syntax and Semantics of Prepositional Calculus, Completeness Theorem, Compactness, NPCompleteness of Satisfiability. Module II: Predicate Logic (12 hours) Syntax and semantics, Herbrands Expansion Theorem, Proof Systems, Completeness and Compactness, Undecidability of Satisfiability. Module III: Incompleteness (12 hours)

First order Axiomatization of number theory, Godels Incompleteness Theorem, Limitations of first order logic. Module IV: Logic and Computation (12 hours) Bucchis Theorem, Logical Characterization for Complexity classes, FaginsTheorem. References 50. C. H. Papadimitriou, Computational Complexity, Addison Wieley, 1994. 51. Jean A. Gallier, Logic for Computer Science Foundations of Automatic Theorem Proving, Wiley, 1986 52. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.

CSA673: Image Processing L 4 T P C 0 0 4

Module I (21 hours) 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 Module II (13 hours) 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 Module III (11 hours) Image compression - image compression models - elements of information theory error-free compression - lossy compression - image compression standards Module IV (11 hours) 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 Reference books 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.

CSA674: Pattern Recognition

L 4

T P C 0 0 4

Module 1: ( 16 hrs) Introduction- Introduction to statistical, syntactic and descriptive approaches, features and feature extraction, learning. Bayes Decision theory- introduction, continuous case, 2-categoryclassification, minimum error rate classification, classifiers, discriminant functions, and decision surfaces. Error probabilities and integrals, normal density, discriminant functions for normal density, Bayes Decision theory Discrete case. Module 2: (14 hrs) Parameter estimation and supervised learning- Maximum likelihood estimation, the Bayes classifier, learning the mean of a normal density, general bayesian learning. Nonparametric technique- density estimation, parzen windows, k-nearest Neighbor estimation, estimation of posterior probabilities, kn nearest neighbor rule, nearestneighbor rule, k-nearest neighbor rule. Module 3: (13 hrs) Linear discriminant functions- linear discriminant functions and decision surfaces, generalized linear discriminant functions, 2-category linearly separable case, nonseparable behavior, linear programming procedures. Multiplayer neural networks- Feed forward operation and classification, Backpropagation algorithm, error surfaces, back propagation as feature mapping, practical techniques for improving back propagation. Module 4: (13 hrs) Supervised learning and clustering- Mixture densities and identifiably, maximum likelihood estimates, application to normal mixtures, unsupervised Bayesian learning, data description and clustering, Hierarchical clustering, low dimensional representation of multidimensional map References 53. Duda and Hart P.E, Pattern classification and scene analysis, John Wiley and sons, NY, 1973. 54. Earl Gose, Richard Johnsonbaugh, and Steve Jost; Pattern Recognition and Image Analysis, PHI Pvte. Ltd., NewDelhi-1, 1999. 55. Fu K.S., Syntactic Pattern recognition and applications, Prentice Hall, Eaglewood cliffs, N.J., 1982 56. Rochard O. Duda and Hart P.E, and David G Stork, Pattern classification , 2nd Edn., John Wiley & Sons Inc., 2001.

CSA643: Trends in Middleware Systems L 3 T P C 0 0 3

Module I ( 12 hours): Publish/Subscribe matching algorithm , Processing of XML data over Xpath expressions , Processing of XML data over XQuery queries , Regular expression processing Module II( 10 hours): Composite event processing ,Content-based routing in distributed broker networks , Distributed Hash-Tables (DHT) Module III ( 10 hours): Content Addressable Networks, Topic-based publish/subscribe over DHTs , TBA. Module IV( 10 hours): Case studies- REBECA, HERMES, Gryphon. References

57. Chris Britton, Peter Bye. IT Architectures and Middleware. Pearson Education
second Edition, 2005 58. Yanlei Diao, and Michael J. Franklin. Query Processing for High-Volume XML Message Brokering. VLDB 2003. 59. 2. Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi . RE-Tree: An Efficient Index Structure for Regular Expressions, VLDB 2002.

60. Peter R. Pietzuch, Brian Shand, Jean Bacon. A Framework for Event
Composition in Distributed Systems, Proc. of the 4th Int. Conf. on Middleware (MW'03)

61. A. Carzaniga and A.L. Wolf. Forwarding in a Content-Based Network.

Proceedings of ACM SIGCOMM 2003. p. 163-174. Karlsruhe, Germany. August, 2003.

CSA636: Topics in Combinatorial Algorithms Prerequisite: Design and Analysis of Algorithms L 3 T P C 0 0 3

Module I: (10 hrs) Primal dual theory of linear programming, and application to flows, cuts. Module II: (10 hrs) Application of primal dual theoty to matching and related combinatorial optimization problems. Module III: (10hrs) Randomization techniques, Module IV: (12 hrs) Approximation algorithms and non-approximability.

References 62. C. H. Papadimitirou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover, 1998. 63. G. Ausiello et.al., Complexity and Approximation: Combinatorial Algorithms and their Approximability Properties, Springer, 2002. 64. Journal of Algorithms. Elsevier.

CSA633: Game Theory L 3 T P C 0 0 3

Module-1:(7hrs) Introduction to Non Co-operative Game Theory: Extensive Form Games, Strategic Form Games, Pure Strategy Nash Equilibrium Module-2:(10hrs) Nonco-operative Game Theory (in detail), Mixed Strategies, Existence of Nash Equilibrium, Computation of Nash Equilibrium, Two Player Zero-Sum Games, Bayesian Games Module-3:(13hrs) Mechanism Design : An Introduction, Dominant Strategy Implementation of Mechanisms, Vickrey-Clorke-Groves Mechanisms, Bayesian Implementation of Mechanisms, Revenue Equivalence Theorem, Design of Optimal Mechanisms Module-4:(13hrs) 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 References 65. Roger B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, September 1997. 66. Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green. Microeconomic Theory. Oxford University Press, New York, 1995. 67. Martin J. Osborne, Ariel Rubinstein. A Course in Game Theory. The MIT Press, August 1994. 68. Philip D. Straffin, Jr. Game Theory and Strategy. The Mathematical Association of America, January 1993. 69. Ken Binmore, Fun and Games : A Text On Game Theory, D. C. Heath & Company, 1992. 70. Paul Klemperer, Auctions: Theory and Practice, The Toulouse Lectures in Economics, Princeton University Press, 2004.

CSA631: Logic and Computation Prerequisite: Logic for Computer Science L 3 Module-1:(10 hrs) Temporal Logic based verification, Buchi automata, Linear Temporal Logic (LTL), Modelling systems Module-2:(9hrs) Computation Tree Logic (CTL), Symbolic model checking Tools: Spin, SMV Module-3:(13hrs) Verification of infinite-state systems, Verification of real-time systems, Timed automata, Modelling real-time systems, Tools: Uppaal, Kronos Module-4:(10hrs) Verification of pushdown systems, Verification of security protocols Reference Books: 71. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999. 72. B. Berard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, P. 73. Schnoebelen, and P. McKenzie. Systems and Software Verification: ModelChecking Techniques and Tools. Springer Verlag, 2001. 74. Jean A. Gallier, Logic for Computer Science Foundations of Automatic Theorem Proving, Wiley, 1986 75. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999. CSA661: Embedded Systems and Applications L 3 T P C 0 2 4 T P C 0 0 3

Prerequisites: Basic courses in digital hardware, algorithms, data structures, elementary calculus, and probability. Module I: (10+7hrs) Introduction to embedded systems: classification, characteristics and requirements. Timing and Clocks in Embedded Systems. Module II: (10+7 hrs) Task modeling and management. Real-time operating system issues. Signals: frequency spectrum, and sampling, digitization (ADC, DAC), signal conditioning and processing.

Module III: (10+7 hrs) Modeling and characterization of embedded computing systems. strategies for embedded systems: encoding, and flow control. Module IV: (12+7 hrs) Fault Tolerance. Formal Verification References Communication

76. H. Kopetz, Real-time Systems, Kluwer, 1997. 77. R. Gupta, Co-synthesis of Hardware and Software for Embedded Systems,
Kluwer 1995.

78. Jane W S Liu, Real time systems, Pearson Education Pte. Ltd., 2001. 79. Raj Kamal, Embedded systems: architecture, programming and design, Tata
McGraw- Hill publishing Co. Ltd., 2003, (2005 reprint).

CSB601 : Cryptography L 3 T P C 0 2 4

Module I: (9 +7 hours) Review of number theory and algebra, computational complexity, probability and information theory, primality testing. Module II: (10+7 hrs) Cryptography and cryptanalysis, symmetric key encryption, DES, Triple DES, AES, RC4, modes of operation. Module III: (13+7 hrs) public key encryption, RSA cryptosystem, Diffie-Hellman, elliptic curve cryptography, Rabin, ElGamal, Goldwasser-Micali, Blum-Goldwasser cryptosystems. Module IV: (10+7 hrs) Message authentication, digital signature algorithms. Security handshake pitfalls, Strong password protocols. References

80. W. Mao, Modern Cryptography: Theory & Practice, Pearson Education, 2004.
81. C. Kaufman, R. Perlman and M. Speciner, Network Security: Private Communication in a public World, 2/e, Prentice Hall, 2002. 82. W. Stallings, Cryptography and Network Security Principles and practice, 3/e, Pearson Education Asia, 2003. 83. H. Delfs and H. Knebl, Introduction to Cryptography: Principles and Applications, Springer-Verlag, 2002.

CSB611: Formal Methods in Secure Computing L T P C 3 0 0 3 Module 1: (9 hours) Formal models: Bell LaPadula, Biba, Clark Wilson, Chinese wall, Role based, Object oriented, Resource allocation monitor models. Module II: (10 hours) Mapping these to the security functions of identification & authentication, Access control, Audit Object reuse. Module III: (10 hours) Reliability of Service, Anonymization, Pseudonymization and communication security functions. Module IV: (13 hours) Methods of protocol design and verification. References 84. Willis H Ware, Charles P Pfleeger, Shari Lawrence Pfleeger, Security in Computing , Prentice Hall, Third Edition, 2003 85. Theo Dimitrakos, Fabio Martinelli Formal Aspects In Security And Trust: Ifip TN Wg1.7 Workshop on Formal Aspects in Security, Springer, 2005 86. Computer Security Handbook, 4th Edition. Seymour Bosworth, M E Kabay (Editors). John Wiley, 2002. 87. W. Mao, Modern Cryptography: Theory & Practice, Pearson Education, 2004

CSB612 : Network Security L 3 Module I: (10+7 hrs) Review of wired/wireless network protocols, intrusion detection systems, malicious software. Module II: (10+7 hrs) Review of cryptographic algorithms and protocols, cryptanalysis, authentication and signature protocols. Module III: (12+7 hrs) Kerberos, PKI, real-time communication security, IPSec: AH, ESP, IKE. Module IV: (10+7 hrs) SSL/TLS, e-mail security, PEM and S/MIMIE, PGP, web security, network management T P C 0 2 4

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

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

90. Schiller J., Mobile Communications, Pearson Education Asia,2/e, 2004. 91. W. Stallings, Cryptography and Network Security Principles and practice, 3/e,
Pearson Education Asia, 2003.

CSB621 : Security in Computing Prerequisite: Operating Systems, Networks, DBMS L 3 T P C 0 0 3

Module I (12 Hrs) Computer security, threats, attacks, computer criminals, defense methods, information and network policies, cryptography, symmetric and public-key encryption, uses of encryption. Module II (11 Hrs) Program security, secure programs, viruses and other malicious code, control against program threats, protection in general-purpose OS, protected resources and methods of protection, user authentication. Module III (9 Hrs) Designing trusted OS, models of security, database security, security requirements, reliability and integrity, inference. Module IV (10 Hrs) Threats in networks, network security controls, firewalls, intrusion detection, administering security, legal, privacy, and ethical issues in computer security. References 92. C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/e, Pearson Education, 2003. 93. M. Bishop and S. S. Venkatramanayya, Introduction to Computer Security, Pearson Education Asia, 2005. 94. Stallings W., Cryptography and Network Security Principles and Practice, 3/e, Pearson Education Asia, 2003. 95. Stallings W., Network Security Essentials: Applications and Standards, Pearson Education Asia, 2002 CSB631: Theoretical aspects of cryptographic algorithms L 3 Module I(9 hrs) T P C 0 0 3

Euclid's algorithm for integers and polynomials applications to modular inversion, Rational polynomial approximation etc. Module II: (10 hrs) Quadratic reciprocity and application to Primality testing. Module III: (10 hrs) Polynomial and integer factorization. Module IV: (13 hrs) Applications to cryptography and coding theory. References: 1. V. Shoup, A computational Introduction to Number theory and Algebra, Cambridge university press, 2005. 2. J. Von Zur Gathen, J. Gerhard, Modern Computer Algebra, Cambridge Unverisy Press, 2003. 3. Journal of Algorithms. Elsevier. CSB632: Cryptocomplexity Prerequisite: Analysis of Algorithms L 3 T P C 0 0 3

Module I: (9 hours) Review of Relevant Mathematics, Complexity Theory, Foundations of Cryptology, Hierarchies based on NP. Module II: (10 hrs) Randomized algorithms and Complexity classes, probabilistic Polynomial time classes, Quantifiers, Graph Isomorphism and lowness. Module III: (10 hrs) RSA Cryprosystem, primality and factoring, Primality Tests, Factoring Methods, Security of RSA. Module IV: (13 hrs) Diffie Hellmans, ElGamals and other protocols, Arthur Merlin Games and Zero knowledge. References 1. Jorg Roth, Complexity Theory and Cryptology An introduction to cryptocomplexity, Springer, 2005. 2. H. Anton, Elementary Linear algebra, John Wiley and Sons, New York, eighth edition, 2000. 3. G. Brassard. A note on the complexity of cryptography, IEEE Transactions on Information Theory, 25(2):232-233, 1979 CSB633 : Information Theory and Coding L 3 Module I: (12 hrs) T P C 0 0 3

Introduction to probability, information, noiseless coding, noisy coding, cyclic redundancy checks, Module II: (10 hrs) permutation of sets, finite fields, linear codes, bounds for codes Module III: (10 hrs) primitive polynomials, RS and BCH codes Module IV: (10 hrs) Concatenated codes, curves and codes. References: 96. P. Garrett, The Mathematics of Coding Theory: Information, Compression, Error Correction and Finite Fields, Pearson Education, 2004. 97. Shu Lin, Daniel J Costello, Error Control Coding - Fundamentals and Applications, Prentice Hall Inc. Englewood Cliffs. 98. San Ling, Coding Theory A First Course. Cambridge Press, 2004. 99. CSB634: Mathematical Models of Internet L T 3 0 P C 0 3

Module I: (9 Hours) Definition and characteristics of mathematical models. Module II: (10 hours) Modeling the network - queuing systems, modeling the QoS for improvement. Mathematical models of fairness and stability. Module III:( (10 hours) Modeling a self-managed internet. Moving away from the end to end concept. Modeling required in an untrustworthy world. Module IV: (12 hours) Modeling of an internet based application. References 1. Harold Tipton, Micki Krause, Information Security Management Handbook, 5th Edition, Auerbach / CRC Press 2004 2. Seymour Bosworth, M E Kabay .Computer Security Handbook, 4th Edition. John Wiley, 2002. 3. Theo Dimitrakos, Fabio Martinelli, (Editors). Formal Aspects in Security and Trust: Proceedings of IFIP Workshop on Formal Aspects in Security and Trust (FAST) 2004, Springer 2005 4. Ali E Abdallah, Peter Ryan, Steve Schneider (Editors). Formal Aspects of Security: Proceedings of First International Conference, FASec 2002. LNCS 2629, Springer 2003 5. Markus Schumacher. Security Engineering with patterns: origins, theoretical model, and new applications. LNCS 2754, Springer.

CSB661 : Perimeter Security L 3 Module I: (6 hrs) Computer security, attacks, methods of defense. Module II: (12+5 hrs) 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 Module III: (12 +9 hrs) Firewalls, design of firewalls, trusted systems, Trojan horse defense Module IV: (12+10 hrs) Security planning, risk analysis, security policies, communication, steganography tools, digital watermarking. physical security, covert T P C 0 2 4

References: 100.E. Cole, R. Krutz, and J. Conley, Network Security Bible, Wiley-Dreamtech, 2005. 101.W. Stallings, Cryptography and Network Security Principles and practice, 3/e, Pearson Education Asia, 2003. 102.C. P. Pfleeger and S. L. Pfleeger, Security in Computing, 3/e, Pearson Education, 2003. 103.M. Bishop, Computer Security: Art and Science, Pearson Education, 2003. CSB671: Data Compression L 3 T P C 0 2 4

Module 1: (10+7 hrs) Introduction, Basic Techniques, Dictionary Methods Module II: (10 +7hrs) Image Compression, Transform based techniques, Wavelet Methods, adaptive techniques Module III: (10 +7hrs) Video compression, Audio Compression, Fractal techniques. Module IV: (12+7 hrs) Comparison of compression algorithms. Implementation of compression algorithms. References 104.David Solomon, Data compression: the complete reference, 2nd edition, Springer-verlag, New York. 2000. 105.Stephen Welstead, Fractal and wavelet Image Compression techniques, PHI,

3.

NewDelhi-1, 1999. Khalid Sayood, Introduction to data compression, Morgan Kaufmann Publishers, 2003 reprint. CSB681: Bioinformatics L 3 T P C 0 0 3

Module I (10 Hrs) Molecular biology, gene structure and information content, molecular biology tools, genomic information content, data searches and pairwise alignments, gaps, scoring matrices, Needleman and Wunsch algorithm, global and local alignments, database searches. Module II (10 hrs) Patterns of substitution within genes, estimating substitution numbers, molecular clocks, molecular phylogenetics, phylogenetic trees, distance matrix methods. Module III (11 Hrs) Character-based methods of phylogenetics, parsimony, ancestral sequences, searches, consensus trees, tree confidence, genomics, prokaryotic gene structure, gene density, eukariotic genomes, gene expression. Module IV (11 Hrs) Protein and RNA structure prediction, polypeptic composition, secondary and tertiary structure, algorithms for modeling protein folding, structure prediction, proteomics, protein classification, experimental techniques, ligand screening, post-translational modification prediction. References 106.D. E. Krane and M. L. Raymer, Fundamental Concepts of Bioinformatics, Pearson Education, 2003. 107.T. K. Attwood and D. J. Parry-Smith, Introduction to Bioinformatics, Pearson Education, 2003. 108.J. H. Zar, Biostatistical Analysis, 4/e, Pearson Education, 1999. CSB682: Pragmatics of Information Security L T P C 3 0 0 3 Module I: (7 hrs) Information Security: Issues and Solutions. Module II: (11 hrs) Evolution of cryptography and cryptographic protocols, relationship with mathematical developments. Module III: (11 hrs) Vulnerability, Threat, Risk Assessments and Managements. Critical Assets. Module IV: (13 hrs) Enterprise security - Policy, Standards, Guidelines and Procedures. Legal requirements. References

109.Security Engineering with patterns: origins, theoretical model, and new applications. Markus Schumacher. LNCS 2754, Springer.

110.M. Bishop, Computer Security: Art and Science, Pearson Education, 2003.
111.Information Security Management Handbook, 5th Edition, Harold Tipton, Micki Krause (Editors) Auerbach / CRC Press 2004 112.Computer Security Handbook, 4th Edition. Seymour Bosworth, M E Kabay (Editors). John Wiley, 2002. 113.Formal Aspects in Security and Trust: Proceedings of IFIP Workshop on Formal Aspects in Security and Trust (FAST) 2004, Theo Dimitrakos, Fabio Martinelli, (Editors).Springer 2005 114.Formal Aspects of Security: Proceedings of First International Conference, FASec 2002. Ali E Abdallah, Peter Ryan, Steve Schneider (Editors). LNCS 2629, Springer 2003

CSB651: Language Based Security L T P C 3 0 0 3 Module I: (10 hrs) Static Analysis. Type Systems. Operational Semantics. Module II: (10 hrs) Typed Assembly Language. Module III: (10 hrs) Language Based Information Flow Security. Module IV: (12 hrs) Certifying Compilers. Proof Carrying Code. References 1. Benjamin C Pierce. Types and Programming Languages. MIT Press. 2002. 2. Benjamin C Pierce(Ed.). Advanced Topics in Types and Programming Languages. Prentice hall of India, 2005. 3. ACM SIGPLAN. CSB684: Security Policies and Assurance L T P 3 0 0 C 3

Module I (10 Hrs) Security policies, policy languages, confidentiality policies, Bell-LaPadula model, controversies over the model. Module II (12 Hrs) Integrity policies, Biba model, Lipners model, Clark-Wilson models, Chinese wall model,

clinical information systems security policy, noninterference and policy composition. Module III (10 Hrs) Assurance and trust, building secure and trusted systems, waterfall model, other models of development. Module IV (10 Hrs) Assurance in requirements definition and analysis, assurance during system and software design, assurance during implementation and integration. References 115.M. Bishop, Computer Security: Art and Science, Pearson Education, 2003. 116.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.

CSB683: Computer Law and Ethics Prerequisite: NIL L T P 3 0 0 C 3

Module I (10 Hrs) Intellectual property rights, computer software copyrights, copyright in databases and electronic publishing, law of confidence, patent laws, trademarks, product designs, international law . Module II (12 Hrs) Computer contracts, liability for defective hardware and software, software contracts, web and hardware contracts, electronic contracts and torts, liabilities. Module III (10 Hrs) Computer crime, computer fraud, hacking, unauthorized modification of information, piracy, computer pornography and harassment. Module IV (10 Hrs) Cyber laws in India, IT Act 2000, data subjects rights, ethical issues in computer security, case studies. References 117.D. Bainbridge, Introduction to Computer Law, 5/e, Pearson Education, 2004. 118.P. Duggal, Cyber law: the Indian Perspective, 2005. 119.C. P. Fleeger and S. L. Fleeger, Security in Computing, 3/e, Pearson Education, 2003. MAG622: Fuzzy Set Theory and Applications L 3 T P C 0 0 3

MODULE I: Crisp sets and fuzzy sets (11 Hours) Introduction crisp sets an overview the notion of fuzzy sets Basic concepts of fuzzy

sets classical logic an overview Fuzzy logic. Operations on fuzzy sets - fuzzy complement fuzzy union fuzzy intersection combinations of operations general aggregation operations MODULE II: Fuzzy relations (11 Hours) Crisp and fuzzy relations binary relations binary relations on a single set equivalence and similarity relations Compatibility or tolerance relations orderings Membership functions methods of generation defuzzification methods. MODULE III :Fuzzy measures (10 Hours) General discussion belief and plausibility measures probability measures possibility and necessity measures relationship among classes of fuzzy measures. MODULE IV: Fuzzy Logic and Applications (10 Hours) Classical logic: An overview fuzzy logic fuzzy rule based systems fuzzy decision making fuzzy logic in database and information systems fuzzy pattern recognition fuzzy contriol systems. References 120.George J Klir and Tina A Folger, Fuzzy sets, Uncertainty and Information, Prentice Hall of India, 1998. 121.H.J. Zimmerman, Fuzzy set theory and its Applications, 4th edition, Kluwer Academic Publishers, 2001. 122.George Klir and Bo Yuan, Fuzzy sets and fuzzy logic: Theory and Applications, Prentice Hall of India, 1997. 123.Timothy J Ross, Fuzzy Logic with Engineering Applications, McGraw Hill International Editions, 1997. 124.Hung Nguyen and Elbert Walker, A first course in Fuzzy logic, 2nd Edition, Chapman and Hall/CRC, 1999. 125.Jerry M Mendel, Uncertain rule-based fuzzy logic systems: Introduction and New directions, PH PTR, 2000. 126.John Yen and Reza Lengari, Fuzzy Logic: Intelligence, Control and Information, Pearson Education, 1999.

MAG652: Advanced Topics in Graph Theory L 3 T P C 0 0 3

Module I: Graphs, Connectivity and Hamiltonicity (11 hours) Graphs: Graphs as models- Paths and connectedness-Cutnodes and Blocks- Graph classes and graph operations Connectivity: Connectivity and edge connectivity - Menger's theorem - Properties of nconnected graphs-Circulants Hamiltonicity: Necessary or sufficient conditions- Connectivity and Hamiltonicity- Graph operations and Hamiltonicity - Generations of Hamiltonicity Module II: Centers, Extremal Distance Problems, Distance Sequences and Matrices (12hours) Centers: The Center and Edge connectivity- Self Central Graphs - The Median Central

Paths- Other Generalized Centers Extremal Distance Problems: Radius- Small Diameter- Diameter- Long paths and Long Cycles Distance sequences: The Eccentric Sequence - Distance Sequences - Distribution Path Sequence - Other Sequences. Matrices: The Adjacency Matrix - The incidence Matrix - The Distance Matrix Module III: Convexity and Symmetry (10 hours) Convexity: Closure Invariants-Metrics on Graphs - Geodetic Graphs- Distance Heredity Graphs Symmetry: Groups- Symmetric Graphs - Distance Symmetry Module IV: Digraphs, Graph Algorithms and Networks (9 hours) Digraphs: Digraphs and connectedness - Acyclic Digraphs - Matrices and Eulerian Digraphs- Long paths in Digraphs- Tournaments Graph Algorithms: Polynomial Algorithms and NP completeness - Path Algorithms and Spanning Trees - Centers - Maximum Matchings - Two NP-Complete Problems Networks: The Max- Flow Min-Cut Theorem - Minimum Spanning Trees - Traveling Salesman Problem - Shortest Paths - Centers - Critical Path Method. Reference Books: 127.Fred Buckley and Frank Harary , Distance in Graphs, Addison Wesley, 1990. 128.C. R. Flouds: Graph Theory Applications, Narosa Publishing House, 1994. 129.Harary F: Graph Theory, Addison- Weslwy pub. 1972. 130.Deo N: Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Inc. 1974.