1 STRUCTURE FOR M. E.

(COMPUTER ENGINEERING) SEMESTER I

Subject Code 510101 510102 510103 510104 510105 Subject Teaching Scheme Lect. Pract. 04 ? 04 04 04 ? 16 ? ? ? 04 04 Examination Scheme Th 100 100 100 100 ? 400 Tw ? ? ? ? 50 50 Pr ? ? ? ? ? ? Or ? ? ? ? ? ? Total Marks 100 100 100 100 50 450

Advances in Computer Networks Distributed Operating Systems Advanced Computer Architecture Applied Algorithms Laboratory Practice I Total

SEMESTER II
Subject Code 510106 510107 510108 510109 510110 510111 510112 Subject Teaching Scheme Lect. Pract. 04 ? 04 04 04 04 ? ? 20 ? ? ? ? 04 01* 05 Examination Scheme Th 100 100 100 100 100 ? ? 500 Tw ? ? ? ? ? 50 50 100 Pr ? ? ? ? ? ? ? ? Or ? ? ? ? ? ? ? ? Total Marks 100 100 100 100 100 50 50 600

Advanced Database Management Systems Mobile Computing Geometric and Solid Modeling Elective I Elective II Laboratory Practice II Seminar I Total

Th: Thory Elective I

Tw: Termwork

Pr: Practical

Or: Oral

a) Network Security b) Intelligent Systems c) Speech Processing Elective II a) b) c) d) Embedded Systems Design Advances in Compiler Techniques Computer Vision Bio-informatics

* Number of hours per student per week.

SEMESTER III
Subject Code 510113 510114 Subject Teaching Scheme Lect. Pract. 01* ? 02* ? 03 ? Examination Scheme Th ? ? ? Tw 50 ? 50 Pr ? ? ? Or ? ? ? Total Marks 50 ? 50

Seminar II Project I** Total

* Number of hours per student per week ** It is mandatory to submit preliminary project report for the grant of term III.

SEMESTER IV
Subject Code 510115 510116 Subject Teaching Scheme Lect. Pract. 01* ? 02* ? 03 ? Examination Scheme Th ? ? ? Tw 50 20 50 Pr ? ? ? Or ? 10 ? Total Marks 50 350 400

Seminar III Project II Total

* Number of hours per student per week

Total of Semester I : 20 Hrs., 450 Marks Total of Semester II : 25 Hrs., 600 Marks Total of Semester III: 03 Hrs., 050 Marks Total of Semester IV: 03 Hrs., 400 Marks Total: 51 Hrs., 1500 Marks Note: All theory papers are of three hours duration.

3 510101 Teaching Scheme Lectures: 4 hrs/week ADVANCES IN COMPUTER NETWORKS Examination Scheme Theory: 100 Marks

1.Introduction Types of Networks, Network design issues, Data in support of network design. Network design tools, protocols and architecture. 2. Performance Modeling and Estimation Probability, Stochastic processes, Modeling and Performance evaluation. Queuing models. Estimating model parameters. 3. Modeling Networks as Graphs Representation of Networks: External and Internal representation; Computational complexity. 4. Network Design Problem definition: Multipoint line layout heuristics, CMST algorithms, ESAUWilliam algorithm, Sharma algorithm, Unified algorithm, Bin-packing algorithm. s s Terminal assignment, Concentrator location. 5. IP Telephony VoIP system architecture, protocol hierarchy, Structure of a voice endpoint, Protocols for the transport of voice media over IP networks. Providing IP quality of service for voice, signaling protocols for VoIP, PSTN gateways, VoIP applications. 6. Storage Networks Introduction, challenges, SCSI protocols and architecture: RAID, Backup and mirroring, Fiber channel attached storage. Network attached storage including NFS, CIFS and DAFS, Management of network storage architectures. New storage protocols, architectures and enabling technologies. 7. Wireless Communication Introduction to CDMA and spread spectrum system, CDMA standards, system architectures of wireless communication systems, physical, network and data link layer of CDMA, wireless LAN standards: IEEE 802.11b, ARPA. 8. Compression Overview of Information Theory. Lossless Compression: Run-Length Encoding, Facsimile compression, String-matching Algorithms. Lossy Compression: DCT, Wavelet compression. Reference Books: 1. Kershenbaum A., Telecommunications Network Design Algorithms, Tata McGraw Hill. 2.Ramaswami R., Shivrajan K, Optical Networks, Morgan Kaufmann. 3.Douskalis B., IP Telephony: The Integration of Robust VoIP Services, Pearson Ed. Asia.

