Syllabus for III and IV Semester

Computer Science and Business

Systems
Semester‐III
Course Credits Total Total
No. Code Course Title
Type L T P Credits Hours
1 BS 23MA3BSPBS Probability Theory for Business Systems 2 1 0 3 4

2 ES 23BS3ESDBS Discrete Mathematics for Business Systems 2 1 0 3 4

3 PC 23BS3PCOPS Operating Systems 2 1 0 3 4

4 PC 23BS3PCCOA Computer Organization and Architecture 3 0 0 3 3

5 PC 23BS3PCFOM Fundamentals of Management 3 0 0 3 3

6 PC 23BS3PCDSA Data Structures and Applications 3 0 0 3 3

7 IPCC 23BS3PCDSL Data Structures Laboratory 0 0 1 1 2

8 IPCC 23BS3AEUNP Unix Programming 0 0 1 1 2

9 IPCC 23BS3AEBC1 Business Communication and Value Science ‐ I 0 0 1 1 2

23BS3AEPRM Probability Theory using MATLAB

10 AE 0 0 1 1 2
23BS3AEDMM Discrete Mathematics using MATLAB
NCMC NSS/YOGA/Physical Edu. (Sports and Athletics) 0 0 0 NP/PP 0

PC‐15, ES‐3,BS‐3, AE/SDC‐1 TOTAL 15 3 4 22 30

1
Semester‐IV
Course Credits Total Total
No. Code Course Title
Type L T P Credits Hours
1 BS 23MA4BSABS Foundations of Algebra for Business Systems 2 1 0 3 4

2 ES 23MA4BSSBS Statistical Modeling for Business Systems 2 1 0 3 4

3 PC 23BS4PCFLA Formal Language and Automata Theory 2 1 0 3 4

4 PC/IPCC 23BS4PCADA Design and Analysis of Algorithms 3 0 1 4 5

5 PC/IPCC 23BS4PCDBM Database Management Systems 3 0 1 4 5

6 PC/IPCC 23BS4PCFMT Financial Management 2 0 1 3 4

7 UHV 23MA4AEUHV Universal Human Values 0 1 0 1 2

23BS4AECPG Competitive Programming

8 AE 23BS4AELIA Linear Algebra using MATLAB 0 0 1 1 2

23BS4AESTM Statistical Modelling using MATLAB

NCMC NSS/YOGA/Physical Edu. (Sports and Athletics) 0 0 0 NP/PP 0

PC‐14, ES‐3,BS‐3,UHV‐1 &AE/SDC‐1 TOTAL 14 4 4 22 30

2
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Probability Theory for Business Systems

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

UNIT - 1

INTRODUCTION TO PROBABILITY: Introduction, Probability: Random Experiment:

Sample point and sample space, event, operation of events, concepts of mutually exclusive and
exhaustive events. Classical and relative frequency approach, axiomatic approach of probability.
Independence of events, conditional probability, Bayes’ theorem and its applications, Bayes’
optimal classifiers and Naive Classifiers.

UNIT - 2

DISCRETE PROBABILITY DISTRIBUTIONS: Discrete Random variables, probability mass

function, cumulative distribution function, Mathematical expectation, mean and variance,
moments and their properties, Moment generating function. Poisson and Geometric distributions.

UNIT - 3

CONTINUOUS PROBABILITY DISTRIBUTIONS: Continuous Random variables,

probability density functions, cumulative distribution function, Mathematical expectation, mean
and variance, moments and their properties, Moment generating function. Exponential, Erlang
and normal (Gaussian) distributions.

UNIT - 4

JOINT PROBABILITY: Introduction - Joint Probability distribution for two discrete and
continuous random variables, Joint probability mass and density function, Joint probability
Cumulative distribution function, Mathematical expectations, conditional distribution and
independence, Covariance and Correlation.

UNIT - 5

MARKOV CHAINS: Introduction to stochastic process, probability vectors, Stochastic matrices, regular
stochastic matrices, Markov chains, higher transition probabilities, Stationary distribution of regular
Markov chains and absorbing states. Markov processes: Chapman - Kolmogorov equations, Mean time
spent in transient states.

Text Books:
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

1. S. M. Ross, “Introduction of Probability Models”, Academic Press, N.Y.

2. A. Goon, M. Gupta and B. Dasgupta, “Fundamentals of Statistics”, vol. I & II, World Press.
3. M. Baron, “Probability and Statistics for Computer Scientists", Taylor and Francis.
4. T. Veerarajan, “Probability, Statistics and Random Processes”, Tata McGraw-Hill Education,
3rd edition, 2017.
5. Murray R Spiegel , Ray Meddis, “Schaum’s Outline of Theory and Problems of Probability,
Schaum Outline Series publication

Reference Books:
1. S. M. Ross, “A first course in Probability”, Prentice Hall.
2. I. R. Miller, J.E. Freund and R. Johnson, “Probability and Statistics for Engineers”, (Fourth
Edition), PHI.
3. A. M. Mood, F. A. Graybill and D. C. Boes, “Introduction to the Theory of Statistics”,
McGraw Hill Education.
4. B. S. Grewal, “Higher Engineering Mathematics”, Khanna Publication, Delhi.
5. R. E. Walpole, R. H. Myers, R. S. L. Myers and K. Ye, “Probability and Statistics for
Engineers and Scientists”, Pearson Education, Delhi, 9th edition, 2012.

MOOCs:
1. https://onlinecourses.nptel.ac.in/noc19_ma30/preview
2. https://archive.nptel.ac.in/courses/111/102/111102111/
3. https://onlinecourses.nptel.ac.in/noc22_ee123/preview
4. http://www.digimat.in/nptel/courses/video/111104146/L19.html
5. http://acl.digimat.in/nptel/courses/video/106101224/L46.html
6. http://www.digimat.in/nptel/courses/video/111102111/L38.html
7. https://www.almabetter.com/bytes/tutorials/applied-statistics/moment-generating-
functions-and-expected-values

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the concepts of Probability distributions to solve engineering problems.
CO2 Analyse the problems in business system using probability theory.
CO3 Demonstrate the use of modern tools for solving problems in computer Science and
Business systems using probability theory.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Discrete Mathematics for Business Systems

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

UNIT - 1

MATHEMATICAL LOGIC: Propositional calculus - propositions and connectives, syntax;

Semantics - truth assignments and truth tables, validity and satisfiability, tautology.

UNIT - 2

COUNTING TECHNIQUES: Basic counting, generating functions, recurrence relations (first

order and higher order homogeneous relations). Principle of mathematical induction, pigeonhole
principle.

UNIT - 3

BOOLEAN ALGEBRA: Introduction of Boolean algebra, truth table, basic logic gate, basic
postulates of Boolean algebra, principle of duality, canonical form.

UNIT - 4

GRAPH THEORY -1: Graphs and digraphs, complement, isomorphism, connectedness and
reachability, adjacency matrix, Eulerian paths and circuits in graphs and digraphs, Hamiltonian
paths and circuits in graphs and tournaments, Shortest path – Dijkstra’s algorithm.

