Study & Evaluation Scheme

B.Tech Computer Science Engineering

Year 4th, sem VIII

Elective – III (Choose any one of the following)

SL Course Subject Periods Evaluation Scheme Subject
No. No. Total
Sessional Examination
Theory L Technical P CA TA Total
1. Elective – III 3 1 0 30 20 50 100 150
2. CS 801 Distributed Systems 3 1 0 30 20 50 100 150
3. Elective – IV 3 1 0 30 20 50 100 150
4. Elective – V 3 1 0 30 20 50 100 150
Practicals/Training/Project
5. CS 851 Distributed Systems Lab 0 0 2 - 25 25 25 50
6. CS852 Industrial Interaction - - - - 50 50 - 50
7. CS 853 Project 0 0 1 - 10 100 150 250
2 0
8. GP 801 General Proficiency - - - - 50 50 - 50
Total 1 4 1 1000
2 4
S.No. Paper Code Paper Name
1. CS031 Data mining and warehousing
2. CS032 Advanced Concept in Database System
3. CS033 Artificial Intelligence
Elective –IV (Choose any one of the following)
S.No. Paper Code Paper Name
1. EC025 Digital Image Processing (to be offered by Electronics
Department)
2. CS042 Computational Geometry
3. CS043 Virtual Reality
4. CS044 Multimedia System

Elective –V (Choose any one of the following)

S.No. Paper Code Paper Name
1. CS051 Real Time System
2. CS052 Parallel Algorithm
3. CS053 Mobile Computing
4. CS054 Data Compression
 DISTRIBUTED SYSTEMS
CS801
Unit – I
Characterization of Distributed Systems: Introduction, Examples of
distributed systems, Resource sharing and the Web Challenges.
System Models Architectural models, Fundamental models
Theoretical Foundation for Distributed System:- Limitation of
distributed system, absence of global clock, shared memory, Logical
clocks, Lamports & vectors logical clocks,Casual ordering of messages,
global state, termination detection.
Distributed Mutual Exclusion:- Classification of distributed mutual
exclusion, requirement of mutual exclusion theorem, Token based and
non token based algorithms, performance metric for distributed mutual
exclusion algorithms.
Unit - II
Distributed Deadlock Detection:- system model, resource Vs
communication deadlocks, deadlock prevention, avoidance, detection &
resolution, centralized dead lock detection, distributed dead lock
detection, path pushing algorithms, edge chasing algorithms.
Agreement Protocols:- Introduction , System models, classification of
Agreement problem, Byzantine agreement problem, Consensus problem,
Interactive consistency Problem, Solution to Byzantine Agreement
problem, Application of agreement problem, Atomic commit in
Distributed Database system.
Unit – III
Distributed Objects and Remote Invocation:Communication between
distributed objects, Remote procedure call, Events and notifications, Java
RMI case study.
Security:Overview of security techniques, Cryptographic algorithms,
Digital signatures
Cryptography pragmatics, Case studies: Needham-Schroeder, Kerberos,
SSL & Millicent.
Distributed File Systems:File service architecture, Sun Network File
System, The Andrew File System, Recent advances.
Unit _IV
Transactions and Concurrency Control:Transactions, Nested
transactions, Locks, Optimistic concurrency control, Timestamp ordering,
Comparison of methods for concurrency control.
Distributed Transactions: Flat and nested distributed transactions,
Atomic commit protocols, Concurrency control in distributed
transactions, Distributed deadlocks, Transaction recovery.
Replication: System model and group communication, Fault-tolerant
services, highly available services, Transactions with replicated data.
Unit V
Distributed Algorithms: - Introduction to communication protocols,
Balanced sliding window protocol, Routing algorithms, Destination based
routing, APP problem, Deadlock free Packet switching, Introduction to
Wave & traversal algorithms, Election algorithm.
Corba Case Study:
CORBA RMI, CORBA services.

REFERENCES:-
• Coulouris, Dollimore, Kind berg, “Distributed Systems: Concepts
and Design”, Pearson Education Asia, 3ed.
• Singhal & Shivratri, “ Advanced concepts in Operating System”,
McGraw Hill.
• Tel, Gerald, “Introduction to Distributed Algorithm”, Oxford
University Press
 DATA MINING & WARE HOUSING

CS031
UNIT I:
Foundation. Introduction to DATA Warehousing. Client/Server
Computing model & Data Warehousing. Parallel processors & Cluster
Systems. Distributed DBMS implementations. Client/Server RDBMS
Solutions.