4.Warland J., Varaiya P., High-Performance Communication Networks, Morgan Kaufmann, 1996.
5.Stallings W., High-Speed Networks: TCP/IP and ATM Design Principles, Prentice Hall, 1998.

6.Garg V., Smolk K., Vilkes J.,Applications of CDMA in wire less communication.
7.Stallings W., High-Speed Networks and Internets: Performance and Quality of Service, Prentice-Hall 2002.

4 510102 DISTRIBUTED OPERATING SYSTEMS Teaching Scheme Lectures: 4 hrs/week Examination Scheme Theory: 100 Marks

1. Introduction to Distributed Systems Definition, characteristics and challenges of distributed systems. Design issues in distributed operating systems. Architectural models: client-server. 2. Communication in Distributed Systems HLL support: Message Passing primitives, atomic actions, remote procedure call mechanisms. Distributed Object model, RMI. 3. Synchronization and Control in Distributed Systems Clock synchronization, event ordering, load distribution, Mutual Exclusion, Election, agreement problem. Atomic transactions, deadlock handling, termination detection. 4. Process and Processors in Distributed Systems Threads, System models, Processor allocation, Scheduling in distributed systems, Fault tolerance and real time distributed systems. 5. Distributed Shared Memory Concept of shared memory, Consistency models, Page based distributed shared memory, shared variable distributed shared memory, object-based distributed shared memory. 6. Distributed File Systems Issues in the design of distributed file systems: naming, transparency and scalability. The reliability hierarchy: recovery, tolerance and resiliency. Resiliency techniques. Use of the Virtual File System layer. Examples of distributed systems: Sun NFS, the Andrew filestore and OSF DCE. 7. Security Security concerns in distributed systems. Capabilities in hardware and software. Security models. Kerberos authentication system. 8. Case study of Distributed Systems Design decisions in typical systems such as Mach, Chorus, Amoeba and the OSF Distributed Computing Environment. Reference Books: 1. Tanenbaum A. S. Distributed Operating Systems", Prentice Hall 1995. 2. Bacon, J., Concurrent Systems, 2nd Edition, Addison Wesley 1998. 3. Silberschatz A., Galvin P. and Gagne G., Applied Operating Systems Concepts, First Edition, Wiley 2000. 4. Coulouris G. et al, Distributed Systems: Concepts and Design, 3rd Edition, Addison Wesley 2001. 5. Galli D.L., Distributed Operating Systems: Concepts and Practice, Prentice-Hall 2000. 6. Sinha P. K., Distributed Operating Systems Concepts and Design, PHI 7. Mullender S., Distributed Systems, 2nd ed., Addison Wesley, 1999. 8. Singhal M., Shivaratri N., Advanced Concepts in operating systems, McGraw Hill, 1994. 9. Tanenbaum, A. S. Modern Operating Systems, 2nd Edition, Prentice Hall 2001.

5 510103 ADVANCED COMPUTER ARCHITECTURE Teaching Scheme Lectures: 4 hrs/week