UNIT - 5

GRAPH THEORY -2: Planar graphs, Euler’s formula, dual of a planar graph, independence number and
clique number, chromatic number, statement of Four-color theorem, Trees, minimal spanning tree –
Kruskal’s algorithm.

Text Books:
1. M. M. Mano, “Digital Logic & Computer Design”, Pearson.
2. C. L. Liu, “Elements of Discrete Mathematics”, (Second Edition) McGraw Hill Computer
Science Series.
3. N. Deo, “Graph Theory with Applications to Engineering and Computer Science”, Prentice-
Hall, Englewood Cliffs.
4. L. Zhongwan, “Mathematical Logic for Computer Science”, World Scientific, Singapore.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Reference Books:
1. R. A. Brualdi, “Introductory Combinatorics”, North-Holland, New York.
2. J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications”, Macmillan Press, London.
3. E. Mendelson, “Introduction to Mathematical Logic”, (Sixth Edition), CRC Press.
4. K. H. Rosen, “Discrete Mathematics and its applications”, (Seventh Edition), McGraw Hill.

MOOCs:
1. https://nptel.ac.in/courses/111104026/(DiscreteMathematics)
2. https://nptel.ac.in/courses/111106086/(Combinatorics)
3. https://nptel.ac.in/courses/111106050/(Graphtheory)

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the concept of Discrete mathematical structures in Computer Science and Business
systems
CO2 Analyse the concept of Discrete mathematical structures in Computer Science and business
systems
CO3 Demonstrate the use of modern IT tools in solving Computer Science and Business systems
applications through Discrete mathematical structures.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Operating Systems

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

UNIT - 1

Introduction: Operating System structure, Operating System operations, Process management,

Memory management, Storage management, Protection and security, Kernel data structures,
computing environments.
Operating System structure: Operating System Services, User-Operating System interface.

UNIT - 2

Processes: Process Concept, Process Scheduling, Inter process communication.

Process Synchronization: The critical section problem, Peterson's solution, Mutex locks,
Semaphores, Classical problems of synchronization.
Multithreaded Programming: Multithreading models.

UNIT - 3

CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms.

Deadlocks: System Model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection and recovery from deadlock.

UNIT - 4

Main Memory: Background, swapping, Contiguous memory allocation, Segmentation, Paging,

Structure of page table.
Virtual Memory: Background, demand paging, copy on write, Page replacement algorithms,
Allocation of frames, Thrashing.

UNIT - 5

Disk performance optimization: Introduction, why disk scheduling is necessary, Disk

scheduling strategies, rotational optimization.
File and Database Systems: Free space management, File access control.

Text Books:
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Wiley
India, 9th Edition,2012.

Reference Books:
1. Operating Systems, A Concept-Based Approach, DM Dhamdhere, Tata Mcgraw-Hill, 3rd
Edition, 2012.
2. Modern Operating Systems, by Andrew S. Tanenbaum and Herbert Bos, Pearson, 4th Edition,
2014.
3. UNIX complete reference by Herbert Schildt, Mcgraw- Hill, 2nd edition.
4. Sumitabha Das: UNIX Concepts and Applications, Tata McGraw Hill, 4th Edition, 2006.
e- Books:
1. https://csc-knu.github.io/%20svs-prog/books/Andrew%20S.%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. Introduction to Operating Systems, https://www.udacity.com/course/introduction-to-
operating-systems--ud923

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Understand the fundamentals of the operating system and its services
CO2 Apply CPU scheduling, memory management, synchronization and file management
techniques to solve problems
CO3 Analyse different algorithms of process scheduling, disk scheduling, OS structures and
services.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Computer Organization & Architecture

Course Code 23BS3PCCOA 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 Structure of Computers and Instruction Set Architecture: Functional Units, Basic
Operational Concepts, Number Representation and Arithmetic Operations, Memory Locations
and Addresses, Memory Operations, Instructions, and Instruction Sequencing, Addressing Modes,
Stored program concept.

UNIT - 2

Introduction to Assembly Language Concepts: Stacks, Subroutines, Additional Instructions,

Basic Input/Output: Accessing I/O Devices, Interrupts, Bus Structure, Bus Operation, Arbitration.

UNIT - 3

Memory System: Basic Concepts, Semiconductor RAM Memories, Read-only Memories, Direct
Memory Access, Memory Hierarchy.
Cache Memories: Mapping Functions, Virtual Memory

UNIT - 4

Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication
of Unsigned Numbers, Multiplication of Signed Numbers.
Fast Multiplication: Bit-Pair Recoding of Multipliers, Carry-Save Addition of Summands,
Summand Addition Tree using 3-2 Reducers, Integer Division, Floating- Point Numbers and
Operations: Arithmetic Operations on Floating-Point Numbers, Guard Bits and Truncation,
Implementing Floating-Point Operations

UNIT - 5

Basic Processing Unit: Some Fundamental Concepts, Instruction Execution, Hardware Components,
Instruction Fetch and Execution Steps, Hardwired Control.
Parallel Computer Architecture: Processor Architecture and Technology Trends, Flynn’s Taxonomy of
Parallel Architectures, Memory Organization of Parallel Computers: Computers with Distributed Memory
Organization, Computers with Shared Memory Organization, Thread-Level Parallelism: Simultaneous
Multithreading, Multicore Processors.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Text Books:
1. Computer Organization and Embedded Systems, Carl Hamacher, Zvonko Vranesic, Safwat
Zaky, Naraig Manjikian, McGraw- Hill, 6th Edition, 2012.
2. Parallel Programming for Multicore and Cluster Systems, Thomas Rauber, Gudula Runger,
Springer, 2nd Edition, 2013.

Reference Books:
1. Computer Organization and Design - The Hardware /Software Interface, David A. Patterson,
John L. Hennessy, Elsevier, 5th Edition, 2014.
2. Computer Organization & Architecture, William Stallings, Pearson, 11th Edition, 2018.
e- Books:
1. The Essentials of Computer Organization and Architecture, Linda Null, Julia Lobur,
https://ia902309.us.archive.org/21/items/c-05_20211009/C05.pdf

MOOCs:
1. Computer Architecture and Organization,
https://onlinecourses.nptel.ac.in/noc22_cs88/preview

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 To apply the concepts of basic functional units to solve the problems of the computational
system
CO2 To analyse the issues of the processor architecture for improving the efficiency of computer
design.
CO3 Analyse performance of memory modules and arithmetic logic units for a given
specification
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Fundamentals of Management

Course Code 23BS3PCFMT 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

Management Theories: Concept and Foundations of Management, Evolution of Management