UNIT II:
DATA Warehousing. Data Warehousing Components. Building a Data
Warehouse. Mapping the Data Warehouse to a Multiprocessor
Architecture. DBMS Schemas for Decision Support. Data Extraction,
cleanup & Transformation Tools. Metadata.

UNIT III:
Business Analysis. Reporting & Query Tools & Applications. On line
Analytical Processing(OLAP). Patterns & Models. Statistics. Artificial
Intelligence.

UNIT IV:
Data Mining. Introduction to Data Mining. Decision Trees. Neural
Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule
Induction. Selecting & Using the Right Technique.

UNIT V:
Data visualization & Overall Perspective. Data Visualization. Putting it
All Together. Appendices: A: Data Visualization. B: Big Data-Better
Returns : Leveraging Your Hidden Data Assets to Improve ROI. C: Dr. E.
F. Codd’s 12 Guidelines for OLAP. D: Mistakes for Data Warehousing
Managers to Avoid.

Reference:
• Berson, “ Data Warehousing, Data Mining & OLAP”,
• Mallach, “Data Warehousing System”,(McGraw Hill)
 Advanced Concepts in Database Systems
CS032
Unit-I
Query Processing, Optimization & Database Tuning:-Algorithms for
executing query operations, Heuristics for query optimizations,
Estimations of query processing cost, join strategies for parallel
processors, Database workloads, Tuning Decisions, DBMS benchmarks,
Clustering & Indexing, Multiple attribute search keys, Query evaluation
plans, Pipelined Evaluations, System catalogue in RDBMS.
Unit-II
Extended Relational Model & Object Oriented Database System:-
New Data types, User Defined Abstract Data types, Structured types,
Object identity, containment, class hierarchy, Logic based Data model,
Data log, Nested relational Model and Expert Database system.
Unit-III
Distributed Database System:- Structure of Distributed Database, Data
Fragmentation, Data Model, Query Processing, Semi Join, Parallel &
Pipeline join, Distributed Query Processing in R* system, Concurrency
Control in Distributed Database System, Recovery in Distributed
Database System, Distributed Deadlock Detection and Resolution,
Commit Protocols.
Unit-IV
Database Security:-Database Security, Access Control, and Grant &
Revoke on views, and Integrity Constraints, Discretionary Access
Control, Role of DBA, Security in Statistical Databases.
Unit-V
Enhanced Data Model for Advanced Applications:-Database
Operating System, Introduction to Temporal Database Concepts, Spatial
and Multimedia Databases, Data Mining, Active Database System,
Deductive Databases, Database Machines, Web Databases, Advanced
Transaction Models, Issues in Real Time Database Design.
REFERENCES:-
*Majumdar & Bhattacharya, “Database Management System”, TMH.
*Korth, Silbertz, Sudarshan, “Database Concepts”, Mc Graw Hill.
*Elmasri, Navathe, “ Fundamentals of Database Systems”, Addison
Wes
*Data C J , “ An Introduction tom Database System”, Addison Wesley.
*Ramakrishnan, Gehrke, “Database Management System”, McGraw
Hill.
• Bernstein, Hadzilacous, Goodman, “ Concurrency Control &
Recovery”, Addison Wesley.
• Ceri & Palgatti, “ Distributed Databases”, McGraw Hill.
 ARTIFICIAL INTELLIGENCE
CS033
Unit –I
Introduction :Introduction to Artificial Intelligence, Simulation of
sophisticated & Intelligent Behaviour in different area, problem solving
in games, natural language, automated reasoning, visual perception,
heuristic algorithm versus solution guaranteed algorithms.

Unit –II
Understanding Natural Languages Parsing techniques, context free and
transformational grammars, transition nets, augmented transition nets,
Fillmore’s grammars, Shanks Conceptual Dependency, grammar free
analyzers, sentence generation, and translation.

Unit –III
Knowledge Representation First order predicate calculus, Horn Clauses
, Introduction to PROLOG ,Semantic Nets ,Partitioned Nets , Minskey
frames ,Case Grammar Theory , Production Rules Knowledge Base , The
Interface System, Forward & Backward Deduction.

Unit – IV
Expert System Existing Systems (DENDRAL , MYCIN) ,domain
exploration ,Meta Knowledge , Expertise Transfer, Self Explaining
System