1. Advanced Processor Architecture s Explicit Parallel Instruction Computing (EPIC): Itanium 1 and 2, Madison/DearField Processors. Chip Multi-processing (CMP): Power 4, Power 5. Reduced Instruction Set computing (RISC): UltraSparc III/IV 2.Node as Building block SMP, MPP, CCNUMA. Computer nodes/File Servers/Graphics Servers/Internet Servers. 3.System Interconnections GigaBit Ethernet, Myrinet (Myricom), Quadrinet (Quadrics), PARAMnet(CDAC) 4. Storage Storage area Network(SAN), Network attached storage and direct storage. 5.Cluster Software Environment Communication substrate, MPI/PVM, HPCC suites. Single system image, Cluster Monitoring and Management Tools. 6. Study of Typical Structures Bewoulf clusters Caltech, Digital true Unix cluster, IBM SP System, PARAM 10000 (CDAC).

Examination Scheme Theory: 100 Marks

Reference Books: ? Kai Hwang, Zhiwei Xu, Scalable Parallel Computers.

6 510104 APPLIED ALGORITHMS Examination Scheme Theory: 100 Marks

Teaching Scheme Lectures: 4 hrs/week

1. Introduction to Problem Solving: Review of algorithmic strategies; proof Techniques such as implication, converse, inverse, contra positive, negation and contradiction. Structure of formal proofs, direct proofs, proof by counterexample, proof by contraposition, proof by contradiction, mathematical induction, strong induction, recursive mathematical definitions, well orderings. 2. Analysis Of Algorithms Asymptotic analysis: upper and average complexity bounds. Identifying differences among best, average and worst Case Behaviors. Big O, little O, omega and theta notations, Standard complexity classes. Empirical measurements of performance. Time and space tradeoffs in algorithms. Analyzing recursive algorithms using recurrence relations. 3. Fundamental Computing Algorithms Numerical algorithms. Sequential and binary search algorithms. Quadratic sorting algorithms and O (n log n) sorting algorithms. Algorithms on graphs and their complexities. 4. Approximation Algorithms Introduction, Absolute approximation, Epsilon approximation, Polynomial time approximation schemes, Probabilistically good algorithms. 5. Advanced Algorithmic Analysis Amortized analysis, online and offline algorithms, randomized algorithms. Dynamic programming. Combinatorial optimization. 6. Parallel Algorithms PRAM Model: Parallel computers and models, performance measures. Parallel Complexity: The NC Class, Basic Lower and Upper Bounds. Algorithms for Parallel Computers: Pointer Jumping, CRCW algorithms and EREW algorithms. Brent Theorem and s Work Efficiency. Work Efficient Parallel Prefix computation, Deterministic Symmetry Breaking. Reference Books: 1. Lakshmivarahan S., Dhall S., Analysis and Design of Parallel Algorithms, McGrawHill 2. Cormen, Leiserson, Rivest, Algorithms, PHI 3. Aho, Hopcraft, Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley 4. Horowitz, Sahni, Fundamentals of Computer Algorithm, Galgotia 5. Knuth, Art of Programming, Addison Wesley 6. C Papadimitriou and K Steiglitz, Combinatorial Optimization, PHI 7. Bressard, Fundamentals of Algorithms, PHI

7 510105 LABORATORY PRACTICE I Teaching Scheme Practicals: 4 hrs/week Examination Scheme Term Work: 50 Marks

Experiments/Assignments based on 510101 to 510104 and/or small project. The lab incharge should frame minimum of five assignments.

8 SEMESTER II 510106 ADVANCED DATABASE MANAGEMENT SYSTEMS Teaching Scheme Lectures: 4 hrs/week
1. Database System Architecture

Examination Scheme Theory: 100 Marks

Parallel Databases: Introduction, I/O Parallelism, Inter-query and Intra-query Parallelism, Inter-operational and Intra-operational Parallelism, Design of Parallel systems. Distributed Databases: Introduction, Distributed DBMS Architectures, Distributed Data Storage and Catalog Management, Distributed Transactions, Distributed Recovery and Distributed Concurrency Control, Introduction to Distributed Query Processing.
2. Advanced Data Types and New Applications Introduction, Time in Databases, Spatial and Geographical Data, Multimedia Databases, Mobility and Personal Databases. 3. Advanced Transaction Processing Transaction-Processing Monitors, Transactional Workflows, Main-Memory Databases, Real-Time Transaction Systems, Long-Duration Transactions, Transaction Management in Multi-databases. 4. Object-Based Databases and XML Object-oriented Databases: Review of Object Oriented Databases: Persistent Programming Languages, Object Identity and its implementation, Clustering, Indexing, Client Server Object Bases, Cache Coherence. Object-Relational Databases: Nested Relations, Complex Types, Inheritance, Reference Types, Querying with Complex Types, Functions and Procedures

