CSE-7 and 8 Semester Syllabus 09-06-2010.oct 2009

R.V.
COLLEGE OF ENGINEERING (An Autonomous Institution under VTU)

R.V. Vidyaniketan Post, Mysore Road Bangalore - 560 059
BACHELOR OF ENGINEERING (b.e.) COMPUTER Science & Engineering
VII & ViII Semester Scheme & Syllabus
Department of Computer Science & Engineering
Page 1
R.V.COLLEGE OF ENGINEERING, BANGALORE - 560059

(An Autonomous Institution under VTU, Belgaum) Semester: VII Department: Computer Science and Engineering
SCHEME OF TEACHING & EXAMINATION

Sl. Sub-Code No. 1. 2. 3. 4. 5. 6. 07CS71 07CS72 07CS73X 07CS74X 07CS75X 07CSP76 Title Computer Architecture Computer Graphics Theory and Laboratoty Elective IV (Group - D) Elective V (Group - E) Elective VI (Group - F) Mini Project Lab BOS Teaching Scheme Exam Hours / Week Credits Theory Tutorials Practical CSE 4 4 CSE CSE CSE CSE CSE Total 3 4 4 4 19 1 1 3 6 9 5 4 4 4 3 24 Exam Marks CIE SEE 100 100 100 + 100 + 50 50 100 100 100 100 100 100 50 50 600 600
Elective - IV Subject code 07CS731 07CS732 07CS733 07CS734 07CS735 07CS736 Group - D Multimedia Communications Business Intelligence (BI) and its Applications Embedded Systems Data Compression Real Time Systems Microcontroller-Based Systems Subject code 07CS741 07CS742 07CS743 07CS744 07CS745 07CS746
Elective - V Group - E Design Patterns Digital Image Processing Fuzzy Logic Ad Hoc Wireless Networks Genetic Algorithms Performance Evaluation of Systems
Elective - VI Subject code 07CS751 07CS752 07CS753 07CS754 07CS755 Group - F Cryptography and Network Security Software Architecture Grid Computing Storage Area Networks Service Oriented Architecture
Page 2
R.V.COLLEGE OF ENGINEERING, BANGALORE - 560059

(An Autonomous Institution under VTU, Belgaum) Semester: VIII Department: Computer Science and Engineering
SCHEME OF TEACHING & EXAMINATION

Sl. No. 1 2 3 4 5 Subject Code 07HSS81 07HSS82 07CSS83 07CSP84 07G8XX Title BOS Teaching Scheme Exam Exam Hours / Week Credits Marks Theory Tutorials Practical CIE SEE 2 2 50 50 4 6 3 20 23 2 2 12 4 22 50 100 100 300 100 100 250
Principles of IEM Intellectual Property Rights Human Skills and HSS Social Service Seminar CSE Project Work CSE Elective VII Respective (Group - G) Boards Total
Elective - VII
Group G
Subject code 07G801 07G802 07G803 07G804 07G805 07G806 07G807 07G808 07G809 07G810 07G811 07G812
Group - G Bio Informatics Finite Element Methods Green Technology Information Security Renewable Energy Sources Embedded Systems Management Practice for Business Excellence Java & J2E Virtual Instrumentation Industrial Robotics Space Technology & Applications Nuclear and Radiation Techniques for Engineering Applications
Page 3
Note : Information Security (07G804) - Computer Science Students are not permitted to select this elective
Page 4
VII Semester Syllabus

COMPUTER ARCHITECTURE
Sub Code Hrs / Week Total Hrs Credits : 07CS71 : 4+0+0 : 48 :4 CIE Marks Exam Hours SEE Marks : 100 : 03 Hours : 100
Objective: The aim is to study parallel computer model and the implementation of instruction level parallel processing. Data parallel architecture, multiprocessor and multi computers are also presented. Study of dataflow architecture and case study of different architectures is included. Part - A 1. Fundamentals of computer design 6 Hours Introduction, Classes of Computers, defining computer architecture, trends in technology, power in integrated circuits and cost, dependability, measuring, reporting and summarizing performance, quantitative principles of computer design. 2. Pipelining 6 Hours Introduction, pipeline hazards, implementation of pipeline, what makes pipelining hard to implement ? 3. Instruction level parallelism I 6 Hours ILP basic concepts and challenges, basic complier techniques for exposing ILP, reducing branch costs with prediction, overcoming data hazards with dynamic scheduling, hardware based speculation. 4. Instruction level parallelism II 6 Hours Exploiting ILP using multiple issues and static scheduling, Exploring ILP using dynamic scheduling, multiple issue and speculation, Advanced Techniques for instruction delivery and Speculation, The Intel Pentium 4 as example. Part - B 5. Multiprocessors and Thread level parallelism: 6 Hours Introduction, Symmetric shared memory architectures; Performance of symmetric shared-memory multiprocessors, Distributed shared memory and directory-based coherence, Basics of synchronization, Models of memory consistency. 6. Review of memory hierarchy Introduction, Cache performance, Cache Optimization, Virtual Memory 6 Hours
7. Memory hierarchy design 6 Hours Introduction, Eleven Advanced optimizations of Cache performance, Memory technology and optimizations, Protection: Virtual memory and virtual machines. 8. Storage systems 6 Hours Introduction, Advanced Topics in Disk Storage, Definition and Examples of Real Faults and Failures, I/O Performance Reliability Measures and Benchmarks, Designing and Evaluating an I/O Systems, The Internet Archive Cluster.
Page 5
Reference Books: 1. John L Hennessy, David A Patterson; Computer Architecture: A Quantitative Approach; Elsevier; 4th Edition; 2009. 2. Kai Hwang; Advanced Computer Architecture: Parallelism, Scalability, Programmability; McGraw-Hill; 2008 (Chapter 1). 3. Dezso Sima, Terence Fountain, Peter Kacsuk; Advanced Computer Architectures - A design space approach; Pearson Education; 2000. Outcome: The student will be capable of working in a parallel processing environment, through different case studies; the students are exposed to the state of the art architectures. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 6
COMPUTER GRAPHICS - THEORY AND LABORATORY

Subject Code : 07CS72 Hours/Week : 3+1+3 03 Hours Total Hours : 36 Credits :5 CIE Marks : 100+50 Exam Hours : SEE Marks : 100+50
Objective: This course will provide a broad exposure to the computer graphics field in order to be prepared for follow-on study. This course covers the basic concepts of 2D Graphics and Algorithms including Line Drawing, Polygon Filling, Clipping and Transformations. Also the basic concepts of Computer graphics using industry standard OpenGL implementation is discussed. Part A 1. Introduction 6 Hours Applications of computer graphics; A graphics system; Images: Physical and synthetic; Imaging systems; The synthetic camera model; The programmers interface; Graphics architectures; Programmable pipelines; Performance characteristics. Graphics Programming: The Sierpinski gasket; Programming two dimensional applications. 2. The OpenGL 6 Hours The OpenGL API; Primitives and attributes; Color; Viewing; Control functions; The Gasket program; Polygons and recursion; The threedimensional gasket; Plotting implicit functions. 3. Input and Interaction 6 Hours Interaction; Input devices; Clients and servers; Display lists; Display lists and modeling; Programming event-driven input; Menus; Picking; A simple CAD program; Building interactive models; Animating interactive programs; Design of interactive programs; Logic operations. Part B 4. Geometric Objects and Transformations 6 Hours Scalars, points, and vectors; Three-dimensional primitives; Coordinate systems and frames; Modeling a colored cube; Affine transformations; Rotation, translation and scaling, Transformations in homogeneous coordinates; Concatenation of transformations; OpenGL transformation matrices; Interfaces to threedimensional applications; Quaternions. 5. Viewing 6 Hours Classical and computer viewing; Viewing with a computer; Positioning of the camera; Simple projections; Projections in OpenGL; Hiddensurface removal; Interactive mesh displays; Parallelprojection matrices; Perspective-projection matrices; Projections and shadows. 6. Implementation 6 Hours Basic implementation strategies; The major tasks; Clipping; Line-segment clipping; Polygon clipping; Clipping of other primitives; Clipping in three dimensions; Rasterization; Bresenhams algorithm; Polygon rasterization; Hidden-surface removal; Antialiasing; Display considerations.
Page 7
Part - C COMPUTER GRAPHICS - LABORATORY Unit - I Implement the following programs in C / C++ with OpenGL libraries : 1. Write a program to generate a line using Bresenhams line drawing technique. Consider slopes greater than one & slopes less than one. 2. Write a program to recursively subdivide a tetrahedron to form 3D Sierpinski gasket. The number of recursive steps is to be specified at execution time. 3. Write a program to create a cylinder and a parallelepiped by extruding a circle and quadrilateral respectively. Allow the user to specify the circle and the quadrilateral. 4. Write a program to create a house like figure and rotate it about a given fixed point using OpenGL functions. 5. Write a program to implement the Cohen-Sutherland line-clipping algorithm. Make provision to specify the input line, window for clipping and view port for displaying the clipped image. 6. Write a program to implement Liang-Barsky line clipping algorithm. 7. Write a program to fill any given polygon using scan-line area filling algorithm. (Use appropriate data structures). 8. Write a program to draw a color cube and spin it using OpenGL transformation matrices. 9. Write a program to create a house like figure and reflect it about an axis defined by y=mx+c. 10. Write a program to generate a Limacon, cardiod, three-leaf curve, spiral. Unit - II Develop a suitable Graphics package using the OpenGL library to implement the skills learnt in the theory and the exercises indicated in Part-A and Part-B Note: 1. Any question from Unit - I may be asked in the examination. 2. A report of about 20 - 30 pages on the package developed in Unit - II, duly certified by the department, must be submitted during examination. A demo of the Graphics pacakage must be shown during the examination. Reference Books: 1. Donald Hearn, Pauline Baker; Computer Graphics with OpenGL; Pearson Education; 2nd Edition; 2003. 2. Edward Angel; Interactive Computer Graphics: A Top-Down Approach with OpenGL; Pearson Education; 5th Edition; 2008. 3. F.S. Hill Jr.; Computer Graphics Using OpenGL; Pearson education; 2nd Edition; 2001. Outcome: The student can design and implement an application which illustrates the use of the pipeline architecture. The Student will be capable of making an appropriate choice of methods required for computer representation of objects. Also the student will be able to use common geometric construction techniques while creating 2D/3D geometric forms for the solution to engineering as well as real-time graphics applications. Scheme of Semester End Evaluation -Theory: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B. Scheme of Semester End Evaluation Laboratory: In the examination questions from Unit-I must be given on lots. Each student must execute one out of ten selected question, which is evaluated for 30 marks. The package developed under Unit-II has to be evaluated for a total of 20 marks. Department of Computer Science & Engineering Page 8
MULTIMEDIA COMMUNICATIONS (Elective - IV; Group - D)