Unit –V
Pattern Recognition Introduction to Pattern Recognition ,Structured
Description , Symbolic Description ,Machine perception , Line Finding
,Interception ,Semantic & Model , Object Identification , Speech
Recognition.Programming Language
Introduction to programming Language ,LISP ,PROLOG
References:
• Char nick “Introduction to Artificial Intelligence”, Addision Wesley
• Rich & Knight, “Artificial Intelligence”
• Winston,”LISP”, Addison Wesley
• Marcellous,”Expert Systems Programming “,PHI
• Elamie,”Artificial Intelligence “, Academic Press
• Lioyed ,”Foundation of Logic Programming “, Springer Verlag
 Digital Image Processing
EC025
Unit - I
Image: Image formation, imaging geometry, perspective and other
transformation, stereo imaging, elements of visual perception.
Digital Image: Sampling and quantization, serial and parallel Image
processing systems.
Unit - II
Signal Processing: Fourier, Walsh-Hadamard, discrete cosine and
Hotelling transforms and their properties, Fileters, Correlators and
Convolvers.
Image enhancement: Contrast modification, Histogram specification,
smoothing, sharpening, frequency domain enhancement, pseudo-color
image enhancement.
Unit - III
Image Restoration: Unconstrained and constrained restoration, Wiener
filter, motion blur removal, geometric and radiometric correction.
Image data compression: Huffman and other codes transform
compression, predictive compression, two-tone image compression, block
coding, run-length coding, contour coding.
Unit - IV
Segmentation techniques: Thresholding approaches. region growing,
relaxation, lines and edge detection approaches, edge linking, supervised
and unsupervised classification techniques, remotely sensed image
analysis and applications.
Unit V
Shape analysis: Gestalt principles, shape number, moment Fourier and
other shape descriptors, skeleton detection, Hough transforms,
topological and textural analysis, shape matching.
Practical applications: Fingerprint classification, signature verification,
text recognition, map understanding, biological cell classification.
References :
*Ganzalez and Wood :Digital Image Processing, Addison Wesley,1993
*Rosenfeld and Kak:Digital Picture Processing vol.I &II,cademic,1982.
*How : Digital Document Processing, Wiley Interscience, 1983.
*Ballard and Brown : Computer Vision , Prentice Hall, 1982.
*Pavlidis:Algo for Graphics and Image Processing,Comp Sc.Press,1982.
*Wayne Niblack : An Intro to Digital Image Processing, Prentice Hall,
1986.
*Milan Sonka,Vaclav Hlavac, Roger Boyle, “Image Processing, Analysis
And Machine Vision” , Vikas
 Computational Geometry
CS042
Unit – I
Historical perspective: complexity notions in classical geometry. Towards
computational geometry, geometric preliminaries, models of
computation.

Unit - II
Geometric searching: point location problems, location of a point in a
planar subdivision, the slab method, the chain method, range - searching
problems.

Unit - III
Convex hulls: problem statement and lower bounds. Graham's scan,
Jarvis's march, quick hull technique, convex hulls in more than one
dimension, extension and applications.

Unit - IV
Proximity: divide and conquer approach, locus approach; the Voronoi
diagram, lower bounds, variants and generalizations. Intersections,
hidden-line and hidden surface problem.

Unit - V
The geometry of rectangles: application of the geometry of rectangles,
measure and perimeter of a union of rectangles, intersection of rectangles
and related problems.

References:

1.F. P. Preparata and M. I. Shamos. Computational Geometry: An

Introduction , Springer
Verlag, 1985
2. Berg, Van, Kreveld, Overmars, Schwarzkopf “ Computational
Geometry:
Algorithms and Applications” Springer 1997.
3. J. O’Rourke “Computational Geometry in C”, Cambridge University
Press.
 VIRTUAL REALITY(CS043)