Thoughts [Pre-Scientific Management Era (before 1880), Classical management Era (1880-1930),
Neo-classical Management Era (1930-1950), Modern Management era (1950-on word).
Contribution of Management Thinkers: Taylor, Fayol, Elton Mayo etc.
Functions of Management: Planning, Organizing, Staffing, Directing, Controlling.

UNIT - 2

Organization Behaviour: Introduction, Personality, Perception, Learning and Reinforcement,

Motivation, Group Dynamics, Power; Influence, Work Stress and Stress Management, Decision
Making, Problems in Decision Making, Decision Making, Organizational Culture, Managing
Cultural Diversity.

UNIT - 3

Organizational Design: Classical, Neoclassical and Contingency approaches to organizational

design; Organizational theory and design, Organizational structure (Simple Structure, Functional
Structure, Divisional Structure, Matrix Structure)

UNIT - 4

Managerial Ethics: Ethics and Business, Ethics of Marketing & advertising, Ethics of Finance
&Accounting, Decision-making frameworks, Business and Social Responsibility, International
Standards, Corporate Governance, Corporate Citizenship, Corporate Social Responsibility.

UNIT - 5

Leadership: Concept, Nature, Importance, Attributes of a leader, developing leaders across the
organization, Leadership Grid.

Text Books:

1. Richard L. Daft, Understanding the Theory and Design of Organizations

 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Reference Books:

1. Stephen P. Robbins, Timothy A. Judge, Neharika Vohra, Organizational Behavior

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Understand the evolution of management thought, contribution of management thinkers,
management theories and management functions
CO2 Apply various aspects of organizational behaviour such as perception, learning, motivation,
stress management, and decision-making.
CO3 Apply various approaches to organizational design and different types of organizational
structure
CO4 Demonstrate the importance of managerial ethics, corporate social responsibility and
leadership
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Data Structures and Applications

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

UNIT - 1

Introduction to Data Structure: Data Management concepts, Data types – primitive and non-
primitive, Types of Data Structures- Linear & Non-Linear Data Structures. Structures and
pointers.
Dynamic memory allocation: allocating a block of memory: Malloc, allocating multiple blocks
of memory, Releasing the used space: Free Altering the size of memory.

UNIT - 2

Linear list: Singly linked list implementation, insertion, deletion and searching operations on
linear list, circularly linked lists- insertion, deletion and searching operations for circularly linked
lists, doubly linked list implementation, insertion, deletion and searching operations, maintaining
directory of names, Manipulation of polynomials (addition), representing sparse matrices. Stack
and queue implementation using linked lists.

UNIT - 3

Stacks: Operations, array representations of stacks, stack applications - infix to postfix

conversion, postfix expression evaluation, and function call tracing, recursion.
Queues: Introduction, Basic concept, linear queue operations, circular queue, priority queues,
double ended queues. Applications of Queues.

UNIT - 4

Trees: Definitions, tree representation, properties of trees, Binary tree, Binary tree representation,
binary tree properties, binary tree traversals, binary tree implementation, Binary Search Tree
operations and its implementation, applications of trees.

UNIT - 5

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

Text Books:
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

1. Fundamentals of Data Structures in C, Horowitz, Sahni, Anderson Freed, Universities Press,

2nd Edition, 2008.
2. Data Structures using C, Reema Thareja, Oxford University press, 2nd Edition, 2014.

Reference Books:
1. Data Structures using C, Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein,
Pearson Education, 5th Edition, 2007.
2. Reference Book 2Data Structures - A Pseudocode Approach with C, Richard F. Gilberg,
Behrouz A. Forouzan, Cengage Learning, 1st Edition, 2005.
e- Books:
1. Data Structures using C, E. Balaguruswamy, https://dokumen.pub/data-structures-using-c-
9781259029547-1259029549.html
2. Data structures and program design in C, Robert L. Kruse, Clovis L. Tondo, Bruce P. Leung,
https://cdn.preterhuman.net/texts/math/Data_Structure_And_Algorithms/Data%20Structures
20and%20Program%20Design%20in%20C++%20-%20Robert%20L.%20Kruse.pdf

MOOCs:
1. Data Structures, https://www.coursera.org /learn/data-structures
2. Data Structures and Algorithms, https://nptel.ac.in/ courses/106102064/

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the concept of linear and nonlinear data structures for computing problems.
CO2 Analyse the appropriate data structure operations for a given problem.
CO3 Design and develop solutions using the linear and nonlinear data structure for a given
specification.
CO4 Conduct experiments for demonstrating the operations of different data structures.

Laboratory Work
gab
ao
Unit# Program Details
Write a program to implement Singly Linked List with following
operations
1 2 a) Create a linked list.
b) Insertion of a node at first position, at any position and at end of list.
c) Display the contents of the linked list.
Write a program to Implement Singly Linked List with following
2 2
operations
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

a) Create a linked list.

b) Deletion of first element, specified element and last element in the list.
c) Display the contents of the linked list.
Write a program to Implement Singly Linked List with following
operations
3 2 a) Sort the linked list.
b) Reverse the linked list.
c) Concatenation of two linked lists
Write a program to Implement doubly linked list with primitive
operations
a) Create a doubly linked list.
4 2
b) Insert a new node to the left of the node.
c) Delete the node based on a specific value
d) Display the contents of the list
Write a program to simulate the working of stack using an array with the
following: a) Push b) Pop c) Display
5 3
The program should print appropriate messages for stack overflow, stack
underflow
Write a program to convert a given valid parenthesized infix arithmetic
expression to postfix expression. The expression consists of single
6 3
character operands and the binary operators + (plus), - (minus), *
(multiply) and / (divide)
Write a program to simulate the working of a queue of integers using an
array. Provide the following operations
7 3 a) Insert b) Delete c) Display
The program should print appropriate messages for queue empty and
queue overflow conditions
Write a program to simulate the working of a circular queue of integers
using an array. Provide the following operations. a) Insert b)
8 3 Delete c) Display
The program should print appropriate messages for queue empty and
queue overflow conditions
Write a program to implement Stack & Queues using Linked
9 3
Representation
Write a program
a) To construct a binary Search tree.
10 4 b) To traverse the tree using all the methods i.e., in-order, pre order and
post order
c) To display the elements in the tree.
Write a program
a. To construct a binary search tree
11 4
b. To implement iterative in order traversal
c. To delete a given element
12 5 Write a program to construct an AVL tree of integers
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Business Communication and Value Science - I

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

Modules

Overview of the course with immersion activity, Overview of business communication, Self-
awareness, confidence and communication, Essentials of Business communication, Application
of communication skills, Application of Life Skills.

Reference Materials
1. English vocabulary in use – Alan McCarthy and O’Dell
2. APAART: Speak Well 1 (English language and communication)
3. APAART: Speak Well 2 (Soft Skills)
4. Business Communication – Dr. Saroj Hiremath

COURSE OUTCOMES (COs)

CO1 Recognize the need for life skills and values.

CO2 Apply the life skills to different situations
CO3 Apply the basic communication practices in different types of communication
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Unix Programming

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

Modules

Working with UNIX commands on Basic Operating System commands, file attributes, file
creation and file handling, directories, Processes, Filters such as find, cut, grep & egrep, Handling
Jobs, SSH.
Working with UNIX scripts on various IPC's, Task Management, File Management, Device files
management, Schedulers, File transfer using IPC's, Deadlocks resolving, Compression utilities
and Directory utilities, etc.

