VI SEMESTER

Unix Systems Programming

Subject Code: 06CS61
I.A. Marks : 25
Hours/Week : 04
Exam Hours: 03
Total Hours : 52
Exam Marks: 100
PART - A
1.Introduction
6 Hrs
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 Standards.
UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development
Environment, API Common Characteristics.
2. UNIX Files
6 Hrs
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 Supportfor Files, Relationship of C Stream Pointers and File Descriptors,
Directory Files, Hard andSymbolic Links.
3.UNIX File APIs
7 Hrs
General File APIs, File and Record Locking, Directory File APIs, Device File APIs,
FIFOFile 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
FileClass, File Listing Program.

4.UNIX Processes
7
Hrs
The Environment of a UNIX Process: Introduction,main function, Process
Termination,Command-Line Arguments, Environment List, Memory Layout of a C
Program, SharedLibraries, Memory Allocation, Environment
Variables,setjmp andlongjmp Functions,
getrlimit, setrlimit Functions, UNIX Kernel Support for Processes.
PART - B
5. Process Control
7 Hrs
Introduction, Process
Identifiers,fork,vfork,exit,wait,waitpid,wait3,wait4Functions, Race
Conditions, exec Functions, Changing User IDs and Group IDs,
InterpreterFiles,system Function, Process Accounting, User Identification, Process
Times, I/ORedirection.
Process Relationships: Introduction, Terminal Logins, Network Logins, Process
Groups,Sessions, Controlling Terminal,tcgetpgrp andtcsetpgrp Functions, Job
Control,Shell Execution of Programs, Orphaned Process Groups.
6.Signals and Daemon Processes
7
Hrs
Signals: The UNIX Kernel Support for Signals,signal, Signal Mask,sigaction,
TheSIGCHLD Signal and thewaitpid Function,
Thesigsetjmp andsiglongjmpFunctions, Kill, Alarm, Interval Timers, POSIX.lb
Timers.
Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging,
Client-Server Model.
7.Interprocess Communication - 1
6 Hrs
Overview of IPC Methods, Pipes,popen,pclose Functions, Coprocesses, FIFOs,
System
V IPC, Message Queues, Semaphores.
8.Interprocess Communication - 2
6 Hrs
Shared Memory, Client-Server Properties, Stream Pipes, Passing File Descriptors, An
Open
Server-Version 1, Client-Server Connection Functions.
Text Books:
1Terrence Chan: Unix System Programming Using C++, Prentice Hall India, 1999.
(Chapters 1, 5, 6, 7, 8, 9, 10)
2W.Richard Stevens: Advanced Programming in the UNIX Environment, Addison-
Wesley/PHI, 1992.
(Chapters 7, 8, 9, 13, 14, 15)
Reference Book:
1.Marc J. Rochkind: Advanced Unix Programming, 2nd Edition, Pearson Education,
2005.
2.Maurice.J.Bach: The Design of the UNIX Operating System, Pearson
Education/Prentice
Hall of India, 1987.
3.Uresh Vahalia: Unix Internals, Pearson Education, ASIA, 2001