XML: Introduction, Structure of XML Data, XML Document Schema, Querying and Transformation, API, Storage of XML Data, XML Applications.
5. Application Development and Administration Web Interfaces to Databases, Performance Tuning and Benchmarks, E-commerce, Legacy Systems. 6. Advanced Querying and Information Retrieval Decision-support systems, Data Analysis and OLAP, Data Mining and Data Warehousing, Information retrieval systems.

7. CASE Studies Case studies of ORACLE, IBM DB2, Microsoft SQL Server with reference to Database Design and Query tools, SQL variations and Extensions, System Architecture, Database Administration Tools. Reference Books: 1. Silberschatz, Korth, Sudarshan, DataBase System Concepts, 4th Edition, McGrawHill International Edition. 2. Ramakrishnan R., Database Management Systems, McGraw-Hill International Edition 3. Date C. J., Database systems, Pearson Education Asia 7th Ed. 4. Ramkrishnan R., Gehrke J., Database Management Systems, 2nd Edition, McGraw Hill.

10 510107 MOBILE COMPUTING Teaching Scheme Lectures: 4 hrs/week

1.Introduction Applications, history of mobile communication, introduction to GSM system, GSM background, GSM operational and technical requirements. 2.GSM Architecture GSM network structure, cell layout and frequency planning, mobile station, base station systems, switching sub systems, home locations, register, Visiting Location Register (VLR), equipment identity register, echo canceller. 3.Time and Frequency Axis Representation Time domain representation, structure of TDMA slot with frame. Time organization of signaling channels, frequency hopping. 4.Mobility Management Signaling protocols, steps in formation of a call, location updates, MS-PSTN call, PSTN-MS call, MS-MS call, call handover. 5.Security Management Authentication, encryption, characteristics of SIM, equipment identification . 6.Spectral Efficiency of GSM Systems FDMA, TDMA, CDMA. 7. GSM Protocols Physical layer, data link layer, MTP3, SCCP, TCAP protocol, Application layers-RR layer, MM-layer, CC-layer, message formation, MAP protocol-MAP protocol for MM, MAP protocol for basic service support. Reference Books: 1. Asha Mehrotra, GSM System Engg. ,Artech House 2. Jerry D. Gibson, The Mobile Communication Handbook , IEEE Press 3. William C.Y. Lee, Mobile Communication Design Fundamentals , Wily Series In Telecommunication 4. Jochen Schiller, Mobile Communication, Pearson Education Asia 5. Garg V., Joseph E. Wilkes, Wireless and personal Communications Systems, Prentice Hall

Examination Scheme Theory: 100 Marks

10

11 510108 GEOMETRIC AND SOLID MODELING Teaching Scheme Lectures: 4 hrs/week Examination Scheme Theory: 100 Marks

