All SemISE Final2

BANGALORE UNIVERSITY
SYLLABUS : 2K11
(Fifth to Eighth Semester)
SCHEME OF STUDY AND EXAMINATIONS
FOR BE DEGREE COURSE IN
INFORMATION SCIENCE AND ENGINEERING
UNIVERSITY VISVESVARAYA COLLEGE OF

ENGINEERING
K.R. CIRCLE, BANGALORE 560 001
INFORMATION SCIENCE AND ENGINEERING
V SEMESTER
Sl.
No
1.
2.
3.
4.
5.
6.
7.
8.
Code
Subject
Database
Management
Systems
2K11CI 52
Operating Systems
2K11CI 53
Computer Networks I
Software Engineering
2K11CI 54
& Testing
2K11CI 55
Computer Graphics
2K11CI 56
Operation Research
Computer
Graphics
2K11CIL 57
Lab
Java
Programming
2K11CIL 58
Lab
Total
2K11CI 51
No. of Hr. / week

Theory
Practical
Duration of Exams
Theory
Practical
Sessional
Marks
Exam
Marks
Total
Marks
04
--
03
--
25
100
125
04
04
---
03
03
---
25
25
100
100
125
125
04
--
03
--
25
100
125
04
04
---
03
03
---
25
25
100
100
125
125
--
03
--
03
25
100
125
--
03
--
03
25
100
125
24
06
18
06
200
800
1000
Sessional
Marks
Exam
Marks
Total
Marks
VI SEMESTER
Sl.
No
1.
2.
3.
4.
5.
6.
7.
8.
Code
Subject
Computer Networks
II
Probability and
2K11CI 62
Stochastic
Processes
2K11CI 63
System Software
Unix/Linux System
2K11CI 64
Programming
Data Compression
2K11IS 65
Techniques
2K11CI 66
Data Mining
Unix/Linux System
2K11CIL 67
Programming Lab+
System software Lab
Database
2K11CIL 68
Management
Systems Lab
Total
2K11CI 61
No. of Hr. / week
Duration of
Exams
Theory
Practical
Theory
Practical
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
--
25
100
125
--
03
--
03
25
100
125
--
03
--
03
25
100
125
24
06
18
06
200
800
1000
VII SEMESTER
Sl.
No
Code No.
1.
2K11IS 71
2.
2K11CI 72
3.
2K11CI 73
4.
5.
2K11CI 74
2K11CIL75
6.
2K11CIL76
7.
2K11CIL77
Subject
Simulation and
Modeling
Soft Computing
Cryptography and
Network Security
Elective I
Networking Lab
Internet Programming
Lab
Project Work
(Preliminary)
Total
No. of Hr. / week
Duration of
Exams
Theory
Practical
Sessional
Marks
Exam
Marks
Total
Marks
Theory
Practical
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
25
100
125
04
--
-03
03
--
-03
25
25
100
100
125
125
--
03
--
03
25
100
125
--
03
--
--
50
--
50
16
09
12
06
200
600
800
Sessional
Marks
Exam
Marks
Total
Marks
VIII SEMESTER
Sl.
No
1
2
3
4
5
6
Code
Subject
No. of Hrs /Week
Duration of Exam
Theory
Practical
Theory
Practical
2K11CI81
04
--
03
--
25
100
125
2K11CI82
04
--
03
--
25
100
125
04
---
03
--
25
100
125
04
--16
03
03
06
03
--12
-03
03
06
25
50
50
200
100
100
100
600
125
150
150
800
Compiler Design
Distributed
Operating System
Digital Image
2K11IS83
Processing
2K11CI84
Elective II
2K11CIL85
C# .NET Lab
2K11CIL86
Project Work
Total
VII SEMESTER (Elective-I)

Sl.
No
Code
1.
2K11IS 74.1
2.
2K11IS74.2
3.
2K11IS74.3
Subject
No. of Hr. / week
Artificial
Intelligence and
Machine Learning
Multimedia
Computing
Advanced
Computer
Architecture
Duration of
Exams
Practical
Theory
Sessional
Marks
Exam
Marks
Total
Marks
Theory
Practical
04
--
03
--
25
100
125
04
--
03
--
25
100
125
04
--
03
--
25
100
125
VIII SEMESTER (Elective-II)

Sl.
No
Code
2K11CI84.1
2
3
4
2K11CI84.2
2K11IS84.3
2K11CI84.4
Subject
Theory
Wireless Sensor
Networks
Storage Networks
Advanced Algorithms
Robotics
No. of Hours
Theory
Duration of Exam
Theor Theory
Practical
IA
Marks
Exam
Marks
Total
Marks
Practical
04
---
03
--
25
100
125
04
04
04
-------
03
03
03
----
25
25
25
100
100
100
125
125
125
BE V SEMESTER INFORMATION SCIENCE AND ENGINEERING

2K11CI 51: DATABASE MANAGEMENT SYSTEMS
Note:
FOUR questions from PART A and FOUR questions from PART B to be set.
Students should answer FIVE questions selecting atleast TWO from each PART.
For every SIX hours of syllabus ONE question may be set.
Hours per Week: 4
Examination Marks: 100
Sessional Marks: 25
PART A
Chapter 1: Introduction to DBMS
6 Hours
Introduction to DBMS with Examples, File System Vs DBMS, People who deal with
databases, Intended uses of a DBMS, Implications of the Database Approach. Data models,
Schemas and instances, DBMS Architecture and data independence, Database languages
and Interfaces, The database system environment, Classification of Database Management
Systems.
Chapter 2: Conceptual Design and the ER Models
6 Hours
Overview of Database design, ER model concepts, Notation for ER diagrams, Proper naming of
schema constructs, Examples.
Chapter 3: Relational Model and Relational Algebra
6 Hours
Relational model concepts, Constraints, Update operations on Relations and dealing with
constraints violations, Relational Algebra, Relational algebra operations and Queries in the
Relational Algebra, Mapping ER model to Relations.
Chapter 4: SQL
6 Hours
SQL Standards, SQL92; Data definition, Queries, Update statements, Views and Assertions in
SQL.
PART B
Chapter 5: Database Design
6 Hours
Informal design guidelines for Relational Schemas, Functional dependencies, Normal Forms
based on primary keys, Generalized definitions of 2NF and 3NF; BCNF, Algorithms for
Relational Database Schema design, Multi-valued Dependencies and 4NF.Join dependencies
and 5NF.Inclusion dependencies, Template dependencies, DKNF.
Chapter 6: Record Storage and Primary File Organization
6 Hours
Introduction, Secondary storage devices, RAID Technology, Buffering blocks, Heap and sorted
Files, Hashing Techniques, Index Types of Index, Single level, multi-level and Multiple key
indexes.
Chapter 7: Examples of Commercial Database Systems

6 Hours
ORACLE: Architecture, Languages and interfaces, Embedded SQL. MS ACCESS: Architecture,
Overview of the features.
Chapter 8: Emerging Technologies
6 Hours
Data Warehousing, Data mining, WWW databases, Text and Digital library data bases,
Multimedia databases, Parallel databases, Mobile databases.
References :
1. Elmasri and Navathe, Fundamentals of Database Systems, Fourth Edition, Addison
Wesley, 2006.
2. Raghu Ramakrishnan, Database Management Systems, McGraw Hill, Thrid Edition,
2003.
3. Peter Rob and Carlos Coronel, Database Systems: Design, Implementation, and
Management, Fifth Edition, Thomson learning, 2006.
4. Abraham Silberschatz, Henry F Korth and S Sudarshan ,Database System Concepts,
Sixth Edition, 2010.
2K11CI 52 : OPERATING SYSTEMS

Note:
Hours per week : 4
Examination Marks : 100
Sessional Marks : 25
PART A
Chapter 1 : Introduction
6 Hours
Batch Systems, Concepts of multi programming and time-sharing, parallel, distributed and real time systems. Operating system structures - operating system components and services.
System calls and system programs. Virtual machines.
Chapter 2 : Process Synchronization
6 Hours
Introduction to Process concept, The critical section problem, synchronization hardware,
semaphores, classical problems of synchronization, critical regions and monitors.
Chapter 3 : Process Management
6 Hours
Process scheduling, cooperating processes, threads and interprocess communication. CPU
scheduling - scheduling criteria, scheduling algorithms, multiple- processor scheduling and realtime scheduling. Algorithm evaluation.
Chapter 4 : Dead Locks
6 Hours
Deadlocks - system model, characterization, Deadlock prevention, avoidance and detection.
Recovery from dead lock. Combined approach.
PART B
Chapter 5 : Storage Management
6 Hours
Memory management - logical and physical address space, swapping, contiguous allocation,
paging and segmentation. Segmentation with paging in MULTICS and Intel 386. Virtual
Memory - Demanding paging and its performance. Page replacement algorithms. Allocation of
frames. Thrashing. Page size and other considerations. Demand segmentation.
Chapter 6 : File systems and Disk management
6 Hours
File systems, Secondary Storage Structure, Protection and Security-File concept, access
methods, directory structure, protection and consistency semantics. File system structure,
allocation methods. Free space management. Directory implementation. Efficiency and
performance. Recovery. Disk structure, disk scheduling methods. Disk management. Swapspace management. Disk reliability.
Chapter 7 : Protection and Security
6 Hours
Protection - Goals of protection, domain of protection. Access matrix and its implementation.
Revocation of access. Security - Authentication, passwords. Threats and threat monitoring.
Encryption. Computer security classifications.
Chapter 8 : Case Study
6 Hours
Windows NT, LINUX, Design principles, system components, environmental subsystems. File
system, networking and programmer interface.
References:
1. Silberschatz and Galvin, Operating System Concepts, Fifth Edition, Addision-Wesley,
1997.
2. Milan Milancovic, Operating Systems, Concepts and Design. Second Edition,
McGrawHill, 2004.
3. Harvey M Deital, Operating Systems, Third Edition, Addision-Wesley, 2000.
4. Dhananjaya M Dhamdhere, Operating Systems, Science Engineering & Math, 2008.
2K11CI 53 : COMPUTER NETWORKS I

Note:
Hours per Week : 4
Examination Marks 100
PART A
Chapter 1 : Introduction Data, Signals and Digital Transmission
6 Hours
Data Communications; Networks; the Internet; Protocols and Standards; Layered tasks; The
OSI Model and the layers in the OSI model; TCP / IP Protocol Suite. Analog and digital signals;
Transmission impairment; Data rate limits; Performance; Digital-to-Digital conversion; Analogto-Digital conversion; Transmission modes.
Chapter 2 : Analog Transmission and Multiplexing
6 Hours
Digital - to - Analog conversion; Analog - to - Analog conversion; Multiplexing; Spread spectrum.
Chapter 3 : Transmission Media, Error Detection and Correction

