B.M.S.

COLLEGE OF ENGINEERING, BENGALURU-19

(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Semester-III
Course Credits Total Total
No. Code Course Title
Type L T P Credits Hours

1 BS 23MA3BSSDM Statistics and Discrete 2 1 0 3 4

Mathematics

2 ES 23IS3PCCOA Computer Organization and 3 0 0 3 3

Architecture

3 PC1 23IS3PCDSC Data Structures 3 0 1 4 5

4 PC2 23IS3PCOOP Object Oriented Programming using 3 0 1 4 5

C++

5 PC3 23IS3PCDLD Digital Logic Design 2 1 0 3 4

6 PC4 23IS3PCOPS Operating Systems 3 1 0 4 5

7 AE/SDC 23IS3AEUSP UNIX System Programming 0 0 1 1 2

NSS

8 NCMC YOGA 0 0 0 0 0

Physical Edu. (Sports and Athletics)

TOTAL 16 3 3 22 28
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Statistics and Discrete Mathematics

Course Code 23MA3BSSDM Credits L-T-P 2-1-0
CIE 50 SEE 100 Marks (50% Weightage)
Contact Total Lecture
4 25
Hours/ Week Hours

UNIT - 1

GRAPH THEORY: Basic concepts: Types of graphs, order and size of a graph, in-degree andout-
degree, connected and disconnected graphs, Eulerian graph, Hamiltonian graphs, sub-graphs,
isomorphic graphs. Matrix representation of graphs: adjacency matrix, incidence matrix. Trees:
spanning tree, minimal spanning tree: Kruskal's algorithm and shortest path-Dijkstra's algorithm

UNIT - 2

PROBABILITY DISTRIBUTIONS:
Theoretical distributions: Discrete and continuous random variables
Discrete distributions: Poisson distribution, Geometric distributions. Continuous distributions:
Exponential, Gaussian, Uniform Distribution and Gamma distributions.

UNIT - 3

JOINT PROBABILITY AND MARKOV CHAIN:

Joint Probability Distributions: Discrete and continuous joint random variables, Mathematical
expectations, Covariance and Correlation.
Markov Chain: Probability vector, stochastic matrix, fixed point vector, regular stochastic
matrix. Higher transition probabilities, stationary distribution of regular Markov chain.

UNIT - 4

STATISTICAL INFERENCE: Introduction, procedure for testing of hypothesis, level of

significance.
Large sample: Test of significance for single mean and difference between two means.
Small sample: Test of significance for single mean, difference between two means, paired t-
test, ratio of variances (F-distribution) and Chi-Square goodness of fit.

UNIT - 5

COMBINATORICS:
Introduction, Binomial and multinomial theorems, Catalan numbers, the principle of inclusion
and exclusion, Derangements, Rook Polynomials, Generating functions.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Text Books:

1. Graph Theory and Combinatorics, D. S. Chandrasekharaiah, 4th Edition, Prism

Engineering Education Series, 2011-12
2. Higher Engineering Mathematics, B. V. Ramana, Tata McGrawHill, 2007
3. Discrete Mathematics and its applications, Kenneth H. Rosen, 7th Edition, McGraw Hill
Publishers.
4. Kenneth H. Rosen, Elementary number theory and its applications, 5th edition, Pearson
publications.

Reference Books:

1. Discrete Mathematics, Kolman, BusbyRoss, 5th edition, Prentice Hall, 2004.

2. Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo,
Eastern Economy Edition, PHI Learning Pvt., Ltd.
3. Mathematics for Machine Learning, Marc Peter Deisennorth, A. Aldo Faisal, Cheng Soon
Ong, Cambridge University Press. 2020.

e- Books:

1. Math 725 (Graph Theory), Spring 2016,

https://jlmartin.ku.edu/~jlmartin/courses/math725S16/.
2. An Introduction to Combinatorics and Graph Theory, David Guichard,
https://www.whitman.edu/mathematics/cgt_online/cgt.pdf.

MOOCs:

1. Introduction to Probability and Data with R, https://www.coursera.org/learn/probability-

intro.
2. Discrete Mathematics, https://nptel.ac.in/courses/111104026/.
3. Combinatorics, https://nptel.ac.in/courses/111106086/.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the concept of Discrete Mathematics and Statistics in Computer and allied
engineering science.
CO2 Demonstrate the Importance of Discrete Mathematics and Statistics using modern tools.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Computer Organization and Architecture

Course Code 23IS3PCCOA Credits 3 L-T-P 3-0-0
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Total Lecture
3 40
Hours/ Week Hours

UNIT - 1

Basic Structures of Computers: Computer Types, Functional Units, Basic Operational

Concepts, Bus Structures, Software, Performance.
Machine Instructions and Programs: Numbers, Arithmetic Operations and Characters, Memory
Locations and Addresses, Memory Operations, Instructions and Instruction Sequencing,
Addressing Modes.

UNIT - 2

Basic Processing Unit: Some Fundamental Concepts-Register Transfers, performing an

Arithmetic or Logic Operation, Fetching a Word from Memory, Storing a Word in Memory,
Execution of a Complete Instruction-Branch Instruction, Multiple-Bus Organization, Hardwired
Control-A Complete Processor.

UNIT - 3

Arithmetic: Addition and Subtraction of Signed Numbers, Multiplication of Positive Numbers,

Signed-Operand Multiplication, Fast Multiplication-Bit Pair Recoding Multipliers, Integer
Division, Floating-Point Numbers.

UNIT - 4

Input/output Organization: Accessing I/O Devices, Interrupts-Interrupt Hardware, Enabling

and Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests, Exceptions,
Direct Memory Access-Bus Arbitration, Buses-Synchronous and Asynchronous.

UNIT - 5

Pipelining: Basic Concepts - Role of Cache Memory, Pipeline Performance, Multistage

Pipelining.
Memory System: Some Basic Concepts, Speed, Size and Cost, Cache Memories - Mapping
Functions, Replacement Algorithms.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Text Books:

1. Computer Organization, Carl Hamacher, 5th Edition, McGraw Hill Publishers.

Reference Books:

1. Computer Organization & Architecture, William Stallings 10th Edition, Pearson, 2015.
2. Computer Organization and Design. The Hardware/SoftwareInterface, David A.Patterson
and John L.Hennessy, fifth Edition, Morgan Kaufman Publishers.

e- Books:

1. Computer Organization and Architecture, William Stallings 10 th Edition,

http://home.ustc.edu.cn/~louwenqi/reference_books_tools/Computer%20Organization%20a
nd%20 Architecture% 2010th % 20-%20William%20Stallings.pdf.

2. Computer Organization and Architecture, Atul P. Godse, Dr. Deepali A. Godse,

https://books.google.co.in/books?id=cp4eEAAAQBAJ&printsec=%20copyright&redir_esc
=y#v=onepage&q&f=false.

MOOCs:

1. Computer architecture and organization,

https://onlinecourses.nptel.ac.in/noc21_cs61/preview.
2. Computation Structures 3: Computer Organization, https://learning.edx.org/course/course-
v1:MITx+6.004.3x_2+1T2017/home.
3. High Performance Computer Architecture, https://www.udacity.com/course/high-
performance-computer-%20architecture--ud007.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Comprehend the concepts of basic architecture of a computer, instruction execution,
interrupts, bus structures, control signals, memory organization, arithmetic unit operations
and Pipelining concepts.
CO2 Apply the operational concepts for instruction execution, addressing modes, arithmetic
operations, control signals, memory operations and data transfer methods on various
problems.
CO3 Analyse types of addressing modes, .interrupts, arithmetic and logic circuits, memory,
pipeline performance ,bus architectures and its timing diagrams.
CO4 Enhance the knowledge skills and technological aspects on various processor architectures.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Data Structures

Course Code 23IS3PCDSC Credits 4 L-T-P 3-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Total Lecture
5 50
Hours/ Week Hours

UNIT - 1

Introduction to Data Structures: Definition and its classification, Dynamic Memory allocation.
Linked Lists: Definition, Basic Operations on Singly Linked List, singly linked List with Header
Nodes, Applications of Singly Linked Lists.

UNIT - 2

Linked List: Doubly Linked Lists, Circular Linked List – Implementation and Applications.
Stacks: Definition, Operations, Implementation using Arrays and Linked list, Applications of
Stack – Infix to postfix conversion, Evaluation of postfix expression.

UNIT - 3

Recursion: Definition, Writing recursive programs, Efficiency of Recursion. Queues: Definition,

Operations, Implementation using Arrays and Linked list. Types of queues – Circular queue,
Deque and priority queue, Applications of queues.

UNIT - 4

Binary Trees: Binary Tree properties and representations, traversals and other operations. Binary
Search Trees: Definition, Operations on BST, Threaded binary trees, Applications.

UNIT - 5

Balanced Trees: AVL Trees, Splay trees, Red- Black Trees – Definitions, Rotation and other
basic operations.

Text Books:
1. Data Structures using C and C++, Yedidyah, Augenstein, Tannenbaum, 2nd Edition,
Pearson Education, 2007.
2. Data Structures using C, Reema Thareja, Oxford University Press 2nd Edition, 2011.
Reference Books:
1. Fundamentals of Data Structures in C, by Horowitz, Sahni, Anderson- Freed, 2nd Edition,
Universities Press, 2007.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

2. Data Structures A Pseudocode Approach with C, Richard F. Gilberg and Behrouz A.

Forouzan, Cengage Learning, 2005.
e- Books:

1. https://www.mta.ca/~rrosebru/oldcourse/263114/Dsa.pdf
2. https://ebooks.lpude.in/computer_application/mca/term_2/DCAP407_DATA_STRUCTURE
.pdf

MOOCs:

1. Data Structures: An Active Learning Approach, https://www.edx.org/learn/computer-

science/the-university-of-california-san-diego-data-structures-an-active-learning-approach.
2. Data Structures and Algorithms Specialization
https://www.coursera.org/specializations/data-structures- algorithms.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:

CO1 Apply principles of Data Structures for solving problems.

CO2 Analyze and Develop operations on linear and non-linear data structures.

CO3 Design and formulate various methods of organizing data.

 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Object Oriented Programming Using C++

Course Code 23IS3PCOOP Credits 4 L-T-P 3-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Total Lecture
5 40
Hours/ Week Hours

UNIT - 1
Introduction: Overview to Object Oriented Programming, Benefits and applications of Object
Oriented Programming.
Beginning with C++: Program structure, cin and cout objects, namespace, identifiers, variables,
constants, operators, reference types, typecasting, control structures.
Objects and Classes: Basics of object and class in C++, private and public members, Specifying
a class, C++ program with a class, arrays within a class, memory allocation to objects, Array of
objects.

UNIT - 2
Functions in C++: Functions, Inline Function, function overloading, Default arguments, Friend
functions, static data and function members, Objects as function arguments, returning objects,
constant member functions and objects, this pointer. 270 page
Constructors and Destructors: Constructors and its types – Default constructors, Parameterized
constructors, multiple constructors in a class, Constructors with default arguments, dynamic
initialization of objects, Copy constructor, Dynamic constructors, Destructors.

UNIT - 3
Operator overloading and Type conversion: Defining Operator overloading, Overloading Unary
operators, Binary Operators using friend functions and Member functions, Overloading Special
operators, Comma operator, new and delete operators, Rules for overloading operators, Type
conversion.
Inheritance: Concept of Inheritance, types of inheritance - single, multiple, multilevel,
hierarchical, hybrid, protected members, overriding, virtual base class. student faculty one

UNIT - 4
Polymorphism: Pointers, Pointes to Objects, pointers to members and member functions, Pointers
to derived classes, virtual and pure virtual functions.
I/O and File Management: Concept of streams, C++ stream classes, Unformatted and formatted
I/O, manipulators, C++ File stream classes, File management functions, File modes, Binary and
Random Files.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

UNIT - 5

Templates: Introduction to templates, function templates and class templates. Introduction to

exception: try-catch throw, multiple catch, catch all, rethrowing exception, User defined
exceptions.
Introduction to Standard Template Library: Components of STL - Containers, Algorithms,
Iterators, Application of Container classes.

Text Books:
1. Object Oriented Programming with C++ by E Balaguruswamy, 6 th Edition, Tata McGraw Hill,
2013.
2. C++ - The Complete Reference by Herbert Schildt, 4th Edition, Tata McGraw Hill, 2015.
Reference Books:

1. C++ Primer by Stanley B Lippman, Josee Lajoie, Barbara E Moo, 6 th Edition, Addison Wesley
Professional.
2. Object-Oriented Programming in C++ by Robert Lafore, 4th Edition, Pearson Education.

e- Books:
1. https://fac.ksu.edu.sa/sites/default/files/ObjectOriented ProgramminginC4th Edition.
2. C++ Primer Fifth Edition,
https://zhjwpku.com/assets/pdf/books/C++.Primer.5th.Edition_2013.pdfe-Book.
MOOCs:

1. Programming in C++, https://onlinecourses.nptel.ac.in/noc19_cs38/preview

2. IIT BombayX: Object-Oriented Programming, https://www.edx.org/learn/object-oriented-
programming/iitbombay-object-oriented-programming

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:

CO1 Apply the concepts of data abstraction, encapsulation, polymorphism, inheritance,

templates and file handling.
CO2 Identify the usage of reusability, polymorphism and exception handling for solving
problems.
CO3 Develop solutions using object oriented programming concepts for a given problem.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Digital Logic Design

Course Code 23IS3PCDLD Credits 3 L-T-P 2-1-0
CIE 50 SEE 100 Marks (50% Weightage)
Contact Total Lecture
4 25
Hours/ Week Hours

UNIT - 1

Boolean Algebra and Combinational Networks: Definition of a Boolean Algebra, Boolean

Formulas and Functions, Canonical Formulas, Gates and Combinational Networks, Incomplete
Boolean Functions and Don't Care Conditions. (Text 1 – 3.1, 3.4 3.5, 3.7, 3.8)

Simplification of Boolean Expressions: Formulation of the Simplification Problem, Prime

Implicants and Irredundant Disjunctive Expressions, Prime Implicates and Irredundant
Conjunctive Expressions, Karnaugh Maps, Using K-Maps to Obtain Minimal Expressions for
Complete Boolean Functions and Incomplete Boolean Functions, The Quine-McCluskey Method
of Generating Prime Implicants and Prime Implicates. (Text 1 – 4.1 to 4.6, 4.8)

UNIT - 2

Data Processing Circuits: Binary Adder and Subtracters, Carry Look Ahead Adder, Decimal
Adders, Comparators, Decoders, Encoders, Multiplexers. (Text 1-5.1, 5.1.1, 5.1.2, 5.2 to 5.6)

UNIT - 3

Flip-Flops: RS Flip-Flops, Gated Flip-Flops, Edge-triggered RS Flip-Flops, Edge Triggered D

Flip-Flops, Edge-triggered JK Flip-Flops, JK Master-Slave Flip-Flops, Various Representations
of Flip- Flops. (Text 2 – 8.1 to 8.5, 8.8, 8.10)

UNIT – 4

Registers: Types of Registers - SISO, SIPO, PISO, PIPO, Universal Shift Register, Applications
of Shift Registers. (Text 2 – 9.1 to 9.7)
Counters: Binary Ripple Counters, Synchronous Binary Counters, Design of Synchronous
Counters and self-correcting counters. (Text 1 – 6.8, 6.9)

UNIT - 5

Design of Synchronous Sequential Circuits: Model Selection, State Transition Diagram, State
Synthesis Table, Design Equations and Circuit Diagram, State Reduction Techniques.
(Text 2 – 11.1 to 11.4, 11.7)
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Text Books:
1. Digital Principles & Design, Donald D Givone, Tata McGraw Hill, 2011.
2. Digital Principles and Applications, Donald P Leach, Albert Paul Malvino & Goutam
Saha,7th Edition, Tata McGraw Hill, 2010.

Reference Books:

1. Illustrative Approach to Logic Design, R D Sudhaker Samuel, Sanguine-Pearson, 2010.

2. Digital Logic and Computer Design, M Morris Mano 10th Edition, Pearson Education, 2008.

e - Books:

1. Digital Logic and Computer Design, https://shorturl.at/tuxGM.

2. Digital Principles and Design, https://bit.ly/2YgpMHr.

MOOCs:

1. Digital Circuits, https://onlinecourses.nptel.ac.in/noc19_ee51/preview.

2. Introduction to Digital Systems Design, https://nptel.ac.in/courses/117105080/.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:

CO1 Comprehend basic logic gates, combinational logic circuits and sequential logic circuits.

Apply digital logic for simplification of Boolean functions and realization of data
CO2
processing circuits.

CO3 Analyse combinational and sequential circuits using flip-flops, registers and counters.

CO4 Design sequential circuits based on synchronous modes.

 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title Operating System

Course Code 23IS3PCOPS Credits 4 L-T-P 3-1-0
CIE 50 SEE 100 Marks (50% Weightage)
Contact Total Lecture
4 40
Hours/ Week Hours

UNIT - 1

OVERVIEW
Introduction: What Operating systems do? Computer structure organisation- Interrupts: Interrupt
timeline for a single Program-Overview (1.2.1.1), I/O structure (1.2.3), Computer-system
Architecture, Operating-system Operations, Virtualization, Kernel data structures, Computing
environments.
Operating System structure: Operating System Services, User Operating System Interface.

UNIT – 2

PROCESS MANAGEMENT
Processes: Process Concept, Process scheduling, Interprocess communication-in shared
memory systems, Interprocess communication-in Message passing systems.
Multithreaded programming: Multithreading models.
CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms.

UNIT - 3

PROCESS SYNCHRONIZATION
Synchronization Tools: The Critical-Section problem, Peterson’s solution, Mutex Locks,
Semaphores.
Synchronization Examples: Classical problems of synchronization.
Deadlocks: System Model, Deadlock characterization, Methods for handling deadlocks, Deadlock
prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.

UNIT – 4
MEMORY MANAGEMENT

Main Memory: Background, Contiguous memory allocation, Paging, Structure of page table,
swapping. Virtual Memory: Background, Demand paging, Copy-On-Write, Page Replacement,
Allocation of frames, Thrashing.

UNIT - 5
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

STORAGE MANAGEMENT
Mass Storage structure- Overview of Mass storage structure (11.1.1), HDD Scheduling.
FILE SYSTEM
File system Interface: File Concept, Access Methods, Directory Structure.
SECURITY AND PROTECTION
Security: The Security Problem

Text Books:
1. Operating System Concepts, by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, 10th
Edition, Wiley India, 2018.

Reference Books:
1. Operating Systems, A Concept-Based Approach, by DM Dhamdhere, 3rd Edition, Tata
McGraw-Hill, 2012.
2. Modern Operating Systems, by Andrew S. Tanenbaum and Herbert Bos, 4 th Edition, Pearson,
2015.
e - Books:

1. http:// csc- knu. github. io/ svs- prog/ books/ Andrew% 20 S. %20Tanenbaum%20-
%20Modern%20Systems.pdf.
2. http://ebooks.lpude.in/computer_application/mca/terms_1/DCAP403_OPERATING_SYST
EM.pdf.

MOOCs:

1. https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/ index.html.
2. https://www.udacity.com/course/introduction-to-operatingsystems--ud923.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Understand the basic concepts of operating system structures, services and functionalities.

CO2 Apply various concepts to solve problems related to synchronization, deadlocks, memory
management, in Operating Systems.

CO3 Analyze different algorithms of CPU scheduling, Page replacement, storage management and disk
scheduling.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

Course Title UNIX System Programming

Course Code 23IS3AEUSP Credits 1 L-T-P 0-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Total Lecture
2 24
Hours/ Week Hours

Working with UNIX commands Basic Operating System commands, file attributes, file creation
and file handling, directories, Processes, Filters such as find, cut, Grep & EGrep, Handling Jobs,
SSH.
 Log in to a Linux system and run simple commands using the shell.
 Managing Files from the Command Line: Copy, move, create, delete, and organize files
while working from the Bash shell, Archiving and Transferring Files.
 Managing Local Users and Groups: Gaining Superuser Access, Controlling Access to Files.
 Shell scripts Introduction to shell, command substitution, Command Line arguments,
Conditional & Looping, Functions.
 Exploring File API’s: Open, Close, Read, Write, LSeek, Stat, FStat, fcntl, chmod, Emulate
commands mv, cp, ls, ln.
 Directory, opendir, readdir, rmdir.
 Programs on Process management using API's.
 Programs related to Signals and Signal handling using Signal API's.
Projects:

Sample Projects on topics like Inter process communications using various IPC's, Task
Management, File Management, Schedulers, File transfer using IPC's.

Text Books:

1. UNIX Concepts and Applications, Sumitabha Das, Second Edition, TMGH, 2002.
2. Unix System Programming Using C++, by Terrence Chan – Prentice Hall India, 1999.
Reference Books:

1. Advanced Programming in the UNIX Environment, by Stephen A. Rago, W. Richard Stevens,

2 Edition, Pearson Education / PHI, 2005
2. Linux System Programming, 2nd Edition by Robert Love Publisher: O'Reilly Media, In
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

e- Books:

1. http://catb.org/~esr/writings/taoup/html/
2. http://oopweb.com/CPP/Documents/DebugCPP/VolumeFrames.html.

MOOCs:

1. http://www.coursera.org/learn/unix
2. http://www.pluralsight.com/courses/linux-systems-programming
3. http://www.edx.org/course/introduction-linux-linuxfoundationx-lfs101x-1
4. https://rha.ole.redhat.com.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Comprehend UNIX commands and API's for files, process, and signals, inter process
communication and sockets
CO2 Apply the API's for implementing UNIX commands and process control
CO3 Identify System call interface for process management, multitasking programs, IPC in
UNIX
CO4 Develop solutions for problems using appropriate API's and IPC methods
CO5 Make an effective oral presentation in a team on files and process of UNIX system.