Text Books:
1. UNIX Concepts and Applications, Sumitabha Das, Second Edition, TMGH, 2002.

Reference Materials:
1. Advanced Programming in the UNIX Environment, by Stephen A. Rago, W. Richard
Stevens, 2 Edition, Pearson Education / PHI, 2005

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

COURSE OUTCOMES (COs)

CO1 Acquire the knowledge on various UNIX shell commands.

CO2 Apply the shell commands to develop UNIX scripts for the given problem.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Probability Distributions using MATLAB

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

Modules

Implementation of Basic Probability, Discrete Probability Distributions, Continuous Probability

Distributions, Joint Probability and Markov Chains using MATLAB online toolbox as per the
syllabus of Probability for Business Systems.

Reference Materials
1. https://in.mathworks.com/matlabcentral/fileexchange/95463-descriptive-statistics-and-
probability-distributions
2. https://in.mathworks.com/matlabcentral/fileexchange/100546-probability-theory
3. https://in.mathworks.com/help/econ/visualize-markov-chain-structure-and-evolution.html

COURSE OUTCOMES (COs)

CO1 Apply MATLAB commands and scripts to solve the problems of probability.
CO2 Design and implement solutions for real-time probability problems using MATLAB.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER III

Course Title Discrete Mathematics using MATLAB

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

Modules

Implementation of Boolean Algebra, Combinatorics, Graph Theory, Mathematical Logic using

MATLAB online toolbox as per the syllabus of Discrete Mathematics for Business Systems.

Reference Materials
1. https://in.mathworks.com/help/matlab/matlab_prog/find-array-elements-that-meet-a-
condition.html
2. https://in.mathworks.com/help/matlab/examples.html?category=graph-and-network-
algorithms&s_tid=CRUX_topnav
3. https://in.mathworks.com/help/matlab/math/visualize-breadth-first-and-depth-first-
search.html

COURSE OUTCOMES (COs)

CO1 Apply MATLAB commands and scripts to solve the problems of Discrete Mathematics.
CO2 Design and implement solutions for real-time Discrete Mathematics problems using
MATLAB.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Foundations of Algebra for Business Systems

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

UNIT - 1

Introduction: Introduction to Financial Management - Goals of the firm - Financial

Environments.
Time Value of Money: Simple and Compound Interest Rates, Amortization, Computing more
that once a year, Annuity Factor.
Valuation of Securities: Bond Valuation, Preferred Stock Valuation, Common Stock Valuation,
Concept of Yield and YTM.

UNIT - 2

Risk & Return: Defining Risk and Return, Using Probability Distributions to Measure Risk,
Attitudes Toward Risk, Risk and Return in a Portfolio Context, Diversification, The Capital Asset
Pricing Model (CAPM)
Operating & Financial Leverage: Operating Leverage, Financial Leverage, Total Leverage,
Indifference Analysis in leverage study
Cost of Capital : Concept , Computation of Specific Cost of Capital for Equity - Preference –
Debt, Weighted Average Cost of Capital – Factors affecting Cost of Capital

UNIT - 3

Capital Budgeting: The Capital Budgeting Concept & Process - An Overview, Generating
Investment Project Proposals, Estimating Project, After Tax Incremental Operating Cash Flows,
Capital Budgeting Techniques, Project Evaluation and Selection - Alternative Methods

UNIT - 4

Working Capital Management: Overview, Working Capital Issues, Financing Current Assets
(Short Term and Long Term- Mix), Combining Liability Structures and Current Asset Decisions,
Estimation of Working Capital.

UNIT - 5

Cash Management: Motives for Holding cash, Speeding Up Cash Receipts, Slowing Down Cash Payouts,
Electronic Commerce, Outsourcing, Cash Balances to maintain, Factoring.
Accounts Receivable Management: Credit & Collection Policies, Analyzing the Credit Applicant, Credit
References, Selecting optimum Credit period.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Text Books:

1. Pandey, I. M., Financial management, Vikas Publishing House Pvt. Ltd., Noida, 2011, 12th ed.
2. Chandra, Prasanna - Financial Management - Theory & Practice, Tata McGraw Hill.
3. Brigham. Eugene F. and Houston. Joel F. (2006). Fundamentals of Financial Management, 10th
Edition, Cengage Learning
4. Khan, M.Y & Jain, P.K.: Financial Management; Tata McGraw Hill, New Delhi, 2008.

Reference Books:

1. Srivastava, Misra: Financial Management, OUP

2. Van Horne and Wachowicz : Fundamentals of Financial Management, Prentice Hall/ Pearson
Education.
3. Brealey and Meyers: Principles of Corporate Finance: Tata McGraw Hill, New Delhi, 2008.
4. Keown, Martin, Petty and Scott (Jr): Financial Management: Principles and Applications;
Prentice Hall of India, New Delhi, 2002.
5. Gitman, L.J: Principles of Managerial Finance; Addison Wasley, 2009.
6. Vanhorne, James C: Financial Management and Policy; Prentice Hall of India, New Delhi,
2002.
7. Kishore Ravi, M: Financial Management; Taxman, 2006.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Understand time value of money concept and the role of a financial manager in the current
competitive business scenario.
CO2 Apply the methods and procedures for the valuation of bonds and equity share capital.
CO3 Apply the methods and procedures of financial management, with particular reference to
investment evaluation, investment management, capital budgeting, risk management.
CO4 Deal with different issues of working capital management, financing of short-term assets
and cash management.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Statistical Modeling for Business Systems

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

UNIT - 1

STATISTICAL METHODS: Curve Fitting: Fitting the straight line, parabola and geometric
curve by the method of least squares. Correlation and regression - Karl Pearson’s coefficient of
correlation and Spearman’s rank correlation. Lines of regression, angle between two regression
lines. Multiple correlation and multiple regression - Problems.

UNIT - 2

SAMPLING TECHNIQUES AND ESTIMATION: Random sampling - Sampling from finite

and infinite populations (sampling with replacement and sampling without replacement),
Sampling distribution of sample mean - Stratified random sampling. Point estimation - Criteria
for good estimates (un-biasedness, consistency), Methods of estimation including maximum
likelihood estimation: Concept and Examples, Complete sufficiency and its application in
estimation.

UNIT - 3

PARAMETRIC INFERENCE: Test of hypothesis: Concept & formulation, Type I and Type II
errors, Neyman Pearson lemma, Z test: Single mean, difference of means, t: Single mean,
difference of means, Paired t-test, F test, Analysis of variance (one way with as well as without
interaction).

UNIT - 4

NON-PARAMETRIC INFERENCE: Comparison with parametric inference, use of order

statistics, Sign test, Chi square test- Goodness of fit, Wilcoxon signed rank test, Mann-Whitney
test, Run test, Kolmogorov-Smirnov test, Spearman’s and Kendall’s test.

UNIT - 5

TIME SERIES ANALYSIS & FORECASTING: Basics: Trend lines, Stationary, ARIMA Models,
identification, estimation and forecasting.

Text Books:
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