6 Hours
Twisted pair cable, Coaxial cable, Fiber-Optic cable, Radio waves, Microwaves, Infrared.
Introduction to error detection / correction; Block coding; linear block codes; Cyclic codes,
Checksum.
Chapter 4 : Data Link Control
6 Hours
Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC; Pointto-point Protocol - framing, transition phases, ALOHA, CSMA, CSMA/CD.
PART B
Chapter 5 : Multiple Access, Ethernet
6 Hours
Random Access; Controlled Access; Channelization. Ethernet: IEEE standards; Standard
Ethernet IEEE 802.3 and changes in the standard; Fast Ethernet; Gigabit Ethernet.
Chapter 6 : Wireless LANS and Connection of LANS
6 Hours
IEEE 802.11; Bluetooth IEEE 802.16, Wireless Broadband IEEE 802.15. Connecting devices;
Backbone Networks; Virtual LANs, CSMA/CA.
Chapter 7 : Interconnecting Devices
6 Hours
Cellular telephony; Introduction to 2G, 3G, 4G and 5G.Switching: 2X2 Switch, Crossbar Switch,
ButterflySwitch, Banniyan Switch. WDM, DWDM. Bridges: Working of Bridges, Wireless
Bridges, Transparent Bridges.
Chapter 8 : Introduction to Network Layer
6 Hours
Introduction to Routing, Different network topologies and their characteristics, Introduction to
Router, Routing tables.
References:
1. Data Communications and Networking Behrouz A. Forouzan, Fourth Edition, Tata
McGraw-Hill, 2006.
2. Communication Networks: Fundamental Concepts and Key Architectures - Alberto Leon,
Garcia and Indra Widjaja,Third Edition, Tata McGraw- Hill, 2004.
3. Data and Computer Communication, William Stallings, Eighth Edition, Pearson
Education, 2007.
4. Computer Networks: A Systems Approach - Larry L. Peterson and Bruce S. David,
Fourth Edition, Elsevier, 2007.
5. Introduction to Data Communications and Networking Wayne Tomasi, Pearson
Education, 2005.
6. Computer and Communication Networks Nader F. Mir, Pearson Education, 2007.
7. Computer Networks , Andrew S.Tanenbaum, Fourth Edition, Prentice Hall PTR, 2007.
2K11CI 54 : SOFTWARE ENGINEERING & TESTING
Note:
Hours per Week : 4
PART A
Chapter 1: Introduction & System Engineering
6 Hours
FAQs about software engineering, Professional and ethical responsibility, Emergent system
properties, Systems and their environment, System Modeling, The system engineering process,
System procurement.
Chapter 2: Software Process
6 Hours
Software process models, Process iteration, Software specification, Software design and
implementation, Software validation, Software evolution, Automated process support.
Chapter 3: Software Project Management
8 Hours
Management activities, Project planning, Project scheduling, Risk management, Limits to
thinking, Group working Choosing and keeping people, Software Cost Estimation, Productivity,
Estimation techniques, Algorithmic cost Modeling, Project duration and staffing, Quality
assurance and standards, Quality planning, Quality control, Software measurement and metrics.
Chapter 4: Software Requirement Engineering
4 Hours
Software Requirements, Functional and non-functional requirements, User requirements ,
System requirements, The software requirements document, Requirements Engineering
Processes, Feasibility studies, Requirements elicitation and analysis , Requirements validation ,
Requirements management.
PART B
Chapter 5 :Software Testing
6 Hours
The Six Essentials of Software Testing : The State of the art and state of the practice. The clean
sheet approach to getting started, Establishing a practical perspective, critical choices : What,
When and how to test Risk and Risk Management, Start testing early, Basic forms of the
testing process, Testing the development cycle and the real world of contracts, Effective and
cost effective testing. Critical Disciplines : Frameworks for Testing Planning, Software
Engineering Maturity and the SEI, Configuration Management, Standards, Formal Documents,
Testware, Measurement, Tools.
Chapter 6 : Testing Methods
6 Hours
Verification Testing : Basic verification methods, getting leverage on verification, verifying
documents at different phases, getting the best from verification, three critical success factors
for implementing verification, recommendation. Validation Testing : Validation overview,
Validation Methods, Validation Activities, Recommendation Strategies for Validation Testing.
Controlling Validation Costs: Minimizing the cost performing tests, Minimizing the cost of
maintaining the tests, Minimizing validation testware development costs, Recommendations.
Chapter 7: Testing Tasks
6 Hours
Testing Tasks, Deliverables and Chronology : Master test planning, verification testing tasks
and deliverables, Validation testing tasks and deliverables, A testing orphan User manuals,
Product release criteria, Summary of IEEE/ANSI test related documents. Software Testing
Tools : Categorizing testing tools, Tool acquisition. Measurements : Useful and other interesting
measures, Recommendations.
Chapter 8 : Managing Testing Technology
6 Hours
Organizational Approaches to Testing : Organizing and Reorganizing Testing, Structural Design
Elements, Approaches to organizing the test functions, Selecting the right approach. Current
Practices, Trends, Challenges: GUIs: What is new here, Usage testing, tester to developer
ratios, Software measures and practices benchmark study. Getting Sustainable Gains in Place:
Getting gains to happen, Getting Help, Follow up, Verification Check Lists.
References:
1. Ian Sommerville, Software Engineering, Pearson Education, Seventh Edition, 2004.
2. Pressman R.S, Software Engineering, McGraw Hill, Seventh Edition, 2010.
3. Jalote P., An integrated approach to Software Engineering, Narosa.2005.
4. Ed Kit : Software Testing in the Real World, Addison Wesley,1995.
5. William Perry : Effective Methods for Software Testing, Third Edition, John Wiely,2006.
6. Bezier B : Software Testing Techniques, Second Edition, Van Nstrand Reinluold, 1990.
10
2K11CI 55 : COMPUTER GRAPHICS

Note:
Hours per Week : 4
PART A
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.
Chapter 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.
Chapter 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.
Chapter 4 : Geometric Objects and Transformations-I

6 Hours
Scalars, Points, and Vectors; Three-dimensional Primitives; Coordinate Systems and Frames;
Modeling a Colored Cube; Affine Transformations; Rotation, Translation and Scaling;
PART B
Chapter 5 : Geometric Objects and Transformations-II
6 Hours
Geometric Objects and Transformations; Transformation in Homogeneous Coordinates;
Concatenation of Transformations; OpenGL Transformation Matrices; Interfaces to three
dimensional applications; Quaternions.
Chapter 6 : Viewing
6 Hours
Classical and computer viewing; Viewing with a Computer; Positioning of the camera; Simple
projections; Projections in OpenGL; Hidden surface removal; Interactive Mesh Displays;
Parallel-projection matrices; Perspective-projection matrices; Projections and Shadows.
Chapter 7 : Lighting and Shading
6 Hours
Light and Matter; Light Sources; The Phong Lighting model; Computation of vectors; Polygonal
Shading; Approximation of a sphere by recursive subdivisions; Light sources in OpenGL;
Specification of materials in OpenGL; Shading of the sphere model; Global Illumination.
11
Chapter 8 : Implementation
6 Hours
Basic Implementation Strategies; Four 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.
References :
1. Edward Angel: Interactive Computer Graphics A Top-Down Approach with OpenGL,
Fifth Edition, Pearson Education, 2008.
2. Donald Hearn and Pauline Baker: Computer Graphics- OpenGL Version, Third Edition,
Pearson Education, 2004.
3. F.S. Hill Jr.: Computer Graphics Using OpenGL, Third Edition, PHI, 2009.
4. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes, Computer
Graphics, Pearson Education 1997.
2K11CI 56 : OPERATION RESEARCH
Note:
Hours per week: 4
Sessional Marks: 25
PART A
4 Hours
Introduction: The origin, nature and impact of OR; Defining the problem and gathering data;
Formulating a mathematical model; Deriving solutions from the model; Testing the model;
Preparing to apply the model; Implementation.
Chapter 2 : Linear Programming
6 Hours
Introduction to: Prototype example; The linear programming (LP) model. Assumptions of LP;
Additional examples.
Chapter 3 : Simplex Method
8 Hours
The essence of the simplex method; Setting up the simplex method; Algebra of the simplex
method; the simplex method in tabular form; Tie breaking in the simplex method. Adapting to
other model forms; Post optimality analysis; Computer implementation Foundation of the
simplex method. The revised simplex method, a fundamental insight.
Chapter 4 : Duality Theory and Sensitivity Analysis
8 Hours
The essence of duality theory; Economic interpretation of duality, Primal dual relationship;
Adapting to other primal forms. The role of duality in sensitive analysis, The essence of
sensitivity analysis; Applying sensitivity analysis. The dual simplex method; Parametric linear
programming; The upper bound technique.
12
PART B
Chapter 5: Transportation
6 Hours
The transportation problem; A streamlined simplex method for the transportation problem. The
assignment problem, A special algorithm for the assignment problem.
Chapter 6 : Assignment Problems and Game Theory
6 Hours
Game Theory: The formulation of two persons, zero sum games; Solving simple games- a
prototype example; Games with mixed strategies; Graphical solution procedure.
Chapter 7 : Decision Analysis
6 Hours
Solving by linear programming, Extensions. Decision Analysis: A prototype example; Decision
making without experimentation; Decision making with experimentation; Decision trees.
Chapter 8 : Metaheuristics
6 Hours
The nature of Metaheuristics, Tabu Search, Simulated Annealing, Genetic Algorithms
References :
1. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research:
Concepts and Cases, Eighth Edition, Tata McGraw Hill, 2005.
2. Wayne L. Winston: Operations Research Applications and Algorithms, Fourth Edition,
Cengage Learning, 2003.
3. Hamdy A Taha: Operations Research: An Introduction, Eighth Edition, Pearson
Education, 2007.
4. S. D. Sharma : Operations Research, Kedarnath Ramnath & Co, 2002.
5. Prem Kumar Gupta, D S Hira : Operations Research, S Chand Pub, New Delhi, 2007.
6. Sharma J K : Operations Research: Theory and Applications, Fourth Edition, Macmilan,
2010.
13
2K11CIL 57 : COMPUTER GRAPHICS LABORATARY

(Regular Laboratory with Mini Project)
Hours per week : 3
PART A
In this laboratory the students has to write and execute programs in C/C++ like
1. Program to recursively subdivide a tetrahedron to from 3D Sierpinski gasket. The number of
recursive steps is to be specified by the user.
2. Program to implement Liang-Barsky line clipping algorithm.
3. Program to draw a color cube and spin it using OpenGL transformation matrices.
4. Program to create a house like figure and rotate it about a given fixed point using OpenGL
functions.
5. 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. 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
7. Program, using OpenGL functions, to draw a simple shaded scene consisting of a tea pot on
a table. Define suitably the position and properties of the light source along with the
properties of the surfaces of the solid object used in the scene.
8. Program to draw a color cube and allow the user to move the camera suitably to experiment
with perspective viewing. Use OpenGL functions.
9. Program to fill any given polygon using scan-line area filling algorithm. (Use appropriate
data structures.)
10. Program to display a set of values { fij } as a rectangular mesh.
PART B
Develop a suitable Graphics package to implement the skills learnt in the theory and the
exercises indicated in PART A using OpenGL.
Note:
Any one question from PART A may be asked in the examination.
A report of about 10 12 pages on the package developed in PART B, duly certified by the
department must be submitted during examination.
14
2K11CIL 58 : JAVA PROGRAMMING LABORATORY

