Subject Code : 06AL61 IA Marks : 25

No. of Lecture Hrs./ : 04 Exam Hours : 03

Week
Total No. of : 52 Exam Marks : 100
Lecture Hrs.

PART - A

MANAGEMENT

UNIT - 1

MANAGEMENT: Introduction - Meaning - nature and characteristics of Management, Scope

and functional areas of management - Management as a science, art or profession -
Management & Administration - Roles of Management, Levels of Management, Development
of Management Thought - early management approaches - Modern management approaches.

7 Hours

UNIT - 2

PLANNING: Nature, importance and purpose of planning process - Objectives - Types of

plans (Meaning only) - Decision making - Importance of planning - steps in planning &
planning premises - Hierarchy of plans.

6 Hours

UNIT - 3

ORGANIZING AND STAFFING: Nature and purpose of organization - Principles of

organization - Types of organization - Departmentation - Committees – Centralization Vs
Decentralization of authority and responsibility - Span of control - MBO and MBE (Meaning
only) Nature and importance of Staffing - Process of Selection & Recruitment (in brief)

6 Hours

UNIT - 4

DIRECTING & CONTROLLING: Meaning and nature of directing - Leadership styles,

Motivation Theories, Communication - Meaning and importance – Coordination, meaning and
importance and Techniques of Co - ordination. Meaning and steps in controlling - Essentials of
a sound control system - Methods of establishing control (in brief)
 7 Hours

PART - B

ENTREPRENEURSHIP

UNIT - 5

ENTREPRENEUR: Meaning of Entrepreneur; Evolution of the Concept, Functions of an

Entrepreneur, Types of Entrepreneur, Intrapreneur - an emerging Class. Concept of
Entrepreneurship - Evolution of Entrepreneurship, Development of Entrepreneurship; Stages
in entrepreneurial process; Role of entrepreneurs in Economic Development;
Entrepreneurship in India; Entrepreneurship – its Barriers.

6 Hours

UNIT - 6

SMALL SCALE INDUSTRY:Definition; Characteristics; Need and rationale: Objectives; Scope;

role of SSI in Economic Development. Advantages of SSI Steps to start an SSI - Government
policy towards SSI; Different Policies of S.S.I.; Government Support for S.S.I. during 5 year
plans, Impact of Liberalization, Privatization, Globalization on S.5.1., Effect of WTO/GATT
Supporting Agencies of Government for S.5.!., Meaning; Nature of Support; Objectives;
Functions; Types of Help; Ancillary Industry and Tiny Industry (Definition only).

6 Hours

UNIT - 7

INSTITUTIONAL SUPPORT: Different Schemes; TECKSOK; KIADB; KSSIDC; KSIMC; DIC

Single Window Agency: SISI; NSIC; SIDBI; KSFC .

6 Hours

UNIT - 8

PREPARATION OF PROJECT : Meaning of Project; Project Identification; Project Selection;

Project Report; Need and Significance of Report; Contents; formulation; Guidelines by
Planning Commission for Project report; Network Analysis; Errors of Project Report; Project
Appraisal. Identification of Business Opportunities:Market Feasibility Study; Technical
Feasibility Study; Financial Feasibility Study & Social Feasibility Study

6 Hours
TEXT BOOKS:

1. Principles of Management – P.C. Tripathi, P.N. Reddy – Tata McGraw Hill, 2007.

2. Dynamics of Entrepreneurial Development & Management – Vasant Desai:,

Himalaya Publishing House, 2007.

3. Entrepreneurship Development – Poornima M Charantimath – Small Business

Enterprises, Pearson Education, 2006.

REFERENCE BOOKS:

1. Management Fundamentals Concepts, Application, Skill Development –

Robert Lusier –, Thompson, 2007.

2. Entrepreneurship Development – S S Khanka, S Chand & Co, 2007.

3. Management – Stephen Robbins:, 17th Edition, Pearson Education / PHI, 2003.

4. Web Sites for the Institutions listed in the Unit 7 on Institutional Support.
 Subject Code : 06CS62 IA Marks : 25
No. of Lecture Hrs./ : 04 Exam Hours : 03
Week
Total No. of : 52 Exam Marks : 100
Lecture Hrs.

PART - A

UNIT - 1

INTRODUCTION: 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.

6 Hours

UNIT - 2

UNIX FILES: 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.

6 Hours

UNIT - 3

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.

7 Hours

UNIT - 4
UNIX PROCESSES: 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.

7 Hours

PART - B

UNIT - 5

PROCESS CONTROL: Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid,
waited, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and
Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process
Times.

Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups,

Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell
Execution of Programs, Orphaned Process Groups.