1. Introduction Perspective of solid modeling: Three levels of abstraction: user interfaces, mathematical and algorithmic infrastructure, the substratum problem and geometric modeling. Conceptual operations and primitives: Primitives, local modifications and global operations. 2. CSG Representation CSG standard primitives, regularized Boolean operations, classification approaches, boundary representation, topological validity of B-rep solids. Boolean operations on boundary representation: Conventions of representation, Geometric operations, Intersection of two shells, multi-shell objects, Compliment, union, and difference, Face boxing techniques. 3. Curves and Surfaces Intrinsic and parametric equations of curves. Overview of Hermite, B-spline, Bezier curves; Bezier surfaces, B-spline surfaces. 4. Representation of Curved Edges, Faces and Polygons Mesh representations, Procedural generation of polygonal representations, Mesh capture and reconstruction. Fix up of Mesh representations, Mesh simplification. 5. Solids Parametric solids, tri-cubic models, Curves and surfaces embedded in a solid, sweep solids, controlled deformation solids. 6. Complex Model Construction Topology of models, Graph based models, Boolean models, boundary models, and space partitioning models. 7. Surface Modeling Extruded lines and curves, Polygon faces, Surface revolution, Ruled surfaces, Mesh generation, Uniform and Non-uniform B- spline surfaces. 8. Solid Modeling Overview of methods of Solid modeling, Computational geometry. 9. Rendering Simple illumination and reflection model, Simple shading with rendering software, Ray tracing, reflection mapping, texture mapping, transparency opacity mapping and reflection, Animation Principles and applications of traditional film animation; the role of the computer; techniques: key-frame systems, kinetic control, scripting systems, model-driven systems; applications. Key framing. Reference Books: 1. Hoffmann C., Geometric and Solid Modeling: An Introduction, Mavgan and Kaufmann Publishers. 2. Olfe D., Computer Graphics Design: From Algorithms to Design, PHI 3. Mortenson M., Geometric Modeling, Wiley Publications 4. Chan, Kaufman, Yagel, Volume Graphics, Springer, 2000

11

12 510109 ELECTIVE I Teaching Scheme Lectures: 4 hrs/week

1. Introduction Management of malicious intent, threat scenarios, critical infrastructures, security targets and policies, security mechanisms, examples of applications and their different security requirements, multi-lateral security, privacy and data protection, computer misuse legislation, Operating system and network security. Cyber laws. 2. Security Models Military and civil security, vulnerability and threat models, End-end security (COMSEC), link encryption (TRANSEC), compartments. Privacy. Authentication. Denial of service. Non-repudiation. Overview of private-key and public-key cryptographic algorithms: DES, RSA. Encapsulation. Encryption principles. Issues in multi-level secure systems. Internet security models: IPv4/IPv6 encapsulation header 3. Security Policies and Design Guidelines Policies: Policy creation, Regularity considerations, Privacy regulations. Security: Infrastructure and components. Design Guidelines. Authentication: Authorization and accounting. Physical and logical access control. User authentication: Biometric devices. 4. Network Layer Security Routing algorithm vulnerabilities: route and sequence number spoofing, instability and resonance effects. Information hiding: DMZ networks, route aggregation and segregation ICMP redirect hazard: denial of service. ARP hazard: phantom sources, ARP explosions and slow links. Defending against Chernobyl packets and meltdown. Fragmentation vulnerabilities and remedies: (ICMP Echo overrun) 5. Transport and Application Layer Security Techniques for - fault detection, isolation and repair. Secure network infrastructure services: DNS, NTP, SNMP, Privacy enhanced mail (PEM), Secure binding of multimedia streams, Secure RTP. Secure RSVP. Mobile systems: Address Export and re-use. Session key management: Blind-key cryptosystems (NTP). 6. Firewalls Network partitioning, firewall platforms, partitioning models and methods, Secure SNMP, Secure routing interoperability: virtual networks (DARTnet/CAIRN). Transparent and opaque network services. Source masking and hidden channels.

(A) NETWORK SECURITY Examination Scheme Theory: 100 Marks

12

13

7. Key and Certificate Management Secure binding of public and private values: DNS certificates. Making and distributing key media: randomization, lifetime issues. Key agreement protocols: STS protocol and IETF work orders. Key Escrow: the Clipper chip. One-time passwords: schemes based on S/KEY, PKI components and Applications. Exploiting diversity and redundancy: Byzantine generals. Time-stamping and reliable ordering of events: NTP. Consensus and agreement protocols. 8. Security in Wireless Networks How it is different, Methods and procedures, MIN/ESN, shared secret data authentication, Token based, public key based.