Objective: The scope of this course is to give an insight of multimedia information representation and different text / image compression techniques. It also deals with different multimedia networking applications like IP telephony & VoIP. Part - A 1. Introduction 4 Hours Introduction to multimedia, Multimedia Information representation, Multimedia networks, Multimedia Information systems, Multimedia applications.
2. Multimedia: Media & Data Streams
5 Hours Media and Data streams, Classification of media, Media concepts, Time dependency of media, Data stream Data stream characteristics, Classification based on time intervals, Logical data unit.
3. Multimedia: Information Representation

5 Hours Digitization principles - analog signals, encoder design, decoder design. Text : unformatted text, formatted text, hypertext. Basic image concepts, Images representation and formats, Video signal representation, Color encoding, Computer video format, Computer representation of music MIDI, Computer representation of speech. 4. Sound / Audio 5 Hours Basic sound concepts, computer representation of sound, Nyquist sampling theorem, Audio PCM speech, CD - quality audio, Synthesized audio, Video - broadcast television, Digital video, PC video, Video content. 5. Images / Graphics 5 Hours Digital image representation, Color models, Image formats, Graphics format , raster graphics, Image synthesis, Components of interactive graphics systems, Raster display, Dithering, Halftoning, Image analysis, Image recognition steps. Part - B 6. Text and Image Compression 7 Hours Compression principles, Text compression - Static Huffman coding, Dynamic Huffman coding, Arithmetic coding , Lempel-Ziv coding, Lempel-Ziv-Welsh coding. Image compression - GIF, TIFF, Digitized documents, JPEG. 7. Audio and Video Compression 10 Hours Audio Compression Audio compression principles, Differential pulse code modulation, Adaptive differential PCM, Adaptive predictive coding, Linear predictive coding, Code-excited LPC, Perceptual coding, MPEG audio coders, Dolby audio coders. Video compression - Video compression principles, H.261, H.263, MPEG - MPEG-1, MPEG-2, MPEG-4. 8. Multimedia Operating systems 4 Hours Real-Time Characterization, Resource Scheduling: Motivation, Properties of Multimedia Streams, Deadline-Based Scheduling - EDF, Rate-Monotonic Scheduling, Deadline-Based vs. Rate-
Page 9
Monotonic Scheduling, Scheduling algorithms, Disk Scheduling algorithms - EDF, SCAN, Group Sweeping algorithms. 9. Multimedia Synchronization 3 Hours Motivation, Synchronization and Multimedia, Reference media for multimedia synchronization, Synchronization Techniques and Case studies. Reference Books: 1. Halsall Fred; Multimedia Communications; Pearson Education; 2001. 2. Steinmetz Ralf, Klara Nahrstedt; Multimedia Computing, Communication & Applications; Pearson Education;1st Edition; 2009. 3. Nader F. Mir; Computer & Communication Networks; Pearson Education;1st Edition; 2009. 4. Jeffcoate J; Multimedia in Practice - Technology & Applications; Prentice Hall; 1998. Outcome: The students will be capable of handling different multimedia data formats and design applications. They will be in a position to make an appropriate choice of a suitable compression technique for a given application and use the same. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questionsfrom Part - A and at least 2 out of 4 questions from Part - B.
Page 10
BUSINESS INTELLIGENCE (BI) AND ITS APPLICATIONS (Elective - IV; Group - D)

Sub Code : 07CS732 Hrs/Week : 3+0+2 Total Hrs : 42 Credits :4 Objective: The proposed elective course exposes engineering/management students to Business Intelligence domain. The Core Modules of this elective includes introduction to BI terminologies and framework, basics of data integration (Extraction Transformation Loading), introduction to multi-dimensional data modeling, basics of enterprise reporting and application of the concepts using open source/Microsoft tools. Prerequisites: Basic knowledge of RDBMS (relational database management system) concepts with hands-on exposure (includes design & implementation of table structures). Part A 1. Introduction to Business Intelligence 4 Hours Introduction to OLTP and OLAP, BI Definitions & Concepts, Business Applications of BI, BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components BI Process, BI Technology, BI Roles & Responsibilities 2. Basics of Data Integration (Extraction Transformation Loading) 8 Hours Concepts of data integration need and advantages of using data integration, introduction to common data integration approaches, introduction to ETL using SSIS, Introduction to data quality, data profiling concepts and applications 3. Introduction to Multi-Dimensional Data Modeling. 6 Hours Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema, introduction to business metrics and KPIs, creating cubes using SSAS CIE Marks Exam Hours SEE Marks : 100 : 3 Hours : 100
4.
Basics of Enterprise Reporting. 12 Hours Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, introduction to SSRS Architecture, enterprise reporting using SSRS
Part B 5.
Tools used for OLAP Design and BI Models 4 Hours Overview of tools and techniques that are in use to design BI and OLAP model. Discussion on common BI and OLAP models, popular OLAP cube formats, design tools for BI and OLAP modeling, tools for OLAP cube building and data population. 6. Future Trends in Business Intelligence 4 Hours This elective lesson will cover the technical trends that are going to drive the usage of BI in future applications. The elective covers aspects like the concept of On-Demand Dashboards, Reportlets, Using BI applications in Google and Microsoft Vista Gadgets, using BI in Google desktop etc.
Page 11
7. Business Intelligence Trending and Planning 4 Hours This elective lesson will cover the usage of trending and planning to solve a business problem. This covers things like how to use trending to get an idea of profit or loss a business is going to make and changing your planning accordingly to be able to allocate resources prudently. It discusses the activity flow used in this type of scenario. 8. Practical Exposure With intent to get some exposure in the business intelligence space, the colleges can arrange for A project that allows the students to apply Technical, Behavioral, Process concepts learnt in the elective course by: Executing near real-life project (with large data) Working in teams ( project teams will ideally comprise of 4 members) Experiencing expectations from different roles There will be 2 projects (one at the end of chapter 2 and the second one at the end of chapter 4) Project 1: Data in disparate data sources such as Excel, text file, databases etc. will be provided to the students. They will be expected to extract, cleanse, integrate and load it into the data-warehouse. Project 2: Design reports according to given business scenarios. The data for the report s is to be pulled from the data-warehouse built in the earlier project. Reference Books: The courseware including PowerPoint and notes are available for the Elective. In addition, following reference books can also be used: 1. Business Intelligence by David Loshin 2. Business intelligence for the enterprise by Mike Biere 3. Business intelligence roadmap by Larissa Terpeluk Moss, Shaku Atre 4. Successful Business Intelligence: Secrets to making Killer BI Applications by Cindi Howson 5. Delivering business intelligence with Microsoft SQL server 2008 by Brain, Larson 6. Foundations of SQL Server 2005 Business Intelligence by Lynn Langit 7. Information dashboard design by Stephen Few Outcomes: At the end of this elective, student will be able to: 1. Differentiate between Transaction Processing and Analytical applications and describe the need for Business Intelligence 2. Demonstrate understanding of technology and processes associated with Business Intelligence framework 3. Demonstrate understanding of Data Warehouse implementation methodology and project life cycle 4. Given a business scenario, identify the metrics, indicators and make recommendations to achieve the business goal 5. Design an enterprise dashboard that depicts the key performance indicators which helps in decision making 6. Demonstrate application of concepts in Microsoft BI suite Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questionsfrom Part - A and at least 2 out of 4 questions from Part - B.
Page 12
EMBEDDED SYSTEMS (Elective - IV; Group - D)

Objective: The Course is intended to provide an understanding of architecture of embedded systems, concepts related to device drivers and handling of associated interrupts and software development / interprocess communications / synchronization methodologies in single / multi-processor environments. Part - A 1. Introduction to Embedded Systems 12 Hours An embedded system, processor in the system, other hardware Units, Software embedded into a system, Exemplary embedded systems, Embedded system-on-Chip (COC) and in VLSI circuit. 2. Hardware Architectures for Embedded Systems 12 Hours Introduction, 8051 micro controller, Architecture, instruction sets, Assembly language programming, I/O port programming, Timer /controller programming, Serial common, Interrupts programming, Real word interfacing. Part - B 3. Device Drivers and Interrupts Servicing Mechanism 10 Hours Device drivers, Parallel port device drivers in a system, Serial port device drivers in a system, Device drivers for internal programmable timing devices, Interrupt servicing (Handling) Mechanism, Context and the periods for context-switching, Deadline and interrupt latency. 4. Program Modeling Concepts in Single and Multiprocessor Systems Software-Development Process 8 Hours Modeling processes for software analysis, Before software implementation, Programming models for event controlled or response time constrained real time programs, Modeling of multiprocessor systems. 1. Inter-Process Communication and Synchronisation of Processes, Tasks and Threads 6 Hours Multiple processes in an application, Problem of sharing data by multiple tasks and routines, Inter Process Communication. Reference Books: 1. Rajkamal; Embedded Systems Architecture, Programming and Design; McGraw-Hill; 2nd Edition; 2008 2. Mohammad Ali Mazidi, Janice Gillispie Mazidi; The 8051 Microcontroller and Embedded Systems; Pearson Education; 2002. 3. Dr. K.V.K.K. Prasad; Embedded/Real-Time Systems: Concepts, Design and ProgrammingThe Ultimate Reference; Dreamtech Press. Outcome: The student would be capable of designing an embedded system and interfacing it to different peripheral devices. Basic concepts of real time systems, inter-task communication and hardware and software interactions help students to design real time systems for different applications. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B. Department of Computer Science & Engineering Page 13
DATA COMPRESSION (Elective - IV; Group - D)