(Regular Laboratory)
Hours per Week : 3
1. Program to implement Stack operations ( push, pop and Display).

2. Program to print all the solutions of a quadratic equation.
3. Program to read students name, regno, marks and display the student details with total
marks, using single and multilevel inheritance.
4. a)Program to implement Queue operations ( insert, delete and display).
b)Program to read two integers, perform division of two numbers, display the result with
appropriate messages using the concept of Exception Handling.
5. Implement different String Operations(strcpy, strlength, strcat, strcmp, str.charAt(i))
using method overloading.
6. Program to multiply given two matrices of size mxn.
7. a)Program to count the frequency of words. (using String Tokenizer)
b)Program to read N values using an array and sort them using Bubble Sort.
8. Program to perform addition, subtraction, division and multiplication of complex
numbers. (use method overloading)
9. Program to find the values of unknowns in the polynomial degree of n.
10. Program to create threads A,B and C for three different tasks using Thread class with a
thread for main method.
11. Program to overload the function search() to search an integer key value and key value
of type double using Binary Search.
12. Applet program that automatically display the text with Font style, Font type using
getParameter(), getCodeBase() and getDocumentBase().
13. Create two classes Teacher and Student. Perform interfacing of classes with
appropriate attributes.
14. Develop an Applet that receives an integer in one text field and computes its factorial
value and returns it in another text field, when the button named computes is clicked.
Note: The evaluation is based on any one program from the list of programs.
15
BE VI SEMESTER INFROMATION SCIENCE AND ENGINEERING
2K11CI 61 : COMPUTER NETWORKS II

Note :
FOUR questions from PART A and FOUR questions from PART B to be set
Hours per week : 4
PART A
Chapter 1: Network Layer
6 Hours
Network layer design issues: Store-and-forward packet switching, Services provided to the
transport layer , Implementation of Connectionless service, Implementation of connectionoriented service, Comparison of virtual-circuit and Datagram subnets. Network topologies.
Chapter 2 : Network Layer
6 Hours
Routing algorithms: Principles ofrouting algorithms, static routing, dynamic routing, flow based
routing, Dijkstra routing, link state routing, hierarchical routing, Broadcast routing, Multicast
routing,Routing in Mobile hosts: Routing in Ad-Hoc networks-AODV, DSR, Routing in Sensor
networks- Leach, SPIN, Zigbee Protocol, IEEE 802.15.4;Label switching and MPLS.
Chapter3: Network Layer
6 Hours
Congestion control algorithms:General principles of congestion control, congestion
prevention policies, congestion control in virtual-circuit subnets, congestion control in datagram
subnets- Warning bit, Choke packets, Hop-by-Hop choke packets, Load shedding, Random
early detection, Jitter control.
Techniques for achieving good quality of service: Overprovisioning, Buffering, Traffic
shaping,Leaky Bucket algorithm, Token Bucket algorithm, Resource Reservation-Admission
control, Proportional routing, Packet scheduling,
Chapter4: Internetworking
6 Hours
Concatenated virtual circuits, Connectionless internetworking, Tunneling, Fragmentation. IP
Addresses, CIDR, NAT, Internet Protocols-ICMP, ARP, RARP, BOOTP, DHCP, OSPF, BGP,
Internet Multicasting, IPv4, IPv6.
PART B
Chapter 5 : Transport Layer
6 Hours
The transport services: Services provided to the upper layers, Transport service primitives,
Berkeley Sockets. Elements of transport protocols: Addressing, Connection Establishment,
Connection release, Flow control and Buffering, Multiplexing, Crash Recovery. TCP: TCP
Header, TCP Connection Establishing and Releasing, TCP transmission policy, TCP timer
management.
16
Chapter 6 : Transport Layer

6 Hours
UDP header, Integrated services, Differentiated services, QOS, Virtual Private Networks(VPNs),
Overlay Networks.
Chapter 7 :Network Security
6 Hours
Overview, General principles of network security algorithms, Private Key, Public Key, General
concepts of RSA, DES, Triple DES, Diffie-Hellman Key Exchange.
Chapter 8 :Application Layer
6 Hours
Domain Name System :The DNS name space, Resource space, Resource records and Name
servers,Electronic Mail: Architecture and Services, The User Agent, Message Formats,
Message Transfer, Final Delivery,Multimedia: VOIP, Video on Demand, MBone(Multicast
Backbone), Compression Techniques-MPEG-7, JPEG; HTTP, SNMP,MIB, SMTP.
References :
1. A S Tanenbaum, Computer Networks, Fourth Edition, PHI, 2002.
2. W Stallings, Data and Computer Communications, Fifth Edition, PHI, 2012.
3. S Keshav, An Engineering Approach to Computer Networking, Addison-Wesely, 1997.
4. Stevens, UNIX Network Programming, PHI, 2001.
5. B A Forouzan and D M Mukhopadhyay, Cryptography and Network Security, Second
Edition, McGraw Hill, 2004.
6. James F Kurose, Keith W Ross, Computer Networking: A Top-Down Approach, Edition,
2005.
2K11CI 62 : PROBABILITY AND STOCHASTIC PROCESS

Note :
FOUR questions from PART A and FOUR questions from PART B to be set
Hours per Week : 4
PART A
Chapter 1: Introduction
6 Hours
Probability Models, Sample Space, Events, Algebra of Events, Graphical Methods of
Representing Events, Probability Axioms, Combinatorial Problems, Conditional Probability,
Independence of Events, Bayes Rule, Bernoulli Trials
Chapter 2 : Random Variables
6 Hours
Random Variables and their event spaces, PMF, Distribution functions, Probability generating
function, exponential distribution, reliability, failure density, and hazard function.
Chapter 3: Expectation
6 Hours
Moments, Expectation of Functions, Transform Methods, Moments and Transforms of Some
Important distributions, computation of mean time to failure.
17
Chapter 4 : Conditional Distribution and Expectation

6 Hours
Mixture distributions, conditional expectations, Imperfect fault coverage and reliability, random
sums.
PART B
Chapter 5 : Stochastic Processes
6 Hours
Classification of Stochastic Processes, The Poisson Process, Renewal Process, Availability

Analysis, Random Incidence, Renewal Model of Program Behavior
Chapter 6 : Markov Chains
6 Hours
Discrete Parameter Markov Chains, Computation of n-step probabilities, state classification and
limiting distributions, distribution of times between state changes, Irreducible finite chains with
aperiodic states, M/G/1 queuing system, discrete parameter birth death processes.
Chapter 7 : Markov Chains
6 Hours
Continuous parameter markov chains birth and death process, non-birth-death process,
markov chains with absorbing states.
Chapter 8 : Network of Queues
6 Hours
Open queuing Networks, Closed Queuing Networks, Non exponential service time distributions
and multiple job types, non product form networks.
References:
1. K S Trivedi, Probability & Statistics with Reliability, Queuing, and Computer Science
Applications, PHI, Second Edition, 2001.
2. Sheldon M Ross, Introduction to Probability Models, Elsevier Press, Tenth Edition, 2009.
3. Paul J Fortier and Howard E Michel, Computer Systems Performance Evaluation and
Prediction, Elsevier Press, First Edition, 2003.
4. A Papoulis and S UnnikrishnaPillai, Probability, Random Variables and Stochastic
Processes, McGrawHill, Fourth Edition, 2002.
5. Richard A Johnson, Probability and Statistics for Engineers, Pearson Education,
Seventh Edition, 2007.
18
2K11CI 63: SYSTEM SOFTWARE
Note :
Students should answer FIVE question selecting atleast TWO from each PART.
Hours per week : 4
PART A
Chapter 1 : Machine Architecture
6 Hours
Introduction, System software and machine architecture, Simplified Instructional Computers
(SIC), SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples.
Chapter 2 : Assemblers-1
6 Hours
Machine Independent Assembler Features A Simpler SIC Assembler, Assembler Algorithm
and Data Structures, Machine Dependent Assembler Features - Instruction Formats &
Addressing Modes, Program Relocation.
Chapter 3 : Assemblers-2
6 Hours
Machine Independent Assembler Features Literals, Symbol-Definition Statements,

Expressions, Program Blocks, Control Sections and Programming Linking, Assembler Design
Operations One Pass Assembler, Multi-Pass Assembler, Implementation Examples MASM
Assembler.
Chapter 4 : Loaders And Linkers
6 Hours
Basic Loader Functions Design of an Absolute Loader, A Simple Bootstrap Loader, MachineDependent Loader Features Relocation, Program Linking, Algorithm and Data Structures for a
Linking Loader; Machine-Independent Loader Features- Automatic Library Search, Loader
Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders,
Implementation Examples, MS_DOS Linker.
PART B
Chapter 5 :Editors And Debugging Systems
6 Hours
Text Editors Overview of Editing Process, User Interface, Editor Structure, Interactive
Debugging Systems Debugging Functions and Capabilities, Relationship With Other parts of
the System, User-Interface Criteria.
Chapter 6 : Macro Processor 1
6 Hours
Basic Macro Processor Functions - Macro Definition and Expansion, Macro Processor Algorithm
and Data Structures, Machine-Independent Macro Processor Features - Concatenation of
Macro Parameters, Generation of Unique Labels.
19
Chapter 7 : Macro Processor 2

6 Hours
Conditional - Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options
Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within
Language Translators, Implementation Examples MASN Macro Processor, ANSI C Macro
Processor.
Chapter 8 : LEX And YACC
6 Hours
Lex And Yacc The Simple Lex Program, Counting Words, And Lines, Symbol Tables,
Grammars, A YACC Parser, The Definition Section, The Rules Section, Symbol, Symbol Values
and Actions, Parsing a Command Line, Compiling and Running a Simple LEX and YACC.
References:
1. System Programming and Operating Systems D.M.Dhamdhere, Second Edition, Tata
McGraw Hill,1999
2. System Software - Leland L Beck, System Software, Third Edition, Addison-Wesley,
1997.
3. Lex and Yacc John.R.Levine, Mason and Doug Brown, OReilly, SPD, 1998.
2K11CI 64 : UNIX/LINUX SYSTEM PROGRAMMING
Note:
Hours per Week : 4
Sessional Marks 25
PART A
6 Hours
Unix and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference
between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open
Standard. UNIX and POSIX APIs: The POSIX APIs. The UNIX and POSIX Development
Environment, API Common Characteristics.
Chapter 2 : UNIX Files-1
6 Hours
File Types, The UNIX and POSIX File System. The UNIX and POSIX File Attributes, Inodes in
UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files,
Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic
Links.
Chapter 3 : UNIX Files-2
6 Hours
UNIX File APIs: General File APIs, File and Record Locking, Directory File APIs, Device File
APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular
Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File
Class, File Listing Program.
20
Chapter 4 :UNIX Processes