File Structures
Subject Code: 06IS62
I.A. Marks : 25
Hours/Week : 04
Exam Hours: 03
Total Hours : 52
Exam Marks: 100
PART – A
1. Introduction
7 Hrs
File Structures: The Heart of the file structure Design, A Short History of File
StructureDesign, A Conceptual Toolkit; Fundamental File Operations: Physical Files and
LogicalFiles, Opening Files, Closing Files, Reading and Writing, Seeking, Special
Characters, TheUnix Directory Structure, Physical devices and Logical Files, File-related
Header Files,UNIX file System Commands; Secondary Storage and System Software:
Disks, MagneticTape, Disk versus Tape; CD-ROM: Introduction, Physical Organization,
Strengths andWeaknesses; Storage as Hierarchy, A journey of a Byte, Buffer
Management, Input /Outputin UNIX.
2.Fundamental File Structure Concepts, Managing Files of Records
6
Hrs
Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance
forRecord Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-
OrientedClass for Record Files, Record Access, More about Record Structures,
Encapsulating RecordOperations in a Single Class, File Access and File Organization.
3.Organization of Files for Performance, Indexing
7
Hrs
Data Compression, Reclaiming Space in files, Internal Sorting and Binary
Searching,Keysorting; What is an Index? A Simple Index for Entry-Sequenced File,
Using TemplateClasses in C++ for Object I/O, Object-Oriented support for Indexed,
Entry-Sequenced Filesof DataObjects, Indexes that are too large to hold in Memory,
Indexing to provide accessby Multiple keys, Retrieval Using Combinations of Secondary
Keys, Improving theSecondary Index structure: Inverted Lists, Selective indexes,
Binding.
4.Cosequential Processing and the Sorting of Large Files
6 Hrs
A Model for Implementing Cosequential Processes, Application of the Model to a
GeneralLedger Program, Extension of the Model to include Mutiway Merging, A
SecondLook atSorting in Memory, Merging as a Way of Sorting Large Files on Disk.
PART - B
5.Multi-Level Indexing and B-Trees
7 Hrs
The invention of B-Tree, Statement of the problem, Indexing with Binary Search
Trees;Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-
OrientedRepresentation of B-Trees, B-Tree Methods; Nomenclature, Formal Definition
of B-TreeProperties, Worst-case Search Depth, Deletion, Merging and Redistribution,
Redistributionduring insertion; B* Trees, Buffering of pages; Virtual B-Trees; Variable-
length Recordsand keys.
6.Indexed Sequential File Access and Prefix B + Trees
6 Hrs
Indexed Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to
theSequence Set, The Content of the Index: Separators Instead of Keys, The Simple
Prefix B+Tree and its maintenance, Index Set Block Size, Internal Structure of Index Set
Blocks: AVariable-order B- Tree, Loading a Simple Prefix B+
Trees, B-Trees, B+ Trees and SimplePrefix B+ Trees in Perspective.
7. Hashing
7 Hrs
Introduction, A Simple Hashing Algorithm, Hashing Functions and Record
Distribution,How much Extra Memory should be used?, Collision resolution by
progressive overflow,Buckets, Making deletions, Other collision resolution techniques,
Patterns of record access.
8. Extendible Hashing
6 Hrs
How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing
Performance, Alternative Approaches.
Text Books:
1.Michael J. Folk, Bill Zoellick, Greg Riccardi: File Structures-An Object Oriented
Approach
with C++, 3rd Edition, Addison-Wesley, 1998.
(Chapters 1 to 12 excluding 1.4, 1.5, 5.5, 5.6, 8.6, 8.7, 8.8)
Reference Books:
1.K.R. Venugopal, K.G. Srinivas, P.M. Krishnaraj: File Structures Using C++, Tata
McGraw-
Hill, 2008.
2.Scot Robert Ladd: C++ Components and Algorithms, BPB Publications, 1993.
3.Raghu Ramakrishan and Johannes Gehrke: Database Management Systems,
3rd Edition,
McGraw Hill, 2003

Computer Networks - II
Subject Code: 06CS64
I.A. Marks : 25
Hours/Week : 04
Exam Hours: 03
Total Hours : 52
Exam Marks: 100
PART - A
1.Packet-Switching Networks – 

Network services and internal network operations; Packet network topology; Datagrams
and
virtual circuits; Routing in packet networks; Shortest-path routing; ATM networks.
2.Packet-Switching Networks – 2, TCP / IP - 1
6 Hrs
Traffic management at the packet level; Traffic management at the flow level; Traffic
management at the flow-aggregate level.
The TCP / IParchitecture; The Internet protocol.
3.TCP / IP – 2
7 Hrs
IPv6; User datagram protocol; Transmission control protocol; Internet routing protocols;
Multicast routing; DHCP, NAT, and Mobile IP.
4. ATM Networks
7 Hrs
Why ATM? BISDN reference model; ATM layer; ATM adaptation layer; ATM
signaling;
PNNI routing; Classical IP over ATM.
PART – B
5.Network Management, Security
6 Hrs
Network management overview; SNMP; Structure of Management information;
MIB;Remote network monitoring. Security and cryptographic algorithms; Security
protocols;Cryptographic algorithms.
6.QoS, Resource Allocation, VPNs, Tunneling, Overlay Networks
7 Hrs
Overview of QOS; Integrated services QoS; Differentiated services QoS; Resource
allocation.Virtual Private Networks; Multiprotocol Label switching; Overlay networks.
7. Compression of Digital Voice and Video, VoIP, Multimedia Networking
7 Hrs
Overview of data compression; Digital voice and compression; Still images and
JPEGcompression; Moving images and MPEG compression; Limits of compression with
loss;Compression methods without loss; Case Study: FAX compression for
transmission.Overview of IP telephony; VoIP signaling protocols; Real-Timemedia
transport protocols;Distributed multimedia networking; SCTP.
8. Mobile Ad-Hoc Networks, Wireless sensor Networks
6
HrsOverview of wireless adhoc networks; Routing in adhoc networks; Routing protocols
for adhoc networks; security of adhoc networks. Sensor networks and protocol
structures;Communication energy model; Clustering protocols; Routing protocols;
Zigbee technologyand IEEE 802.15.4
Text Books:
1.Alberto Leon-Garcia and Indra Widjaja: Communication Networks –Fundamental
Concepts and Key architectures, 2nd Edition, Tata McGraw-Hill, 2004.
(Chapters 7, 8, 9, 11, Appendix B)
2.Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.
(Chapters 12, 16, 17, 18, 19, 20)