Unit - I
Introduction to the Course. What is Virtual Reality? Sensing in VR and
VR Hardware. VR Development Languages. VR past, present, and future.
Examples of Virtual Worlds.
Development issues - Development cycle and development tools.
Organizing the code. Scenes and scene graphs. Creating and navigating
the virtual world. Gravity and collision. Geometry, standard units, co-
ordinate systems and transformations. Examples.
Unit - II
Adding user interaction - Events and time, sensors and routes. Examples.
Object oriented nature of VRML programming - Prototypes, nodes,
fields. Structure of a VR Object. Creating Prototypes and
Objects.Interface declaration semantics. Definition semantics. Rules for
mapping. Scoping rules.External prototype semantics.Static and dynamic
instantiation.Eg.
Unit - III
Adding processing capabilities to VR models - Scripting. Script
languages. Script execution. Initialize and shutdown. Events processed.
Scripts with direct outputs. Asynchronous scripts. Event In handling.
Accessing fields and events. Accessing fields and event Outs of the script.
Accessing evenings and event Outs of other VRML nodes. Sending event
Outs. Examples.
Unit - IV
Adding audio-visual effects 1 - Animation and Light. Interpolators.
Common principles. Color interpolator. Scalar Interpolator. Orientation
Interpolator. Position Interpolator. Dynamic scaling. Directional, point,
and spot light. Examples.
Unit – V
Adding audio-visual effects 2 - Texture and Sound. Textures and texture maps.
Application of textures to different geometric objects. Level of Detail. Sound and its
spatial aspect. Examples.Creating VR models with emergent behaviour. Examples.
Using Java with VRML - Scripting in Java. Creating and driving a virtual
world from an external Java code - External Authoring Interface.
Examples.
References:-
1.R.Carey,G.Bell ”The Annotated Vrml 2.0
Reference”AddisonWesley,1997
2. M. McCarthy, A. Descartes “Reality Architecture: Building 3D Worlds
In Java and VRML” Prentice Hall, 1998
3. S. Diehl “Distributed Virtual Worlds: Foundations and Implementation
Techniques Using Vrml, Java, and Corba.” Springer Verlag, 2001.
 MULTIMEDIA SYSTEM(CS044)
Unit - I
Introduction Introduction to Multimedia, Multimedia Objects,
Multimedia in business and work.
Stages of Multimedia Projects Multimedia hardware, Memory &
storage devices, Communication devices, Multimedia software's,
presentation tools, tools for object generations, video, sound, image
capturing, authoring tools, card and page based authoring tools.
Unit - II
Multimedia Building Blocks Text, Sound MIDI, Digital Audio, audio
file formats, MIDI under windows environment Audio & Video Capture.
Unit - III
Data Compression Huffman Coding, Shannon Fano Algorithm, Huffman
Algorithms, Adaptive Coding, Arithmetic Coding Higher Order
Modelling. Finite Context Modelling, Dictionary based Compression,
Sliding Window Compression, LZ77, LZW compression, Compression,
Compression ratio loss less & lossy compression.
Unit - IV
Speech Compression & Synthesis Digital Audio concepts, Sampling
Variables, Loss less compression of sound, loss compression & silence
compression.
Unit - V
Images Multiple monitors, bitmaps, Vector drawing, lossy graphic
compression, image file formatic animations Images standards, JPEG
Compression, Zig Zag Coding
Video Video representation, Colors, Video Compression, MPEG
standards, MHEG Standard recent development in Multimedia.
References:
• Tay Vaughan " Multimedia, Making IT Work" Osborne McGraw
Hill
• Buford " Multimedia Systems " Addison Wesley
• Agrawal & Tiwari " Multimedia Systems " Excel
• Mark Nelson " Data Compression Book" BPB
• David Hillman “Multimedia technology and Applications”
Galgotia Publications.
• Rosch " Multimedia Bible" Sams Publishing.
• Sleinreitz "Multimedia System " Addison Wesley.
• James E Skuman “Multimedia in Action” Vikas
 Real Time System(CS051)
Unit - I
Introduction to real time system, Priorities, Task, Embedded System,
Deadlines, Soft, hard.

Unit - II
Firm Real Time Systems. Introduction to real time Operating Systems,
Case studies of Maruti II, HART OS, VRTX etc.

Unit - III
Characterization Real Time System and Task, Task Assignment &
scheduling Theory, Fixed Priority Scheduling.

Unit - IV
Dynamic scheduling, Real Time Communication, FDDI, Specification
& Verification using Duration Calculus.

Unit - V
Fault Tolerant Real Time System, Clock Synchronization. Issues in
Real Time Software Design.

References:

1. CM Krishna, “Real Time System” McGraw Hill.

2. Levi & Agrawal, “ Real Time System “, McGraw Hill.
3. Mathi Joseph, “Real Time System: Specification, Validation &
Analysis”, PHI.
 PARALLEL ALGORITHM
CS052
Unit – I
Models of computation, Sorting Networks, Prefix Summation.

Unit - II
Sorting on different models, Selection Algorithms.

Unit – III
Parallel combinatorial algorithms: permutations with and without
repetitions combinations, derangements.