6 Hours
The Environment of a UNIX Process: Introduction, main function, Process termination,
Command-line arguments, Environment List, Memory layout of a C Program, Shared Libraries,
Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit
Functions, UNIX Kernel Support for Processes.
PART B
Chapter 5: Process Control
6 Hours
Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, wait3, wait4 Functions, Race
Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, System
Function, Process Accounting, User Identification, Process Times, I/O Redirection.
Chapter 6 : Process Relationships
6 Hours
Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal,
tcgetpgrp and tcsetpgrp Functions, Job Control, Shell Execution of Programs, Orphaned
Process Groups.
Chapter 7 : Signals and Daemons
6 Hours
Signals: The Unix Kernel Support for Signals, Signal, Signal Mask, Sigaction, The SIGCHLD
Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval
Timers, POSIX.1b, Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding
Rules, Error Logging, Client Server Model.
Chapter 8 : Inter Process Communication
6 Hours
Interprocess Communication: Overview of IPC Methods, Pipes, popen, pclose Functions,
Coprocesses, FIFOs, System V IPC, Message Queues, Semaphores, Shared Memory, Client
Server Properties, Stream Pipes, Passing File Descriptors, An Open Server Version 1, Client
Server Connection Functions.
References :
1. Terrence Chan: Unix System Programming Using C++, PHI, 1999.
2. W Richard Stevens: Advanced Programming in the Unix Environment, AddisonWesley/PHI, 2005.
3. Maurice J Bach: The Design of the Unix Operating System, PHI, 1986.
4. Uresh Vahalia: Unix Internals, Pearson Education, 1996.
21
2K11 IS 65 : DATA COMPRESSION TECHNIQUES

Note :
Hours per Week : 4
Sessional Marks 25
PART A
6 Hours
Compression Techniques: Loseless Compression, Lossy Compression, Measures of
Performance, Modeling and Coding. Mathematical Preliminaries : Overview, Introduction to
Information Theory, Models : Physical Models, Probability Models, Markov Models.
Chapter 2 : Huffman Coding
6 Hours
Good Codes, Huffman Coding Algorithm: Minimum Variance Huffman Codes, Length of
Huffman Codes, Extended Huffman Codes, Non Binary Huffman Codes, Adaptive Huffman
Codes, Applications.
Chapter 3 : Arithmetic Codes
6 Hours
Overview, Coding a Sequence, Generating a Binary Code, Comparison of Huffman and
Arithmetic Coding Applications.
Chapter 4 : Lossless Image Compression
6 Hours
Introduction, Facsimile Encoding, Run Length Encoding, Progressive Image Transmission,
Other Approaches.
PART B
Chapter 5 : Vector Quantization
6 Hours
Introduction, Advantages, LBG Algorithm, Empty Cell Problem, Tree Structured Vector
Quantizer, Other Vector Quantization Schemes.
Chapter 6 : Differential Coding
6 Hours
Overview, Introduction, Basic Algorithm, DPCM, ADPCM, Delta Modulation, CFDM, Speech
Coding.
Chapter 7 : Transform Coding
6 Hours
Introduction, KL Transform, DCT, DST, Quantization & Coding of Transform Coefficient,
Application of Image Compression-JPEG. Different transforms, Quantization and Coding of
transforms, Application to Image Compression. Wavelet transforms and data compression,
Transform coding, DTWT for image compression, Audio compression, video coding using multi
resolution techniques.
Chapter 8 : Compression Methods
6 Hours
Introduction, Wavelet based Compression, wavelets, Image Compression, Video Compression;
MPEG-I Video Standard, H.262, HDTV.
22
References :
1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann Publishers,
Second Edition, 2000.
2. Ralf Steinmetz and KlaraNahrstedt, Multimedia Computing and Communication and
Applications, PHI, 1995.
2K11CI 66 : DATA MINING

Note :
Hours per Week : 4
PART A
6 Hours
Importance of Data Mining, Data Mining Functionalities, Different kinds of Data, Classification
of Data Mining Systems, Primitives, Major Issues and challenges in Data Mining.
Chapter 2: Data Preprocessing
6 Hours
Descriptive Data Summarization, Data Cleaning, Data Integration and Transformation, Data
Reduction, Data Discretization and Concept Hierarchy Generation.
Chapter 3: Classification and Prediction

6 Hours
Supervised and unsupervised learning, Definition of classification, Issues in Classification,
Decision Tree Induction, Bayesian classification, Rule Based Classification, K-nearest neighbor
method, Prediction using Linear and Non-linear Regression, Classification Accuracy and Error
Measures.
Chapter 4: Clustering
6 Hours
Types of Data in Cluster Analysis, Classification of clustering methods, K-means and KMethods Algorithms, BIRCH, DBSCAN, STING, Expectation-Maximization and Outlier Analysis.
PART B
Chapter 5: Association Rule Mining-1
6 Hours
Basic concepts, Classification of Association Rules, Apriori Algorithms, Multilevel Association
rules, FP Tree, Categorical Association Rules, Multidimensional Association Rules.
Chapter 6: Association Rule Mining-2
6 Hours
Mining Frequent closed Itemsets, Metarule-guided Association Rules, Constraint Based
Association Rules.
23
Chapter 7: Data Warehouse and OLAP Technology

6 Hours
OLAP and OLTP, Data Ware house Model, Star Schema and Show flake Schema, Dataware
Architecture, Data ware house Implementation, Data Cube Computation.
Chapter 8: Big Data
6 Hours
Basic concepts of Big data, Four dimensions of Big Data: Volume, Velocity, Variety and
Veracity. Introduction to storage, Map Reduce and Query Stack. Overview of Big Data Stores,
Processing of Big Data. Overview of tools and techniques to analyze Big Data.
References :
1. Jiawei Han and Micheline Kamber, Data Mining, Concepts and Techniques,
Elsevier,Second Edition, 2001.
2. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Data Mining Algorithms, 2005.
3. Big Data Now, OREILLY Media, First Edition, 2012.
4. David Hand, Heikki Mannila, Padhraic Smyth, Principles of Data Mining, PHI, 2001.
5. Margaret H Dunham, Data Mining Introductory and Advanced Topics, Pearson
Education, 2008.
2K11CIL 67: LINUX/UNIX PROGRAMMING LABORATORY AND SYSTEM SOFTWARE

LABORATORY(Regular laboratory)
Hours per Week : 3
UNIX / LINUX PROGRAMS

1. A) shell script that accepts any number of non recursive arguments and print them in
reverse order
B) C program to create child process to read commands from standard input and
execute them
2. A) C program to create file with 16 bytes of ordinary data from the beginning and other
16 bytes of ordinary data from an offset of 48. display the contents to demonstrate how
hole in a file is handled.
B) C program that accepts valid filename as command line argument and print the type
of the file
3. A) Shell script which prints command line arguments one by one after translating all
lower case to upper case
B) C program to run the command and determine the time taken by it
4. A) Shell script to check file permissions process status , date and the current user using
case conditional statements.
B) AWK script to print the transpose of matrix
5. A) Shell script that accept valid login name and print corresponding home directory
B) Shell script that accepts two file names as arguments sort both to temporary files and
merge the sorted output and finally delete the temporary files.
6. A ) Shell script to display the calendar of the current month with current date replaced by
* (or ) ** depending on whether the date has one digit or two .
B) Terminal locking using shell script.
24
SYSTEM SOFTWARE PROGRAMS

Execution of the following programs using LEX:
1. Program to count the number of vowels and consonants in a given string.
2. Program to count the number of characters, words, spaces and lines in a given input file.
3. Program to count number of (i) positive and negative integers (ii) positive and negative
fractions.
4. Program to count the number of comment lines in a given C program. Also eliminate
them and copy that program into separate file.
5. Program to count the number of scanf and printf statements in a C program. Replace
them with readf and writef statements respectively.
Execution of the following programs using YACC:
1. Program to test the validity of a simple expression involving operators +, -, *, and /.
2. Program to recognize nested IF control statements and display the number of levels of
nesting.
3. Program to recognize a valid arithmetic expression that uses operators +, -, * and /.
Note :
The evaluation is based on execution of one program from Linux/Unix and one from
system software(LEX or YACC).
2K11CIL 68 : DATABASE MANAGEMENT SYSTEMS LABORATORY