1. R. E. Walpole, R. H. Myers, S. L. Myers and K.Ye, “Probability & Statistics for

Engineers & Scientists”, International Edition, 9th Edition.
2. D.C. Montgomery, G. C. Runger, “Applied Statistics and Probability for Engineers”,
Wiley Edition, 6th Edition.
3. S. C. Gupta, V. K. Kapoor, “ Fundamentals Of Mathematical Statistics”, Sultan Chand
& Sons Publication.

Reference Books:

1. R. A. Johnson, “Miller and Freund’s Probability and Statistics for Engineers”, Pearson
Education India (2015) 8th ed.
2. A. M. Goon, M. K. Gupta and B. Dasgupta, “Fundamentals of Statistics,” Vol. I & II, The
World Press (2002), 8th ed.
3. C. Chatfield, “The Analysis of Time Series: An Introduction”, Chapman & Hall/CRC
(2003) 6th ed.
4. G. G. Vining, E. A. Peck and D. C. Montgomery, “Introduction to Linear Regression
Analysis”, Wiley- Interscience (2006), 6th ed.
5. A. M. Mood, F. A. Graybill and D. C. Boes, “Introduction to the Theory of Statistics”,
McGraw Hill (2017), 4th ed.
6. N. R. Draper and H. Smith, “Applied Regression Analysis”, Wiley-Interscience (1998),
3rd ed.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the concepts of Statistical methods, sampling techniques and inference to solve
problems in Computer & Business systems.
CO2 Analyze problems in Computer & Business systems through statistical methods, sampling
techniques and inferences.
CO3 Apply modern IT tools to solve Business systems using statistical methods, sampling
techniques and inferences.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Formal Language and Automata Theory

Course Title

Course Code 23BS4PCFLA Credits 3 L-T-P 2-1-0

CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Total Lecture
4 40
Hours/ Week Hours

UNIT - 1

Introduction to Finite Automata: Central Concepts of Automata Theory, Deterministic Finite

Automata (DFA), Nondeterministic Finite Automata (NFA), Finite Automata with Epsilon
Transition, An Application Text Search

UNIT - 2

Regular Expressions and Languages: Regular Expressions, 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

UNIT - 3

Context-Free Grammars and Languages Parse Trees: Context-Free Grammars, Parse trees,
Applications of Context-Free Grammars, Ambiguity in Grammars and Languages, Eliminating
Useless Symbols, Computing the Generating and Reachable Symbols, Eliminating Epsilon
Productions, Eliminating Unit Productions, Chomsky Normal Form, Greibach Normal form.

UNIT - 4

Pushdown Automata: Definition of the Pushdown Automaton, The Languages of a PDA,

Equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata, The Pumping Lemma for
Context-Free Languages, Closure Properties of Context-Free Languages.

UNIT - 5

Introduction to Turing Machine: Problems That Computers Cannot Solve, The Turing Machine,
Programming Techniques for Turing Machines, Extensions to the Basic Turing Machine, Restricted Turing
Machines, Turing Machines and Computers, Definition of Post Correspondence Problem, A Language
That Is Not Recursively Enumerable, An Undecidable Problem That is RE, Other Undecidable Problems.
NP Problems solvable in Polynomial Time, Satisfiability Problem.

Text Books:
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

1. Introduction to Automata Theory, Languages and Computation, John E. Hopcroft, Rajeev

Motwani, Jeffrey D. Ullman, Pearson education, 3rd Edition, 2007

Reference Books:
1. Introduction to Languages and Automata Theory, John C Martin, Tata McGraw- Hill, 3rd
Edition, 2007.
2. An Introduction to Formal Languages and Automata, Peter Linz, Narosa Publishing House,
5th Edition, 2012.

e- Books:
1. Introduction to Theory of Computation, Anil Maheshwari, Michiel Smid,
https://cglab.ca/~michiel/TheoryOfComputation/TheoryOfComputation.pdf

MOOCs:
1. Automata Theory, https://www.edx.org/course/automata-theory
2. Introduction to Automata, Languages and Computation,
https://onlinecourses.nptel.ac.in/noc21_cs19/preview
3. Automata Theory, https://online.stanford.edu/courses/soe-ycsautomata- automata-theory

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply the knowledge of Automata Theory, Grammars & Regular Expressions for the given
requirement of the formal language.
CO2 Analyse the given Automata to identify the formal language it represents.
CO3 Design Automata and Grammar for pattern recognition and syntax checking of the given
formal language.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Design and Analysis of Algorithms

Course Code 23BS4PCADA 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 to Algorithm, Fundamentals of Algorithmic Problem Solving.

Analysis of Algorithm Efficiency: The Analysis Framework, Asymptotic Notations and Basic
Efficiency Classes, Mathematical Analysis of Non-Recursive Algorithm, Mathematical Analysis
of Recursive Algorithms.

UNIT - 2

Brute-Force: String Matching, Exhaustive Search: TSP, Knapsack Problem, Assignment

Problem, Depth-First Search and Breadth-FirstSearch.
Decrease-and-Conquer: Topological Sorting, Algorithms for Generating Combinatorial
Objects: Generating Permutations, Decrease by-a-Constant-Factor Algorithms: Binary Search,
Russian Peasant Multiplication, Variable Size-Decrease Algorithms: Computing Median and the
Selection Problem.

UNIT - 3

Divide-and-Conquer: Merge sort, Quicksort, Multiplication of Large Integers and Strassen’s

Matrix Multiplication.
Transform-and-Conquer: Pre-sorting, Heaps and Heap sort, Horner’s Rule.
Space and Time Trade-offs: Horspool Algorithm, Boyer-Moore Algorithm.

UNIT - 4

Dynamic Programming: Coin Problem, The Knapsack Problem, Warshall’s and Floyd’s
Algorithms.
Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm-Without disjoint subsets and Union
Find algorithms, Dijkstra’s Algorithm, Huffman Trees.

UNIT - 5

Backtracking: n-Queens Problem, Subset-Sum Problem.

Branch-and-Bound: Knapsack Problem, Traveling Salesman Problem.
NP-Completeness: Polynomial time, Polynomial-time verification, NP-completeness and reducibility. NP-
Complete Problems: The Clique problem, The Vertex Cover problem, Approximation Algorithms: The
Vertex-Cover problem.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Text Books:
1. Introduction to the Design and Analysis of Algorithms, Anany Levitin, Pearson, 3rd Edition,
2014.
2. Introduction to Algorithms, Thomas H Cormen, Charles E Leiserson, Ronald L Rivest,
Clifford Stein, The MIT Press, 3rd Edition, 2009.

Reference Books:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekhara M,
University Press Pvt. Ltd., 2nd Edition,2009.
2. Analysis and Design of Algorithms, Padma Reddy, Sri Nandi Publications, 2009.

e- Books:
1. Introduction to Design & Analysis of Algorithms, K. Raghava Rao,
https://www.smashwords.com/books/view/365630
2. Data structures and Algorithm Analysis in C++, Allen Weiss,
http://www.uoitc.edu.iq/images/documents/informatics-institute/Competitive_exam/
DataStructures.pdf