Objective: This course deals with lossy and lossless compression techniques. Sub-band coding, audio coding and wavelet based compression methods are also discussed. Part - A 1. Introduction, Lossless Compression - 1 6 Hours Compression techniques, Modeling and coding. Mathematical preliminaries for lossless compression, Overview, Basic concepts of Information Theory, Models, Coding; Algorithmic information theory, Minimum description length principle. Huffman coding, Overview, The Huffman coding algorithm, Minimum variance Huffman codes, Application of Huffman coding for text compression. 2. Lossless Compression - 2 6 Hours Dictionary Techniques, Overview, Introduction, Static dictionary, Adaptive dictionary, Applications, UNIX compress, GIF, PNG, V.42. Lossless image compression, Overview, Introduction, Basics, CALIC, JPEG-LS, Multi resolution approaches, Facsimile encoding, Runlength coding, T.4 and T.6. 3. Basics of Lossy Coding 6 Hours Some mathematical concepts, Overview, Introduction, Distortion criteria, Models. Scalar quantization, Overview, Introduction, The quantization problem, Uniform quantizer, Adaptive quantization. 4. Vector Quantization, Differential Encoding 6 Hours Vector quantization, Overview; Introduction, Advantages of vector quantization over scalar quantization, The LBG algorithm. Differential Encoding, Overview; Introduction, The basic algorithm, Prediction in DPCM, Adaptive DPCM, Delta modulation, Speech coding, Image coding. Part - B 5. Mathematical Concepts, Transform Coding 6 Hours Mathematical concepts, Linear systems, Sampling, Discrete Fourier transform, Z-transform. Transform coding, Overview, introduction, The transform, Transforms of interest, Quantization and coding for transform coefficients, Application to image compression - JPEG, Application to audio compression - MDCT. 6. Sub-band Coding, Audio Coding 6 Hours Sub-band Coding, Overview, introduction, Filters, The basic sub-band coding algorithm, Bit allocation, Application to speech coding - G.722; Application to audio coding - MPEG audio, Application to image compression. Audio Coding, Overview, Introduction, MPEG audio coding, MPEG advanced audio coding, Dolby AC3, Other standards. 7. Wavelet-Based Compression 6 Hours Overview, Introduction, Wavelets, Multi resolution and the scaling function, Implementation using Filters, Image compression, Embedded zero tree coder, Set partitioning in hierarchical trees, JPEG 2000. Department of Computer Science & Engineering Page 14
8. Video Compression 6 Hours Overview, Introduction, Motion compensation, Video signal representation, H.261, Model-based coding, Asymmetric applications, MPEG-1 and MPEG-2, H.263, H.264, MPEG-4 and advanced video coding, Packet video. Reference Book: 1. Khalid Sayood; Introduction to Data Compression; Elsevier; 3rd Edition; 2006. 2. David Salomon; Data Compression - The Complete Reference; Springer; 3rd Edition; 2005. Outcome: The students will be capable of applying different compression techniques based on the application. They will also have sufficient knowledge on audio coding, sub-band coding and transform coding. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 15
REAL TIME SYSTEMS (Elective - IV; Group - D)

Objective: The course aims at providing exposure to the various aspects related to operating systems used in realtime environments and is intended to provide exposure to specification / design, kernels, inter-task communication / synchronization, memory management etc. The course is also designed to extend the coverage to performance analysis, optimization, reliability / testing / fault tolerance. The course concludes with an exposure to multi-processor systems, integration and applications. Part - A
1. Basic Real-Time Concepts
4 Hours Basic computer architecture-bus transfer mechanism, input and output, memory, cpu operation; some terminology- software concepts, system concepts, real-time definitions, events and determinism, synchronous and asynchronous events, determinism, time-loading; real-time design issues; example real-time systems; brief history-software, hardware. 7 Hours Natural languages; mathematical specification; flowcharts; structure charts; pseudo code and programming design languages; finite state automata; data flow diagrams- demarcos rules, hatley and pribhais extensions; petri nets; warnier-orr notation- indexed loop; statecharts- depth, orthogonality, broadcast communication; sanity in using graphical techniques. 6 Hours Polled loop system- polled loop with interrupts; phase/state- driven code; coroutines; interruptdriven systems- context switching, round-robin systems, preemptive priority systems, major and minor cycles, hybrid systems; foreground/background systems- background processing, initialization, real- time operation; full-featured real-time operating systems- task- control block model; build or buy? POSIX. 4 Hours Buffering data- time-relative buffering, ring buffers; mailboxes- mailbox implementation, other operations on mailboxes, queues; critical regions; semaphores- mailboxes and semaphores, counting semaphores, problems with semaphores, the test- and- set instruction; event flags and signals; deadlock- avoidance, detect and recover. 3 Hours Process stack management- task-control block model, managing the stack, run-time ring buffer, maximum stack size, multiple stack arrangements, task-control block model; dynamic allocationswapping, overlays, MFT, MVT, demand paging, working sets, real-time garbage collection, contiguous file systems; static schemes. Part - B
2. Real-Time Specification and Design Techniques
3. Real-Time Kernels
4. Inter-task Communication and Synchronization
5. Real-Time Memory Management
6. System Performance Analysis and Optimization
8 Hours Response-time calculation- polled loops, coroutines / phase- driven code, interrupt systems; interrupt latency- propagation delay, macroinstruction execution times, interrupts disabled, preemption, low priority interrupts high; time-loading and its measurement- using a logic analyzer, instruction counting, pictorial representation, instruction execution time simulators, Page 16
deterministic performance; scheduling is np-complete; reducing response times and time-loadingcompute at slowest cycle, scaled arithmetic, binary angular measurement, look-up tables, basic optimization theory, other optimization techniques, combination effects, speculative execution; analysis of memory requirements- memory-mapped i/o and DMA memory, program area, RAM area, stack area, memory management schemes; reducing memory-loading- variable selection, reuse variables, memory fragmentation, self-modifying code; i/o performance.
7. Reliability, Testing and Fault Tolerance
6 Hours Faults, failures, bugs and effects; reliability- formal definition, calculating system reliability; testing- unit level testing, system-level testing, statistically based testing, clean room testing, stress testing; fault tolerance- general problems handling, n-version programming, built-in-test software, CPU testing, memory testing, spurious and missed interrupts, dealing with bit failures.
8. Multiprocessing Systems
4 Hours Classification of architectures; distributed systems- embedded, organic, system specification, reliability in distributed systems, calculation of reliability in distributed systems, increased reliability in distributed systems; non-von neumann architectures- data flow architectures, systolic processors, wavefront processors, transputers. 3 Hours Goals of real-time system integration- system unification, system validation; tools- multimeters, oscilloscope, logic analyzer, in-circuit emulator, software simulators, hardware prototypes/ simulators, debuggers; methodology- establishing a baseline, backoff method, patching; the software heisenberg uncertainty principle- real-world analogies, the software heisenberg uncertainty principle, testing of software, time- and memory-loading, other implications. 3 Hours Real-time systems as complex systems; the first real-time application; real-time databases; realtime image processing- virtual reality, multimedia; real-time UNIX; building real-time applications with real-time programming languages.
9. Hardware/ Software Integration
10. Real-Time Applications:
Reference Books: 1. Phillip A. Laplante; Real-Time Systems Design and Analysis: An Engineers Handbook; Prentice Hall; 2nd Edition; 2005. 2. Jane.W.S.Liu; Real-Time Systems; Pearson Education; 1st Edition; 2009. 3. Stuare Bennutt; Real-Time Computer Control: An Introduction; Pearson Education; 2nd Edition; 2003. 4. C. M. Krishna, Kang G. Shin; Real Time Systems; McGraw-Hill; 1997. Outcome: The student would be able to design real-time operating systems and applications suitable to specific requirements. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 17
MICROCONTROLLER-BASED SYSTEMS (Elective - IV; Group - D)

Objective: The course introduces 8051 Microcontroller and programming the 8051. Popular applications such as LCD, Keyboard, ADC and DAC interfacing are discussed to give an insight into the methodology of Interfacing. Part - A 1. Introduction, 8051 Assembly Language Programming (ALP - 1) 6 Hours Microcontrollers and embedded processors; Overview of the 8051 family; 8051 Assembly Language Programming : Inside the 8051;Introduction to 8051 ALP; Assembling and running an 8051 program; The PC and ROM space in 8051; Data types, directives, flag bits, PSW register, register banks, and the stack. 2. ALP - 2 6 Hours Jump and loop instructions; Call instructions; Time delay for various 8051 family members; I/O programming; I/O bit manipulation programming. Immediate and register addressing modes; Accessing memory using various addressing modes. 3. ALP - 3, Programming in C 6 Hours Bit addresses for I/O and RAM; Extra 128 bytes of on-chip RAM in 8052. Arithmetic instructions; Signed numbers and arithmetic operations; Logic and compare instructions; rotate instruction and serialization; BCD, ASCII, and other application programs. Programming in C: Data types and time delays; I/O programming; Logic operations; Data conversion programs; Accessing code ROM space; Data serialization. 4. Pin Description, Timer Programming 6 Hours Pin description of 8051; Intel Hex file; Programming the 8051 timers; Counter programming; programming Timers 0 and 1 in C. Part - B 5. Serial Port Programming, Interrupt Programming 6 Hours Basics of serial communications; 8051 connections to RS232; Serial port programming in assembly and in C. 8051 interrupts; Programming timer interrupts; Programming external hardware interrupts; Programming the serial communications interrupt; Interrupt priority in 8051 / 8052; Interrupt programming in C. 6. Interfacing LCD, Keyboard, ADC, DAC and Sensors 6 Hours LCD interfacing; Keyboard interfacing; Parallel and serial ADC; DAC interfacing; Sensor interfacing and signal conditioning. 7. Interfacing to External Memory, Interfacing with 8255 6 Hours Memory address decoding; Interfacing 8031 / 8051 with external ROM; 8051 data memory space; Accessing external data memory in C. Interfacing with 8255; Programming 8255 in C. 8. DS12887 RTC Interfacing and Programming, Applications 6 Hours DS12887 RTC interfacing; DS12887 RTC programming in C; Alarm, SQW, and IRQ features of DS12886. Relays and opto-isolators; Stepper motor interfacing; DC motor interfacing and PWM. Department of Computer Science & Engineering Page 18
Reference Books: 1. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay; The 8051 Microcontroller and Embedded Systems using Assembly and C; Pearson Education; 2nd Edition; 2008. 2. Raj Kamal; Microcontrollers Architecture, Programming, Interfacing and System Design; Pearson Education; 2008. Outcome: The students will be capable of programming the 8051 effectively and design applications with/without 8255 in between. The students would also be able to develop systems based on MCUs like 8051, 80X96, low power MCUs. The concepts learnt in this course form the basis for designing the Embedded Systems. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 19
DESIGN PATTERNS (Elective - V; Group - E)