Reference Books: 1. Stallings, W., Cryptography and Network Security: Theory and Practice, Second Edition, John Wiley 2. Schneier, B., Applied Cryptography - Protocols, Algorithms, and Source Code in C, Second Edition. John Wiley and Sons, 1995 3. Stinson D., Cryptography - Theory and Practice, CRC Press, Boca Raton, FA, 1995 4. Stein L., Web Security: A Step-by-Step Reference Guide, Addison Wesley Longman, Inc., 1998 5. Gollmann, D., Computer Security, Wiley, 1999 6. Anderson R., Security Engineering: A Guide to Building Dependable Distributed Systems, Wiley 7. Cheswick W., Bellovin S., Firewalls and Internet Security: Repelling the Wily Hacker, 2nd ed., Addison-Wesley 8. Garfinkel S., Spafford G., Practical Unix and Internet Security, O'Reilly 9. Amoroso E., Fundamentals of Computer Security Technology, Prentice-Hall 10. Blacharski D., Network Security in a Mixed Environment

13

14 510109 ELECTIVE I Teaching Scheme Lectures: 4 hrs/week (B) INTELLIGENT SYSTEMS Examination Scheme Theory: 100 Marks

1. Intelligent Agents Introduction. How agents should act, structure: Table-driven, Simple reflex, Goalbased, Utility-based, Agents that keep track of world, Environments. 2. Problem Formulation Problem solving, Formulating problems: Knowledge and problem types, Welldefined problems and solutions, Measuring problem-solving performance, Choosing states and actions. 3. Search Methods Searching for solutions, Search strategies: Time, space, optimality and completeness issues. Un-informed search methods: Breadth-first, Depth-first, Iterative deepening, Bidirectional search, Avoiding repetitions, Constraint satisfaction search. Informed search methods: Best first search: Greedy search, A*, Heuristic functions, Memory bounded search: IDA*, SMA*. Iterative improvement algorithms: Hill climbing, Simulated annealing, Application in CSPs. 4. Planning A simple planning agent. From problem solving to planning: Representation of actions, Representation of states, Representation of goals, Representation of plans. Basic representation for planning: Representations for states and goals, Representation for actions, Situation space and plan space, Representations for plans. 5. Partial Order Planning Example: partial order planning, Initial plan, Achieving preconditions, Protected links and threats, Promotion and demotion, Recovering from dead ends. A partial-order planning algorithm, Planning with partially instantiated operators, Knowledge engineering for planning: Blocks world, Shakey's world. 6. Practical Planning Practical planners: Spacecraft assembly, Job shop scheduling, Space mission scheduling, Buildings and aircraft carriers. Hierarchical decomposition: Extending the language, Modifying the planner. Analysis of hierarchical decomposition: Decomposition and sharing, Decomposition versus approximation. More expressive descriptions: Conditional effects, Negated and disjunctive goals, Universal quantification, A planner for expressive operator descriptions. Resource constraints: Using measures in planning, Temporal constraints. 7. Planning and Acting Conditional planning and execution monitoring, Conditional planning: The nature of conditional plans, Algorithm for generating conditional plans, Extending the plan language. A simple re planning agent: Bounded vs. unbounded indeterminacy, Simple re planning with execution monitoring. Fully integrated planning and execution. Discussion and extensions: Comparing conditional planning and re planning, Coercion, abstraction and aggregation. 8. Uncertain Knowledge and Reasoning Uncertainty, Probabilistic Reasoning Systems, Making simple decisions, Making complex decisions. Reasoning: Agents that reason logically, First-order logic, Inferences in 1st order logic Reference Books: 1. Russell S., Norving P., Artificial Intelligence Modern Approach 2. Henry P., Artificial Intelligence, 3rd Ed., Winstone 3. Patric H., Lisp programming language, Winstone

14

15 510109 ELECTIVE I Teaching Scheme Lectures: 4 hrs/week