7 Hours

UNIT - 6

SIGNALS AND DAEMON PROCESSES: 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.lb Timers. Daemon Processes:
Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single-instance daemons;
Daemon conventions; Client-Server Model.

7 Hours

UNIT - 7

INTERPROCESS COMMUNICATION: Introduction; Pipes, popen, pclose Functions;

Coprocesses; FIFOs; XSI IPC; Message Queues; Semaphores.

6 Hours
UNIT - 8

NETWORK IPC: SOCKETS:

Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer;

Socket options; Out-of-band data; Nonblocking and asynchronous I/O.

6 Hours

TEXT BOOKS:

1. Unix System Programming Using C++ – Terrence Chan - Prentice Hall India, 1999.

2. Stephen A. Rago: Advanced Programming in the UNIX Environment –

W.Richard Stevens, 2nd Edition, Pearson Education / PHI, 2005.

REFERENCE BOOKS:

1. Advanced Unix Programming – Marc J. Rochkind:, 2nd Edition, Pearson Education,

2005.
2. The Design of the UNIX Operating System – Maurice.J.Bach:, Pearson Education /
PHI, 1987.
3. Unix Internals – Uresh Vahalia:, Pearson Education, 2001.
 Subject Code : 6CS63/06IS6 IA Marks : 25
62
No. of Lecture : 04 Exam : 03
Hrs./ Week Hours
Total No. of : 52 Exam : 100
Lecture Hrs. Marks

PART - A

UNIT - 1

INTRODUCTION, LEXICAL ANALYSIS: Language processors; The structure of a Compilers;

The evolution of programming languages; The science of building a compiler; Applications of
Compiler technology; Programming language basics; Lexical analysis: The Role of Lexical
Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens.

8 Hours

UNIT - 2

SYNTAX ANALYSIS – 1: Introduction; Context-free Grammars; Writing a Grammar; Top-

down Parsing.

6 Hours

UNIT - 3

SYNTAX ANALYSIS – 2: Bottom-up Parsing; Introduction to LR Parsing: Simple LR.

6 Hours

UNIT - 4

SYNTAX ANALYSIS – 3: More powerful LR parsers; Using ambiguous grammars; Parser

Generators.
 6 Hours

PART - B

UNIT - 5

SYNTAX-DIRECTED TRANSLATION: Syntax-Directed definitions; Evaluation order for SDDs;

Applications of Syntax-directed translation; Syntax-directed translation schemes.

6 Hours

UNIT - 6

INTERMEDIATE CODE GENERATION: 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.

8 hours

UNIT - 7

RUN-TIME ENVIRONMENTS: Storage Organization; Stack allocation of space; Access to

non-local data on the stack; Heap management; Introduction to garbage collection.

6 Hours

UNIT - 8

CODE GENERATION: 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.

6 Hours

TEXT BOOK:

1. Compilers- Principles, Techniques and Tools – Alfred V Aho, Monica S. Lam, Ravi
Sethi, Jeffrey D Ullman – 2nd Edition, Addison-Wesley, 2007.

REFERENCE BOOKS:
 1. Crafting a Compiler with C – Charles N. Fischer, Richard J. leBlanc, Jr., Pearson
Education, 1991.

2. Modern Compiler Implementation in C – Andrew W Apple Cambridge University

Press, 1997.

3. Compiler Construction Principles & Practice – Kenneth C Louden – Thomson

Education, 1997.

Subject Code : 06CS64/IS6 IA Marks : 25

65
No. of Lecture : 04 Exam Hours : 03
Hrs./ Week
Total No. of : 52 Exam Marks : 100
Lecture Hrs.

PART - A

UNIT - 1

PACKET-SWITCHING NETWORKS – 1: Network services and internal network operations;

Packet network topology; Datagrams and virtual circuits; Routing in packet networks;
Shortest-path routing; ATM networks.

6 Hours

UNIT - 2

PACKET-SWITCHING NETWORKS – 2, TCP / IP - 1: Traffic management at the packet

level; Traffic management at the flow level; Traffic management at the flow-aggregate level.
The TCP / IP architecture; The Internet protocol.

6 Hours

UNIT - 3
TCP / IP - 2: IPv6; User datagram protocol; Transmission control protocol; Internet routing
protocols; Multicast routing; DHCP, NAT, and Mobile IP.
7 Hours

UNIT - 4
ATM NETWORKS: Why ATM? BISDN reference model; ATM layer; ATM adaptation layer; ATM
signaling; PNNI routing; Classical IP over ATM.
7 Hours