(Programming and Mini Project Laboratory)
Hours per Week : 3
Sessional Marks 25
PART A
I.
i.
ii.
Consider the Insurance database given below. The primary keys are underlined and the
datatypes are specified.
PERSON (driver id #: String, name: string, address: string)
CAR (Regno: string, model: string, year: int)
ACCIDENT (report-number: int, date: date, location: string)
OWNS (driver-id #:string, Regno:string)
PARTICIPATED (driver-id: string, Regno:string, report-number:int, damage amount:int)
Create the above tables by properly specifying the primary keys and the foreign keys.
Enter atleast five tuples for each relation.
25
iii.
iv
v.
Demonstrate how you

1.
Update the damage amount for the car with a specific Regno in the accident with
report number 12 to 25000.
2.
Add a new accident to the database.
Find the total number of people who owned cars that were involved in accidents in 2002.
Find the number of accidents in which cars belonging to a specific model were involved.
II. Consider the following relations for an order processing database application in a company.
i.
ii.
iii.
iv.
v.
CUSTOMER (cust #: int , cname: string, city: string)

ORDER (order #: int, odate: date, cust #: int, ord-Amt: int)
ORDER ITEM (order #: int, Item #: int, qty: int)
ITEM (item # : int, unit price: int)
SHIPMENT (order #: int, warehouse#: int, ship-date: date)
WAREHOUSE (warehouse #: int, city: string)
Produce a listing: CUSTNAME, #oforders, AVG_ORDER_AMT, where the middle
column is the total numbers of orders by the customer and the last column is the
average order amount for that customer.
List the order# for orders that were shipped from all the warehouses that the company
has in a specific city.
Demonstrate how you delete item# 10 from the ITEM table and make that field null in the
ORDER_ITEM table.
III. Consider the following database of student enrollment in courses & books adopted for each
course.
i.
ii.
iii.
iv.
v.
STUDENT (regno: string, name: string, major: string, bdate:date)

COURSE (course #:int, cname:string, dept:string)
ENROLL ( regno:string, course#:int, sem:int, marks:int)
BOOK _ ADOPTION (course# :int, sem:int, book-ISBN:int)
TEXT (book-ISBN:int, book-title:string, publisher:string, author:string)
Demonstrate how you add a new text book to the database and make this book be
adopted by some department.
Produce a list of text books (include Course #, Book-ISBN, Book-title) in the alphabetical
order for courses offered by the CS department that use more than two books.
List any department that has all its adopted books published by a specific publisher.
IV. The following tables are maintained by a book dealer.

AUTHOR (author-id:int, name:string, city:string, country:string)
PUBLISHER (publisher-id:int, name:string, city:string, country:string)
CATALOG (book-id:int, title:string, author-id:int, publisher-id:int, category-id:int, year:int,
price:int)
CATEGORY (category-id:int, description:string)
ORDER-DETAILS (order-no:int, book-id:int, quantity:int)
i.
26
ii.
iii.

Give the details of the authors who have 2 or more books in the catalog and the price of
the books is greater than the average price of the books in the catalog and the year of
publication is after 2000.
Find the author of the book which has maximum sales.
Demonstrate how you increase the price of books published by a specific publisher by
10%.
iv.
v.
V Consider the following database for a banking enterprise

BRANCH(branch-name:string, branch-city:string, assets:real)
ACCOUNT(accno:int, branch-name:string, balance:real)
DEPOSITOR(customer-name:string, accno:int)
CUSTOMER(customer-name:string, customer-street:string, customer-city:string)
LOAN(loan-number:int, branch-name:string, amount:real)
BORROWER(customer-name:string, loan-number:int)
i.
Create the above tables by properly specifying the primary keys and the foreign keys
ii.
Enter atleast five tuples for each relation
iii.
Find all the customers who have atleast two accounts at the Main branch.
iv.
Find all the customers who have an account at all the branches located in a specific city.
v.
Demonstrate how you delete all account tuples at every branch located in a specific city.
PART B
One mini project to be completed and submitted. A miniproject is to be implemented using an
RDBMS like INGRES, ORACLE, SYBASE etc. ( Excluding dbase like systems). The project
could be for
Hotel Management
Hospital administration
Inventory control
Manufacturing centre
Placement centre
Gas agency
Railway/Roadway/Airway reservation system
Academic administration
Sports databases
Career opportunities
Employee database
Payroll system
Library management
Examination system management
Banking operations
Finance companies
Product Management
Pharmacy
Mall
News
Population
CET
College
27
Insurance
Movies
Manufacturing
Voting
Weather
Books
Websites
Travel
Real Estate
Wild life
Students
Income tax
Import-Export
Doctor
Railways
Note : The evaluation is based on Execution of any one program from PART A and
demonstration of Mini Project. The student has to submit a report to the examiner.
28
BE VII SEMESTER INFORMATION SCIENCE & ENGINEERING
2K11IS 71 : SIMULATION AND MODELING

Note :
Hours per Week : 4
PART A
4 Hours
When Simulation is the Appropriate Tool; When Simulation is Not Appropriate; Advantages and
Disadvantages of Simulation, Areas of Application, Systems and System Environment,
Components of a System, Discrete and Continuous Systems, Model of a System, Types of
Models, Discrete Event System Simulation, Steps in a Simulation Study.
Chapter 2: Simulation Examples
4 Hours
Characteristics of Queuing Systems, Queuing Notation, Simulation of Queuing Systems,
Simulation of Inventory Systems .
Chapter 3: General Principles
4 Hours
Concepts in Discrete Event Simulation, The Event Scheduling/Time Advance Algorithm, World
Views, Manual Simulation Using Event Scheduling.
Chapter 4: Probability Theory and Random Number Generation
8 Hours
Introduction to Probability Theory, Random Variables and their Properties, Estimation of mean,
variance and correlations, confidence intervals, Hypothesis tests for Mean, Properties of
Random Numbers, Generation of Pseudo Random Numbers, Techniques for Generating
Random Numbers, Tests for Random Numbers.
Chapter 5: Random Variate Generation
4 Hours
Inverse Transform Technique, Exponential Distribution, Uniform Distribution, Discrete
Distributions, Acceptance Rejection Technique, Poisson Distribution, Gamma Distribution.
PART B
Chapter 6: Input Modeling
6 Hours
Data Collection, Identifying the Distribution with Data, Parameter Estimation, Goodness of Fit
Tests, Selecting Input Models without Data, Multivariate and Time Series Input Models.
Chapter 7: Verification and Validation of Models
6 Hours
Model Building, Verification and Validation, Verification of Simulation Models, Calibration and
Validation of Models.
29
Chapter 8: Output Analysis for a Single Model

6 Hours
Types of Simulations with respect to Output analysis. Stochastic nature of output data,
Measures of Performance and their estimation, Output analysis of terminating simulations,
Output analysis for Steady State Simulations.
Chapter 9; GPSS and SIMSCRIPT
6 Hours
General Descriptions, Facilities, Storages, Queues, Transfer Blocks, Control Statements,
Variables, Logic Switches, Boolean Variables, Functions Concept of User Chains, Facility
Preemption, Matching, Introduction to SIMSCRIPT and Some Simple Program using Simscript.
References :
1. Jerry Banks, John S Carson, Barry L Nelson, David M Nicol, Discrete Event System
Simulation, Third Edition, Pearson Education/PHI, India. 2000
2. Averill M Law, W David Kelton, Simulation Modeling and Analysis, Third Edition,
McGraw Hill.
3. Geoffery Gordon, System Simulation, Second Edition, PHI.
2K11CI 72 : SOFT COMPUTING

Note :
Hours per Week : 4
PART A
Neural Networks, Fuzzy Logic, Genetic Algorithms, Hybrid Systems.
6 Hours
Chapter 2: Artificial Neural Networks

6 Hours
Fundamental Concepts, Basic Models of Artificial Neural Networks, Important Terminologies of
ANN, McCulloch Pitts Neuron, Linear Separability, Hebb Network.
Chapter 3: Supervised Learning Network
6 Hours
Perceptron Networks, Adaline, Multiple Adaptive Linear Neurons, Back Propagation Network,
RBFs.
Chapter 4: Unsupervised Learning Networks
6 Hours
Kohonen Self Organizing Feature Maps, Learning Vector Quantization, Counterpropagation
Networks, ART.
30
PART B
Chapter 5: Fuzzy Sets and Fuzzy Relations
6 Hours
Crisp Sets vs Fuzzy Sets, Operations and Properties, Classical Relation vs Fuzzy Relations,
Tolerance and Equivalence Relations.
Chapter 6: Membership Functions, Fuzzy Arithmetic and Fuzzy Rules
6 Hours
Features of the Membership Functions, Fuzzification, Methods of Membership Value
Assignments, Defuzzyfication, Fuzzy Arithmetic, Fuzzy Measures, Truth Values and Tables in
Fuzzy Logic.
Chapter 7: Genetic Algorithms
6 Hours
Introduction, Basic Operators and Terminologies in GAs, Simple GA, The Schema Theorem,
Classification of GAs.
Chapter 8: Applications of Softcomputing
6 Hours
Applications, Image Processing, Optimization, Search Engines, Real Time Applications.
References :
1. S N Sivanandam, S N Deepa, Principles of Soft Computing, Wiley India Edition.
2. Vojislav Kecmann, Learning and Soft Computing, Pearson Education
3. David E Goldberg, Genetic Algorithms in search, optimization and machine
learning,1989
4. Andrea Tettamanzi,Marco Tomassini and J JanBen, Soft Computing, Springer, 2001
2K11CI 73 : CRYPTOGRAPHY AND NETWORK SECURITY

Note :
Hours per Week : 4
PART A
6 Hours
Overview : Services, Mechanisms and Attacks, The OSI Security Architecture, A Model of
Network Security. Classical Encryption Techniques : Symmetric Cipher Model, Substitution
Techniques, Transposition Techniques
Chapter 2: Symmetric Ciphers
6 Hours
Block Cipher and the Data Encryption Standard : Block Cipher Principles, The DES, The
Strength of DES, Differential and Linear Cryptanalysis. Confidentiality using Conventional
Encryption : Placement of Encryption Function, Traffic Confidentiality, Key Distribution, Random
Number Generation.
31
Chapter 3: Number theory

6 Hours
Number Theory: Prime Numbers Formats and Eulers Theorems, Testing for Primality,Chinese
Remainder theorem
Chapter 4: Public Key Encryption
6 Hours
Public Key Cryptography and RSA : Principles of Public Key Cryptosystems, The RSA
Algorithms, Key Management, Diffie Hellman Key Exchange, Elliptic curve cryptography.
PART B
Chapter 5: Authentication Protocols
8 Hours
Message Authentication : Authentication Requirements, Authentication Functions, Message
Authentication Codes, Hash functions, Security of Hash functions and MACs, Secure Hash
algorithms, Digital Signatures.
Chapter 6: Network Security
8 Hours
Authentication Applications : Kerberos, X.509 Authentication Service, Pretty Good Privacy,
S/MIME. IP Security : Overview, IP Security Architecture, Authentication Header, Encapsulation
Security Payload. Web Security : Web Security considerations, Secure Sockets Layer and
Transport Layer Security.
Chapter 7: System Security
8 Hours
Intruders, Intrusion detection, Viruses and Related Threats, Counter Measures, Firewalls and its
Design Principles.
References :
1. William Stallings, Cryptography and Network Security, Fourth Edition, Pearson
Education/PHI, 2009
2. Behrouz A. Forouzan: Cryptography and Network Security, Special Indian Edition, Tata
McGraw-Hill,2007.
3. Atul Kahate, Cryptography and Network Security, TMH.
32
2K11CIL 75 : NETWORKING LABORATORY

(Programming and Mini Project Laboratory)
Hours per Week : 3
PART A
1.
2.
3.
4.
5.
Write a Program to implement RSA algorithm.

Write a Program to find the shortest path in a network of 6 to 10 nodes.
Write a program for error detecting code using CRC-CCITT (16- bits).
Write a program for distance vector algorithm to find suitable path for transmission.
Using TCP/IP sockets, write a client server program to make the client send the file
name and to make the server send back the contents of the requested file if present.
6. Write a program for error detecting using Hamming Code.
7. Write a Program to implement sliding window protocol.
8. Write a program to implement FIFO-Client and FIFO-Server to transfer files.
9. Using UDP Sockets write client server program to transfer files.
10. Write a program to implement Diffie-Hellman key Exchange.
11. Write a program to implement Congestion Control using leaky bucket.
12. Write a Socket program to implement PING/ECHO.
PART B
(Simulation Exercises)
The following experiments shall be conducted using NS2 or any other suitable simulator.
1. Simulate a three nodes point to point network with duplex links between them. Set
the queue size and vary the bandwidth and find the number of packets dropped.
2. Simulate a four node point-to-point network with the links connected as follows:
n0 n2, n1 n2 and n2 n3. Apply TCP agent between n0-n3 and UDP between n1n3. Apply relevant applications over TCP and UDP agents changing the parameter and
determine the number of packets sent by TCP / UDP.
3. Simulate the transmission of ping messages over a network topology consisting of 6
nodes and find the number of packets dropped due to congestion.
4. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source / destination.
5. Simulate an Ethernet LAN using n nodes (6-10), change error rate and data rate and
compare throughput.
Note:
The evaluation is based on execution of one program from PART-A and one program
from PART-B.
33
2K11CIL 76 : INTERNET PROGRAMMING LABORATORY

(Programming/Mini Project Laboratory)
Hours per Week : 3
PART A
Develop and execute the following programs using HTML and PHP. Create Database
using MYSQL wherever necessary.
1. a) Program to display various Server Information like Server Name, Server Software,
Server protocol, CGI Revision etc.
b) Program to accept UNIX command from a HTML form and to display the output of the
command executed.
2. a) Program to accept the User Name and display a greeting message.
b) Program to keep track of the number of visitors, visited the web page and display the
counter with proper headings.
3. Program to display a greeting based on the access time of the Web server. Also to verify
whether the webmaster is currently logged in.
4. Program to display a digital clock which displays the current time of the server.
5. Program to display the current contents of the table in a database.
6. Program to insert new name and age information entered by the user into the database.
7. Program to query the database and to display the result on a web page.
8. Program to accept book information viz. Accession number, title, authors, edition and
publication from a web page and to store those in a database.
9. Program to search a book for a title given by the user on a web page and display the
search results with proper headings.
Develop and execute the following programs using HTML and JAVA Servlets.
10. a) Program to accept user name and display a greeting message.
b) Program to change the background color of the page based on the color selected by
the user.
11. Program to display a greeting based on the access time of the server.
12. Program to create and display a cookie.
13. Program to create a session and display session information viz. session ID, creation
time and last accessed.
14. Program to request server information viz. Request Method, URI, Protocol and Remote
address.
15. Program to accept User name and address and display them in a web page by passing
parameters.
PART B
The Student should Develop an integrated Mini project to demonstrate their skills in JAVA, CGI,
PERL, HTML, XML, etc. based on Internet Applications.
Note :
The evaluation is based on Execution of any one program from PART A and demonstration of
Mini Project. The student has to submit a report to the examiner.
34
2K11CIL 77 : PROJECT WORK (PRELIMINARY)

(Project Laboratory)
Hours per Week : 3
Sessional Marks 50
The Student has to submit a Preliminary Project Report to the respective Guide in Connection
with the Project Work that has to be carried out in Eighth Semester.
35
BE VIII SEMESTER INFORMATION SCIENCE AND ENGINEERING
2K11CI81 : COMPILER DESIGN

Note :
Students should answer FIVE questions selecting atleast TWO from each PART .
Hours per week : 4
PART A
Chapter 1: Introduction, Lexical Analysis
6 Hours
Language processors; structure of a Compilers; evolution of programming languages;
Applications of Compiler technology; Programming language basics; Lexical analysis: Role of
Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens, Finite
Automata, Regular Expression to in Lexical Analyzer
Chapter 2: Syntax Analysis 1
6 Hours
Context-free Grammars;
Writing a Grammar;
Top-Down Parsing: Recursive-Descent
Parsing, FIRST and FOLLOW, LL(1) Grammars, Nonrecursive Predictive Parsing, Error
Recovery in Predictive parsing
6 Hours
Bottom-Up Parsing; Shift Reduce parsing, Conflicts During Shift-Reduce parsing ,LR Parsing:
Simple LR, LR(0) Automation, Construction of SLR Parsing tables, Viable prefixes
6 Hours
Canonical LR(1) Parser, LR(1) items, Construction of LR(1) Parsing Tables, Construction of
LALR Parsing Tables, Compaction of LR Parsing Tables; using ambiguous grammars; Parser
Generators:YACC
PART B
Chapter 5: Syntax-Directed Translation
6 Hours
Syntax-Directed definitions; Evaluation order for SDDs; Applications of Syntax-directed
translation; Syntax-directed translation schemes.
Chapter 6: Intermediate Code Generation
6 Hours
Variants of syntax trees; Three-address code; Types and declarations; Translation of
expressions; Type checking; Control flow; Back patching; Switch statements; Intermediate code
for procedures.
Chapter 7: Run-Time Environments
6 Hours
Storage Organization; Stack allocation of space; Access to non-local data on the stack; Heap
management; Introduction to garbage collection.
36
Chapter 8: Code Generation

6 Hours
Issues in the design of Code Generator; The Target language; Addresses in the target code;
Basic blocks and Flow graphs; Optimization of basic blocks; A Simple Code Generator.
References
1. Compilers- Principles, Techniques and Tools Alfred V Aho, Monica S. Lam, Ravi
Sethi, Jeffrey D Ullman Second Edition, Addison-Wesley, 2007.
2. The Compiler Design Handbook: Optimization and Machine Code Generation - Y N
Srikant, Priti Shankar CRC Press 2002
3. Compiler Construction Principles & Practice Kenneth C Louden Thomson Education,
1997.
4. Modern Compiler Implementation in C Andrew W Apple Cambridge University Press,
1997.
5. Compiler Design in C- Allen I Holub, Prentice Hall Inc, 1990
6. Crafting a Compiler with C Charles N. Fischer, Richard J. leBlanc, Jr., Pearson
Education,1991.
2K11CI82 : DISTRIBUTED OPERATING SYSTEMS
Note :
Hours per week : 4
PART A
Chapter 1: Introduction To Network And Distributed Operating System
6 Hours
Functions of an OS, Design Approaches, Issues in DOS, Process Synchronisation, Resource
Management, Communication Primitives, Message Passing Model and RPC.
Chapter 2:Clocks And Distributed Mutual Exclusion
6 Hours
Introduction, Inherent Limitations of Distributed System, Lamports Logical Clocks, Vector

Clocks, Casual Ordering of Messages, Global State, Termination Detection, A simple solution to
Distributed Mutual Exclusion, Non token based Algorithms, Lamports algorithm, The Ricart
Agrawala Algorithm, Maekawas Algorithm, Token based Algorithms, Suzuki Kasamis
Broadcast Algorithm, Singhals Heuristic Algorithm, Raymonds Tree based Algorithm.
Chapter 3:Distributed Deadlock Detection
6 Hours
Preliminaries, Deadlock Handling strategies in Distributed systems, Issues in Deadlock

Detection and Resolution, Control Organizations for Distributed Deadlock Detection, Centralized
Deadlock Detection algorithms, Distributed Deadlock Detection Algorithms, Hierarchical
Deadlock Detection Algorithms.
Chapter 4:Agreement Protocols
6 Hours
Classification of Agreement Problems, Solutions to the Byzantine Agreement Problem,

Applications of agreement algorithms.
37
PART B
Chapter 5:Distributed Scheduling
6 Hours
Issues in Load Distribution, components of a load distributing algorithm, stability, load

distributing algorithms, performance comparison, selecting a suitable load sharing algorithm,
requirements for load sharing policies.
Chapter 6:Fault Tolerance
6 Hours
Atomic actions and committing, commit protocols, non blocking commit protocols, voting
protocols, dynamic voting protocols, The majority based reassignment protocols.
Chapter 7:Resource Security And Protection
6 Hours
Access and flow control : The access matrix model, implementations of access matrix, safety in
the access matrix model, requirement of a database operating system, database systems, a
concurrency control model of a database systems, the problem of concurrency control,
serializability theory.
Chapter 8:Concurrency Control Algorithms
6 Hours
Introduction, Basic Synchronization Primitives, Lock Based algorithms, timestamp based

algorithms, optimistic algorithms, concurrency control algorithms, data replication.
References
1. Mukesh Singal and Niranjan Shivaratri, Advanced Concepts in Operating Systems, Tata
Mcgraw Hill.
2. Bernstein P A Hazallacos and Goodmani M, Concurrency Control and Recovery in
Database Systems, Addison Wesley Co.
3. Ceri S and Pelagorthi S, Distributed Databases, McGraw Hill.
2K11IS83 DIGITAL IMAGE PROCESSING

Note :
Hours per week : 4
PART A
Chapter 1:Introduction And Fundamentals

6 Hours
Motivation and Perspective, Applications, Components of Image Processing System, image
Acquisition, Element of Visual Perception, A Simple Image Model, Sampling and Quantization.
38
Chapter 2: Image Enhancement In Spatial Domain

6 Hours
Introduction; Basic Gray Level Functions Piecewise-Linear Transformation Functions:
Contrast Stretching; Histogram Specification; Histogram Equalization; Local Enhancement;
Enhancement using Arithmetic/Logic Operations Image Subtraction, Image Averaging; Basics
of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening The
Laplacian.
Chapter 3: Image Enhancement In Frequency Domain
6 Hours
Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters
Low-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain;
Smoothing Frequency Domain Filters Gaussian Lowpass Filters; Sharpening Frequency
Domain Filters Gaussian Highpass Filters; Homomorphic Filtering.
Chapter 4: Image Restoration

6 Hours
A Model of Restoration Process, Noise Models, Restoration in the presence of Noise onlySpatial Filtering Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic
Filters Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain
Filtering Bandpass Filters; Minimum Mean-square Error Restoration.
PART B
Chapter 5: Image Compression
6 Hours
Fundamentals, Image compression models, Elements of Information Theory, Error-free
compression, lossy- compression , image compression standards .
Chapter 6:Registration
6 Hours
Introduction, Geometric Transformation Plane to Plane transformation, Mapping, Stereo
Imaging Algorithms to Establish Correspondence, Algorithms to Recover Depth
Chapter 7:Segmentation
6 Hours
Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local
Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge
Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements
Extraction by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.
Chapter 8: Representation And Description
Representation, Topological Attributes, Geometric Attributes
Region-based Description, Relationship.
6 Hours
Boundary-based Description,
Reference
1. Digital Image Processing Second Edition, Rafael C. Gonzalvez and Richard E. Woods.
Pearson Education.
2. Digital Image Processing and Computer Vision, R.J. Schalkoff. John Wiley and Sons,NY.
3. Fundamentals of Digital Image Processing, A.K. Jain. Prentice Hall, Upper Saddle River,
39
2K11CIL85 C# .NET LABORATORY

Hours per week : 3
WRITE AND EXECUTE C# PROGRAMS ON .NET PLATFORM

1.Program to Check whether a number is Palindrome or not.
2. Program to demonstrate Command line arguments Processing.
3. Program to find the roots of Quadratic Equation.
4. Program to demonstrate boxing and unBoxing.
5. Program to implement Stack operations.
6. Write a program to demonstrate Operator overloading.
7. Program to find the second largest element in a single dimensional array.
8. Program to multiply to matrices using Rectangular arrays.
9. Find the sum of all the elements present in a jagged array of 3 inner arrays.
10. Write a program to reverse a given string .
11. Using Try, Catch and Finally blocks Program to demonstrate error handling.
12. Design a simple calculator using Switch Statement .
13. Demonstrate Use of Virtual and override key words with a simple program
14. Implement linked lists using the existing collections name space.
15. Write a program to demonstrate abstract class and abstract methods .
16. Program to build a class which implements an interface which already exists.
17. Write a program to illustrate the use of different properties .
18. Demonstrate arrays of interface types with a C# program
The student should develop an integrated mini project to demonstrate their skill on .NET
platform
Note: The evaluation is based on execution of any one program from PART A and
demonstration of mini project. The student has to submit a report to the examiner.
2K11CIL86: PROJECT WORK
Hours per Week: 3
Sessional Marks: 50
The Student has to submit a Project Report to the respective Guide in Connection with the
Project Work for Eighth Semester.
40
2K11IS 74.1 : ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Note :
Hours per Week : 4
Sessional Marks 25
PART A
6 Hours
Artificial Intelligence: Its scope, history and applications, The Propositional Calculus, The
Predicate Calculus, Using Inference Rules to produce Predicate Calculus Expressions,
Application: A logic based financial advisor.
Chapter 2 :Structures and strategies for state space search
6 Hours
Graph theory, strategies for space search , using state space to represent reasoning with the
predicate calculus.
Chapter 3 : Heuristic Search
6 Hours
Heuristic search- An algorithm for heuristic search. Admissibility, monotonicity and
informedness. Heuristics in games. Complexity issues. Control and implementation of state
space search- Recursion based search, pattern directed search, production systems, the black
board architecture for problem solving.
Chapter 4 : Knowledge Based Systems
6 Hours
Overview of expert system technology. Rule based expert systems, Model- based, Case
based and Hybrid Systems. Reasoning in uncertain situations, The stochastic approach to
uncertainty. Non - monotonic systems. Reasoning with fuzzy sets.
PART B
Chapter 5 : Knowledge Representation
6 Hours
Knowledge representation : languages. Issues in knowledge representation. A survey of
network representation. Conceptual graphs. A network representation language. Structured
representations. Further issues in knowledge representation.
Chapter 6 : An Introduction to LISP
6 Hours
LISP: A brief Overview, Search in LISP: A functional approach to the farmer, wolf, goat, and
cabbage problem. Higher- order functions and procedural abstraction. Search strategies in
LISP. A recursive Unification function.
Chapter 7 : Machine Learning : Connectionist
6 Hours
Foundations for connectionist networks, preception learning, back propagation learning.
Competitive learning. Hebbian coincidence learning. Attractor networks or memories.
Machine learning: social and emergent - models; the genetic algorithm. classifier systems
and genetic programming. Artifical life and society based learning.
41
Chapter 8 : Automated Reasoning

6 Hours
Automated reasoning - Weak methods in theorem proving. The general problem solver and
difference tables. Resolution theorem proving. Further issues in automated reasoning.
References :
1. George. F. Luger , Artificial Intelligence - Structures and Strategies for Complex
Problem Solving, Fourth Edition, Pearson Education
2. P. H. Winston, Artificial Intelligence, Third Edition, Addision-Wesely.
3. E. Rich and Knight, Artificial Intelligence, Second Edition, TMH.
2K11IS 74.2 : MULTIMEDIA COMPUTING

Note :
Hours per Week : 4
PART A
6 Hours
Media and Data Streams, Audio Technology, Multimedia Elements, Multimedia Applications,
Multimedia Systems Architecture,Evolving Technologies for Multimedia Systems, Defining
Objects for Multimedia Systems, Multimedia Data Interface Standards, The need for Data
Compression, Multimedia Databases.Media: Perception Media, Representation Media,
Presentation Media, Storage Media, Transmission Media, Information Exchange
Media,Presentation Spaces & Values, and Presentation Dimensions, Key Propertiesof a
Multimedia System: Discrete & Continuous Media, Independence Media, Computer Controlled
Systems, Integration, Audio Representation on Computers, Three Dimensional Sound
Projection, Music and MIDI Standards, Speech Signals, Speech Output, Speech Input, Speech
Transmission.
Chapter 2 : Graphics and Animation
6 Hours
Graphics and Images, Video Technology, Computer-Based Animation:Capturing Graphics and
Images Computer Assisted Graphics and ImageProcessing, Reconstructing Images, Graphics
and Image Output Options.Basics, Television Systems, Digitalization of Video Signals,
DigitalTelevision, Basic Concepts, Specification of Animations, Methods of Controlling
Animation, Display of Animation, Transmission of Animation, Virtual Reality Modeling Language.
Chapter 3 : Data Compression 1
6 Hours
Data Compression 1: Storage Space, Coding Requirements, Source,Entropy, and Hybrid
Coding, Basic Compression Techniques, JPEG: ImagePreparation, Lossy Sequential DCTbased Mode, Expanded Lossy DCT-based Mode, Lossless Mode, Hierarchical Mode
42
Chapter 4: Data Compression 2

6 Hours
Data Compression 2: H.261 (Px64) and H.263: Image Preparation, Coding Algorithms, Data
Stream, H.263+ and H.263L, MPEG: Video Encoding,Audio Coding, Data Stream, MPEG-2,
MPEG-4, MPEG-7, FractalCompression.
PART B
Chapter 5 : Optical Storage Media
6 Hours
Optical Storage Media: History of Optical Storage, Basic Technology,Video Discs and Other
WORMs, Compact Disc Digital Audio, Compact Disc Read Only Memory, CD-ROM Extended
Architecture, Further CD-ROM- Based Developments, Compact Disc Recordable, Compact
Disc Magneto- Optical, Compact Disc Read/Write, Digital Versatile Disc.
Chapter 6 : Content Analysis
6 Hours
Content Analysis : Simple Vs. Complex Features; Analysis of Individual Images, Analysis of
Image Sequences, Audio Analysis, Applications.
Chapter 7 : Data and File Format Standards
6 Hours
Data and File Format Standards: Rich-Text Format, TIFF File Format, Resource Interchange
File Format (RIFF), MIDI File Format, JPEG DIB FileFormat for Still and Motion Images, AVI
Indeo File Format, MPEG Standards, TWAIN
Chapter 8 : Multimedia Application Design
6 Hours
Multimedia Application Design : Multimedia Application Classes, Types ofMultimedia Systems,
Virtual Reality Design, Components of Multimedia Systems, Organizing Multimedia Databases,
Application Workflow Design Issues, Distributed Application Design Issues.
References:
1. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding and
Content processing, Second Edition, PHI, Indian Reprint 2008.
2. Prabhat K. Andleigh, Kiran Thakrar: Multimedia Systems Design,PHI, 2003.
3. K.R Rao, Zoran S. Bojkovic and Dragorad A. Milovanovic : Multimedia Communication
Systems: Techniques, Standards, and Networks, Pearson Education, 2002.
4. Nalin K Sharad: Multimedia Information Networking, PHI, 2002.
43
2K11IS 74.3 : ADVANCED COMPUTER ARCHITECTURE

Note :
Hours per week : 4
PART A
Chapter 1 : Parallel Computer Architecture
6 Hours
The State of Computing, Computer Development Milestones, Elements of Modern Computers,
Evolution of Computer Architecture.
Chapter 2 : Parallel Architecture Types
6 Hours
System Attributes to Performance, Multiprocessors, Multivector and Architecture types SISD,
SIMD, MISD and MIMD Computers.
Chapter 3 : Program and Network Properties
6 Hours
Conditions of Parallelism, Program PARTitioning and Scheduling, Program Flow Mechanisms,
System Interconnect Architecture.
Chapter 4 : Processor and Memory Technologies
6 Hours
Advanced Processor Technology, Superscalar and Vector Processor, Backplane Bus System,
Shared Memory Organizations.
PART B
Chapter 5 : Pipelining and Superscalar Technologies
6 Hours
Linear Pipeline Processors, Non Linear Pipeline Processors, Instruction Pipeline Design,
Arithmetic Pipeline Design.
Chapter 6 : Multiprocessors and Multi Computers
6 Hours
Multiprocessor System Interconnects, Cache Coherence and Synchronization Mechanisms,
Message Passing Schemes.
Chapter 7 : Parallel Programs
6 Hours
Parallel Application Case Studies, The Parallelization Process, Parallelization of an Example
Program.
Chapter 8 : Scalable Multiprocessors
Scalability, Realizing Programming Model.
6 Hours
References :
1. Kai Hwang, Advanced Computer Architecture Parallelism, Scalability, Programmability,
McGraw Hill. 2005
2. David E Culler, J P Singh, Anoop Gupta, Parallel Computer Architecture, Harcoust Asia
and Morgan Kaufmann.1998
3. John P Hayes, Computer Architecture and Organization, 3rd Edition, McGrawHill.1998
44
4.
V Rajaraman, C Siva Ram Murthy, Parallel Computers Architecture and

Programming, PHI.
2K11CI84.1 WIRELESS SENSOR NETWORKS

Note :
Hours per week : 4
PART A
6 Hours
Unique Constraints and Challenges, Advantages of Sensor Networks, Energy advantage,
Detection advantage, Sensor Network Applications, Habitat monitoring, Wildlife conservation
through autonomous, non-intrusive sensing, Tracking chemical plumes, Ad hoc, just-in-time
deployment mitigating disasters, Smart transportation: networked sensors making roads safer
and less congested, Collaborative Processing.
Chapter 2: Key Definitions And The Problem
6 Hours
Key Definitions of Sensor Networks, Canonical Problem: Localization and Tracking, Tracking
Scenario, Problem Formulation, Sensing model, Collaborative localization, Bayesian state
estimation, Distributed Representation and Inference of States, Impact of choice of
representation, Design desiderata in distributed tracking, Tracking Multiple Objects, State space
decomposition, Data association, Sensor Models, Performance Comparison and Metrics.
Chapter 3 : Networking And Protocols
6 Hours
Networking Sensors, Key Assumptions, Medium Access Control, The SMAC Protocol, IEEE
802.15.4 Standard and ZigBee, General Issues, Geographic, Energy-Aware Routing, Unicast
Geographic Routing, Routing on a Curve, Energy-Minimizing Broadcast, Energy-Aware Routing
to a Region, Attribute-Based Routing, Directed Diffusion, Rumor Routing, Geographic Hash
Tables. Infrastructure Establishment, Topology Control, Clustering.
Chapter 4: Time Synchronization
6 Hours
Clocks and Communication Delays, Interval Methods, Broadcasts, Localization and Localization
Services, Ranging Techniques, Range-Based Localization Algorithms, Other Localization
Algorithms, Location Services. Sensor Tasking and Control, Task-Driven Sensing, Roles of
Sensor Nodes and Utilities, Information- Based Sensor Tasking, Sensor selection, IDSQ:
Information-driven sensor querying, Cluster leader based protocol, Sensor tasking in tracking
relations, Joint Routing and Information Aggregation, Moving center of aggregation, Multi-step
information-directed routing, Sensor group management, Case study: Sensing global
phenomena.
45
PART B
Chapter 5: Databases
10 Hours
Sensor Network Databases, Sensor Database Challenges, Querying The Physical Environment,
Query Interfaces, Cougar sensor database and abstract data types, Probabilistic queries, Highlevel Database Organization, In- Network Aggregation, Query propagation and aggregation,
Tiny DB query processing, Query processing scheduling and optimization, Data-Centric
Storage, Data Indices and Range Queries, One-dimensional indices, Multidimensional indices
for orthogonal range searching, Non-orthogonal range searching, Distributed Hierarchical
Aggregation, Multi-resolution, Partitioning, Fractional cascading, Locality preserving hashing,
Temporal Data, Data aging, Indexing motion data.
Chapter 6: Platforms and Tools
6 Hours
Sensor Network Platforms and Tools, Sensor Network Hardware, Berkeley motes, Sensor
Network Programming Challenges, Node-Level Software Platforms,
Chapter 7: Operating system
8 Hours
Tiny OS, Imperative language: nesC, Dataflow style language: Tiny GALS, Node-Level
Simulators, ns-2 and its sensor network extensions, TOSSIM, Programming Beyond Individual
Nodes: State-centric programming, Collaboration groups, PIECES: A state-centric design
framework, Multi-target tracking problem revisited. Applications and Future Directions.
References
1. Feng Zhao, Leonidas Guibas: Wireless Sensor Networks An Information Processing
Approach, Elsevier, 2004.
2. Waltenegus Dargie, Christian Poellabauer, Fundamentals of Wireless Sensor Networks:
Theory and Practice, a John Willey and sons publication , third edition, 201
3. C.S. Raghavendra, Krishna M. Sivalingam, Taieb Znati, Wireless Sensor Networks,
Springer, 2004
46
2K11CI84.2 STORAGE NETWORKS
Note :
Hours per week : 4
PART A
6 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.
Chapter 2: Intelligent Disk Subsystems
6 Hours
Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O Channels; JBOD,
Storage virtualization using RAID and different RAID levels; Caching: Acceleration of Hard Disk
Access; Intelligent disk subsystems, Availability of disk subsystems.
Chapter 3: I/O Techniques
6 Hours
The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel Protocol
Stack; Fibre Channel SAN; IP Storage.
Chapter 4: Network Attached Storage

6 Hours
The NAS Architecture, The NAS hardware Architecture, The NAS Sotfware Architecture,
Network connectivity, NAS as a storage system.
PART B
Chapter 5: File System And NAS
6 Hours
Local File Systems; Network file Systems and file servers; Shared Disk file systems;
Comparison of fibre Channel and NAS.
Chapter 6: Storage Virtualization
6 Hours
Definition of Storage virtualization ; Implementation Considerations; Storage virtualization on
Block or file level; Storage virtualization on various levels of the storage Network; Symmetric
and Asymmetric storage virtualization in the Network.
Chapter 7: SAN Architecture And Hardware Devices
6 Hours
Overview, Creating a Network for storage; SAN Hardware devices; The fibre channel switch;
Host Bus Adaptors; Putting the storage in SAN; Fabric operation from a Hardware perspective.
Chapter 8: Software Components Of SAN
6 Hours
The switchs Operating system; Device Drivers; Supporting the switchs components;
Configuration options for SANs.
47
.
References
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller, Storage Networks Explained, Wiley
India, 2007.
2. Marc Farley, Storage Networking Fundamentals An Introduction to Storage Devices,
subsystems, Applications, Management, and File Systems, Cisco Press, 2005.
3. Robert Spalding, Storage Networks The Complete Reference, Tata McGraw-Hill, 2003.
4. Richard Barker and Paul Massiglia,Storage Area Network Essentials A CompleteGuide
to understanding and Implementing SANs, Wiley India, 2006.
2K11IS84.3 ADVANCED ALGORITHMS

Note :
Hours per week : 4
PART A
Chapter 1: Review Of Analysis Techniques
6 Hours
Growth of Functions: Asymptotic notations; Standard notations and common functions;
Recurrences and Solution of Recurrence equations- The substitution method, The recurrence
tree method, The master method; Amortized Analysis: Aggregate, Accounting and Potential
Methods.
Chapter 2: Graph Algorithms
6 Hours
Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnsons Algorithm for
sparse graphs; Flow networks and Ford-Fulkerson method; Maximum bipartite matching.
Chapter 3: Polynomials And The FFT
6 Hours
Representation of polynomials; The DFT and FFT; Efficient implementation of FFT.
Chapter 4: Number -Theoretic Algorithms
6 Hours
Elementary notions; GCD; Modular Arithmetic; Solving modular linear equations; The Chinese
remainder theorem; Powers of an element; RSA cryptosystem; Primality testing; Integer
factorization.
PART B
Chapter 5: String-Matching Algorithms
8 Hours
Nave string Matching; Rabin - Karp algorithm; String matching with finite automata; KnuthMorris-Pratt algorithm; Boyer Moore algorithms.
Chapter 6: Probabilistic And Randomized Algorithms
8 Hours
Probabilistic algorithms; Randomizing deterministic algorithms, Monte Carlo and Las Vegas
algorithms; Probabilistic numeric algorithms.
48
Chapter 7: Parallel Algorithms

8 Hours
Introduction, Models, speedup and efficiency, Some basic techniques, Examples from graph
theory, sorting, Parallel sorting networks. Parallel algorithms and their parallel time and
processors complexity.
References:
1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, Third
Edition, Prentice-Hall of India, 2010.
2. Kenneth A. Berman, Jerome L. Paul: Algorithms, Cengage Learning, 2002.
3. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: Fundamentals of Computer Algorithms,
2nd Edition, Universities press, 2007.
2K11CI84.4 ROBOTICS
Note :
Hours per week : 4
PART A
6 Hours
Introduction brief history, types, classification and usage, Science and Technology of robots.
Chapter 2: Elements of Robots
6 Hours
links, joints, actuators, and sensor Position and orientation of a rigid body, Homogeneous
transformations, Representation of joints, link representation using D-H parameters, Examples
of D-H parameters and link transforms, different kinds of actuators stepper, DC servo and
brushless motors, model of a DC servo motor, Types of transmissions, Purpose of sensors,
internal and external sensors, common sensors encoders, tachometers, strain gauge based
force-torque sensors, proximity and distance measuring sensors, and vision.
Chapter 3: Kinematics of Serial Robots
6 Hours
Introduction, Direct and inverse kinematics problems, Examples of kinematics ofcommon serial
manipulators, workspace of a serial robot, Inverse kinematics of constrained and redundant
robots, Tractrix based approach for fixed and free robots and multi-body systems, simulations
and experiments, Solution procedures using theory of elimination, Inverse kinematics solution
for the general 6R serial manipulator.
Chapter 4: Kinematics of Parallel Robots
6 Hours
Degrees-of-freedom of parallel mechanisms and manipulators, Active and passive joints,

Constraint and loop-closure equations, Direct kinematics problem, Mobility of parallel
manipulators, Closed-from and numerical solution, Inverse kinematics of parallel manipulators
and mechanisms, Direct kinematics of Gough-Stewart platform.
49
PART B
Chapter 5: Velocity and Static Analysis of Robot Manipulators
6 Hours
Linear and angular velocity of links, Velocity propagation, Manipulator Jacobians for serial and
parallel manipulators, Velocity ellipse and ellipsoids, Singularity analysis for serial and parallel
manipulators, Loss and gain of degree of freedom, Statics of serial and parallel manipulators,
Statics and force Transformation matrix of a Gough Stewart platform, Singularity analysis and
statics.
Chapter 6: Dynamics of Serial and Parallel Manipulators
6 Hours
Mass and inertia of links, Lagrangian formulation for equations of motion for serial and parallel
manipulators, Generation of symbolic equations of motion using a computer, Simulation (direct
and inverse) of dynamic equations of motion, Examples of a planar 2R and four-bar mechanism,
Recursive dynamics, Commercially available multi body simulation software (ADAMS) and
Computer algebra software Maple
Chapter 7: Motion Planning and Control
6 Hours
Joint and Cartesian space trajectory planning and generation, Classical control concepts using
the example of control of a single link, Independent joint PID control, Control of a multi-link
manipulator, Nonlinear model based control schemes, Simulation and experimental case
studies on serial and parallel manipulators, Control of Constrained manipulators, Cartesian
control, Force control and Hybrid position/force control, Advanced topics in non-linear control of
manipulators
Chapter 8: Modeling and Control of Flexible Robots
6 Hours
Models of flexible links and joints, Kinematic modeling of multilink flexible robots, Dynamics and
control of flexible link manipulators, Numerical simulations results, Experiments with a planar
two-link flexible manipulator.
References:
1. Ghosal,A., Robotics: Fundamental Concepts and Analysis, Oxford University Press,
Second Reprint, 2008
2. Fu,K., Gonzalez, R. and Lee, C.S. G., Robotics: Control, Sensing, Vision and
Intelligence McGraw- Hill, 1987.
3. Murray, R.M., Li, Z., and Sastry,S.S.,A Mathematical Introduction to Robotic
Manipulator, CRC Press, 1994.
4. Merlet, J.-P.,Parallel Robots,Kluwer Academic,Dordrecht, 2001.
5. Featherstone, R.S., Robot Dynamics Algorithms, Kluwer Academic Publishers 1987
6. Haug,E.J., Computer-Aided Kinematics and Dynamics of Mechanical Systems: Basic
Methods, Vol. 1,Allyn and Bacon, 1989.
7. Siciliano,B., and Khatib, O.(Editors), Handbook of Robotics,Springer, 2008.
8. Craig, J. J., Introduction to Robotics: Mechanics and Control, Second Edition, AddisonWesley, 1989.
50

All SemISE Final2

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

All SemISE Final2

Enviado por

Direitos autorais:

Formatos disponíveis

BANGALORE UNIVERSITY

INFORMATION SCIENCE AND ENGINEERING

UNIVERSITY VISVESVARAYA COLLEGE OF

No. of Hr. / week

No. of Hr. / week

No. of Hr. / week

No. of Hrs /Week

VII SEMESTER (Elective-I)

No. of Hr. / week

VIII SEMESTER (Elective-II)

BE V SEMESTER INFORMATION SCIENCE AND ENGINEERING

Examination Marks: 100

Chapter 7: Examples of Commercial Database Systems

2K11CI 52 : OPERATING SYSTEMS

Examination Marks : 100

2K11CI 53 : COMPUTER NETWORKS I

Examination Marks 100

Chapter 3 : Transmission Media, Error Detection and Correction

Examination Marks 100

2K11CI 55 : COMPUTER GRAPHICS

Examination Marks: 100

Chapter 4 : Geometric Objects and Transformations-I

Examination Marks: 100

2K11CIL 57 : COMPUTER GRAPHICS LABORATARY

Examination Marks : 100

2K11CIL 58 : JAVA PROGRAMMING LABORATORY

Examination Marks : 100

1. Program to implement Stack operations ( push, pop and Display).

BE VI SEMESTER INFROMATION SCIENCE AND ENGINEERING

2K11CI 61 : COMPUTER NETWORKS II

Hours per week : 4

Examination Marks : 100

Chapter 6 : Transport Layer

2K11CI 62 : PROBABILITY AND STOCHASTIC PROCESS

Examination Marks 100

Chapter 4 : Conditional Distribution and Expectation

Classification of Stochastic Processes, The Poisson Process, Renewal Process, Availability

2K11CI 63: SYSTEM SOFTWARE

Examination Marks : 100

Machine Independent Assembler Features Literals, Symbol-Definition Statements,

Chapter 7 : Macro Processor 2

2K11CI 64 : UNIX/LINUX SYSTEM PROGRAMMING

Examination Marks: 100

Chapter 4 :UNIX Processes

2K11 IS 65 : DATA COMPRESSION TECHNIQUES

Examination Marks 100

2K11CI 66 : DATA MINING

Examination Marks : 100

Chapter 3: Classification and Prediction

Chapter 7: Data Warehouse and OLAP Technology

2K11CIL 67: LINUX/UNIX PROGRAMMING LABORATORY AND SYSTEM SOFTWARE

Examination Marks : 100

UNIX / LINUX PROGRAMS

SYSTEM SOFTWARE PROGRAMS

2K11CIL 68 : DATABASE MANAGEMENT SYSTEMS LABORATORY

Examination Marks 100

Demonstrate how you

CUSTOMER (cust #: int , cname: string, city: string)

STUDENT (regno: string, name: string, major: string, bdate:date)

IV. The following tables are maintained by a book dealer.

Enter atleast five tuples for each relation.

V Consider the following database for a banking enterprise

BE VII SEMESTER INFORMATION SCIENCE & ENGINEERING

2K11IS 71 : SIMULATION AND MODELING