1. Speech sources Articulatory, linguistic, acoustic and perceptual descriptions. 2.Speech Processing Technologies Speech digitization techniques, PCM, CUSA, ADPCM, sub band coding, coding, LPC, format synthesis, speech digitization direction. 3. Text To Speech Technology Letter to sound conversion, calculation of acoustics parameters, synthesizing of speed output, performance characteristic of text to speech, present status of text to speech and future directions, application of text to speech technology products. 4. Speech and Voice Recognition Spectrum distance measures for speech recognitions, auditory nerve representation as a basis for speech processing, dynamic programming based speech recognition algorithms, issues in using HMM models for speech recognition, NURAL network approaches for speech recognition. 5.Voice Processing System Architecture Hardware architecture and voice processing software. 6. Speech Enhancement Noise suppression with pattern matching ,adaptive echo cancellation for speech signals, quality assessment of text to speech synthesis by rule . Reference Books: 1.Furui S., Sondhi M., Advances in Speech Signal Processing, Dekker 2.Tetschner W., Voice Processing, Artech House 3. Syrdal A., Benett R., Greenspan S., Applied Speech Technology, CRC space

(C) SPEECH PROCESSING Examination Scheme Theory: 100 Marks

15

16 510110 ELECTIVE II Teaching Scheme Lectures: 4 hrs/week

1. Introduction to Embedded Systems Classification, characteristics, design metrics, requirements, trends. Brief Review of Sensors, signal conditioning and data converters. RAM technology and programming of EPROM. 2. Embedded Hardware Dedicated processor and General Purpose Processors. 32 bit ARM architecture, Development environment. 3. Interfacing Microprocessor to Peripherals Buses & protocols, ISA, EISA, PCI, ARM, I 2C, CAN, FIREWIRE, USB. Wireless protocol: Bluetooth and IEEE 802.11:Introduction, features, areas of applications. Interface for IRDA, SMART card and WEB enabling. Case study of PCI & USB. 4. Target Devices Different types of ASICS: FPGA, CPLD architectures. 5. Real Time Operating Systems (RTOS) Features, characteristics, Real time features of Vx works, WIN CE, QNX , Nucleaus, RT_Linux. One case study Reference Books: 1. Vahid F., Givargies T., Embedded Systems Design, John WILEY X SONS 2002 2. Gupta R., Co-synthesis of Hardware and Software for Digital embedded systems, Kluwer. 3. Barr M., RTOS. 4. Smith M., Application specific Integrated circuits. 5. Liu, Real-Time systems, Pearson Ed. Asia 6. Manual of ARM processor.

(A) EMBEDDED SYSTEMS DESIGN Examination Scheme Theory: 100 Marks

16

17 510110 ELECTIVE II Teaching Scheme Lectures: 4 hrs/week (B) ADVANCES IN COMPILER TECHNIQUES Examination Scheme Theory: 100 Marks

1. Basics of Compiler Design Planning a compiler, approaches to compiler design, compiler development tools Lex and Yaac. 2. Code Generation Efficient code generation for expressions, code generator generators, code generation for pipelined machines, register allocation techniques. 3. Code Optimization Classical theory of data flow analysis, bi-directional data flows, unified algorithm for data flow analysis, theory of data flow analysis, program representation for optimization SSA form. 4. Parallel Compilers Motivation and overview, Structure of a Parallelzing compiler. Parallelism detection: data dependence, direction vectors, loop carried and loop independent dependences. 5. Compilation for Distributed Machines Data partitioning, instruction scheduling, register allocation, machine optimization. Dynamic compilation. 6. Advanced Topics Just in time (JIT) compilers, Auto scheduling compilers. Reference Books: 1 Aho, Ulman, Sethi, Compiler Principles and Techniques, Addison Wesley 2. Muchnik, Advanced Compiler Design and Implementation, Kauffman(1998) 3. Wolf M., Optimizing Super Compiler for Super Computers, Pitman(1989) 4. Banerjee U., kluwer, Loop Optimization, PHI (1997)