1. Behrouz A. Forouzan:Data Communications and Networking, 4th Edition, Tata

McGraw-
Hill, 2006.
2. William Stallings: Data and Computer Communication, 8th Edition, Pearson
Education,
2007.
3. Larry L. Peterson and Bruce S. David: Computer Networks – A Systems Approach,
4th
Edition, Elsevier, 2007.
4.Wayne Tomasi: Introduction to Data Communications and Networking, Pearson
Education,
2005

Information Systems,Subject Code: 06IS65,I.A. Marks : 25,Hours/Week : 04,

Exam Hours: 03,Total Hours : 52,Exam Marks: 100
PART – A
I.Foundation Concepts – 1
7 Hrs
Information Systems in Business: Introduction, The real world of Information
Systems,Networks, What you need to know, The fundamental role of IS in business,
Trends in IS,Managerial challenges of IT.
System Concepts: A foundation, Components of an Information System, Information
System Resources, Information System activities, Recognizing Information Systems.
2.Foundation Concepts – 2
6 Hrs
Fundamentals of strategic advantages: Strategic IT, Competitive strategy concepts,
Thecompetitive advantage of IT, Strategic uses of IT, Building a customer-focused
business,The value chain and strategic IS, Reengineering business processes, Becoming
an agilecompany Creating a virtual company, Building a knowledge-creating company.
3.Electronic Business Systems
6 Hrs
Enterprise Business Systems: Introduction, Cross-functional enterprise
applications,Enterprise application integration, Transaction processing systems,
Enterprise collaborationsystems.
Functional Business Systems: Introduction, Marketing systems, Manufacturing systems,
Human resource systems, Accounting systems, Financial management systems.
4.Enterprise Business Systems
7 Hrs
Customer relationship management: Introduction, What is CRM? The three phases of
CRM, Benefits and challenges of CRM, Trends in CRM.
Enterprise resource planning: Introduction, What is ERP? Benefits and challenges of
ERP,
Trends in ERP.
Supply chain Management: Introduction, What is SCM? The role of SCM, Benefits and
challenges of SCM, Trends in SCM.
PART – B
5.Electronic Commerce Systems
6 Hrs
Electronic commerce fundamentals: Introduction, The scope of e-commerce, Essential e-
commerce, processes, Electronic payment processes.
e-Commerce applications and issues: E-commerce application trends, Business-to-
Consumer e-commerce,Web store requirements, Business-to-Business e-commerce, e-
commerce marketplaces, Clicks and bricks in e-commerce.
6.Decision Support Systems
7 Hrs
Decision support in business: Introduction, Decision support trends, Decision
supportsystems (DSS), Management Information Systems, On-line analytical processing,
UsingDSS, Executive information systems, Enterprise portals and decision support,
Knowledgemanagement systems, Business and Artificial Intelligence (AI), An overview
of AI, Expertsystems.
7.Security and Ethical Challenges
7 Hrs
Security, Ethical and societal challenges of IT: Introduction, Ethical responsibility
ofbusiness professionals, Computer crime, Privacy issues, Other challenges, Health
issues,Societal solutions.
Security management of IT: Introduction, Tools of security management, Internetworked
security defenses, Other security measures, System Controls and audits.
8.Enterprise and Global Management of IT
6 Hrs
Managing IT: Business and IT, Managing IT,Business / IT planning, Managing the IS
function, Failures of IT management.
Managing global IT: The International Dimension, Global IT Management,
Cultural,Political and Geo - Economic challenges, Global Business/ IT strategies, Global
Business /IT applications, Global IT Platforms, Global data access issues, Global
Systems development.
Text Books:
1.James A. O’ Brien, George M. Marakas: Management Information Systems,
7th Edition,
Tata McGraw Hill, 2006.
(Chapters 1, 2, 7, 8, 9, 10, 13, 14)
Reference Books:
1.Kenneth C. Laudon and Jane P. Laudon: Management Information System, Managing
the Digital Firm, 9th Edition, Pearson Education, 2006.
2.Steven Alter: Information Systems The Foundation of E-Business, 4th Edition, Pearson
Education, 2002.
3.W.S. Jawadekar: Management Information Systems, Tata McGraw Hill 199