Objective: This subject deals with organizing design patterns. Different design patterns like structural pattern and behavioral patterns are presented. Part - A
1. Introduction
6 Hours What is a Design Pattern, Describing Design patterns, The catalog of design patterns, Organizing the catalog, How design patterns solve design problems, How to select a design pattern?, How to use a design pattern. 8 Hours Design problems, Document structure, Formatting, Embellishing the user interface, supporting multiple Lock-and-Feel standards, Supporting Multiple window system, User operations, spelling checking and hyphenation. 10 Hours Creational Patterns, Abstract factory, Builder, Factory method, Prototype, Singleton Intent, Motivation, Applicability, Structure, Collaborations, Consequences, Implementation, Sample code, Known uses, related patterns, Discussion on creational patterns.
2. Designing A Document Editor
3. Design Pattern Catalog
Part - B 4. Structural Patterns 9 Hours Adaptor, Participants, , Bridge, Composite, Decorator, Faade, Flyweight, Proxy, Discussion on structural patterns Intent, Motivation, Applicability, Structure, Collaborations, Consequences, Implementation, Sample code, Known uses, related patterns
5. Behavioral Patterns 1
7 Hours Chain of responsibility, Command, Interpreter. Iterator Intent, Motivation, Applicability, Structure, Collaborations, Consequences, Implementation, Sample code, Known uses, related patterns 8 Hours Mediator, Memento, Observer, State, Strategy, Template method, Visitor Intent, Motivation, Applicability, Structure, Collaborations, Consequences, Implementation, Sample code, Known uses, related patterns, What to expect from design patterns, A brief history.
6. Behavioral Patterns 2 and Conclusion
Reference Books: 1. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides; Design Patterns, Elements of Reusable Object Oriented Software; Pearson Education; 2004. 2. Alan Shaloway, James R Trott; Design Pattern Explained; Pearson Education; 2004. Outcome: Using different structural patterns and behavioral patterns, students can design patterns to solve design problems. Scheme of Semester End Evaluation:
Page 20
Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 21
DIGITAL IMAGE PROCESSING (Elective - V; Group - E)

Objective: This course deals with basics of Image processing. Image enhancement techniques under Spatial Domain and Frequency Domain are presented. Image Restoration, Image compression and Segmentation are presented in detail. Part - A 1. Introduction 7 Hours What is Digital Image Processing?; The Origins of Digital Image Processing; Fundamental Steps in Digital Image Processing; Components of an Image Processing System; Image Sampling and Quantization; Some Basic relationships between pixels. 2. Intensity Transformations and Spatial Filtering 8 Hours Background; Some basic gray level transformation functions; Histogram Processing; Fundamentals of Spatial Filtering; Smoothing spatial filters; Sharpening spatial filters; Combining spatial enhancement methods. 3. Filtering in Frequency Domain 9 Hours Background; The Basics of Filtering in the frequency domain; Image Smoothing using frequency domain filters; Image Sharpening using frequency domain filters. Part - B 4. Image Restoration and Reconstruction 7 Hours A model of the image degradation/restoration process; Noise models; Restoration in the presence of noise only-spatial filtering; Periodic noise reduction by frequency domain filtering; Linear; position-invariant degradations; Estimating the degradation function; Inverse filtering; Minimum mean square error filtering; Constrained least squares filtering; Geometric mean filter. 5. Image Compression Fundamentals; Basic Compression Methods. 6. 8 Hours
Morphological Image Processing 4 Hours Preliminaries; Erosion and Dilation; Opening and Closing; The Hit-or-Miss Transformation; Some Basic Morphological Algorithms.
7. Image Segmentation 5 Hours Fundamentals; Point, Line and Edge Detection; Thresholding; Region-based segmentation; Reference Books: 1. Rafael C. Gonzalez, Richard E. Woods; Digital Image Processing; Pearson Education; 3 rd Edition; 2009. 2. Anil K. Jain; Fundamentals of Digital Image Processing; Prentice Hall; 2008. 3. Milan Sonka, Vaclav Hlavac, Roger Boyle; Image Processing Analysis and Machine Vision; PWS South Western Duxbury Cole; 2nd Edition; 2007.
Page 22
Outcome: The students will be capable of designing different digital image applications using the concept of filtering, compression, morphing and image segmentation. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 23
FUZZY LOGIC (Elective - V; Group - E)

Objective: The objective of the course is to present an adequate survey of topics dealing within imprecision, uncertainty and complexity of the real world. Part - A 1. Introduction 8 Hours The case for Imprecision, The Utility and Limitations of Fuzzy Systems, Statistics and Random Processes, Uncertainty and Information, Fuzzy Sets and Membership, Chance versus Fuzziness, Sets as points in hyper cubes. Classical Sets and Fuzzy Sets: Classical Sets - Operations on Classical Sets, Properties of Classical (Crisp) Sets, Mapping of Classical Sets to functions. Fuzzy Sets - Fuzzy set operations, Properties of Fuzzy Sets. 2. Classical Relations and Fuzzy Relations 8 Hours Cartesian product, Crisp Relations - Cardinality of Crisp Relations, Operations on Crisp Relations, Properties of Crisp Relations, Composition. Fuzzy Relations - Cardinality of Fuzzy Relations, Operations on Fuzzy Relations, Properties of Fuzzy Relations, Fuzzy Cartesian product and Composition, non-interactive Fuzzy Sets. Tolerance and equivalence Relations - Crisp Equivalence Relation, Crisp Tolerance Relation, Fuzzy Tolerance and equivalence Relations. Value Assignments - Cosine Amplitude, Max-min Method, Other Similarity methods. 3 Properties of Membership Functions, Fuzzification, and Defuzzification 8 Hours Features of the Membership Function, Various Forms, Fuzzification, Defuzzification to crisp sets, Lambda-Cuts for Fuzzy Relations, Defuzzification to Scalars. Part - B 4. Logic and Fuzzy Systems 6 Hours Classical Logic Tautologies, Contradictions, Equivalence, Exclusive or and Exclusive Nor, Logical Proofs, Deductive Inferences. Fuzzy Logic, approximate reasoning, other forms of the Implication Operation, Fuzzy Systems: Natural Languages, Fuzzy (Rule -Based) systems.
5. Development of Membership Functions 6 Hours Membership value Assignments, Intuition, Inference, Rank Ordering, Neural Networks, Genetic Algorithms, Inductive Reasoning. 6. Automated Methods for Fuzzy Systems 6 Hours Definitions, Batch Least Squares Algorithm, Recursive Least Squares Algorithm, Gradient Method, Clustering Method, Learning From Example. 7. Rule Based Reduction Methods 6 Hours Fuzzy systems Theory and Rule Reduction. New Methods, Singular Value Decomposition, Combs Method, SVD and Combs Method Examples.
Page 24
Reference Books: 1. Timothy J. Ross; Fuzzy logic with engineering applications; John Wiley; 2nd Edition; 2007. 2. Bart Kosko; Nural Networks and Fuzzy systems: A Dynamical System approach; Pearson Education; 1st Edition; 2007. 3. George J. Klir, Bo Yuan; Fuzzy Sets and Fuzzy Logic-Theory and Applications; Prentice Hall; 1st Edition; 2008. Outcome: The students will have in depth knowledge on classical relation logic and fuzzy relation/logic. They can apply it to different research areas, where uncertainty and imprecision are involved. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 25
AD HOC WIRELESS NETWORKS (Elective - V; Group - E)

Objective: This course deals with the basic concepts of Wireless LANs, MANs and MAC protocols for Ad Hoc Networks. Popular routing protocols for Ad Hoc Networks are also discussed. Part - A 1. Introduction 2 Hours Fundamentals of Wireless Communication Technology, The Electromagnetic Spectrum, Radio Propagation Mechanisms, Characteristics of the Wireless channel, Voice Coding, IEEE 802.11 Standard. 2. Wireless LANs and PANs Introduction, Fundamentals of WLANs, IEEE 802.11 standard, Bluetooth, Home RF. 4 Hours
3. Wireless WANs and MANs 3 Hours Introduction, The cellular concept, Cellular Architecture, The first generation cellular systems, The second generation cellular systems, The third generation cellular systems, Wireless in local loop, IEEE 802.16 standard. 4. Ad Hoc Wireless Networks Introduction, Issues in Ad Hoc Wireless Networks, Ad Hoc Wireless Internet. 5 Hours
5. MAC Protocols for Ad Hoc Networks 8 Hours Introduction, Issues in designing a MAC protocol for Ad hoc wireless Networks, Design goals of a MAC protocol for Ad hoc wireless Networks, Classification of MAC protocols, Contention based protocols, Contention based protocols with reservation mechanisms, Contention-based MAC protocols with scheduling mechanism. 6. Routing Protocols for Ad Hoc Wireless Networks - 1 2 Hours Introduction, Issues in designing a routing protocol for Ad hoc wireless Networks, Classification of routing protocols, Table drive routing protocol. Part - B 7. Routing Protocols for Ad Hoc Wireless Networks - 2 4 Hours On-demand routing protocol Dynamic Source Routing Protocol, AODV, Temporally Ordered Routing, Location Aided Routing, Associativity Based Routing, Signal stability based Adaptive Routing, Flow oriented Routing, Power aware routing protocols. 8. Transport Layer for Ad Hoc Networks 5 Hours Introduction, Issues in designing a transport layer protocol for Ad hoc wireless Networks, Design goals of a transport layer protocol for Ad hoc wireless Networks, Classification of transport layer solutions, TCP over Ad hoc wireless Networks, Other transport layer protocols for Ad hoc wireless Networks, Security in wireless Ad hoc wireless Networks, Network security requirements, Issues & challenges in security provisioning, Network security attacks, Key management, Secure routing in Ad hoc wireless Networks.
Page 26
9. Quality of Service in Ad Hoc Wireless Networks - 1 6 Hours Introduction, Issues and challenges in providing QoS in Ad hoc wireless Networks, Classification of QoS solutions, MAC layer solutions, network layer solutions - QOS Routing Protocols, Ticket Based QOS Routing Protocols, Predictive Location Based protocol. 10. Quality of Service in Ad Hoc Wireless Networks - 2 5 Hours Network layer solutions - Trigger based Distributed QOS Routing, QOS - Enabled Ad Hoc On Demand Distance Vector Routing, Bandwidth Routing, On-Demand QOS Routing, On- Demand Link state Multipath QOS Routing, Asynchronous slot allocation strategies, QOS Frameworks for Ad Hoc Wireless Networks. 11. Recent Advances in Wireless Networks 4 Hours Introduction, Ultra Wide Band Radio Communication, Wireless Fidelity Systems, Optical Wireless Networks, The multimode 802.11 - IEEE 802.11a/b/g. Reference Books: 1. C. Siva Ram Murthy, B. S. Manoj; Ad Hoc Wireless Networks; Pearson Education; 2nd Edition; 2005. 2. C.K. Toh; Ad Hoc Mobile Wireless Networks - Protocols and Systems; Pearson Education; 1st Edition; 2009. 3. Ozan K. Tonguz, Gianguigi Ferrari; Ad Hoc Wireless Networks; John Wiley; 2 nd Edition; 2006. 4. Sudip Misra, Issac Woungang, Subhash Chandra Misra; Guide to wireless Ad Hoc Networks Computers Communications & Networks; Springer; Illustrated Edition; 2009. Outcome: As students are exposed to protocols at MAC, Routing layer and Transport layers, they can develop new protocols for each layer or improve upon existing protocols. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 27
GENETIC ALGORITHMS (Elective - V; Group - E)