Unit – IV
Matrix Operations and their applications.

Unit – V
Parallel graph algorithms: parallel graph search &, tree traversal
algorithms,
Parallel algorithms for connectivity problems, parallel algorithms for path
problems.

References:
• Joseph Jaja., “ An Introduction to Parallel Algorithms” , Addison
Wesley, 1992.
• H. Sparkias and A. Gibbon, “ Lecture notes on Parallel
Computation” ,
Cambridge University Press, 1993.
• K. Hwang and F. A. Briggs, “ Computer Architecture and Parallel
Processing” , McGraw Hill Inc., 1985.
 MOBILE COMPUTING
CS053
Unit – I
Issues in Mobile Computing, Overview of wireless Telephony, IEEE
802.11 & BlueTooth, Wireless Multiple access protocols, channel
Allocation in cellular systems.

Unit – II
Data Management Issues, data replication for mobile computers, adaptive
Clustering for Mobile Wireless networks.
Coda File System, Disconnected operation Mobile computing with Rover
Toolkit.

Unit – III
Distributed location Management, pointer forwarding strategies, Energy
Efficient Indexing on air, Energy Indexing for wireless broadcast data,
Mobile IP, TCP Over wireless.

Unit – IV
Mobile Agents Computing, Security and fault tolerance, transaction
Processing in Mobile computing Environment.

Unit – V
Ad hoc network, Routing Protocol, Global State Routing (GSR),
Dynamic State Routing (DSR), Fisheye State Routing (FSR), Ad hoc On-
Demand Distance Vector (AODV), Destination Sequenced Distance-
Vector Routing (DSDV).

References:
 DATA COMPRESSION
CS054
Unit - I
Introduction:Compression Techniques:- Loss less compression, Lossy
Compression, Measures of performance, Modeling and coding
Mathematical Preliminaries for Lossless compression:-A brief
introduction to information theory: -Models:- Physical models,
Probability models, Markov models, composite source model, Coding:-
uniquely decodable codes, Prefix codes,
Unit - II
Huffman coding:-The Huffman coding algorithm:- Minimum variance
Huffman codes,
Adaptive Huffman coding:- Update procedure, Encoding procedure,
Decoding procedure, Golomb codes, Rice codes, Tunstall codes,
Application of Huffman coding:- Loss less image compression, Text
compression, Audio compression.
Unit - III
Arithmetic coding:- Coding a sequence, Generating a binary code,
Comparison of Binary and Huffman coding, Applications:- Bi –level
image compression-The JBIG standard, JBIG2, Image compression.
Dictionary Techniques:- Introduction, Static Dictionary:- Diagram
Coding,Adaptive Dictionary:- The LZ77 Approach, The LZ78 Approach
Applications:- File Compression-UNIX compress,Image Compression:-
The Graphics Interchange Format(GIF), Compression over modems-
V.42 bis,Predictive Coding:- Prediction with Partial match(ppm):- The
basic algorithm, The ESCAPE SYMBOL, length of context, The
Exclusion Principle, The Burrows-Wheeler Transform:- Move – to –front
coding, CALIC, JPEG-LS, Multiresolution Approaches, Facsimile
Encoding, Dynamic Markov Compression
Unit - IV
Mathematical Preliminaries for Lossy Coding:- Distortion criteria,
Models.
Scalar Quantization:-The Quantization problem, Uniform Quantizer,
Adaptive Quantization, Non uniform Quantization.
Unit - V
Vector Quatization:- Advantages of Vector Quantization over Scalar
Quantization,The Linde-Buzo-Gray Algorithm, Tree structured Vector
Quantizers, Structured Vector Quantizers.

REFERENCES:-
Khalid Sayood, “Introduction to Data Compression”, Morgan Kaufmann
Publishers
CS 851

Distributed System Lab

1. The design and implementation of RMI using Java

2. The design and implementation of a sequencer multicast protocol
using Java
3. The design and implementation of a Task Bag server using CORBA or
Java RMI
4. The use of the Unix interface to UDP sockets to implement a simple
RPC framework in C++
5. Operating systems experiments
6. A prototype for a stateless file server and its cache mechanisms
CS 853
Project

Student will complete the project identified in previous semester(CS751).

Detailed Design , Coding and Implementation of the project should be
done in this semester. At the end of the semester , Student will submit
detail project report and Soft Copy of project work which will be
evaluated by experts from University / Industry