Computer Graphics and Visualization,Subject Code: 06IS665 /

06CS65,
PART - A
1.INTRODUCTION
7 Hrs
Applications of computer graphics; A graphics system; Images: Physical and
synthetic; The humanvisual system; The pinhole camera; The synthetic
camera model; The programmer’s interface;Graphics architectures.
Graphics Programming: The Sierpinski gasket.
2. The OpenGL
6 Hrs
The OpenGL API; Primitives and attributes; Color; Viewing; Control
functions; The Gasket
program; Polygons and recursion; The three-dimensional gasket.
3.Input and Interaction
6 Hrs
Interaction; Input devices; Clients and servers; Display lists; Programming
event-driven input;Menus; Picking; A simple paint program; Animating
interactive programs; Design ofinteractive programs.
4.Geometric Objects and Transformations
7 Hrs
Scalars, points, and vectors; Three-dimensional primitives; Coordinate
systems and frames;Modeling a colored cube; Affine transformations;
Rotation, translation and scaling;Transformation in homogeneous
coordinates; OpenGL transformation matrices; Interfaces tothree-
dimensional applications.
PART - B
5. Viewing
7 Hrs
Classical and computer viewing; Positioning of the camera; Simple
projections; Projections inOpenGL; Hidden-surface removal; Walking
through a scene; Parallel-projection matrices;Perspective-projection
matrices; Projections and shadows.
6. Shading
6 Hrs
Light and matter; Light sources; The Phong reflection model;
Computation of vectors;Polygonal shading; Approximation of a sphere by
recursive subdivisions; Light surfaces inOpenGL; Specification of materials
in OpenGL; Shading of the sphere model; Globalrendering.
7. Implementation
7 Hrs
The major tasks; Implementation of transformations; Line-segment
clipping; Polygonclipping; Clipping of other primitives; Clipping in three
dimensions; Hidden-surface removal;Scan conversion; Bresenham’s
algorithm; Scan conversion of polygons; Antialiasing;
Displayconsiderations.
8. Visualization
6 Hrs
Data + Geometry; Height field and contours; Visualizing surfaces and
scalar fields;Isosurfaces and marching cubes; Direct volume rendering;
Vector-field visualization; Tensor-visualization.

.
File Structures Laboratory
Subject Code: 06ISL67
I.A. Marks : 25
Hours/Week : 03
Exam Hours: 03
Total Hours : 42
Exam Marks: 50
NOTES:
1.One mini project per a batch of 2 students.
2.The department must ensure that all the projects are implemented.
3.Each student should demonstrate his/her project individually.
4. Marks allocation:
a.Demonstration of the project report and related viva:
50%
b.Implementation of the specified modification:
30%
c. Subject Viva:
20%
5. All possible operations relating to files like open, close, read, retrieve, delete and
update
have to be implemented and demonstrated in all the mini projects
PART – I
The following specifications are common to all projects.
Design a class called STUDENT.Each object of this class represents information about a
singlestudent.Members should be included for student USN (University Seat Number),
Name,Address, Semester, Branch etc. Methods should be included for initialization,
assignment andmodifying values.Provide methods to write the member values to the
output stream suitablyformatted.Add methods to store objects as records in files and load
objects from the file usingbuffering.Design a suitable IO BUFFER class hierarchy.Add
pack and unpack methods toclass STUDENT.For all the mini projects, assume variable–
size fields with delimiters, in afixed length record structure for the data file.
PART – II
One of the following mini projects is to be completed by each batch of two students.
PROJECT – 1
29
Develop an indexed file for the student record file with the USN as the key and name as
thesecondary key. Write a driver program to create an index file from the student record
file createdin PART – 1.Prompt for USN and display of the record.
Modify the program so that if a secondary key value is entered by the user and if there are
multiple matching records, then all the records are displayed.
1.Select any other secondary key of your choice and demonstrate the retrieval using
combinations of secondary keys.
2.Use inverted list structure to rearrange the secondary key index file when new insertion
is to be done.
PROJECT– 2
 Develop an application that produces student’s transcripts.Use Cosequential processes