Objective: This course deals with basics of genetic algorithms, mathematical foundation, data structures and operators used in genetic algorithms. It also deals with different industrial applications. Part - A 1. Genetic Algorithms 8 Hours What are Genetic Algorithms?, Robustness of traditional optimization and search methods, Goals of optimization, How are Genetic Algorithms different from traditional methods, A Simple Genetic Algorithm, Genetic algorithms at work, grist for search Mill, Similarity Templates. 2. Mathematical Foundations 8 Hours Who shall live and who shall die?, Fundamental theorem, Schema Processing at work, 2 armed and K armed bandit problem, How many schemata are processed usefully?, building block hypothesis, minimal deceptive, extend schema analysis of the two problem, similarity templates as hyper planes. 3. Computer Implementation of Genetic Algorithms 8 Hours Data Structure, reproduction, crossover and mutation, A time to reproduce, a time to cross, get with the main program, How well does it work, mapping objective functions to fitness form, fitness scaling, coding, multiparameter, mapped, fixed-point coding, discretization, constraints. Part - B 4. Applications of Genetic Algorithm 12 Hours The rise of Genetic Algorithms, Genetic algorithm applications of historical interest Bagley and adoptive game playing problem, Rosen Berg and Biological Cell Simulation, Cavicchio and Pattern Recognition, Hollstien and Function Optimization, Frantz and Positional Effect, Bosworth, Foo and Zeigler Real Jenes, Box and Evolutionary Operation, Other Evolutionary Optimization Technique, improvements in basic techniques, Alternate selection schema, Scaling Mechanism, Ranking Procedure, current applications of genetic algorithms. 5. Advanced operators and techniques in Genetic Algorithms Search, machine learning 12 Hours Dominance, Diploid and abeyance, an analysis of dominance and diploidy in GA search, inversion and other re-ordering operators, theory of re-ordering operators, other micro operators, segregation, translocation and multiple chromosome structure, duplication and deletion, sexual determination and differentiation, niche and special speciation, multi-objective optimization, knowledge based techniques, Genetic Algorithms and Parallel processors, Genetic Based Machine learning, What is Classifier Systems. Reference Books: 1. David E Goldberg; Genetic Algorithms in search, optimization and machine learning; Pearson Education; 2009. 2. Charles L Karr, L. Michael Freeman; Industrial applications of Genetic Algorithms; CRC Press; 1999.
3. Mitchell, Melanie; An Introduction to Genetic Algorithms; MIT Press; 1996.

Department of Computer Science & Engineering Page 28
4. Falkenauer, Emanuel; Genetic Algorithms and Grouping Problems; John Wiley; 1997.
Outcome: Students will be capable of applying concepts of genetic algorithm for different optimization problems. They can also apply Genetic Algorithms to different research oriented fields when near optimal solution (set of optimal solutions) is required. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 29
PERFORMANCE EVALUATION OF SYSTEMS (Elective - V; Group - E)

Objective: This course introduces the various metrics and their importance to performance evaluation of systems. Different mathematical techniques are introduced and applied for evaluating systems. Part - A 1. Introduction 8 Hours The art of Performance Evaluation, Common mistakes in Performance Evaluation, A systematic approach to Performance Evaluation, Selecting an evaluation technique, Selecting performance metrics, Commonly used performance metrics, Utility classification of performance metrics, Setting performance requirements. 2. Workloads, Workload Selection and Characterization 10 Hours Types of workloads, addition instructions, Instruction mixes, Kernels, Synthetic programs, Application benchmarks, Popular benchmarks. Work load selection, Services exercised, Level of detail, Representativeness, Timeliness, other considerations in workload selection. Work load characterization techniques, Terminology, Averaging, Specifying dispersion, Single-parameter histograms, Multi-parameter histograms, Principle-component analysis, Markov models, Clustering. 3. Monitors, Program Execution Monitors, and Accounting Logs 6 Hours Monitors, Terminology and classification, Software and hardware monitors, Software versus hardware monitors, Firmware and hybrid monitors, Distributed system monitors. Program execution monitors and accounting logs, Program execution monitors, Techniques for improving program performance, Accounting logs, Analysis and interpretation of accounting log data, Using accounting logs to answer commonly asked questions. Part - B 4. Capacity Planning and Benchmarking 3 Hours Steps in capacity planning and management, Problems in capacity planning, Common mistakes in benchmarking, Benchmarking games, Load drivers, Remote-terminal emulation, Components of an RTE, Limitations of RTEs. 5. Experimental Design and Analysis 6 Hours Introduction, Terminology, Common mistakes in experiments, types of experimental designs, 2k Factorial Designs, concepts, Computation of effects, Sign table method for computing effects, Allocation of variance, General 2k Factorial Designs. General full factorial designs with k factors, Model, Analysis of a general design, Informal methods. 6. Queuing Models 15 Hours Introduction, Queuing notation, Rules for all Queues, Littles law, Types of stochastic processes. Analysis of Single Queue: Birth-Death processes, M / M / 1 Queue, M / M / m Queue, M / M / m / B Queue with finite buffers, Results for other M / M / 1 Queuing Systems. Queuing Networks, Open and closed Queuing Networks, Product form networks, Queuing Network models of Computer Systems. Operational Laws, Utilization law, Forced flow law, Littles law, General response time law, Interactive response time law, Bottleneck analysis.
Page 30
Reference Books: 1. Raj Jain; The Art of Computer Systems Performance Analysis; John Wiley; 1991. 2. Paul J. Fortier, Howard E. Michel; Computer Systems Performance Evaluation and Prediction; Elsevier; 2003. 3. Trivedi K S, Kishor S. Trivedi; Probability and Statistics with Reliability, Queuing and Computer Science Applications; John Wiley; 2nd Edition; 2008.
4. R. Panneerselvam; Research Methodology; Prentice Hall; 2004.

Outcome: The students will be capable of evaluating different systems based on workloads and monitors. They can analyze systems based on benchmarking and queuing models. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questionsfrom Part - A and at least 2 out of 4 questions from Part - B.
Page 31
CRYPTOGRAPHY AND NETWORK SECURITY (Elective - VI; Group - F)

Objective: This course introduces different symmetric and public key encryption techniques. Digital signatures, different authentication protocols and network security are also dealt in detail. Part - A
1. Introductory Concepts
4 Hours Services, mechanisms, and Attacks Services, Mechanisms, Attacks; The OSI Security Architecture Security Services, Security Mechanisms, Security Attacks; A Model for Network security.
2. Basic Cryptographic Techniques

4 Hours Symmetric Cipher Model Cryptography, Cryptanalysis; Substitution Techniques Caesar Cipher, Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polyalphabetic Cipher, One-time Pad; Transposition Techniques, Rotor Machines, Steganography.
3. Block Ciphers and the data Encryption Standard

6 Hours Simplified DES-S-DES Key generation, S-DES Encryption, Analysis of Simplified DES, Relationship to DES: Block Cipher Principle-Stream Ciphers and Block Ciphers, Motivation for Feistel Cipher Structure, The Feistal Cipher: the Data Encryption Standard, Strength of DES-The use of 56-Bit Keys, The nature of the DES algorithm, Timing Attacks, Differential and Linear Cryptanalysis-Differential Cryptanalysis, Differential Cryptanalysis attack, Liner Cryptanalysis.
4. Contemporary Symmetric Ciphers

