MALNAD COLLEGE OF ENGINEERING, HASSAN
(An Autonomous Institution Affiliated to VTU, Belgaum)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING
VISION
To prepare competent engineers in Information Science & Engineering with a
strong foundation for professionalism and responsible citizenship, and become an
excellent center for learning.
MISSION

Imparting high quality education with emphasis on fundamental concepts and
practical application, adopting the best technologies.

Encouraging students and faculty to pursue higher studies.

Collaborating with industry and institutes of higher learning.

Nurturing personality development of students.

Accomplishing social obligations.
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)
1) Graduates
will
be
able
to
synthesize
Mathematics,
Science,
Computer
fundamentals, and Laboratory experiences in Information Science and Engineering
to formulate and solve problems.
2) Graduates will succeed in getting employment in prestigious organizations.
3) Graduates will succeed in the pursuit of higher studies.
4) Graduates will communicate proficiently, work effectively in teams, practice
professional ethics and assume social responsibility.
5) Graduates will acquire the necessary skills for continued independent learning.
PROGRAM OUTCOMES (POs)
1. An ability to apply the knowledge of Mathematics, Science and Computer
Engineering.
2. An ability to design and conduct experiments, analyze and interpret results.
3. An ability to design a system, component or process to meet the desired needs
within realistic constrains.
4. An ability to work on multi-disciplinary tasks.
5. An ability to identify, and solve engineering problems.
6. An understanding of professional and ethical responsibility.
7. An ability to communicate effectively.
8. The broad education necessary to understand the impact of engineering
solutions in global, economic, environmental and societal contexts.
9. To appreciate the need for and the ability to engage in life-long learning.
10. Knowledge of contemporary issues.
11. An ability to use the tools and techniques for solving problems.
12. An ability to prepare for competitive examinations and pursue higher education.
CIE SCHEME (Theory)
Assessment
CIE 1 (based on unit1 and unit2)
CIE 2 (based on unit3 and unit4)
CIE 3 (based on unit5 and unit6)
Total
Weightage in Marks
25
25
25
50
III Year B.E.: Scheme of Teaching and Credits, 2015-2016
(Information Science and Engineering)
5th Semester
Course
Code
Course Title
L
T
P
C
IS501
Operating Systems
3
0
2
4
IS502
Finite Automata & Formal Languages
3
1
0
4
IS503
Principles of Programming Languages
3
0
0
3
IS504
Database Management Systems
3
1
0
4
IS505
Computer Networks-I
4
0
0
4
IS506
Systems Programming
4
0
0
4
IS507
Database Applications Laboratory
0
0
3
1.5
IS508
Systems Programming & Operating
Systems Laboratory
0
0
3
1.5
HS004
Communication Skills - 2
2
0
0
1.5
HS005
Constitution of India and professional
Ethics ( Audit Course)
2
0
0
-
24
2
8
27.5
L
T
P
C
Total
6th Semester
Course
Code
Course Title
IS601
Java and J2EE
3
0
2
4
IS602
Computer Networks-II
3
1
0
4
IS603
File Structures
3
0
0
3
IS604
Management Information Systems
3
0
0
3
IS605
Web Programming
3
0
2
4
IS606
Mini Project
0
0
4
2
IS607
Web Programming Laboratory
0
0
3
1.5
IS6XX
Elective I
3
0
0
3
HS006
Environmental Studies ( Audit Course)
2
0
0
-
20
1
11
24.5
Total
Courses for Elective I
IS651
Distributed Operating Systems
IS652
Advanced DBMS
IS653
Computer Graphics & Visualization
IS654
Compiler Design
IS655
Unix Systems Programming
IS501 - Operating Systems (3-0-2)4
Exam: 3 Hrs.
SEE: 50 Marks
#
Hours/Week: 4
Total Hours: 52
Course Outcomes
1. Learn the fundamentals of various concepts in operating systems
and understand about processes, threads, IPC, concepts of
semaphores, deadlocks, monitors, synchronization.
2. Learn process scheduling with different scheduling algorithms,
memory allocation methods, disk scheduling, memory and
storage management
3. Understand various security problems faced by operating
systems and learn to minimize them, with an introduction to
Linux operating system
Mapping to
POs
1, 12
1, 2, 5, 12
1, 10
PART- A
1. Introduction to Operating Systems, System Structures: What Operating Systems
Do; Computer System Architecture; Operating System Structure; Operating System
Operations; Distributed Systems; Special-Purpose Systems; Computing
Environments, Operating System Services; User-Operating System Interface;
System Calls; Types of System Calls; System Programs; Operating System
Structure; Virtual Machines – Benefits, The Java Virtual Machine.
7 Hrs.
2. Process Management: Process Concept; Process Scheduling; Operations on
Processes; Inter-Process Communication. Multi-Threaded Programming: Overview;
Multithreading Models; Thread Libraries; Threading Issues- The fork() and exec()
System Calls, Cancellation, Signal Handling. Process Scheduling: Basic Concepts;
Scheduling Criteria; Scheduling Algorithms; Multiple-Processor Scheduling. 7 Hrs.
PART- B
3. Process Synchronization : Synchronization: The Critical Section Problem;
Peterson’s Solution; Synchronization Hardware; Semaphores; Classic problems of
Synchronization, Monitors- Usage.
6 Hrs.
4. Deadlocks: Deadlocks: System Model; Deadlock Characterization; Methods for
Handling Deadlocks; Deadlock Prevention; Deadlock Avoidance; Deadlock
Detection and Recovery from Deadlock.
6 Hrs.
PART- C
5. Memory Management: Memory Management Strategies: Background; Swapping;
Contiguous Memory Allocation; Paging; Structure of Page Table; Segmentation.
Virtual Memory Management: Background; Demand Paging; Copy-on-Write; Page
Replacement.
7 Hrs.
6. Memory Management (Contd.): Allocation of frames; Thrashing- Cause of
Thrashing. Storage Management: File System: File Concept; Access Methods;
Directory Structure; File System Mounting; Protection. Implementing File System:
File System Structure; File System Implementation; Directory Implementation;
Allocation Methods; Free Space Management.
7 Hrs.
PART- D
7. Storage Management (Contd.): Secondary Storage Structures, Protection : Mass
Storage Structures; Disk Structure; Disk Attachment; Disk Scheduling; Disk
Management; Swap Space Management. Protection: Goals of Protection, Principles
of Protection, Domain of Protection- Domain Structure, Access Matrix,
Implementation of Access Matrix, Access Control, Revocation of Access Rights.
7 Hrs.
8. Case Study: The Linux Operating System: Linux History; Design Principles;
Kernel Modules; Process Management; Memory Management- Management of
Physical Memory, Virtual Memory-Virtual Memory Regions; File Systems-The
Virtual File System, The Linux ext2fs File System, Journaling. (Please refer to
chapter details for this unit)
5 Hrs.
Text Book:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System
Principles, 8th Edition, Wiley India, 2009. (Chapters: 1.1, 1.3 – 1.5, 1.10 -1.12, 2.1 to
2.5, 2.7, 2.8 - 2.8.2, 2.8.6.2, 3.1 to 3.4 , 4.1 to 4.4-4.4.1, 4.4.2, 4.4.3, 5.1 to 5.3, 5.5,
6.1 to 6.7-6.7.1, 7, 8.1 to 8.6, 9.1 to 9.6 - 9.6.1, 10.1-10.3 - 10.3.1, 10.3.2, 10.4,
10.6, 11.1 to 11.5, 12.1 to 12.6, 14.1 - 14.3.1, 14.4 - 14.7, 21.1 to 21.4.1, 21.6 21.6.1, 21.6.2 - 21.6.2.1, 21.7 - 21.7.1, 21.7.2, 21.7.3)
Reference Books:
1. D.M Dhamdhere: Operating Systems - A Concept Based Approach, 2nd Edition,
Tata McGraw- Hill, 2002.
2. P.C.P. Bhatt: Introduction to Operating Systems: Concepts and Practice, 2nd
Edition, PHI, 2008.
3. Harvey M. Deitel: Operating Systems, 3rd Edition, Pearson Education, 1990.
IS502 – Finite Automata and Formal Languages (3-1-0)4
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 4
Total Hours: 52
#
Course Outcome
1.
Students will know the core concepts of computer science and will
be able to use computation and computational thinking to solve
different problems.
Will learn the central concepts and applications of finite automata.
Will have the basic understanding of regular expressions, context
free grammars and properties of context-free languages.
Come to know the basics of Push Down Automata and turing
machines.
Will be able to distinguish between decidable and undecidable
problems and recursively enumerable problems.
2.
3.
4.
5.
Mapping to
POs
1, 2, 5
1, 5
1, 2, 5
1, 5, 12
1, 5, 10, 12
PART – A
1. Introduction to Finite Automata: Why Study Automata theory? The Central
Concepts of Automata Theory, An Informal Picture of Finite Automata, Deterministic
Finite Automata, Nondeterministic Finite Automata.
7 Hrs
2. Introduction to Finite Automata (Contd.): An Application, Finite Automata with
Epsilon-Transitions.
Regular Expressions and Languages: Properties of Regular Languages: Regular
Expressions
6 Hrs
PART – B
3. Regular Expressions and Languages (Contd.): Finite Automata and Regular
Expressions, Applications of Regular Expressions, Proving Languages Not To Be
Regular, Closure Properties of Regular Languages, Equivalence and Minimization
of Automata.
7 Hrs
4. Context-Free Grammars and Languages: Context-Free Grammars, Parse Trees,
Applications, Ambiguity in Grammars and Languages
7 Hrs
PART – C
5. Pushdown Automata, Properties of Context-Free Languages: Definition of the
Pushdown Automata, The Languages of a PDA, Equivalence of PDA’s and CFG’s,
Deterministic Pushdown Automata, Normal Forms for CFGs, The Pumping Lemma
for CFGs, Closure Properties of CFLs.
7 Hrs
6. Introduction to Turing Machines: Problems That Computers Cannot Solve, The
Turing machine, Programming Techniques for Turing Machines.
6 Hrs
PART – D
7. Extensions to the Basic Turing Machine: Restricted Turing machines, Turing
Machines and Computers.
6 Hrs
8. Undecidability: A Language That Is Not Recursively Enumerable, An Undecidable
Problem That Is RE, Undecidable Problems About Turing Machines, Post’s
Correspondence Problem.
6 Hrs
Text Books:
1. J.P.Hopcroft, Rajeev Motwani, J.D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Pearson Education, 3rd Edition, 2007.
Chapter 1(1.1 and 1.5), Chapter 2 (2.1, to 2.5) , Chapter 3 (3.1 to 3.3), Chapter 4
(4.1, 4.2 and 4.4), Chapter 5 (5.1 to 5.4), Chapter 6 (6.1 to 6.4 excluding 6.3.2),
Chapter 7 (7.1 to 7.3), Chapter 8 (8.1 to 8.6), Chapter 9 (9.1 to 9.4 excluding 9.4.3)
Reference Books:
1. John Martin, “Introduction to Languages and Theory of Computation”, Tata McGrawHill, 2003.
2. Peter Linz, “An Introduction to Formal Languages and Automata”, 4 th Edition,
Narosa Publishing House, 2007
IS503 – Principles of Programming Languages (3-0-0) 3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 3
Total Hours: 40
Course Outcomes
Study different programming languages, programming
environments, binding concept.
Learn the storage management, implementation of scope rules of
different programming languages
Gain knowledge of different data types like strings, arrays, sets,
pointers, type checking, records and variants
Understand the concepts of subroutine calling sequences,
parameter passing, exception handling and coroutines
Get an overview of functional languages, logic languages and
scripting languages.
Mapping to
POs
1, 11
1, 2, 10
1, 5, 11
10, 11
2, 3, 5, 10, 12
PART- A
1. Introduction, Names, Scope, and Bindings: Language Design, Programming
Language Spectrum, Why Study Programming Languages? Compilation and
Interpretation, Programming Environments. Names, Scope, and Bindings:
Concept of Binding Time, Object Lifetime and Storage Management.
5 Hrs.
2. Names, Scope, and Bindings (contd.): Scope Rules - Implementing Scope, The
Binding of Reference Environments, Macro Expansion.
5 Hrs.
PART- B
3. Data Types: Type Systems; Type Checking, Records and Variants.
5 Hrs.
4. Data Types (contd.): Arrays, Strings, Sets, Pointers and Recursive Types.
5 Hrs.
PART- C
5. Data Types (contd.): Lists. Files and Input/ Output, Equality Testing and
Assignment, Subroutines - Review of Stack Layout, Calling Sequences.
5 Hrs.
6. Subroutines (contd.): Parameter Passing, Generic Subroutines and Modules,
Exception Handling, Coroutines; Events.
5 Hrs.
PART- D
7. Functional Languages, Logic Languages, Scripting Languages: Functional
Languages: Origins, Concepts, An overview of scheme, Evaluation Order Revisited,
Higher-order Functions
5 Hrs.
8. Functional Languages, Logic Languages, Scripting Languages (contd.):
Functional Programming in Perspective. Logic Languages: Concepts, Prolog,
Logic Programming in Perspective. Scripting Languages: Common Characteristics.
5 Hrs.
Text Book:
1. Michael L. Scott, Programming Language Pragmatics, Third Edition, Elsevier, 2009.
(Chapters 1.1 to 1.5, 3 .1 to 3.4, 3.6, 3.7, 7, 8, 10.1 to 10.5, 10.7, 11.1, 11.2, 11.4, 13.1)
Reference Books:
1. Ravi Sethi, Programming Languages Concepts and Constructs, 2 nd Edition, Pearson
Education, 1996.
2. R Sebesta: Concepts of Programming Languages, 8th Edition, Pearson Education,
2008.
3. Allen Tucker, Robert Nonan: Programming Languages, Principles and Paradigms,
2nd Edition, Tata McGraw-Hill, 2007.
IS504 - Database Management Systems (3-1-0)4
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 4
Total Hours: 52
#
Course Outcome
1.
Students learn the use of Database Management System
concepts and its applications.
Students design relational Schema and ER diagram, get
familiarized with creation of attributes, tables, records,
constraints, various types of queries using SQLs and think
critically and creatively, both independently and with others in the
team.
Learn the relationships between different tables based on
attributes and constraints, and to normalize tables up to third
normal form.
Design, implement, test and debug application programs using
SQL and design queries for various database transactions.
Work effectively in teams to design and implement solutions to
computational problems.
Mapping
POs
1
2.
3.
4.
5.
1, 2, 3, 7
1, 9, 10, 12
2, 5
4, 5, 7
to
PART – A
1. Introduction: Introduction, An example, Characteristics of Database approach,
Actors on the Screen, Workers Behind the Scene, Advantages of Using DBMS
Approach, A Brief History of Database Applications, When Not to Use a DBMS.
Data Models, Schemas and Instances, Three-schema Architecture and Data
Independence, Database Languages and Interfaces, The Database System
Environment, Centralized and Client-Server Architectures, Classification of
Database Management Systems.
6 Hrs
2. Entity-Relationship Model: Using High-Level Conceptual Data Models for
Database Design, An Example Database Application, Entity Types, Entity Sets,
Attributes and Keys, Relationship Types, Relationship Sets, Roles and Structural
Constraints, Weak Entity Types, Refining the ER Design, ER Diagrams, Naming
Conventions and Design Issues, Relationship Types of Degree Higher Than Two.
6 Hrs
PART – B
3. Relational Model and Relational Algebra: Relational Model Concepts, Relational
Model Constraints and Relational Database Schemas, Update Operations,
Transactions and Dealing with Constraint Violations, Unary Relational Operations:
SELECT and PROJECT, Relational Algebra Operations from Set Theory, Binary
Relational Operations: JOIN and DIVISION, Additional Relational Operations,
Examples of Queries in Relational Algebra.
6 Hrs
4. Relational Model and Relational Algebra (contd…): Relational Database Design
Using ER- to-Relational Mapping.
SQL–1: SQL Data Definition and Data Types, Specifying Basic Constraints in SQL,
Schema Change Statements in SQL, Basic Queries in SQL.
7 Hrs
PART – C
5. SQL–1 (contd.): More Complex SQL Queries.
SQL–2: Insert Delete and Update Statements in SQL, Specifying Constraints as
Assertion and Trigger, Views (Virtual Tables) in SQL, Additional Features of SQL,
Database Programming Issues and Techniques, Embedded SQL, Dynamic SQL,
Database Stored Procedures and SQL / PSM.
7 Hrs
6. Database Design–1: Informal Design Guidelines for Relation Schemas, Functional
Dependencies, Normal Forms Based on Primary Keys, General Definitions of
Second and Third Normal Forms, Boyce-Codd Normal Form.
6 Hrs
PART - D
7. Database Design-2: Properties of Relational Decompositions, Algorithms for
Relational Database Schema Design, Multivalued Dependencies and Fourth Normal
Form, Join Dependencies and Fifth Normal Form, Inclusion Dependencies, Other
Dependencies and Normal Forms.
Transaction Management: The ACID Properties, Transactions and Schedules.
7 Hrs
8. Transaction Management(contd.): Concurrent Execution of Transactions, Lock Based Concurrency Control, Performance of Locking, Transaction Support in SQL,
Introduction to Crash Recovery, 2PL, Serializability and Recoverability, Lock
Management, Introduction to ARIES, The log, Other Recovery-related structures,
The Write-ahead Log Protocol, Checkpointing, Recovering From a System Crash,
Media Recovery, Other Approaches and Interaction with Concurrency Control.
7 Hrs
Text Books:
1. Elmasri and Navathe, “Fundamentals of Database Systems”, 5 th Edition, AddisonWesley, 2007
(Chapters 1, 2, 3 except 3.8, 5, 6.1 to 6.5, 7.1, 8, 9.1, 9.2 except SQLJ, 9.4, 10, 11)
2. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”, 3 rd
Edition, McGraw-Hill, 2003.
(Chapters 16, 17.1, 17.2, 18)
Reference Books:
1. Silberschatz, Korth and Sudarshan: “Data base System Concepts”, 5 th Edition, McGraw Hill, 2006.
2. C.J. Date, A. Kannan, S. Swamynatham: “An Introduction to Database Systems”, 8th
Edition, Pearson Education, 2006.
IS505 - Computer Networks–I (4-0-0)4
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 4
Total Hours: 52
Course Outcome
Students will be introduced to the concepts of data
communications and networking and discussion on data
communication components, data representation and data flow
Gain the knowledge of analog and digital signals and how the
analog-to-digital conversion is done and vice-versa.
will study various multiplexing techniques and different
transmission media.
Will have the basic understanding of the telephone networks,
switching and the process of error detection and correction
Will study the architecture of SONET and virtual circuit networks.
Mapping to
POs
1
1, 2
1, 2
1, 5, 12
1, 10
PART – A
1. Introduction: Data Communications, Networks, the Internet; Protocols and
Standards, Layered Tasks, The OSI Model, Layers in the OSI Model, TCP/ IP
Protocol Suite, Addressing.
7 Hrs
2. Data and Signals: Analog and Digital Signals, Transmission Impairment, Data
Rate Limits, Performance, Digital-to-Digital Conversion – Line Coding Schemes.
7 Hrs
PART – B
3. Digital Transmission: Digital-to-Digital Conversion – Block Coding Schemes,
Analog–to–Digital Conversion, Transmission Modes. Digital-to-Analog Conversion,
Analog-to-Analog conversion.
6 Hrs
4. Multiplexing, Transmission Media: Multiplexing, Spread Spectrum, Guided Media,
Unguided Media.
6 Hrs
PART – C
5. Switching, Telephone Network: Circuit-switched Networks, Datagram Networks,
Virtual Circuit Networks, Structure of a Switch, Telephone Network, Cable TV
Networks, Cable TV for Data Transfer, Dial-up Modems, Digital Subscriber Line.
7 Hrs
6. Error Detection and Correction: Introduction, Block Coding; Linear Block Codes,
Cyclic Codes, Checksum
6 Hrs
PART – D
7. Data Link Control: Framing, Flow and Error Control,
Channels; Noisy Channels, HDLC, Point-to-Point Protocol.
Protocols, Noiseless
7 Hrs
8. SONET/SDH: Architecture, SONET Layers, SONET Frames, STS Multiplexing,
Virtual Circuit Networks: Frame Relay, ATM.
6 Hrs
Text Book:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 5th Edition, Tata
McGraw-Hill, 2006.
(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 17 - Excluding 17.5, 18)
Reference Books:
1. Alberto Leon-Garcia and Indra Widjaja, “Communication Networks - Fundamental
Concepts and Key Architectures”, 3rd Edition Tata McGraw-Hill, 2004.
2. William Stallings, “Data and Computer Communication”, 8 th Edition, Pearson
Education, 2007.
IS506 – Systems Programming (4-0-0) 4
Exam: 3 Hrs.
SEE: 50 Marks
#
Course Outcomes
1. Introduced to various machine architecture
2. Learn the basic functions and features of assemblers, linkers
and loaders
3. Basic understanding of the functionalities of editors and
interactive debugging systems
4. Appreciate the functionalities of Macro processors
5. Learn the syntax of lex and yacc, and will be able to write the
simple programs
Hours/Week: 4
Total Hours: 52
Mapping to POs
1, 12
1, 2
1, 2, 3, 10
1, 2, 10
1, 2, 3, 12
PART - A
1. Machine Architecture: Introduction, System Software and Machine Architecture,
Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE
Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines VAX Architecture, RISC Machines - Ultra SPARC Architecture
6 Hrs
2. Assemblers - 1: Basic Assembler Function - A Simple SIC Assembler, Assembler
Algorithm and Data Structures, Machine Dependent Assembler Features Instruction Formats & Addressing Modes, Program Relocation.
6 Hrs
3. Assemblers - 2: Machine Independent Assembler Features – Literals, SymbolDefinition Statements, Expression, Program Blocks, Control Sections and
Programming Linking, Assembler Design Operations - One-Pass Assembler, MultiPass Assembler, Implementation Examples - MASM Assembler.
6 Hrs
4. Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A
Simple Bootstrap Loader, Machine-Dependent Loader Features – Relocation,
Program Linking, Algorithm and Data Structures for a Linking Loader; MachineIndependent Loader Features - Automatic Library Search, Loader Options, Loader
Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders,
Implementation Examples - MS-DOS Linker.
8 Hrs
PART – B
5. Editors And Debugging Systems: Text Editors - Overview of Editing Process,
User Interface, Editor Structure, Interactive Debugging Systems - Debugging
Functions and Capabilities, Relationship With Other Parts Of The System, UserInterface Criteria.
6 Hrs
6. Macro Processor: Basic Macro Processor Functions - Macro Definitions and
Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent
Macro Processor Features - Concatenation of Macro Parameters, Generation of
Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro
Processor Design Options – Recursive Macro Expansion, General-Purpose Macro
Processors, Macro Processing Within Language Translators, Implementation
Examples - MASM Macro Processor.
8 Hrs
7. Lex and Yacc: Lex and Yacc - The Simplest Lex Program, Recognizing Words With
LEX, Symbol Tables, Grammars, Parser-Lexer Communication, The Parts of
Speech Lexer, A YACC Parser, The Rules Section, Running LEX and YACC, LEX
and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular
Expressions,Parsing aCommand Line.Using YACC – Grammars, Recursive Rules,A
YACC Parser - The Definition Section, The Rules Section, Symbol Values and
Actions, The LEXER, Arithmetic Expressions and Ambiguity, Variables and Typed
Tokens.
6 Hrs
8. Introduction to Compiling: Compilers, Analysis of the source program. The
phases of a compiler, Cousins of the compiler, The grouping of Phases ,Compiler
construction tools.
6 Hrs
Text Books:
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
(Chapters 1 (except1.4.2, 1.5.2,1.5.3), 2 (except 2.5.2 2.5.3), 3(except 3.5.2,3.5.3)
4(except4.4.2,4.4.3), 7 (except 7.1), )
2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999.
(Chapters 1, 2 (Page 27-36), 3 (Page 51-65))
3. Alfred V.Aho,Ravi Sethi,Jeffrey D. Ullman: Compilers ,Pearson-Education,2013
(Chapter 1)
Reference Books:
1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata
McGraw - Hill, 1999.
IS507 - Database Applications Laboratory (0-0-3)1.5
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
Hours/Week: 3
Total Hours: 39
Course Outcome
Mapping to
POs
Students apply Database concepts to develop solutions for 2, 5
application involving Databases.
Effectively design an ER diagram and map it to relational Schema 1, 2, 3, 11
and get familiarized with creation of tables, attributes, records,
constraints, reports using Oracle
Work effectively in teams to design and implement solutions to 3, 7, 8
computational problems, think critically and creatively, both
independently and with others in the team.
1. Consider the following schema:
Employee (EmpNo, EmpName, Sex, Salary, Address, DNo, age)
Department (DeptNo, DeptName, Location)
Create Employee table with following constraints:
i. Make EmpNo as Primary key
ii. Do not allow EmpName, Sex, Salary and Address to have null values
iii. Set the default salary value to Rs. 1000.
Create Department table with following:
i. Make DeptNo as Primary key
ii. Make DeptName as candidate key
Make DNo of Employee as foreign key which refers to DeptNo of Department
Design a database to the satisfy the above requirements and answer following
queries
a) List all the employees who are above 40 years of age
b) List the employees who work in a particular department
c) List the employees who are drawing salary more than 10,000
d) List all the female employees who are 30 years of age and drawing salary
>8000
2. Consider the following relations:
STUDENT (snum: integer, sname: string, major: string, level: string, age: integer)
CLASS (name: string, meets at: string, room: string, d: integer)
ENROLLED (snum: integer, cname: string)
FACULTY (fid: integer, fname: string, deptid: integer)
The meaning of these relations is straightforward; for example, Enrolled has one record
per student-class pair such that the student is enrolled in the class. Level is a two
character code with 4 different values (example: Junior: JR etc)
Write the following queries in SQL. No duplicates should be printed in any of the
answers.
i. Find the names of all Juniors (level = JR) who are enrolled in a class taught by Prof.
Harshith
ii. Find the names of all classes that either meet in room R128 or have five or more
Students enrolled.
iii. Find the names of all students who are enrolled in two classes that meet at the same
time.
iv. Find the names of faculty members who teach in every room in which some class is
taught.
3. 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)
Create the above tables by properly specifying the primary keys and the foreign
keys. Enter atleast five tuples for each relation.
a) 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.
b) Find the author of the book which has maximum sales.
c) Demonstrate how you increase the price of books published by a specific
publisher by 10%.
4. A mini project on database, has to be designed and implemented using an RDBMS
environment like Oracle with Front end VB or any other similar tool.
Instructions:
1. The exercises are to be solved in an RDBMS environment like Oracle or DB2.
2. Suitable tuples have to be entered so that queries are executed correctly.
3. Front end may be created using either VB or VAJ or any other similar tool.
4. The student has to create the front end in the examination. The results of the
queries may be displayed suitably.
5. Relevant queries other than the ones listed along with the exercises may also be
asked in the examination.
6. Questions must be asked based on lots.
7. In the Internal CIE examination any Database can be asked to be executed.
8. The developed mini project has to be demonstrated in the SEE.
IS508 - Systems Programming and Operating Systems Laboratory
(0-0-3)1.5
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 3
Total Hours: 39
#
Course Outcome
1.
Able to design and implement different LEX programs such as
validating arithmetic expressions, counting characters, identifiers
and words etc.
Able to design and implement different YACC programs to
recognize valid variables, grammars and strings.
Able to design and implement shell scripts.
Able to design and implement different C programs in Linux
environment.
2.
3.
4.
Mapping to
POs
2, 5, 11
2, 5, 11
2, 5
2, 5
PART – A: Lex and Yacc
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 that program into separate file.
2. a. Program to recognize a valid arithmetic expression, identity the identifiers and
operators present and 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
(an bn , n>= 0).
6. Program to recognize the grammar (an b, n>= 10).
PART – B: UNIX Programming
7. 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 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.
8. 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 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.
9. a. Shell script that accepts path names and creates all the components in that path
names as directories. For example, if the script name is mpe, then the command
mpe a/b/c/d should create directories a, a/b, a/b/c, and a/b/c/d..
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.)
10. 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 that accepts one command-line argument, executes the arguments
as a shell command, determines the time taken by it and prints the time values, Use
the “times”, function and the “tms” structure. The code need not include error
checking.
11. a. Awk script that folds long line into 40 columns. Thus any line that exceeds 40
characters must be broken after 40th and is to be continued with the residue. The
inputs are to be supplied through a text file created by the user.
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.
12. a. Awk script to delete duplicated lines from a text file. The order of the original
must remain unchanged.
b. C program that accepts a valid directory names as a command line argument
and lists all the files in the given directory as well as all the subsequent
subdirectories. (The solution can be recursive or non- recursive)
13. a. Shell script to implement terminal locking. It should prompt the user for a
password. After accepting the password entered by the user, it must prompt again
for password confirmation (to retype the password). If a match occurs, it must lock
the terminal and prompt for the password. If the proper password is entered, the
terminal must be unlocked. Note the script must be written to disregard BREAK,
Control-D etc. No time limit need be implemented for the lock duration.
b. C program to prompt the user for the name of an environment variable and print
its value if it is defined and a suitable message otherwise; and to repeat the process
if user wants it.
14. Develop and execute a program in C / C++ to simulate the working of First come
First Served(FCFS) Algorithm. Determine the average turn-around time and
average waiting time.
15. Develop and execute a program in C/C++ to to simulate FIFO Page Replacement
Algorithm.
16. evelop and execute a program in C/C++ to simulate LRU page Replacement
Algorithm.
17. Develop and execute a program in C / C++ to simulate the working of Round-Robin
Scheduling Algorithms. Experiment with different quantum sizes for the RoundRobin algorithm. In all cases, determine the average turn-around time. The input
can be read from key board or from a file.
18. Develop and execute a program in C/C++ to simulate the working of First fit memory
management Algorithm.
19. Develop and execute a program to implement the Banker’s Algorithm. Demonstrate
its working with different data values. (Either Deadlock Avoidance / Deadlock
Prevention)
HS004 - Communication Skills - 2 (2-0-0) 1.5
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
Hours/Week: 3
Total Hours: 39
Course Outcome
Understand and acquire ability to manage the change from
college to corporate culture and the professional etiquettes and
behavior.
Demonstrate ability to read and interpret advertisements and
construct resumes.
Participate in group discussions and face interviews with
Mapping to
POs
6, 8, 10
7
4, 6, 7, 10
emphasis on narrating and describing situations to develop oral
communication skills including fluency, idea sequencing,
accuracy, vocabulary and pronunciation.
Session No. Topics
Session 1
College to Corporate - Change management
Session 2
Grooming
Etiquettes and behavior - General Professional Power of Dressing and
Session 3
Meetings & Report writing
Session 4
Stress Management
Session 5
Aptitude and Analytical Skills/ practice papers
Session 6
Reading and interpreting advertisements
Session 7
Resume writing & writing covering letters
Session 8
Understanding types of Interviews
Session 9
The essence of Group Discussion in Interviews
Session 10 Mock Interviews - GD
Session 11 Mock Interviews - Panel Interviews
Session 12 Mock Interviews - Screening/Individual Interviews
Session 13 Recap and Feedback
HS005 - Constitution of India and Professional Ethics (2-0-0) 0
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 2
Total Hours: 26
#
Course Outcome
1.
Understand the significance of the preamble of the constitution,
the fundamental rights and duties
Appreciate and emulate the principles of Freedom of thought and
expression as a professional
Critically analyze and interpret the current scenario of the nation
verses the constitutional provisions
Gain professional and ethical responsibility as engineers and
acquire applicational competence
2.
3.
4.
Mapping to
POs
1, 6, 10, 8
9, 10
6, 8, 10
10, 9
Constitution of India
Preamble to the constitution of India - Evolution of constitutional Law Scope and
extent of fundamental rights under part III - Details of Exercise of rights, Limitations
and Important Cases.
4 Hrs
Relevance of Directive Principles of State Policy under Part IV, Significance of
Fundamental Duties under Part IV a.
3 Hrs
Union Executive President, Vice-President, Prime Minister, Council of Ministers,
Parliament and Supreme Court of India.
3 Hrs
State Executive, Governor, Chief Minister, Council of Ministers, Legislature and High
Courts.
3 Hrs
Constitutional provisions for scheduled castes and tribes, women and children and
backward classes, Emergency provisions
4 Hrs
Electoral process, amendment procedure, 42nd, 44th, 74th, 76th, 86th and 91st
constitutional amendments.
3 Hrs
Professional Ethics
Scope and aims of engineering ethics, responsibility of engineers, impediments to
responsibility.
3 Hrs
Honesty, integrity and reliability, risks, safety and liability in engineering.
3 Hrs
Text Books:
1. Durga Das Basu : Introduction to the Constitution of India (Students Edn.), PH EEE, 19th / 20th Edn., 2001
2. Charles E Haries, Michael S Pritchard and Michael J Robins, Engineering Ethics,
Thompson Asia, 2003-08-05
Reference Books:
1. M V Pylee : An Introduction to Constitution of India, Vikas Publishing
M Govindarajan, S Natarajan, V S Senthilkumar : Engineering Ethics, Prentice - Hall
of India, New Delhi, 2004
IS601 - Java and J2EE (3-0-2)4
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
Course Outcome
Learn fundamentals of Programming with Java, using various
data types, operators, expressions and control statements.
Gain the knowledge of exception handling, applets,
multithreaded programming, event handlers and swings.
Understand and implement concepts of Servlets, JDBC, JSP.
Hours/Week:4
Total Hours: 52
Mapping to Pos
1,2
2,5,10
1,10,12
PART - A
1. Introduction to Java: Java and Java Applications, How Java Changed the Internet,
Java Development Kit (JDK), The Byte Code, Servlets, The Java Buzzwords,
Object-Oriented Programming, Simple Java Programs using Control Statements
and Blocks of code, Lexical Issues, Data Types, Variables, and Arrays : The
primitive Types, Integers, Floating-Point Types, Characters, Booleans, Literals,
Variables, Type Conversion and Casting, Arrays, Strings, Operators : Arithmetic,
Bitwise, Relational, Boolean Logical, Assignment Operator, The ? Operator,
Operator Precedence, Java’s Selection Statements, Iteration Statements, Jump
Statements.
7 Hrs
2. Introducing Classes, Objects and Methods: Class Fundamentals, Declaring
Objects, Object Reference Variables, Methods, Constructors, The this keyword,
Garbage collection, Overloading Methods and constructors, Argument Passing,
Returning Objects, Recursion, Access Control, Nested and Inner Classes.
6 Hrs
PART - B
3. Inheritance, Packages and Interfaces, Exception Handling: Inheritance Basics,
Using Super, Multilevel Hierarchy, When Constructors are called, Method
Overriding, Abstract Classes. Packages, Access Protection, Importing Packages,
Interfaces, Exception-Handling Fundamentals, Exception types, Uncaught
Exceptions, Using try and Catch, Multiple catch Clauses, Nested try Statements,
throw, Java’s Built-in Exceptions.
6 Hrs
4. Multi Threaded Programming, Event Handling: The Java Thread Model, The
Main Thread, Creating a Thread, Creating Multiple Threads, Using isAlive() and
join(), Synchronization, Interthread Communication, The Modern way of
Suspending, Resuming, and stopping Threads. Event Handling: Two Event
Handling Mechanisms, The Delegation Event Model, Event Classes, Sources of
Events, Event Listener Interfaces, Using the Delegation Event Model, Adapter
Classes, Inner Classes.
7 Hrs
PART - C
5. The Applet Class: Two Types of Applets, Applet Basics, Applet Architecture, An
Applet Skeleton, Simple Applet Display Methods, Requesting Repainting, Using the
Status Window, The HTML APPLET tag, Passing Parameters to Applets,
getDocumentbase() and getCodebase(), ApletContext and showDocument(), The
AudioClip Interface, The AppletStub Interface, Output to the Console.
6 Hrs
6. Swing: The Origins of Swing, Two Key Swing Features, Components and
Containers, The Swing Packages, A Simple Swing Application, Event Handling,
Create a Swing Applet, J label and Image Icon, J Text Field, The Swing Buttons, J
Tab bed pane, J Scroll Pane, J List, J Combo Box, J Table.
7 Hrs
PART - D
7. Servlets, JSP: Background, The Life Cycle of a Servlet, Using Tomcat for Servlet
Development, A Simple Servlet, The Servlet API, The Javax.servlet Package,
Reading Servlet Parameter, The Javax.servlet.http Package, Handling HTTP
Requests and Responses, Using Cookies, Session Tracking. JSP Java Server
Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies,
Session Objects.
8 Hrs
8. Java 2 Enterprise Edition Overview, Database Access: Overview of J2EE and
J2SE. The Concept of JDBC, JDBC Driver Types, JDBC Packages, A Brief
Overview of the JDBC Process, Database Connection, Associating the JDBC/
ODBC Bridge with the Database, Statement Objects, ResultSet, Transaction
Processing, Metadata, Data Types, Exceptions.
5 Hrs
Text Books:
1. Herbert Schildt, “Java The Complete Reference”, 7th Edition, Tata McGraw-Hill,
2007.
(Chapters 1, 2, 3, 4, 5, 6, 8, 10, 11, 21, 22, 29, 30, 31)
2. Jim Keogh, “J2EE The Complete Reference”, Tata McGraw-Hill, 2007.
Reference Books:
1. Y. Daniel Liang, “Introduction to JAVA Programming, Brief Version”, 9th Edition,
Pearson Education, 2012.
2. Stephanie Bodoffetal, “The J2EE Tutorial”, 2nd Edition, Pearson Education, 2004.
IS602 - Computer Networks-II (3-1-0)4
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
Hours/Week: 4
Total Hours: 52
Course Outcome
Mapping to
POs
1, 10, 5
Concepts like random access, controlled access and
channelization and study IEEE standards.
Knowledge of backbone networks, virtual LANs and various
1, 10, 12
connecting devices.
Understands the concepts of IPV4 address, IPV6 addresses and 1, 10
transition
Will study the issues related to transport layer and application 1, 12
layer
PART – A
1. Multiple Access: Random Access, Controlled Access, Channelization.
Wired LANs: Ethernet - IEEE Standards.
6 Hrs
2. Wired LANs (Contd.): Connecting LANs, Backbone Networks, and Virtual
LANs:
Standard Ethernet and Changes in the Standard, Fast Ethernet, Gigabit Ethernet
Connecting Devices - Backbone Networks, Virtual LANs.
6 Hrs
PART – B
3. Network Layer: IPv4 Addresses, IPv6 Addresses.
Internet Protocol – Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6.
7 Hrs
4. Network Layer (contd.): Address Mapping, ICMP, IGMP, ICMPv6, Delivery,
Forwarding
7 Hrs
PART – C
5. Network Layer (contd.): Unicast Routing Protocols, Multicast Routing Protocols.
7 Hrs
6. Transport Layer: Process-to-Process Delivery, User Datagram Protocol, TCP,
Data Traffic, Congestion, Congestion Control.
6 Hrs
PART – D
7. Transport Layer (contd.): Congestion Control – Two Examples, Quality of Service,
Techniques to Improve QoS, Integrated Services, Differential Services, QoS in
Switched Networks.
Application Layer: Name Space, Domain Name Space, Distribution of Name
Space, DNS in the Internet, Resolution, DNS Messages, Types of Records,
Registrars, Dynamic DNS, Encapsulation.
6 Hrs
8. Application Layer (contd.): Remote Logging, Electronic Mail, File Transfer WWW
and HTTP: Architecture, Web Documents, HTTP.
7 Hrs
Text Books:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 5th Edition, Tata
McGraw-Hill, 2006.
(Chapters 12, 13, 15, 19, 20, 21, 22, 23, 24, 25, 26, 27)
Reference Books:
1. Alberto Leon-Garcia and Indra Widjaja, “Communication Networks - Fundamental
Concepts and Key architectures”, 3rd Edition Tata McGraw- Hill, 2004.
2. William Stallings, “Data and Computer Communication”, 8 th Edition, Pearson
Education, 2007.
IS603 - File Structures (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 3
Total Hours: 40
Course Outcome
Students will be able to understand the difference in accessing
speed of Primary memory and Secondary memory.
Will learn the conceptual difference between Physical files and
Logical Files.
Will learn the file handling functions available in C and C++.
Gain an understanding of Indexing, Co sequential Processing,
B-Trees and Hashing
Students will be able to design and implement file structures.
Mapping to POs
3, 10
3, 10
2, 3, 10
1, 5, 10
1, 2, 3, 5, 11
1. Introduction to the Design and Specification of File Structures: The Heart of the
File Structure Design, A Short History of File Structure Design, A Conceptual Tool
Kit.
Fundamental File Processing Operations: Physical Files and Logical files,
Opening files, Closing files, Reading and Writing, Seeking, Special Characters, The
Unix Directory Structure, Physical Devices and Logical Files, File-related Header
Files, Unix File System Commands
Secondary Storage and System Software: Storage as Hierarchy, A Journey of a
Byte, Buffer Management.
5Hrs
2. Fundamental File Structure Concepts, Managing Files of Records: Field and
Record Organization, Using Classes to Manipulate Buffers, Record Access. 5 Hrs
3. Organizing File for Performance: Data Compression, Reclaiming Space in Files,
Finding Things Quickly: An Introduction to Internal Sorting and Binary Searching,
Key Sorting.
5 Hrs
4. Indexing: What is an Index? A Simple Index for Entry-Sequenced Files, ObjectOriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes That
Are Too Large to Hold in Memory, Indexing to Provide Access by Multiple Keys,
Retrieval Using Combinations of Secondary Keys, Improving the Secondary Index
Structure: Inverted Lists, Selective indexes, Binding.
5Hrs
5. Cosequential Processing and the Sorting of Large Files: An Object-Oriented
Model for Implementing Cosequential Processes, Application of the Model to a
General Ledger Program, Extension of the Model to Include Multiway Merging, A
Second Look at Sorting in Memory.
5 Hrs
6. Multi-Level Indexing and B-Trees: The Invention of the B-tree, Statement of the
Problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees,
Example of Creating a B-tree, An Object-Oriented Representation of B-trees, B-tree
Methods, Nomenclature.
5 Hrs
7. B-Trees (contd.): Formal Definition of B-Tree Properties, Worst-case Search
Depth, Deletion, merging and Redistribution, Redistribution During Insertion, B*
Trees, Buffering of pages: Virtual B-Tress, Variable length Records and Keys.
Indexed Sequential File Access and Prefix B+ Trees: Indexed Sequential
Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set,
The Content of the Index: Separators Instead of Keys, The Simple Prefix B+ Tree.
Simple Prefix B+ Tree Maintenance.
5 Hrs
8. Hashing and Extendible Hashing: Introduction, A Simple Hashing Algorithm,
Hashing Functions and Record Distribution. How Much Extra Memory Should be
Used? Collision Resolution by Progressive Overflow, Storing More Than One
Record Per Address: Buckets. Extendible Hashing: Introduction, How Extendible
Hashing Works.
5 Hrs
Text Book:
1. Michael J. Folk, Bill Zoellick, Greg Riccardi, “File Structures-An Object Oriented
Approach with C++, 3rd Edition”, Addision-Wesley, 1998.
Chapters 1, 2, 3.7 to 3.9, 4.1, 4.2, 5.1, 6, 7 (Except 7.3, 7.4.2, 7.4.3), 8.1 to 8.4, 9,
10.1 to 10.6, 11.1 to 11.6 (Except 11.6.2), 12.1, 12.2.
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.
IS604 – Management Information Systems (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
Hours/Week: 3
Total Hours: 40
Course Outcome
Mapping to
POs
Students will be able to cognize the importance of Information 1, 7, 10
Technology and knowledge management in an organization.
Will gain the understanding of Electronic Business and Enterprise 5, 10
Business Systems.
Students will understand the mechanism of e-Commerce systems 5, 10
and Decision Support Systems.
Students will be able to appreciate the Security, Ethical and 6, 10
Societal Challenges of IT.
PART – A
1. Foundations of IS in Business: Information Systems in Business: Introduction,
The Real World of Information Systems, The Fundamental Role of IS in Business,
Types of IS, System Concepts: A Foundation, Components of an Information
System, Information System Resources.
5 Hrs
2. Competing with IT: Fundamentals of Strategic Advantages: Strategic IT,
Competitive Strategy Concepts, The Competitive Advantage of IT, The Value Chain
and Strategic IS, Reengineering Business Processes: The Role of IT, Creating a
Virtual Company, Building a Knowledge-Creating Company.
5 Hrs
PART – B
3. Electronic Business Systems: Enterprise Business Systems: Introduction, Crossfunctional Enterprise Applications, Enterprise Application Integration, Transaction
Processing Systems, Enterprise Collaboration Systems, Functional Business
Systems: Introduction, Marketing Systems, Manufacturing Systems
5 Hrs
4. Enterprise Business Systems: 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.
5 Hrs
PART – C
5. Electronic Commerce Systems: 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.
5 Hrs
6. Decision Support Systems: Decision Support in Business: Introduction, Decision
Support Systems (DSS), Management Information Systems, On-line Analytical
Processing, Executive Information Systems, Knowledge Management Systems,
Business and Artificial Intelligence (AI), Expert Systems.
5 Hrs
PART – D
7. Security and Ethical Challenges: Security, Ethical and Societal Challenges of IT:
Introduction, Ethical Responsibility of Business Professionals, Computer Crime,
Privacy Issues, Health Issues, Security Management of IT: Introduction, Tools of
Security Management, Internetworked Security Defenses.
5Hrs
8. Enterprise and Global Management of IT: Managing IT: Business and IT,
Managing IT, Business/ IT Planning, Managing the IS Function, Managing Global
IT:The International Dimension, Global IT Management, Cultural, Political and Geo Economic Challenges, Global Business/ IT Applications, Global IT Platforms, Global
Data Access Issues, Global Systems Development.
5 Hrs
Text Book:
1. James A. O’ Brien, George M. Marakas, “Management Information Systems”, 10 th
Edition, Tata McGraw Hill, 2013.
Chapters: 1, 2, 7, 8, 9, 10, 13 and 14
Reference Books:
1. Kenneth C. Laudon and Jane P. Laudon, “Management Information System Managing the Digital Firm” 9th Edition, Pearson Education, 2006.
2. W.S. Jawadekar, “Management Information Systems”, Tata McGraw Hill 1998.
IS605 - Web Programming (3-0-2)4
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
Hours/Week: 4
Total Hours: 52
Course Outcome
Will be able to understand the intricacies of Internet.
Students will be able to design and develop a new markup
language.
Will learn web programming languages like Javascript, Perl,
and PHP.
Students will be able to design and implement interactive
Websites.
Mapping to POs
2, 10
1, 2, 3, 5
3, 10
1, 2, 3, 5
PART – A
1. Fundamentals of Web: A Brief Introduction to the Internet, The World Wide Web,
Web Browsers, Web Servers, Uniform Resource Locators, Multipurpose Internet
Mail Extensions, HTTP, Security.
XHTML: Origins and Evolution of HTML and XHTML, Basic Syntax, Standard
XHTML Document Structure, Basic Text Markup, Images, Hypertext Links, Lists.
7 Hrs
2. XHTML (contd.): Tables, Forms, Frames, Syntactic Difference between HTML and
XHTML.
Cascading Style Sheets: Introduction, Levels of Style Sheets, Style Specification
Formats, Selector Forms, Property Value Forms, Font Properties, List Properties,
Colour, Alignment of Text, The Box Model, Background Images, The <span> and
<div> Tags, Conflict Resolution.
6 Hrs
PART – B
3. The Basics of JavaScript: Overview of JavaScript, Object Orientation and
JavaScript,
General Syntactic Characteristics, Primitives, Operations, and
Expressions, Screen Output and Keyboard Input, Control Statements, Object
Creation, and Modification, Arrays, Functions, Constructors, Pattern Matching
Using Regular Expressions, Errors in Scripts.
6 Hrs
4. JavaScript and XHTML Documents: The JavaScript Execution Environment, The
Document Object Model, Element Access in JavaScript, Events and Event
Handling, Handling Events from Body Elements, Handling Events from Button
Elements, Handling Events from The Text Box and Password Elements, The DOM2
Event Model, The navigator Object, DOM Tree Traversal and Modification
Dynamic Documents with JavaScript: Introduction, Positioning Elements, Moving
Elements, Element Visibility, Changing Colours and Fonts, Dynamic Content,
Stacking Elements, Locating the Mouse Cursor, Reacting to a Mouse Click, Slow
Movement of Elements, Dragging and Dropping Elements.
7 Hrs
PART – C
5. Introduction to XML: Introduction, The Syntax of XML, XML Document Structure,
Document Type Definitions, Namespaces, XML Schemas, Displaying Raw XML
Documents, Displaying XML Documents with CSS, XSLT Style Sheets, XML
Processors, Web Services.
6 Hrs
6. The Basics of Perl: Origins and Uses of Perl, Scalars and Their Operations,
Assignment Statements and Simple Input and Output, Control Statements,
Fundamentals of Arrays, Hashes, References, Functions, Pattern Matching, File
Input and Output, An Example.
Using Perl for CGI Programming: The Common Gateway Interface, CGI Linkage,
Query String Format, The CGI.pm Module, A Survey Example, Cookies.
7 Hrs
PART – D
7. Introduction to PHP: Origins and Uses of PHP, Overview of PHP, General
Syntactic Characteristics, Primitives, Operations and Expressions, Output, Control
Statements, Arrays, Functions, Pattern Matching, Form Handling, Files, Cookies,
Session Tracking.
7 Hrs
8. Database Access Through the Web: Relational Databases, An introduction to
Structured Query Language (Review), Architectures for Database Access, The
MySQL Database System, Database Access with Perl and MySQL, Database
Access with PHP and MySQL, Database Access with JDBC and MySQL.
6 Hrs
Text Book:
1. Robert W. Sebesta, “Programming the World Wide Web”, 4th Edition, Pearson
Education, 2006.
(Chapters 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13)
Reference Books:
1. Chris Bates, “Web Programming Building Internet Applications”, 3 rd Edition, Wiley
India, 2006.
2. James Lee, Brent Ware, “Open Source Web Development with LAMP”, Pearson
Education, 2005
IS607 - Web Programming Laboratory (0-0-3)1.5
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
Hours/Week: 3
Total Hours: 39
Course Outcome
Students gain the practical understanding of XHTML and XML.
gain the practical understanding of Javascript and DOM.
Students will gain the practical understanding of Perl,CGI and PHP.
Will be able to design and implement interactive Websites.
Mapping to
POs
1, 2
1, 2
1, 2
1, 2, 3
Note: In the examination each student picks one question from the lot of all 12
questions.
1. Develop and demonstrate a XHTML document that illustrates the use of external
style sheet, ordered list, table, borders, padding, color, and the <span> tag.
2. Develop a XHTML file that includes Javascript script for the following problems:
a) Input
: A number n obtained using prompt
Output
: The first n Fibonacci numbers
b) Input
: A number n obtained using prompt
Output : A table of numbers from 1 to n and their squares using alert
3. Develop and demonstrate using JavaScript, a XHTML document that displays
random numbers (integers).
4. a) Using Javascript script, develop a XHTML document that collects the USN (the
valid format is: A digit from 1 to 4 followed by two upper-case characters followed by
two digits followed by two upper-case characters followed by three digits; no
embedded spaces allowed) of the user. Event handler must be included for the form
element that collects this information to validate the input. Messages in the alert
windows must be produced when errors are detected.
b) Modify the above program to get the current semester also (restricted to be a
number from 1 to 8)
5. Develop and demonstrate a XHTML file that includes Javascript script that uses
functions for the following problems:
a) Parameter: A string
Output: The position in the string of the left-most vowel
b) Parameter: A number
Output: The number with its digits in the reverse order
6.
a) Develop and demonstrate, using Javascript script, a XHTML document that
contains three short paragraphs of text, stacked on top of each other, with only
enough of each showing so that the mouse cursor can be placed over some part of
them. When the cursor is placed over the exposed part of any paragraph, it should
rise to the top to become completely visible.
b) Modify the above document so that when a paragraph is moved from the top
stacking position, it returns to its original position rather than to the bottom.
7. Develop using JavaScript script, an XHTML document that demonstrates the use of
on load and on focus events.
8. a) Design an XML document to store information about a student in an engineering
college affiliated to VTU. The information must include USN, Name, Name of the
College, Brach, Year of Joining, and e-mail id. Make up sample data for 3
students. Create a CSS style sheet and use it to display the document.
b) Create an XSLT style sheet for one student element of the above document and
use it to create a display of that element.
9. a) Write a Perl program to display various Server Information like Server Name,
Server Software, Server Protocol, CGI Revision etc.
b) Write a Perl program to accept UNIX command from a HTML form and to display
the output of the command executed.
10. a) Write a Perl program which meets the following specifications:
Input: A file, specified on the command line, of lines of text, where each line is
person’s name
Output: The input names, after all letters are converted to uppercase, in
alphabetical order.
a
b) Write a Perl program which meets the following specifications:
Input: A file of text in which all words are separated by whitespace or punctuation,
possibly followed by whitespace, where the punctuation can be a comma, a
semicolon, a question mark an exclamation point, a period, or a colon. The input
file is specified on the command line
Output: A list of all unique words in the input file, in alphabetical order
11. a) Write a Perl program to accept the User Name and display a greeting message
randomly chosen from a list of 4 greeting messages.
b) Write a Perl program to keep track of the number of visitors visiting the web page
and to display this count of visitors, with proper headings.
12. Write a Perl program to display a digital clock which displays the current time of the
server.
13. Write a Perl program to insert Name and Age information entered by the user into a
table created using MySQL and to display the current contents of this table.
14. Write a PHP program to store current date and time in a COOKIE and display the
Last visited on date and time on the web page upon reopening of the same page.
15. Write a PHP program to store page views count in SESSION, to increment the
count on each refresh, and to show the count on web page.
16. Using PHP and MySQL, Create a XHTML form with Name, Address Line 1, Address
Line 2, and E-mail text fields. On submitting, store the values in MySQL table.
Retrieve and display the data based on Name.
17. Using PHP and MySQL, develop a program to accept book information viz.
Accession Number, Title, Authors, Edition and Publisher from a web page and store
the information in a database and to search for a book with the title specified by the
user and to display the search results with proper headings.
HS006 - Environmental Studies (2-0-0) 0
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 2
Total Hours: 26
#
Course Outcome
1.
Acquire an awareness of and sensitivity to the total environment
and its allied problems.
Develop strong feelings of concern, sense of ethical responsibility
for the environment and the motivation to act in protecting and
improving it.
Analyze and evaluate environmental measures in real world
situations in terms of ecological, political, economical, societal and
aesthetic factors.
2.
3.
Mapping to
POs
7, 10
6, 11
6, 8, 9
1. Environment: Definition, Ecosystem, Balanced ecosystem, Effects of human
activities
on environment
Agriculture Housing Industry Mining and
Transportation.
4 Hrs
2. Natural Resources: Water resources, Availability and Quality, Water borne
diseases, Water induced diseases, Fluoride problem in drinking water. Mineral
Resources - Forest Resources - Material Cycles - Carbon, Nitrogen and Sulphur
Cycles.
8 Hrs
3. Pollution: Effects of pollution - Water pollution - Air pollution Land pollution - Noise
pollution.
8 Hrs
4. Current Environmental issues of importance: Acid Rain, Ozone layer depletion Population Growth, Climate change and Global warming. Environmental Impact
Assessment and Sustainable Development Environmental Protection - Legal
aspects.
Water
Act
and
Air
Act.
8 Hrs
Text Books:
1. Environmental Studies - Dr. D.L Manjunath, Pearson Education -2006
2. Environmental Studies - Dr. S. M. Prakash - Elite Publishers - 2006
Reference Books:
1. Environmental Studies - Benny Joseph - Tata McGraw ill- 2005
2. Principles of Environmental Science and Engineering P. Venugopaia Rao, Prentice
Hall of India.
3. Environmental Science and Engineering - Meenakshi, Prentice Hall India.
IS651-Distributed Operating Systems (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 3
Total Hours: 40
#
Course Outcome
1.
Students will be introduced to the basic concepts of Distributed
computing systems and various system models.
Students will know about the different issues in message passing,
encoding and decoding, process addressing and other concepts.
Students learn to use remote procedure calls for client server
communication and also issues related to security and exception
handling.
Students gain an understanding of distributed shared memory
systems, their design and implementation.
Students get the fundamental knowledge of resource and process
management.
2.
3.
4.
5.
Mapping to
POs
1, 12
1, 5, 10
1, 10
3, 10
1, 12
PART - A
1. Fundamentals: What is Distributed Computing Systems? Distributed Computing
System Models, What is Distributed Operating System? Issues in Designing a
Distributed Operating System, Introduction to Distributed Computing Environment
(DCE).
5 Hrs
2. Message Passing
Desirable Issues of Good Message Passing, Issues in IPC by Message Passing,
Synchronization, Buffering, Multi datagram Messages, Encoding and Decoding of
Message Data, Process Addressing, Failure Handling, Group Communication, Case
Study: 4.3 BSD UNIX IPC Mechanism.
5Hrs
PART - B
3. Remote Procedure Calls: The RPC Model, Transparency of RPC, Implementing
RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and
Results, Server Management, Parameter - Passing Semantics, Call Semantics,
Communication Protocols for RPCs, Complicated RPCs.
5 Hrs
4. Remote Procedure Calls (cont.):
Security, Case Studies: Sun RPC.
Client-Server Binding, Exception Handling,
Distributed Shared Memory: General Architecture of DSM Systems, Design and
Implementation Issues of DSM, Granularity, Structure of Shared Memory Space,
Consistency Models.
5 Hrs
PART – C
5. Distributed Shared Memory (cont.): Replacement Strategy, Thrashing.
Synchronization: Clock Synchronization
5 Hrs
6. Synchronization (contd.): Event Ordering, Mutual Exclusion, Deadlock, Election
Algorithms.
5 Hrs
PART - D
7. Resource Management: Desirable Features of a Good Global Scheduling
Algorithm, Task Assignment Approach, Load – Balancing Approach, Load – Sharing
Approach.
5 Hrs
8. Process Management
Process Migration, Threads.
5 Hrs
Text Book:
1. Pradeep. K. Sinha, “Distributed Operating System: Concepts and Design”, 1997,
PHI. Chapters: 1.1, 1.3, 1.5 -1.7, 3.2-3.11, 4.2-4.15, 4.20, 5.2-5.8, 6.2-6.6, 7.2-7.4,
8.2-8.3
Reference Book:
1. Andrew S. Tanenbaum, “Distributed Operating System, Pearson Education”, 2002
IS652 - Advanced DBMS (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 3
Total Hours: 40
Course Outcome
Students will get an understanding the basic indexing structures for
files and learn to write optimized queries.
Understands different issues in physical database design and learn
the concepts of tuning the design.
Students will be introduced to the basic object oriented database
concepts like ODL and OQL.
Students gain the knowledge of enhanced data models like active
data bases, temporal databases and deductive databases.
Students get an overview of distributed databases and other
emerging database technologies.
Mapping to
POs
1, 2
2, 10, 11
1, 12
10, 11
10
PART – A
1. Indexing Structures for Files: Types of Single-Level Ordered Indexes, Multilevel
Indexes, Dynamic Multilevel Indexes Using B Trees and B+ Trees.
5 Hrs
2. Indexing Structures for Files (contd.): Hashing Techniques.
Query Processing and Optimization: Translating SQL Queries into Relational
Algebra, Algorithms for External Sorting, Algorithms for SELECT and SET
Operations
5 Hrs
PART – B
3. Query Processing and Optimization (contd.): Using Heuristics in Query
Optimization, Using Selectivity and Cost Estimates in Query optimization, Overview
of Query Optimization in ORACLE, Semantic Query Optimization.
5 Hrs
4. Physical Database Design and Tuning: Guidelines for Index Selection. Examples,
Clustering and Indexing, Indexes that Enable Index-Only Plans, Tools That Assist in
Index Selection, Physical Database Design in Relational Databases, An Overview of
Database Tuning in Relational Systems.
5 Hrs
PART - C
5. Concepts for Object Databases : Overview of Object- Oriented Concepts,
Overview of the Object Model of ODMG, The Object Definition Language ODL, the
Object Query Language OQL, Overview of the C++ Language Binding, Object
Database Conceptual Design.
5 Hrs
6. Enhanced Data Models for Advanced Applications: Active Database Concepts
and triggers, Temporal Database Concepts, Multimedia Databases.
5 Hrs
PART - D
7. Enhanced Data Models for Advanced Applications (contd.): Introduction to
Deductive Databases.
Distributed Databases And Client-Server Architecture:
Distributed Database
Concepts, Data Fragmentation, Replication, and Allocation Techniques for
Distributed Database Design, Type of Distributed Database Systems.
5 Hrs
8. Distributed Databases and Client-Server Architecture (contd.): An Overview of
3–Tier Client – Server Architecture, Distributed Databases in Oracle.
Emerging Database Technologies and Applications: Mobile Databases, Multimedia
Databases, Geographic Information Systems, Genome Data Management. 5 Hrs
Text Books:
1. Elmasri and Navathe. “Fundamentals of Database Systems”, 5th Edition, Pearson
Education, 2003.
2. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”,
3rd Edition, McGraw-Hill, 2003 ( Chapter 20.1 – 20.6)
Reference Books:
1. Silberschatz, Korth and Sudarshan, “Database System Concepts”, 4th Edition,
McGraw-HiIl, 2002.
2. Connolly and Begg, “Database Systems”, 3rd Edition, Pearson Publications, 2002.
IS653 - Computer Graphics and Visualization (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 3
Total Hours: 40
Course Outcome
Mapping to
POs
To understand basics of computer graphics
1, 2, 8
Ability to implement Computer Graphics algorithm
1, 2, 5
To develop the programming skills in 3G computer graphics.
1, 3
Ability to use OpenGL to develop Graphics applications.
1, 2
To acquire knowledge about the advanced techniques for 3D 1
rendering and modeling.
PART – A
1. Introduction: Applications of Computer Graphics, A Graphics System, Images,
Physical and Synthetic, Imaging Systems, The Synthetic Camera Model, The
Programmer’s Interface
5 Hrs
2. Graphics Architectures: Programmable Pipelines, Performance Characteristics.
Graphics Programming: The Sierpinski Gasket, Programming Two-Dimensional
Applications. The OpenGL API, Primitives and Attributes
5 Hrs
PART – B
3. The OpenGL API (contd..): Color, Viewing, Control Functions, The Gasket
Program, Polygons and Recursion, The Three-Dimensional Gasket.
5 Hrs
4. 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.
5 Hrs
PART – C
5. Geometric Objects and Transformations-1: Scalars, Points, and Vectors, ThreeDimensional Primitives, Coordinate Systems and Frames, Modeling a Colored
Cube, Affine Transformations,.
5 Hrs
6. Geometric Objects and Transformations-2: Rotation, Translation and Scaling,
Transformations in Homogeneous Coordinates, Concatenation of Transformations,
OpenGL Transformation Matrices, Interfaces to Three-Dimensional Applications.
5 Hrs
PART – D
7. Viewing: Classical and Computer Viewing, Viewing with a Computer, Positioning of
the camera, Simple Projections, Projections in OpenGL, Hidden-Surface Removal,
Interactive Mesh Displays.
5 Hrs
8. 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.
5 Hrs
Text Book:
1. Edward Angel, “Interactive Computer Graphics”, A Top-Down Approach with
OpenGL, 5th Edition, Addison-Wesley, 2008.
(Chapters 1, 2, 3, 4, 5, 6, 7)
Reference Books:
1. F.S. Hill Jr., “Computer Graphics Using OpenGL”, 2nd Edition, Pearson Education,
2001.
2. Donald Hearn and Pauline Baker, “Computer Graphics - OpenGL Version”, 2nd
Edition,
Pearson Education, 2003.
IS654 - Compiler Design (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
Hours/Week: 3
Total Hours: 40
#
Course Outcome
1.
2.
Understand different phases of a Compiler
Develop working skills in the theory and application of finite state
machines, production rules, parsing and language semantics
Acquire knowledge of different run time storage management,
hence the execution environment
Students will be able to apply classical compilation techniques to
diverse non-compiler applications like data processing
applications such as Word Processors and Work flow managers
Knowledge of Simple Code Optimization
3.
4.
5.
Mapping to
POs
1
1, 2, 9, 11
1, 3, 9, 11
1, 2, 3, 5, 11
5, 10
PART – A
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.
5 Hrs
2. Syntax Analysis–1:
Top-down Parsing.
Introduction, Context-free Grammars, Writing a Grammar,
5 Hrs
PART – B
3. Syntax Analysis–2: Bottom-up Parsing, Introduction to LR Parsing: Simple LR.
5 Hrs
4. Syntax Analysis–3:
Parser Generators.
More Powerful LR Parsers, Using Ambiguous Grammars,
5 Hrs
PART – C
5. Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Order for
SDDs, Applications of Syntax-Directed Translation, Syntax-Directed Translation
Schemes.
5 Hrs
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.
5 Hrs
PART – D
7. Run-Time Environments: Storage Organization, Stack Allocation of Space, Access
to Non-Local Data on the Stack, Heap Management, Introduction to Garbage
Collection.
5 Hrs
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.
5 Hrs
Text Book:
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman, “Compilers - Principles,
Techniques and Tools”, 2nd Edition, Addison-Wesley, 2007.
(Chapters 1, 3.1-3.4, 4, 5.1-5.4, 6, 7.1-7.5, 8.1-8.6)
Reference Books:
1. Charles N. Fischer, Richard J. LeBlanc, Jr., “Crafting a Compiler with C”, Pearson
Education, 1991.
2. Andrew W Apple, “Modern Compiler Implementation in C”, Cambridge University
Press, 1997.
IS655 - Unix Systems Programming (3-0-0)3
Exam: 3 Hrs.
SEE: 50 Marks
#
1.
2.
3.
4.
5.
Hours/Week: 3
Total Hours: 40
Course Outcome
Introduced with Unix files, ANSI standards and POSIX
development environment.
Will learn different UNIX file APIs and different file classes.
Knowledge of unix processes, process control and process
relationships.
Study about different signals and daemon processes.
Gain knowledge of interprocess communication and sockets.
Mapping to
POs
1
1, 10, 12
1, 12
1, 12
10, 11
PART – A
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.
UNIX Files: I-nodes in UNIX System V, Application Program Interface to Files,
UNIX Kernel Support for Files.
5 Hrs
2. UNIX File APIs
General File APIs, File and Record Locking, Directory File APIs, Device File APIs,
FIFO File APIs, Symbolic Link File APIs.
5 Hrs
PART – B
3. UNIX File APIs (contd.): 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.
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.
5 Hrs
4. 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.
5 Hrs
PART – C
5. 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.
Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The
SIGCHLD Signal and the waitpid Function.
5 Hrs
6. Signals and Daemon Processes: The sigsetjmp and siglongjmp Functions, Kill,
Alarm, Interval Timers, POSIX.lb Timers, timer class.
Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error
Logging, Single-instance daemons, Daemon conventions, Client-Server Model.
5 Hrs
PART – D
7. Interprocess Communication: Introduction, Pipes, popen, pclose Functions,
Coprocesses, FIFOs, XSI IPC, Message Queues, Sémaphores.
5 Hrs
8. Network IPC: Sockets - Introduction, Socket Descriptors, Addressing, Connection
Establishment, Data Transfer, Socket Options, Out-of Band Data, Non-blocking and
Asynchronous I/O.
5 Hrs
Text Books:
1. Terrence Chan, “Unix System Programming Using C++”, PHI, 1999.( Chapters 1, 5,
6.4, 6.5, 6.6, 7)
2. W. Richard Stevens, Stephen A. Rago, “Advanced Programming in the UNIX
Environment”, 2nd Edition, Pearson Education/ PHI, 2005.(Chapters 7, 8, 9, 13,
15.1-15-8, 16)
Reference Books:
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/
PHI, 1987.