andMaster Transaction Process to develop this.For each student record (Master) print the
studentinformation and list of all subjects (transactions) taken by the student.As input,
use file ofSTUDENT records sorted by USN.
1.Demonstrate 4-way merge.
2.Sort the data file using heap-sort and demonstrate the 4 phases of merging using heap-
sort.
PROJECT– 3
Add B – tree indexes to the data files created in PART – 1.Use Class BTREE to create B-
tree
index of the student record file with USN as key.
Write a driver program to create a B-tree file from an existing student record file.
Demonstrate
the retrieval information based on USN and print all objects that match it.
1.Calculate and display the average space utilization.
2.Invoke a method to indicate the level of collapse.
3.Invoke a method to indicate the level splitting.
PROJECT – 4
Design and implement class B+ Tree, which puts together the classes sequence set and B-
tree.B-Tree characteristics should be maintained in the index set as before; the sequence
set shouldbe maintained so that blocks are always at least half full.
Consider the following suggestions:
1.Do not compress the keys as you form the separators for the index set.
2.Keep B-tree nodes in the same file as the sequence set blocks.The header block
shouldcontain a reference to the root of the B-tree as well as a reference to the beginning
of thesequence set.
PROJECT – 5
Develop a hashed index of the student record file with the USN as the key.
Write a driver program to create a hashed file from an existing student record
file.Demonstrate
the recursive collapse of directory over more than one level.
30
1.Demonstrate doubling of the directory size.
2.Display the space utilization for buckets and directory size.
System Programming Laboratory
Subject Code: 06ISL68
I.A. Marks: 25
Hours/Week : 03
Exam Hours: 03
Total Hours: 42
Exam Marks : 50
PART A
LEX and YACC Programs:
Execute the following programs using LEX:
 1)a. Program to count the number of characters, words, spaces and lines in a giveninput
file.
b. Program to count the numbers of comment lines in a given C program. Alsoeliminate
them and copy the resulting program into separate file.
2)a. Program to recognize a valid arithmetic expression and to recognize the identifiers
and
operators present. Print them separately.
b. Program to recognize whether a given sentence is simple or compound.
3)Program to recognize and count the number of identifiers in a given input file.
Execute the following programs using YACC:
4)a. Program to recognize avalid arithmeticexpressionthat usesoperators +, -, *
and /.
b. Program to recognize a valid variable, which starts with a letter, followed by any
number
of letters or digits.
5)a. Program to evaluate an arithmetic expression involving operators +, -, * and /.
b. Program to recognize strings ‘aaab’, ‘abbb’, ‘ab’ and ‘a’usingthegrammar
(anbn, n>= 0).
6)Program to recognize the grammar (anb, n>= 10).
PART B
Unix Programming:
1.a) Non-recursive shell script that accepts any number of argumentsand prints
them in the Reverse order, ( For example, if the script is named rargs, thenexecuting
rargs A B Cshould produce C B A on the standard output).
b) C programthat creates a child process to read commands from the standardinput
andexecute them (a minimal implementation of a shell – like program). You can assume
thatno arguments will be passed to the commands to be executed.
2.a) Shell script that accepts two file names as arguments, checks if the permissions
for these files are identical and ifthe permissions are identical, outputs the
common permissions, otherwise outputs each file name followed by its permissions.
b) C program to createafile with16 bytesofarbitrary data from thebeginning
and another 16 bytes of arbitrary data from an offset of 48. Display the file contents to
demonstrate how the hole in file is handled.
3.a) Shell function that takes a valid directory names as an argument and recursively
descends all the subdirectories, finds the maximum length of any file in thathierarchy
and writes this maximum value to the standard output.
b) C program that accepts valid file names as command line arguments and for
each of the arguments, prints the type of the file ( Regular file, Directory file, Character
special file, Blockspecial file, Symbolic link etc.)
4.a) Shellscript thatacceptsfilenamesspecified as arguments and creates a shell
31