4 Hours Triple DES Double DES, Triple DES with Two keys, Triple DES with three keys; Blowfish Sub key and S - Box Generation, Encryption and Decryption; RC5 Parameters, Key Expansion, Encryption, Decryption, RC5 Modes; Characteristics of Advanced Symmetric Block Ciphers, RC4 Stream Cipher Stream Cipher Structure, the RC4 Algorithm.
5. Public-Key Cryptography and RSA
4 Hours Principles of Public Key Cryptosystems, Application for Public Key Crypto Systems, Requirement for Public Key Cryptography, Public Key Cryptanalysis; the RSA Algorithm Description of the Algorithm, Computational Aspect, The security of RSA.
6. Key Management; Other Public-Key Cryptosystems
2 Hours Key Management Distribution of Public Keys-Public announcement, publicly available directory, public-key authority, public-key certificates: Public Key Distribution of Secret Keys -Simple secrete key Distribution. Diffie-Hellman Key Exchange. Part - B
7. Message Authentication and hash Functions
4 Hours
Page 32
Authentication Requirements, Authentication Functions Message Encryption, MAC, Hash Function; Message Authentication Code - Requirements for MACs, Message Authentication Code Based on DES; Hash Functions Requirements for a Hash Function, Simple Hash Functions, Birthday Attacks, Block chaining Techniques.
Page 33
8. Hash Algorithms
4 Hours MD5 Message Digest Algorithm MD5 Logic, MD5 Compression Function, MD4, Strength of MD5, Secure hash Algorithm SHA-1 Logic, SHA-1 Compression Function, Comparison of SHA-1 and MD5,Revised Secure Hash Standard. 9. Digital Signatures and Authentication protocols 4 Hours Digital Signatures Requirements, Direct Digital Signature, Arbitrated Digital Signature; Authentication protocols Mutual Authentication, One-way Authentication; Digital Signature Standard the DSS Approach, The Digital Signature Algorithm. 10. Network Security practice 4 Hours Kerberos motivation, Kerberos version 4, Kerberos version 4; X.509 Authentication Service Certificates, Authentication Procedures, X.509 Version 3; PGP Notation, Operational Description, Cryptographic Keys and Key Rings, Public Key Management; S/MIME RFC 822, Multipurpose Internet Mail Extension, S/MIME Functionality, S/MIME Messages, S/MIME Certificate Processing. 11. IP Security 4 Hours IP Security overview Applications of IPSec, Benefits of IPSec, Routing Applications; IP Security Architecture IPSec Documents, IPSec Services, Security Associations, Transport and Tunnel Models.; Authentication Header Anti-Replay Service, Integrity Check Value, transport and Tunnel Models; Encapsulation Security Payload ESP Format, Encryption and Authentication Algorithms, Padding, Transport and Tunnel Modes; Combining security Associations Authentication Plus Confidentiality, Basic Combinations of Security Associations; Key management Oakley Key Determination Protocol. 12. System security 4 Hours Intruders Intrusion Techniques; Intrusion Detection Audit Records, Statistical Anomaly Detection, Rule-Based Intrusion Detection, The Base Rate Fallacy, Distributed Instruction Detection, Honey pots; Password Management Password Protection, Password Selection Strategies; Viruses and Related Threats Malicious Programs, The Nature of Viruses, Types of Viruses, Macro Viruses, E-mail Viruses, Worms; Virus Countermeasures Antivirus Approaches, Advanced Antivirus techniques, Behavior-Blocking Software. Reference Books: 1. William Stallings; Cryptography and Network Security Principles & Practices; Pearson Education; 3rd Edition; 2008. (Chapter 1: 1.1-1.3, Chapter 2 : 2.1-2.5, Chapter 3 : 3.1-3.5, Chapter 6 : 6.1-6.5, Chapter 9: 9.1-9.2, Chapter 10 : 10.1-10.2, Chapter 11: 11.1-11.5, Chapter 12: 12.112.2, Chapter 13: 13.1-13.3, Chapter 14 : 14.1 14.2, Chapter 15 : 15.1-15.2, Chapter 16 : 16.116.6, Chapter 18: 18.1-18.3, Chapter 19:19.1-19.2). 2. Douglas Stinson; Cryptography Theory and Practice; Chapman & Hall; 2nd Edition; 2002. 3. Behrouz A. Forouzan; Cryptography and Network Security; McGraw-Hill; 2007. 4. William Stallings; Network Security Essentials: Applications and Standards; Pearson Education; 2000. Outcome: The students will be capable of designing networking applications with security features. They can also design secure protocols at IP level or application level like email or web. Scheme of Semester End Evaluation:
Page 34
Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 35
SOFTWARE ARCHITECTURE (Elective - VI; Group - F)

Objective: The objective of the course is to provide a sound technical exposure to the concepts, principles, methods and best practices in Software Architecture and Design. The vision of the course is to produce Software Architects with sound knowledge and superior competence in building Robust, Scalable and Reliable software intensive systems in an effective way. Part - A 1. Introduction 5 Hours The Architecture Business Cycle: Where do architectures come from? Software processes and the architecture business cycle; What makes a good architecture? ; What software architecture is and what it is not? ; Other points of view; Architectural patterns, reference models and reference architectures; Importance of software architecture; Architectural structures and views. 2. Architectural Styles and Case Studies 7 Hours Architectural styles; Pipes and filters; Data abstraction and object-oriented organization; Eventbased, implicit invocation; Layered systems; Repositories; Interpreters; Process control; Other familiar architectures; Heterogeneous architectures. Case Studies: Keyword in Context; Instrumentation software; Mobile robotics; Cruise control; Three vignettes in mixed style. 3. Quality 7 Hours Functionality and architecture; Architecture and quality attributes; System quality attributes; Quality attribute scenarios in practice; Other system quality attributes; Business qualities; Architecture qualities. Achieving Quality: Introducing tactics; Availability tactics; Modifiability tactics; Performance tactics; Security tactics; Testability tactics; Usability tactics; Relationship of tactics to architectural patterns; Architectural patterns and styles. 4. Architectural Patterns - 1 5 Hours Introduction; From mud to structure: Layers Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Example resolved, Variants, known uses, Consequences; Pipes and Filters - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Example resolved, Variants, Known uses, Consequences; Blackboard - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Variants, known uses, Example resolved, Consequences. Part B 5. Architectural Patterns - 2 7 Hours Distributed Systems: Broker - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Example resolved, Variants, Known uses, Consequences; Interactive Systems: Model View Controller - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Variants, known uses, Consequences; Presentation-Abstraction-Control Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Variants, known uses, Consequences.
Page 36
6. Architectural Patterns - 3 5 Hours Adaptable Systems: Microkernel - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Example resolved, Variants, known uses, Consequences; Reflection - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Example resolved, Variants, known uses, Consequences. 7. Some Design Patterns 5 Hours Introduction, Structural decomposition: Whole Part : Example, Context, Problem, Solution, Structure, Dynamics, Example resolved, Variants, known uses, Consequences; Organization of work: Master Slave: Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Variants, known uses, Consequences; Access Control: Proxy - Example, Context, Problem, Solution, Structure, Dynamics, Implementation, Variants, Example resolved, known uses, Consequences. 8. Designing and Documenting Software Architecture 7 Hours Architecture in the life cycle; Designing the architecture; Forming the team structure; Creating a skeletal system. Uses of architectural documentation; Views; Choosing the relevant views; Documenting a view; Documentation across views. Reference Books: 1. Len Bass, Paul Clements, Rick Kazman; Software Architecture in Practice; Pearson Education; 2nd Edition; 2003. (Chapter 1: 1.1-1.3, Chapter 2 : 2.1-2.5, Chapter 4 : 4.1-4.7, Chapter 5 : 5.1-5.9, Chapter 7 : 7.1-7.4, Chapter 9: 9.1-9.5). 2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal; Pattern -Oriented Software Architecture, A System of Patterns; John Wiley; Volume 1; 2006. (Chapter 2 : 2.1-2.5, Chapter 3 : 3.1-3.4). 3. Mary Shaw, David Garlan; Software Architecture - Perspectives on an Emerging Discipline; Prentice Hall; 2007. (Chapter 2 , Chapter 3). 4. E. Gamma, R. Helm, R. Johnson, J. Vlissides; Design Patterns - Elements of Reusable Object -Oriented Software; Pearson Education; 1995. Outcome: The students will be able to appreciate the roll of abstractions, modeling, architecture and design patterns in the development of a software product. They would be able to make optimal architectural choices and employ the most relevant methods, best practices and technologies for architecting and implementing a software product regardless of its complexity and scale. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B..
Page 37
GRID COMPUTING (Elective - VI; Group - F)

Objective: The aim of this course is to introduce Grid Computing Organizations and different types of architectures. The OGSA Platform Components and OGSA Basic Services are discussed. Part - A 1. Introduction, Grid Computing Organizations and Their Roles 6 Hours Early Grid Activities, Current Grid Activities, An Overview of Grid Business Areas, Grid Applications, Grid Infrastructure. Organizations Developing Grid Standards and Best Practice Guidelines, Organizations Developing Grid Computing Toolkits and the Framework, Organizations Building and Using Grid-Based Solutions to Solve Computing, Data and Network Requirements, Commercial Organizations Building and Using Grid-Based Solutions. 2. The Grid Computing Anatomy, Road Map 6 Hours The Grid Problem. Anatomy Computing, Business on Demand and Infrastructure Virtualization, Service-Oriented Architecture and Grid, Semantic Grids. 3. Architectures - 1 6 Hours Service-Oriented Architecture, Web Services Architecture, XML, Related Technologies and Their Relevance to Web Services, XML Messages and Enveloping, Service Message Description Mechanisms. 4. Architectures - 2 6 Hours Relationship between Web Service and Grid Service, Web Service Interoperability and the Role of the WS-I Organization, Open Grid Services Architecture (OGSA) and Goals, Commercial Data Center (CDC), National Fusion Collaborator (NFS), Online Media and Entertainment. Part - B 5. The OGSA Platform Components, Open Grid Services Infrastructure (OGSI)-1 6 Hours Native Platform Services and Transport Mechanisms, OGSA Hosting Environment, Core Networking Services Transport and Security, OGSA Infrastructure, OGSA Basic Services. Grid Services, A High-Level Introduction to OGSI. 6. OGSI - 2 Technical Details of OGSI Specification, Introduction to Service Service: Naming and Change Management Recommendations. Data Concepts, 6 Hours Grid
7. OGSA Basic Services - 1 6 Hours Common Management Model (CMM), Service Domains, Policy Architecture, Security Architecture, Metering and Accounting. 8. OGSA Basic Services - 2, Toolkit 6 Hours Common Distributed Logging, Distributed Data Access and Replication. GLOBUS GT3 Toolkit Architecture.
Page 38
Reference Books: 1. Joshy Joseph, Craig Fellenstein; Grid Computing; Pearson Education; 1st Edition; 2009. 2. Prabhu C S R; Grid and Cluster Computing; Prentice Hall; 2007. 3. Maozhen Li, Mark Baker ; The Grid: Core Technologies; John Wiley; 2005. Outcome: The student will be able to contribute towards formulating and solveing problems using abstractions and modeling. Also the students can apply the state of art in Grid Computing and design middleware, handle security and measure performance of the system. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 39
STORAGE AREA NETWORKS (Elective - VI; Group - F)