MOOCs:
1. Algorithms, https://www.coursera.org/course/algs4partI
2. Design and Analysis of Algorithms, https://onlinecourses.nptel.ac.in/noc19_cs47/preview

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Apply algorithmic design paradigms to basic computing problems.
CO2 Analyse the time complexity of different algorithms.
CO3 Design efficient algorithms using appropriate algorithm design techniques.
CO4 Conduct experiments to implement algorithms and provide valid conclusions.

List of Lab Programs:

Lab Unit# Program Details
Program
Write program to do the following:

1 2 a. Print all the nodes reachable from a given starting node in a digraph
using BFS method.
b. Check whether a given graph is connected or not using DFS method.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

2 2 Write program to obtain the Topological ordering of vertices in a given

digraph.
3 2 Implement Johnson Trotter algorithm to generate permutations

Sort a given set of N integer elements using Merge Sort technique and
4 3 compute its time taken. Run the program for different values of N and
analyze its time complexity.

5 3 Sort a given set of N integer elements using Quick Sort technique and
compute its time complexity.

6 3 Sort a given set of N integer elements using Heap Sort technique and
analyze its time complexity.
7 4 Implement 0/1 Knapsack problem using dynamic programming.

8 4 Implement All Pair Shortest paths problem using Floyd’s algorithm.

9 4 Find Minimum Cost Spanning Tree of a given undirected graph using

Prim/Kruskal’s algorithm.

10 4 From a given vertex in a weighted connected graph, find shortest paths to

other vertices using Dijkstra’s algorithm.
11 5 Implement “N-Queens Problem” using Backtracking.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Database Management Systems

Course Code 23BS4PCDBM 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

Databases and Database Users- Introduction, Characteristics of the Database Approach,

Advantages of using the DBMS Approach, When Not to use a DBMS. Database.
System Concepts and Architecture-Data Models, Schemas and Instances, Three-Schema
Architecture and Data Independence, The Database System Environment.

UNIT - 2

Data Modeling Using the Entity-Relationship Model-Using High-Level Conceptual Data

Models for Database design, Entity Types, Entity Sets, Attributes and Keys, Relationship Types,
Relationship Sets, Roles and Structural Constraints, Weak Entity Types, ER Diagrams, Naming
Conventions and Design issues, A Sample Database Application, Relationship Types of Degree
Higher than Two. Relational Database Design Using ER-to Relational Mapping.

UNIT - 3

The Relational Data Model and Relational Database Constraints- Relational Model Concepts,
Relational Model Constraints and Relational Database Schemas, Update Operations, Transactions
and Dealing with Constraint.
Basic SQL- SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic Retrieval
Queries in SQL, INSERT, DELETE and UPDATE Statements in SQL, Additional Features of
SQL, More Complex SQL Retrieval Queries, Views, Schema Change Statements in SQL.

UNIT - 4

The Relational Algebra- Unary Relational Operations: SELECT, PROJECT, Relational

Algebra Operations from Set Theory, Binary Relational Operations-JOIN, DIVISION, Additional
Relational Operations, Examples of Queries in Relational Algebra.

Basics of Functional Dependencies and Normalization for Relational Databases- 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.

UNIT - 5
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Introduction to Transaction Processing Concepts and Theory- Introduction to Transaction Processing,

Transaction and System Concepts, Desirable Properties of Transactions, Characterizing Schedules Based
on Recoverability, Characterizing Schedules Based on Serializability, Transaction Support in SQL, Two-
Phase Locking Techniques for Concurrency Control.

Text Books:
1. Fundamentals of Database Systems,7th Edition, Ramez Elmasri & Shamkant B. Navathe,
Published by Pearson India Education Services Pvt. Ltd.,2017.

Reference Books:
1. Database System Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Sixth
Edition, Tata McGraw-Hill,2010
2. An Introduction to Database Systems, C.J.Date, A. Kannan, S. Swamynathan, 8 th Edition,
Pearson Education, 2006
3. Database Management Systems, Ramakrishnan and Gehrke, 3rd Edition McGraw Hill 2014

e- Books:
1. https://mrcet.com/downloads/digital_notes/ECE/III%20Year/DATABASE%20MANAGEM
ENT%20SYSTEMS.pdf
2. https://ebooks.lpude.in/management/mba/term_3/DCAP204_MANAGING_DATABASED
CAP402_ DATABASE_ MANAGEMENT_ SYSTEMS.pdf

MOOCs:
1. https://ocw.mit.edu/courses/6 -830-database-systems-fall- 2010/pages/lecture-notes/
2. https://www.udemy.com/topic/database-management
3. https:// www. classcentral. com/ course/ swayam- data- base- management-system-9914 nptel

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Acquire the knowledge of fundamentals of database management systems.
CO2 Apply the concepts of Entity–Relationship model, relational algebra, database design
principles and transaction management properties.
CO3 Extract the information from the given database using SQL for the given problems.
CO4 Design and demonstrate the given application without anomalies using ER modelling and
Normalizations
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

List of Lab Assignments:

Question 1:
Create tables for the following schema:
SAILOR (sid: integer, sname: string, rating: integer, age: real)
BOAT (bid: integer, bname:string, color:string)
RESERVES (sid: integer, bid: integer, day: date)
Mandatory Queries:
1) Add the required constraints on the created tables.
2) Populate the relations with at least 5 tuples each.
3) Select names and ages of all sailors. Rename sname as ‘Sailor Name’
4) Find all sailors with a rating above 7?
5) Find the sid of sailors who have reserved a red boat?
6) Find the colors of boats reserved by ‘Shyam’?
7) Delete all boats which have never been reserved.
Additional Queries:
1) Find the names of sailors who have reserved boat number 103?
2) Find the names of sailors who have reserved a red boat?
3) Find the ages of sailors whose name begin and end with B and has at least 5 characters?
4)Find the name and age of oldest sailor.

Question 2:
Create tables for the following schema:
SUPPLIER(sid: integer, sname: string, address: string)
PART(pid: integer, pname: string, color: string)
CATALOG(sid: integer, pid: integer, cost: real)
Mandatory Queries:
1) Add the required constraints on the created tables.
2) Populate the relations with at least 5 tuples each.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

3) Select the ID and names of all the suppliers.

4) Select the most costly part available in the catalog.
5) Find the pnames of parts for which there is some supplier.
6) Find the sids of suppliers who supply a red part and a green part.
7) Delete all parts of a given ID.
Additional queries:
1) Find the sids of suppliers who supply a red part or a green part.
2) List the suppliers residing in Bangalore.
3) Find the sids of suppliers who supply red parts.
4) For every supplier that supplies a green part and a red part, print the name and price of the most
expensive part that he/she supplies.