PART - B
UNIT - 5
NETWORK MANAGEMENT, SECURITY: Network management overview; SNMP; Structure of
Management information; MIB; Remote network monitoring. Security and cryptographic
algorithms; Security protocols; Cryptographic algorithms.
6 Hours

UNIT - 6
QoS, Resource Allocation, VPNs, Tunneling, Overlay Networks: Overview of QOS;
Integrated services QoS; Differentiated services QoS; Resource allocation.Virtual Private
Networks; Multiprotocol Label switching; Overlay networks.
7 Hours
UNIT - 7
COMPRESSION OF DIGITAL VOICE AND VIDEO, VOIP, MULTIMEDIA NETWORKING:
Overview of data compression; Digital voice and compression; Still images and JPEG
compression; 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-Time media transport protocols; Distributed
multimedia networking; SCTP.
7 Hours

UNIT - 8
MOBILE AD-HOC NETWORKS, WIRELESS SENSOR NETWORKS: Overview 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 technology and IEEE 802.15.4
6 Hours

TEXT BOOKS:

1. Communication Networks – Fundamental Concepts and Key architectures –

Alberto Leon-Garcia and Indra Widjaja:, 2nd Edition, Tata McGraw-Hill, 2004.
2. Computer and Communication Networks – Nader F. Mir:, Pearson Education, 2007.

REFERENCE BOOKS:

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

McGraw-Hill, 2006.

2. Data and Computer Communication – William Stallings – 8th Edition, Pearson

Education, 2007.

1. Computer Networks A Systems Approach – Larry L. Peterson and Bruce S. David –

4th Edition, Elsevier, 2007.
2. Introduction to Data Communications and Networking – Wayne Tomasi –
Pearson Education, 2005.
 Subject Code : 06CS65 IA Marks : 25
No. of Lecture Hrs./ : 04 Exam : 03
Week Hours
Total No. of : 52 Exam : 100
Lecture Hrs. Marks

PART - A

UNIT - 1

INTRODUCTION: Applications of computer graphics; A graphics system; Images: Physical

and synthetic; Imaging systems; The synthetic camera model; The programmer’s interface;
Graphics architectures; Programmable pipelines; Performance characteristics. Graphics
Programming: The Sierpinski gasket; Programming two-dimensional applications.

7 Hours

UNIT - 2

THE OPENGL: The OpenGL API; Primitives and attributes; Color; Viewing; Control functions;
The Gasket program; Polygons and recursion; The three-dimensional gasket; Plotting implicit
functions.

6 Hours

UNIT - 3
INPUT AND INTERACTION: 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.

7 Hours

UNIT - 4

GEOMETRIC OBJECTS AND TRANSFORMATIONS – 1: Scalars, points, and vectors; Three-

dimensional primitives; Coordinate systems and frames; Modeling a colored cube; Affine
transformations; Rotation, translation and scaling.

6 Hours

PART - B

UNIT - 5

GEOMETRIC OBJECTS AND TRANSFORMATIONS – 2: Transformations in homogeneous

coordinates; Concatenation of transformations; OpenGL transformation matrices; Interfaces
to three-dimensional applications; Quaternions.

5 Hours

UNIT - 6

VIEWING: 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.

7 Hours

UNIT - 7

LIGHTING AND SHADING: 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.

6 Hours
UNIT - 8

IMPLEMENTATION: Basic implementation strategies; The major tasks; Clipping; Line-

segment clipping; Polygon clipping; Clipping of other primitives; Clipping in three dimensions;
Rasterization; Bresenham’s algorithm; Polygon rasterization; Hidden-surface removal;
Antialiasing; Display considerations.

8 Hours

TEXT BOOK:

1. Interactive Computer Graphics A Top-Down Approach with OpenGL -Edward

Angel, 5th Edition, Addison-Wesley, 2008.

REFERENCE BOOKS:

1. Computer Graphics Using OpenGL – F.S. Hill,Jr. 2nd Edition, Pearson Education,
2001.
2. Computer Graphics – James D Foley, Andries Van Dam, Steven K Feiner, John F
Hughes, Addison-wesley 1997.
3. Computer Graphics - OpenGL Version – Donald Hearn and Pauline Baker, 2nd
Edition, Pearson Education, 2003.
 OPERATIONS RESEARCH

Subject Code : 06CS661 IA Marks : 25

No. of Lecture Hrs./ : 04 Exam Hours : 03
Week
Total No. of : 52 Exam Marks : 100
Lecture Hrs.

PART - A

UNIT - 1

INTRODUCTION, LINEAR PROGRAMMING – 1: 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.
Introduction to Linear Programming: Prototype example; The linear programming (LP) model.

6 Hours