Objective: This course is designed to introduce the fundamentals of network storage technologies, focusing on SAN and Network attached storage, major building blocks, its capabilities, challenges and some applications. This course provides an overview of alternative technologies in the connectivity of Network storage, backup and restoration technique, various disasters recovery methods, SAN management hierarchy. Part - A 1. Introduction 4 Hours Server - Centric IT Architecture and its Limitations; Storage - Centric IT Architecture and its advantages; Case study: Replacing a server with Storage Networks; The Data Storage and Data Access problem; The Battle for size and access. 2. Intelligent Disk Subsystems 5 Hours Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O Channels; JBOD; Storage Virtualization using RAID; Different RAID levels; Caching: Acceleration of Hard Disk Access; Intelligent disk subsystems; Availability of disk subsystems. 3. I/O Techniques 8 Hours The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel Protocol Stack; Fibre Channel SAN; IP Storage. InfiniBand; Virtual Interfaces and RDMA; RDMA over TCP, SDP, iSCSI, Extensions for RDMA (iSER). 4. Storage on the Network and Network for Storage 2 Hours NAS idea; NAS evolution and development; Operational overview of NAS; NAS caveats; SAN idea; SAN evolution and development; Operational overview of SAN; SAN caveats. 5. Storage Area Networks 5 Hours Architecture overview : Creating Network for Storage; Hardware Devices : Fiber Channel Switch; Host Bus Adaptors; Puttinh the Storage in Storage Area Networks; Fabrics operation from a hardware perspective; SAN hardware considerations. Part - B 6. Software Components of SAN 3 Hours The Switchs operating system; Device Drivers; Supporting components; Considerations for SAN software. 7. SAN Configurations 3 Hours Connecting into the Data Centre; Evolving network connections; Evolving device connections; Connecting to the future; Configuration guidelines. 8. Integration of SAN and NAS 2 Hours Differences; similarities; Need for Integration; Future storage connectivity; Storage Integration.
Page 40
9. Management of Storage 10 Hours Planning business Continuity : Defining the environment; Role of storage networking in business continuity; Storage Design and Implementation of business continuity plan. Managing Availability : Availability metrics; Implementing the plan; Finding the holes; Closing the loop. Maintaining Serviceability : Tracking configurations; Investigating changes; Closing the loop. Capacity Planning : Developing a plan for storage; Storage analysis; Modeling Performance and Capacity requirements; Implementing the plan; Closing the loop. 10. Security Considerations 6 Hours Overview of Information Security; Security methods; Storage Security technology; Storage security challenges; Fiber Channel SAN security; NAS security; Best Practices. Reference Books: 1. Robert Spalding; Storage Networks: Complete Reference Storage Networks; McGraw-Hill; 1st Edition; 2008. 2. Ulf Troppens, Rainer Erkens, Wolfgang Muller; Storage Networks Explained; John Wiley; 2008. 3. Richard Barker, Paul Massiglia; Storage Area Network Essentials, A Complete Guide to understanding and Implementing SANs; John Wiley; 2002. 4. Marc Farley; Storage Networking Fundamentals; Cisco Press; 2005. Outcome: The students will be capable of handling large scale data in a networking environment, able to configure, operate and troubleshoot the SAN system. They will also have an in-depth technical understanding of open storage area network systems and maintenance. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 41
SERVICE ORIENTED ARCHITECTURE (Elective - VI; Group - F)

Objective: Fundamentals of Service Oriented Architecture (SOA) and web service frame work are introduced. Business process designs on different SOA platforms are discussed. Part - A 1. Introduction to SOA, Evolution of SOA 6 Hours Fundamentals of SOA; Common Characteristics of contemporary SOA; Common tangible benefits of SOA; An SOA timeline (from XML to Web services to SOA); The continuing evolution of SOA (Standards organizations and Contributing vendors); The roots of SOA (comparing SOA to past architectures). 2. Web Services and Primitive SOA 6 Hours The Web services framework; Services (as Web services); Service descriptions (with WSDL); Messaging (with SOAP). 3. Web Services and Contemporary SOA - 1 6 Hours Message exchange patterns; Service activity; Coordination; Atomic Transactions; Business activities; Orchestration; Choreography. 4. Web Services And Contemporary SOA - 2 6 Hours Addressing; Reliable messaging; Correlation; Polices; Metadata exchange; Security; Notification and eventing. Part - B 5. Principles of Service Orientation 6 Hours Services-orientation and the enterprise; Anatomy of a service-oriented architecture; Common Principles of Service-orientation; How service orientation principles interrelate; Serviceorientation and object-orientation; Native Web service support for service-orientation principles. 6. Service Oriented Design (P1) and Service Design 7 Hours Introduction to service oriented design, WSDL - related XML Schema language basics, WSDL language basics, SOAP language basics, Service interface design tools, Service Design Overview; Entity-centric business service design; Application service design; Task-centric business service design. 7. Business Process Design 5 Hours WS-BPEL language basics; WS Coordination overview; Service-oriented business process design. 8. SOA Platforms 6 Hours SOA platform basics; SOA support in J2EE; SOA support in .NET; Integration considerations.
Page 42
Reference Books: 1. Thomas Erl; Service-Oriented Architecture - Concepts, Technology and Design; Pearson Education; 2005. 2. Eric Newcomer, Greg Lomow; Understanding SOA with Web Services; Pearson Education; 2005. Thomas Erl; SOA principles of service design; Prentice Hall; 2008. 4. Paul C Brown; Implementing SOA; Pearson Education; 2009. Outcome: The students will be capable of designing appropriate architecture based on the concept of service description message exchange, business activities on platforms like J2EE or .NET. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questionsfrom Part - A and at least 2 out of 4 questions from Part - B.
Page 43
MINI PROJECT LAB

Sub Code Hrs / Week Total Hrs Credits : 07CSP76 :6 ::3 CIE Marks Exam Hours SEE Marks : 50 : 3 Hours : 50
Objective: The objective is to enable the students to understand the basics of software development life cycle through hands-on implementation of concepts learnt by them. The student teams will have the flexibility of choosing the application domain as well as the language used for implementing the same. Guidelines for Mini Project Lab The mini-project is to be carried out individually or by a team of not more than two students. Each student in a team must contribute equally in the tasks mentioned below. The students will pick a topic in consultation with the faculty members. The mini-project must be carried out in the college only. The students can choose topics from areas like networking, data mining, data warehousing, clientserver technology, wireless networking, sensor networks, image processing, parallel processing, distributed computing, multi-media, cryptography, operating systems, Linux etc. The implementation code should be provided by the students. The mini-project task would involve: 1. Carry out the Literature Survey of the topic chosen. 2. Understand the requirements specification of the mini-project. 3. Detail the design concepts using Data Flow Diagram / ER-diagram / Scenarios / Use-case diagram / Activity Diagram / Class diagrams, as applicable. 4. Commence implementation using an appropriate programming language / tool after approval by the faculty. 5. Conduct thorough testing of all the modules developed and carry out integrated testing. 6. Demonstrate the functioning of the mini-project along with presentations of the same. 7. Prepare a project report covering all the above phases including the complete source code developed. Conclusion and Future Enhancements must also be included in the report. 8. Submit the report in the prescribed format. Represntative mini-projects: 1. Voice over IP. 2. Simulation of Video on Demand. 3. Transfer of GIF, TIFF, JPEG images. 4. Implementation of Compression-Decompression algorithms. 5. Implementation of filtering proxies which restrict access to certain sites - AD filtering, Block filtering, Blink filter, etc. 6. Search Engines.. 7. Digital Watermarking for Color images. 8. Finding frequent patterns in a Graph. 9. Patches for Linux. 10. Compliers / Cross Compilers. Outcome : The student would be able to realize his / her potential / strengths of implementing a hardware / software project in the chosen domain. The student would also be exposed to the nuances of the languages/tools deployed for implementation of the mini-project. These aspects would facilitate effective participation by the student in team work and development of communication / presentation skills essential for carrying out the final semester project as well as being part of the industry. Department of Computer Science & Engineering Page 44
Scheme of Evaluation for CIE Marks: Sl. No. 1. 2. 3. 4. Evaluation Component Semniar I Seminar II Implementation and Demonstration Report Total Marks 10 10 20 10 50
Scheme of Evaluation for SEE Marks: Sl. No. 1. 2. 3. 4. 5. Evaluation Component Write up Presentation Demonstration of the project Viva Report Total Marks 10 10 20 05 05 50
Page 45
VIII Semester Syllabus

PRINCIPLES OF INTELLECTUAL PROPERTY RIGHTS
Sub Code : 07HSS81 CIE Marks : 50 Hrs / Week : 2+0+0 Exam Hours : 2 Hours Total Hrs : 26 SEE Marks : 50 Credits :2 Objective: The course aims at providing details on Intellectual Property Rights to encourage invention, investment and innovation and disclosure of New Technology and to recognise and reward innovativeness. It is also intended to promote innovation and technical development and to promote linkages to industries and stimulate research through developing and utilizing novel technologies.
1. Introduction
3 Hours Basic concepts of IPR, Nature and scope of IPR, Commercial exploitation of IPR, IPR and economic development, Types of Intellectual property, Advantages of IPR, Intellectual property in specific fields Plant breeders rights, Plant variety protection, A brief history national and international legal regime governing industrial and Intellectual property. 7 Hours Introduction, Basic concepts, Object and value of patent law, Advantages of patent to inventor, patentable inventions, inventions are not patentable, How to obtain patent, Biotechnology patents and patents on computer program, Government use of inventions, Infringement of patents and remedy for infringement, Case study for patent engineering. Patent Acts 1970 as amended in 1999, 2002, & 2005. 5 Hours Basic concepts, Definition, Functions, different kinds of trademarks like service marks, collective trademarks, certification trademarks and textile trade marks, registrable and non registrable marks, Establishing trade mark right, use and registration, Registrability &distinctive character, Good will, infringement and action for trademarks, Passing off, Trade mark and domain names, Comparison with patents, industrial design and copy right, Case Studies. 6 Hours Introduction, Nature and scope, Subject matter, Related or allied rights, the works in which copy right subsists, Rights conferred by copy right, Copy right protection in India, transfer of copy rights, right of broad casting organisations and of performer, computer soft ware and IPR and Case Studies. information: 5 Hours Introduction, basic concepts and scope and nature of rights process of registration rights, available after registration, transfer of interest or rights, made available under respective legislations such as assignment, transmission and licenses; Reliefs and Remedies and Action for infringement of the rights; Appeals, Case studies.
2. Patents
3. Trade Marks
4. Copy Right
5. Industrial Design, Integrated Circuits, Geographical Indications and Confidential
References Books: 1. P Narayan; Intellectual Property Law; Eastern Law House; New Delhi and Kolkata; 2005; EAN: 9788171771813. 2. Prabuddha Ganguly; Intellectual Property Rights: Unleashing Knowledge Economy; McGrawHill; New Delhi; 1st Edition; 2001; ISBN: 0074638602. 3. Cornesh W .R; Intellectual Property Rights Patents, Copy Right, Trade Mark, Allied Rights; Universal Law Publishing Company Pvt. Ltd; Delhi; 2001. Department of Computer Science & Engineering Page 46
4. S.R Myneni; Law of Intellectual Property; Asia Law House; Hyderabad; 2001.
Web 1. Using the Internet for non-patent prior art searches, Derwent IP Matters, July 2000. [www.ipmatters.net/features/000707_gibbs.html]. 2. Patents by N.R.Subbaram, Pharma book syndicate. 3. www.iptoday.com Outcome: The students would be able to learn, articulate the applicable source, scope and limitations of the core Intellectual Property discipline such as Patent, Copyright, Trademark and Trade secret Law and also gain exposure to various Legal issues pertaining to Intellectual Property Rights. Scheme of Semester End Evaluation: Question paper will be set to cover both descriptive and objective type questions, with weightage of 60% for descriptive questions and 40% for objective questions.
Page 47
INFORMATION SECURITY (Elective - VII; Group - G)