Question 3:
Create tables for the following schema:
SALESMAN (Salesman_id:integer, Name:string, City:string, Commission:integer)
CUSTOMER (Customer_id:integer, Cust_Name:string, City:string)
ORDERS (Ord_No:integer, Purchase_Amt:real, Ord_Date:date, Customer_id:integer,
Salesman_id:integer)
Mandatory Queries:
1) Add the required constraints on the created tables.
2) Populate the relations with at least 5 tuples each.
3) Select the ID and names of all the customers.
4) Select the salesman with the highest commission.
5) List all the orders placed in descending order of their purchase amount.
6) Select customers who have salesmen in their cities.
7) Delete all orders placed before Jan 2018.
Additional queries:
1) Find the names of salesman who have customers.
2) Find the names of all salesmen whose commission is greater than 25%.
3) List the names of customers and the order amount placed by them.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

4) Find the name and ID of all salesmen who have earned commission amount more than 10,000

Question 4:
Create the following Tables:

LOCATION

Location_ID Regional_Group

122 NEW YORK

123 DALLAS

124 CHICAGO

167 BOSTON

DEPARTMENT

Department_ID Name Location_ID

10 ACCOUNTING 122

20 RESEARCH 124

30 SALES 123

40 OPERATIONS 167

JOB

Job_ID Function

667 CLERK

668 STAFF

669 ANALYST

670 SALESPERSON

671 MANAGER

672 PRESIDENT

EMPLOYEE
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

MIDDL
EMPLO LAST_ FIRST_ JOB MANA HIREDA SAL COM DEPART
E_NAM
YEE_ID NAME NAME _ID GER_ID TE ARY M MENT_ID
E

MEGA 12-DEC-
7839 JOHN S 672 NULL 5500 NULL 30
N 14

17-DEC-
7369 SMITH JOHN Q 667 7521 800 NULL 20
18

ALLE 20-FEB-
7499 KEVIN J 670 7507 1600 300 30
N 17

DOYL 04-APR-
7505 JEAN K 671 7839 2850 NULL 30
E 15

DENNI 15-MAY-
7506 LYNN S 671 7839 2750 NULL 30
S 15

BAKE 10-JUN-
7507 LESLIE D 671 7839 2200 NULL 40
R 15

CYNT 22-FEB-
7521 WARK D 670 7505 1250 500 30
HIA 15

Queries based on the above tables:

Order By Clause:
1. List out the employee id, last name in ascending order based on the employee id.
2. List out the employee id, name in descending order based on salary column
3. list out the employee details according to their last_name in ascending order and salaries in
descending order
4. list out the employee details according to their last_name in ascending order and then on
department_id in descending order.
Group By & Having Clause:
5. How many employees who are working in different departments wise in the organization
6. List out the department wise maximum salary, minimum salary, average salary of the
employees
7. List out the job wise maximum salary, minimum salary, average salaries of the employees.
8. List out the no.of employees joined in every month in ascending order.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

9. List out the no.of employees for each month and year, in the ascending order based on the
year, month.
10. List out the department id having atleast four employees.
11. How many employees in January month.
12. How many employees who are joined in January or September month.
13. How many employees who are joined in 1985.
14. How many employees joined each month in 1985.
15. How many employees who are joined in March 1985.
16. Which is the department id, having greater than or equal to 3 employees joined in April 1985.
Sub-Queries
17. Display the employee who got the maximum salary.
18. Display the employees who are working in Sales department
19. Display the employees who are working as “Clerk”.
20. Display the employees who are working in “New York”
21. Find out number of employees working in “Sales” department.
22. Update the employees’ salaries, who are working as Clerk on the basis of 10%.
23. Delete the employees who are working in accounting department.
24. Display the second highest salary drawing employee details.
25. Display the Nth highest salary drawing employee details
Sub-Query operators: (ALL, ANY, SOME, EXISTS)
26. List out the employees who earn more than every employee in department 30.
27. List out the employees who earn more than the lowest salary in department 30.
28. Find out whose department has not employees.
29. Find out which department does not have any employees.
Co-Related Sub Queries:
30. Find out the employees who earn greater than the average salary for their department.
Joins
Simple join
48. List our employees with their department names
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

49. Display employees with their designations (jobs)

50. Display the employees with their department name and regional groups.
51. How many employees who are working in different departments and display with department
name.
52. How many employees who are working in sales department.
53. Which is the department having greater than or equal to 5 employees and display the department
names in ascending order?
54. How many jobs in the organization with designations.
55. How many employees working in “New York”.
Non – Equi Join:
56. Display employee details with salary grades.
57. List out the no. of employees on grade wise.
58. Display the employ salary grades and no. of employees between 2000 to 5000 range of salary.
Self-Join:
59. Display the employee details with their manager names.
60. Display the employee details who earn more than their manager’s salaries.
61. Show the no. of employees working under every manager.
Outer Join:
61. Display employee details with all departments.
62. Display all employees in sales or operation departments.
Set Operators:
63. List out the distinct jobs in Sales and Accounting Departments.
64. List out the ALL jobs in Sales and Accounting Departments.
65. List out the common jobs in Research and Accounting Departments in ascending order.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Financial Management

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

UNIT - 1

Introduction: Introduction to Financial Management - Goals of the firm - Financial

Environments.
Time Value of Money: Simple and Compound Interest Rates, Amortization, Computing more
that once a year, Annuity Factor.
Valuation of Securities: Bond Valuation, Preferred Stock Valuation, Common Stock Valuation,
Concept of Yield and YTM.

UNIT - 2

Risk & Return: Defining Risk and Return, Using Probability Distributions to Measure Risk,
Attitudes Toward Risk, Risk and Return in a Portfolio Context, Diversification, The Capital Asset
Pricing Model (CAPM)
Operating & Financial Leverage: Operating Leverage, Financial Leverage, Total Leverage,
Indifference Analysis in leverage study
Cost of Capital : Concept , Computation of Specific Cost of Capital for Equity - Preference –
Debt, Weighted Average Cost of Capital – Factors affecting Cost of Capital

UNIT - 3

Capital Budgeting: The Capital Budgeting Concept & Process - An Overview, Generating
Investment Project Proposals, Estimating Project, After Tax Incremental Operating Cash Flows,
Capital Budgeting Techniques, Project Evaluation and Selection - Alternative Methods

UNIT - 4

Working Capital Management: Overview, Working Capital Issues, Financing Current Assets
(Short Term and Long Term- Mix), Combining Liability Structures and Current Asset Decisions,
Estimation of Working Capital.

UNIT - 5

Cash Management: Motives for Holding cash, Speeding Up Cash Receipts, Slowing Down Cash Payouts,
Electronic Commerce, Outsourcing, Cash Balances to maintain, Factoring.
Accounts Receivable Management: Credit & Collection Policies, Analyzing the Credit Applicant, Credit
References, Selecting optimum Credit period.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Text Books:

1. Pandey, I. M., Financial management, Vikas Publishing House Pvt. Ltd., Noida, 2011, 12th ed.
2. Chandra, Prasanna - Financial Management - Theory & Practice, Tata McGraw Hill.
3. Brigham. Eugene F. and Houston. Joel F. (2006). Fundamentals of Financial Management, 10th
Edition, Cengage Learning
4. Khan, M.Y & Jain, P.K.: Financial Management; Tata McGraw Hill, New Delhi, 2008.