UNIT - 2
LP – 2, SIMPLEX METHOD - 1: Assumptions of LP; Additional examples. 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.

7 Hours

UNIT - 3

SIMPLEX METHOD - 2: Adapting to other model forms; Post optimality analysis; Computer
implementation. Foundation of the simplex method.

6 Hours

UNIT - 4

SIMPLEX METHOD - 2, DUALITY THEORY: The revised simplex method, a fundamental

insight. The essence of duality theory; Economic interpretation of duality. Primal dual
relationship; Adapting to other primal forms.

7 Hours

PART - B

UNIT - 5

DUALITY THEORY AND SENSITIVITY ANALYSIS, OTHER ALGORITHMS FOR LP: 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.

7 Hours

UNIT - 6

TRANSPORTATION AND ASSIGNMENT PROBLEMS: The transportation problem; A

streamlined simplex method for the transportation problem; The assignment problem; A
special algorithm for the assignment problem.

7 Hours

UNIT - 7
GAME THEORY, DECISION ANALYSIS: Game Theory: The formulation of two persons, zero
sum games; Solving simple games- a prototype example; Games with mixed strategies;
Graphical solution procedure; Solving by linear programming, Extensions. Decision Analysis: A
prototype example; Decision making without experimentation; Decision making with
experimentation; Decision trees.

6 Hours

UNIT - 8

METAHEURISTICS: The nature of Metaheuristics, Tabu Search, Simulated Annealing,

Genetic Algorithms.

6 Hours

TEXT BOOK:

1. Introduction to Operations Research – Frederick S. Hillier and Gerald J. Lieberman

– 8th Edition, Tata McGraw Hill, 2005.

REFERENCE BOOKS:

1. Operations Research Applications and Algorithms – Wayne L. Winston – 4th

Edition, Thomson Course Technology, 2003.
2. Operations Research: An Introduction – Hamdy A Taha – 8th Edition, Prentice Hall
India, 2007.

Subject Code : 06CSL67 IA Marks : 25

No. of Practical : 03 Exam Hours : 03
Hrs./ Week
Total No. of : 42 Exam Marks : 50
Practical Hrs.

PART - A

IMPLEMENT THE FOLLOWING PROGRAMS IN C / C++

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 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. Use the OpenGL.

REFERENCE BOOKS:

1. Computer Graphics Using OpenGL – F.S. Hill,Jr. – 2nd Edition, Pearson education,
2001.
2. Interactive Computer Graphics A Top-Down Approach with OpenGL Edward
Angel – 2nd Edition, Addison-Wesley, 2000.
 Subject Code : 06CSL68 IA Marks : 25
No. of Lecture Hrs./ : 03 Exam Hours : 03
Week
Total No. of Lecture : 42 Exam Marks : 50
Hrs.

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

given input file.
b.Program to count the numbers of comment lines in a given C program. Also
eliminate 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 a valid arithmetic expression that uses operators +, -, *

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’ using the grammar
(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 argument and prints
them in the Reverse order, (For example, if the script is named rargs, then
executing rargs A B C should produce C B A on the standard output).
 b) C program that creates a child process to read commands from the standard
input and execute them (a minimal implementation of a shell – like program). You
can assume that no 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 if the permissions are
identical, outputs the common permissions, otherwise outputs each file
name followed by its permissions

b) C program to create a file with 16 bytes of arbitrary data from the beginning
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 that hierarchy 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, Block special file, Symbolic link etc.)

4. a) Shell script that accepts file names specified as arguments and

creates a shell script that contains this file as well as the code to recreate these
files. Thus if the script generated by your script is executed, it would recreate the
original files(This is same as the “bundle” script described by Brain W. Kernighan
and Rob Pike in “ The Unix Programming Environment”, Prentice – Hall India).

b) C program to do the following: Using fork( ) create a child process. The child
process prints its own process-id and id of its parent and then exits. The parent
process waits for its child to finish (by executing the wait( )) and prints its own
process-id and the id of its child process and then exits.

COMPILER DESIGN:
1. Write a C program to implement the syntax-directed definition of “if E then S1” and
“if E then S1 else S2”. (Refer Fig. 8.23 in the text book prescribed for 06CS62
Compiler Design, Alfred V Aho, Ravi Sethi, Jeffrey D Ullman: Compilers- Principles,
Techniques and Tools, Addison-Wesley, 2007.)

2. Write a yacc program that accepts a regular expression as input and produce its
parse tree as output.

INSTRUCTIONS:

In the examination, a combination of one LEX and one YACC problem has to be asked
from part A for a total of 25 marks and one programming exercise from Part B has to
be asked for a total of 25 marks.