Sub Code Hrs / Week Total Hrs Credits : 07G804 : 4+0+0 : 48 :4 CIE Marks Exam Hours SEE Marks : 100 : 3 Hours : 100
Objective: The Course is intended to provide exposure to the various aspects of Information Security to students from all Engineering disciplines since security of hardware, software, data / information and networks in any business or other enterprise / organisation needs to be addressed in all the domains of the enterprise. The objective is to provide an understanding of the need for security in light of threats & attacks and risk management strategies. The course also aims at covering aspects related to planning for implementation of the strategies using state-of-art electronic / computerized systems and physical security methods with a brief exposure to maintenance of information security systems and staffing of the information security department. Part - A 1. Introduction to Information Security 3 Hours Introduction; What is security? Critical characteristics of information; NSTISSC security model; Approaches to information security implementation; The Security System Development Life Cycle; Information Security Terminology. 2. The Need for Security 5 Hours Introduction; Business needs : protecting functionality, operations, data and technology assets; Threats : acts of human error / failure, deliberate acts, compromises to intellectual property, deviations of quality of service, technical failures / obsolescence and forces of nature; Attacks : malicious code, hoaxes, back doors, password crack, brute force, denial-of-service and distributed denial-of-service, spoofing, man-in-the middle, spam, mail bombing, sniffers, social engineering, buffer overflow and timing attack. 3. Risk Management 8 Hours Introduction; Overview of Risk Management; Risk identification; Risk Assessment; Risk Control Strategies; Selecting a Risk Control Strategy; Risk Management discussion; Documenting results; Recommended practices in controlling risks. 4. Planning for Security 8 Hours Introduction; Information Security Policy, Standards, and Practices; The Information Security Blue Print; Security education, Training and Awareness program. Part - B 5. Security Technology 12 Hours Firewalls and VPNs: Introduction, Physical design, Firewalls, Protecting Remote Connections. Intrusion Detection, Access control and Other Security Tools: Introduction; Intrusion Detection Systems (IDS); Honey Pots, Honey Nets, and Padded cell systems; Scanning and Analysis Tools; Access Control Devices. 6. Physical Security 5 Hours Introduction; Physical Access controls; Fire Security and safety; Failure of supporting utilities and structural collapse; Interception of data; Mobile and Portable systems; Special considerations for physical security threats.
Page 48
7. Security and Personnel 3 Hours Introduction; Position and staffing the security function; Credentials of Information Security professionals; 8. Information Security Maintenance 4 Hours Introduction; The Maintenance Model : monitoring the external and internal environments, planning and risk assessment, vulnerability assessment and remediation and readiness and review. Reference Books: 1. Michael E. Whitman, Herbert J. Mattord; Principles of Information Security; Thomson; 2nd Edition; 2005. 2. Mark Merkow and Jim Breithaupt; Information Security Principles & Practices; Pearson Education; 2nd Edition; 2007. 3. Mark Stamp; Information Security Principles & Practice; John Wiley; 1st Edition; 2006. 4. NIIT; Information Security : An Overview; Prentice-Hall; 1st Edition; 2004. Outcome: The student should be in a position to quickly fit into the hierarchy of Information Security team in any enterprise. The student should be able to actively participate in: identifying threats, evolving strategies for risk management, evolving information security policy specific to the enterprise and implementing these as the student grows from entry-level position to the position of the highest executive. Scheme of Semester End Evaluation: Students have to answer 5 questions choosing at least 2 out of 4 questions from Part - A and at least 2 out of 4 questions from Part - B.
Page 49
SEMINAR
Sub Code : 07CSS83 CIE Marks : 50 Hrs / Week :3 Exam Hours : Credits :2 SEE Marks : Objective: The objective is to provide an opportunity to the students to carry out a detailed study of and understand the latest trends / technology related to a topic in the computer science discipline chosen from articles / papers from journals / white papers. Technical Seminar Guidelines
1. The topic for the seminar should be selected from recent papers published in reputed journals.
2. The topic should be approved by the faculty. 3. Two seminars should be presented. 4. A report of at least 30 pages should be submitted. Outcome: The student would be in a position to confidently carry out literature survey on a new topic and compile a presentation on the same. This exercise would help him / her to improve presentation / communication skills, work out methodologies for preparing new project proposals and present the details to his / her project teams in an effective manner in his / her future career. Scheme of Evaluation for CIE Marks: Sl. No. 1. 2. 4. Evaluation Component Literature Survey Presentation Report Total Marks 10 30 10 50
Page 50
PROJECT WORK
Sub Code Hrs / Week Total Hrs Credits : 07CSP84 : 0+0+20 : 20 : 12 CIE Marks Exam Hours SEE Marks : 100 : 3 Hours : 100
Objective: The objective is to provide an opportunity for the students to work in teams for carrying out an ab initio project in the computer science domain. The effort would be comprehensive, covering all aspects of the software development life cycle applied to convert the knowledge gained in earlier semesters to solve a selected real world problem. General Guidelines 1. The project work is to be carried out by a team of two to four students. 2. Each student in the team must contribute synergistically towards successful completion of the project. The project may be carried out in an Industry / R&D Institution / In-House. 3. In case of external projects, specific approval from the department is necessary. 4. The In-House projects would be proposed by the department and the students are required to select a project from the list. 5. The project would involve coding of about 2000 lines in C or equivalent language. 6. Projects involving use of simulators will invariably involve coding in a scripting language while the simulator is used only as a front end tool. 7. The student team is required to submit hard copies of the detailed Project Report in the prescribed format as well as softcopy on a CD. 8. The student team is required to demonstrate the functioning of the modules and the integrated application along with a presentation on the details of the project carried out during the semester end examination in the department. Outcome : The student would be able to realize his / her potential / strengths of implementing a hardware / software project in the chosen domain. The student would also be equipped to pursue higher studies in a specialized area / carry out research / work in an industrial environment. These aspects would facilitate effective participation by the student in team work and development of communication / presentation skills essential for being part of any of the domains in his / her future career. Scheme of Evaluation for CIE Marks: Sl. Evaluation Component No. 1. Semniar I 2. Seminar II 3. Seminar III 4. Demonstration of the project 5. Report Total Marks 15 15 20 30 20 100
Scheme of Evaluation for SEE Marks: Sl. Evaluation Component Marks No. 1. Write up 20 2. Presentation 30 3. Viva 30 4. Report 20 Total 100 Note: Availability of source code for end semester examination is optional. Department of Computer Science & Engineering Page 51

CSE-7 and 8 Semester Syllabus 09-06-2010.oct 2009

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE-7 and 8 Semester Syllabus 09-06-2010.oct 2009

Uploaded by

Copyright:

Available Formats

R.V.

COLLEGE OF ENGINEERING (An Autonomous Institution under VTU)

BACHELOR OF ENGINEERING (b.e.) COMPUTER Science & Engineering

VII & ViII Semester Scheme & Syllabus

Department of Computer Science & Engineering

R.V.COLLEGE OF ENGINEERING, BANGALORE - 560059

SCHEME OF TEACHING & EXAMINATION

Department of Computer Science & Engineering

R.V.COLLEGE OF ENGINEERING, BANGALORE - 560059

SCHEME OF TEACHING & EXAMINATION

Department of Computer Science & Engineering

Department of Computer Science & Engineering

VII Semester Syllabus

Department of Computer Science & Engineering

Department of Computer Science & Engineering

COMPUTER GRAPHICS - THEORY AND LABORATORY

Department of Computer Science & Engineering

MULTIMEDIA COMMUNICATIONS (Elective - IV; Group - D)

2. Multimedia: Media & Data Streams

3. Multimedia: Information Representation

Department of Computer Science & Engineering

Department of Computer Science & Engineering

BUSINESS INTELLIGENCE (BI) AND ITS APPLICATIONS (Elective - IV; Group - D)

Department of Computer Science & Engineering

Department of Computer Science & Engineering

EMBEDDED SYSTEMS (Elective - IV; Group - D)

DATA COMPRESSION (Elective - IV; Group - D)

Department of Computer Science & Engineering

REAL TIME SYSTEMS (Elective - IV; Group - D)

1. Basic Real-Time Concepts

2. Real-Time Specification and Design Techniques

4. Inter-task Communication and Synchronization

5. Real-Time Memory Management

6. System Performance Analysis and Optimization

Department of Computer Science & Engineering

7. Reliability, Testing and Fault Tolerance

9. Hardware/ Software Integration

10. Real-Time Applications:

Department of Computer Science & Engineering

MICROCONTROLLER-BASED SYSTEMS (Elective - IV; Group - D)

Department of Computer Science & Engineering

DESIGN PATTERNS (Elective - V; Group - E)

2. Designing A Document Editor

3. Design Pattern Catalog

6. Behavioral Patterns 2 and Conclusion

Department of Computer Science & Engineering

Department of Computer Science & Engineering

DIGITAL IMAGE PROCESSING (Elective - V; Group - E)

Department of Computer Science & Engineering

Department of Computer Science & Engineering

FUZZY LOGIC (Elective - V; Group - E)

Department of Computer Science & Engineering

Department of Computer Science & Engineering

AD HOC WIRELESS NETWORKS (Elective - V; Group - E)

Department of Computer Science & Engineering

Department of Computer Science & Engineering

GENETIC ALGORITHMS (Elective - V; Group - E)

3. Mitchell, Melanie; An Introduction to Genetic Algorithms; MIT Press; 1996.

Department of Computer Science & Engineering

PERFORMANCE EVALUATION OF SYSTEMS (Elective - V; Group - E)

Department of Computer Science & Engineering

4. R. Panneerselvam; Research Methodology; Prentice Hall; 2004.