Reference Books:

1. Srivastava, Misra: Financial Management, OUP

2. Van Horne and Wachowicz : Fundamentals of Financial Management, Prentice Hall/ Pearson
Education.
3. Brealey and Meyers: Principles of Corporate Finance: Tata McGraw Hill, New Delhi, 2008.
4. Keown, Martin, Petty and Scott (Jr): Financial Management: Principles and Applications;
Prentice Hall of India, New Delhi, 2002.
5. Gitman, L.J: Principles of Managerial Finance; Addison Wasley, 2009.
6. Vanhorne, James C: Financial Management and Policy; Prentice Hall of India, New Delhi,
2002.
7. Kishore Ravi, M: Financial Management; Taxman, 2006.

COURSE OUTCOMES (COs)

At the end of the course, the student will be able to:
CO1 Understand time value of money concept and the role of a financial manager in the current
competitive business scenario.
CO2 Apply the methods and procedures for the valuation of bonds and equity share capital.
CO3 Apply the methods and procedures of financial management, with particular reference to
investment evaluation, investment management, capital budgeting, risk management.
CO4 Deal with different issues of working capital management, financing of short-term assets
and cash management.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Universal Human Values

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

UNIT - 1

Course Introduction - Need, Basic Guidelines, Content and Process for Value Education
1. Purpose and motivation for the course, recapitulation from Universal Human Values-I
2. Self-Exploration–what is it? - Its content and process; ‘Natural Acceptance’ and
Experiential Validation- as the process for self-exploration
3. Continuous Happiness and Prosperity- A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facility- the basic requirements for
fulfilment of aspirations of every human being with their correct priority
5. Understanding Happiness and Prosperity correctly- A critical appraisal of the current
scenario
6. Method to fulfil the above human aspirations: understanding and living in harmony at
various levels.
Include practice sessions to discuss natural acceptance in human being as the innate acceptance
for living with responsibility (living in relationship, harmony and co-existence) rather than as
arbitrariness in choice based on liking-disliking

UNIT - 2

Understanding Harmony in the Human Being - Harmony in Myself!

1. Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’
2. Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical facility
3. Understanding the Body as an instrument of ‘I’ (I being the doer, seer and enjoyer)
4. Understanding the characteristics and activities of ‘I’ and harmony in ‘I’
5. Understanding the harmony of I with the Body: Sanyam and Health; correct appraisal of
Physical needs, meaning of Prosperity in detail
6. Programs to ensure Sanyam and Health.
Include practice sessions to discuss the role others have played in making material goods available
to me. Identifying from one’s own life. Differentiate between prosperity and accumulation.
Discuss program for ensuring health vs dealing with disease.

UNIT - 3

Understanding Harmony in the Family and Society- Harmony in Human- Human

Relationship
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

1. Understanding values in human-human relationship; meaning of Justice (nine universal

values in relationships) and program for its fulfilment to ensure mutual happiness; Trust and
Respect as the foundational values of relationship
2. Understanding the meaning of Trust; Difference between intention and competence
3. Understanding the meaning of Respect, Difference between respect and differentiation; the
other salient values in relationship
4. Understanding the harmony in the society (society being an extension of family):
Resolution, Prosperity, fearlessness (trust) and co-existence as comprehensive Human Goals
5. Visualizing a universal harmonious order in society- Undivided Society, Universal Order-
from family to world family.
Include practice sessions to reflect on relationships in family, hostel and institute as extended
family, real life examples, teacher-student relationship, goal of education etc. Gratitude as a
universal value in relationships. Discuss with scenarios. Elicit examples from students’ lives.
UNIT - 4

Understanding Harmony in the Nature and Existence - Whole existence as Coexistence

1. Understanding the harmony in the Nature
2. Holistic perception of harmony at all levels of existence.

UNIT - 5

Implications of the above Holistic Understanding of Harmony on Professional Ethics

1. Natural acceptance of human values
2. Definitiveness of Ethical Human Conduct
Include practice Exercises and Case Studies will be taken up in Practice (tutorial) Sessions eg. To discuss
the conduct as an engineer or scientist etc.

Text Books:
1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel Books,
New Delhi, 2010
Reference Materials:
1. Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Rediscovering India - by Dharampal
9. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
10. India Wins Freedom - Maulana Abdul Kalam Azad
11. Vivekananda - Romain Rolland (English)
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Competitive Programming

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

Modules

Development of competitive programming skills in C/C++ using online tools.

Reference Materials
1. Competitive Programming, Ravi Ojha, https://www.hackerearth.com/getstarted-
competitive- programming/
2. Competitive Programming – A Complete Guide,
https://www.geeksforgeeks.org/competitive-programming-a-complete-guide/
3. Competitive Programmer’s Handbook E-Book 1, Antti Laaksonen,
https://cses.fi/book/book.pdf
4. Programming Challenges: The Programming Contest Training Manual, Steven S. Skiena
& Miguel Revilla, https://www.pdfdrive.com/programming-challenges-the-
programming-contest-training-manual-e167992721.html
5. Getting Started with Competitive Programming,
https://archive.nptel.ac.in/noc/courses/noc21/SEM2/noc21-cs99/
6. Competitive Programming, https://www.udemy.com/course/competitive-programming/

COURSE OUTCOMES (COs)

CO1 Solve programming challenges by applying appropriate techniques.

CO2 Design and implement solutions for hackathon events.
CO3 Create solutions for the contest platforms.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Linear Algebra using MATLAB

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

Modules

Implementation of Abstract Algebra, Vectors, Spaces, Basis and Dimensions, Inner Product
Spaces, Eigenvalues and Eigenvectors, Matrix Decomposition and their Applications using
MATLAB online toolbox as per the syllabus of Linear Algebra for Business Systems.

Reference Materials
1. https://matlabacademy.mathworks.com/details/introduction-to-linear-algebra-with-
matlab/linalg
2. https://in.mathworks.com/help/matlab/linear-algebra.html

COURSE OUTCOMES (COs)

CO1 Apply MATLAB commands and scripts to solve the problems of Linear Algebra.
CO2 Design and implement solutions for real-time Linear Algebra problems using MATLAB.
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
SEMESTER IV

Course Title Statistical Modelling using MATLAB

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

Modules

Implementation of Statistical Techniques, Linear Statistical Models, Estimations, Sufficient

Statistic, Test of hypothesis, No-parametric Inference, Time Series Analysis and Forecasting
using MATLAB online toolbox as per the syllabus of Statistical Modelling for Business Systems.

Reference Materials
1. https://matlabacademy.mathworks.com/details/statistics-onramp/orst
2. https://drive.mathworks.com/sharing/13557eb7-e980-4d01-8096-84980a08781a/math-
stats_datascience

COURSE OUTCOMES (COs)

CO1 Apply MATLAB commands and scripts to solve the problems of Statistical Modelling.
CO2 Design and implement solutions for real-time Statistical Modelling problems using
MATLAB.