17

18 510110 ELECTIVE II Teaching Scheme Lectures: 4 hrs/week (C) COMPUTER VISION Examination Scheme Theory: 100 Marks

1.Mathematical Preliminaries and Data Structures for Image Processing Notations, matrix theory, kronecker products, random signals, spectral density functions, estimation theory. Traditional image data structures like matrices, chains, topological and relational structures. Hierarchical data structures like pyramids and QUAD trees. 2.Image Pre-processing Techniques Pixel brightness transformation, geometric transformation, local preprocessing like image smoothing, age detection, image restoration using inverse and wiener filtration. 3.Image Segmentation Techniques Thresholding age based segmentation, huogh transforms, region based segmentation using region merging, splitting, growing techniques. 4.Shape Representation and Description Region identification, contour based and region based shape representation and description, shape classes . 5.Object Recognition Knowledge representation, statistical pattern recognition, neural nets, syntactic pattern recognition, recognition as graph matching . 6. 3D Vision and Geometry Basics of projective geometry, single perspective camera, two cameras and stereopsis, Three or more cameras. Reference Books: 1. Sonka M., Hlavac V., Boyle R., Image Processing Analysis and Machine Design, PWS Publishers 2. Ballard D., Brown C., Computer Vision, Prentice Hall 3. Bratt W., Digital Image Processing, John Wiley & sons

18

19 510110 ELECTIVE II
Teaching Scheme Lectures: 4 hrs/week

(D) BIO-INFORMATICS
Examination Scheme Theory: 100 Marks

1. Concept of cells, cell organelles, bio-molecules. 2. Structure of nucleic acids and proteins, enzymes. 3. Concept of gene, gene structure, promoters, mutation. 4. Flow of genetic information, Sequence, structure-function relationship, 5. Biological databases: Sequence and structure databases. 6. Mathematical Algorithms in bio-informatics. 7. Sequence alignment, Structure Prediction algorithm. 8. 3D structure comparison, Gene predictions Markov model, genome databases
References books: 1. Lesk, A.M., Computational Molecular Biology: An Introduction, Cambridge University Press, Cambridge, 1987 2. Lesk A., Introduction to Bioinformatics 3. Gusfield, D., Algorithms on Strings, Trees and Sequences, Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997 4. Waterman, M.S., Introduction to Computational Biology, Maps, Sequences and Genomes, Chapman and Hall, 1995 5. Apostolico, A. and Z. Galil, Pattern Matching Algorithms, Oxford University Press, New York, 1997 6. Baxevanis A., Bioinformatics, B.F.F. Ouellette, eds., 1998 7. Branden C., Tooze J., Introduction to Protein Structure. 8. Grant G., Ewens W., Statistical Methods in Bioinformatics: An Introduction

19

20 510111 LABORATORY PRACTICE II Teaching Scheme Practicals: 4 hrs/week Examination Scheme Term Work: 50 Marks

Experiments/Assignments based on 510106 to 510110 and/or small project. The lab incharge should frame minimum of five assignments.

510112 SEMINAR I Teaching Scheme Practicals: 1 hrs/week/student

Seminar on state-of-art topic.

Examination Scheme Term Work: 50 Marks

510113 SEMINAR II Teaching Scheme Practicals: 1 hrs/week/student

Seminar on Dissertation Topic.

Examination Scheme Term Work: 50 Marks

510114 PROJECT I Teaching Scheme Practicals: 2 hrs/week/student Examination Scheme NIL

Project will consist of a System Development in Hardware/Software. Project work should be carried out using Software Engineering principles and practices.

510115 SEMINAR III Teaching Scheme Practicals: 1 hrs/week/student

Seminar on Dissertation Topic.

Examination Scheme Term Work: 50 Marks

510116 PROJECT II Teaching Scheme Practicals: 2 hrs/week/student Examination Scheme Term Work: 200 Marks Oral: 150 Marks

Project will consist of a System Development in Hardware/Software.

20